The bi-objective stochastic covering tour problem
From MaRDI portal
Publication:1762147
DOI10.1016/j.cor.2011.09.009zbMath1251.90361OpenAlexW2050695188WikidataQ36654429 ScholiaQ36654429MaRDI QIDQ1762147
Fabien Tricoire, Walter J. Gutjahr, Alexandra C. Graf
Publication date: 15 November 2012
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2011.09.009
stochastic optimizationmulti-objective optimizationbranch-and-cutdisaster reliefcovering tour problem
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Multi-objective and goal programming (90C29) Stochastic programming (90C15) Combinatorial optimization (90C27)
Related Items (29)
An integration of mixed VND and VNS: the case of the multivehicle covering tour problem ⋮ A biobjective chance constrained optimization model to evaluate the economic and environmental impacts of biopower supply chains ⋮ A multicut L-shaped based algorithm to solve a stochastic programming model for the mobile facility routing and scheduling problem ⋮ Multicriteria optimization in humanitarian aid ⋮ Time constrained maximal covering salesman problem with weighted demands and partial coverage ⋮ Using 3D-printing in disaster response: the two-stage stochastic 3D-printing knapsack problem ⋮ An \(\varepsilon \)-constraint column generation-and-enumeration algorithm for bi-objective vehicle routing problems ⋮ Designing humanitarian supply chains by incorporating actual post-disaster decisions ⋮ A multi-depot two-echelon vehicle routing problem with delivery options arising in the last mile distribution ⋮ A multi‐vehicle covering tour problem with speed optimization ⋮ A data-driven optimization framework for routing mobile medical facilities ⋮ Modelling beneficiaries' choice in disaster relief logistics ⋮ Stochastic last mile relief network design with resource reallocation ⋮ Branch-and-Bound for Bi-objective Integer Programming ⋮ Threshold robustness in discrete facility location problems: a bi-objective approach ⋮ Online covering salesman problem ⋮ Robust strategic planning for mobile medical units with steerable and unsteerable demands ⋮ Whole blood or apheresis donations? A multi-objective stochastic optimization approach ⋮ A simultaneous facility location and vehicle routing problem arising in health care logistics in the Netherlands ⋮ Objectives and methods in multi-objective routing problems: a survey and classification scheme ⋮ Metaheuristic search techniques for multi-objective and stochastic problems: a history of the inventions of Walter J. Gutjahr in the past 22 years ⋮ Stochastic multi-objective optimization: a survey on non-scalarizing methods ⋮ Exact methods for mono-objective and bi-objective multi-vehicle covering tour problems ⋮ Robust bi-level optimization of relief logistics operations ⋮ A stochastic inventory routing problem for infectious medical waste collection ⋮ Bi-objective stochastic programming models for determining depot locations in disaster relief operations ⋮ Spatial coverage in routing and path planning problems ⋮ A location-or-routing problem with partial and decaying coverage ⋮ Bi-objective facility location under uncertainty with an application in last-mile disaster relief
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Multicriteria tour planning for mobile healthcare facilities in a developing country
- The bi-objective covering tour problem
- The median tour and maximal covering tour problems: Formulations and heuristics
- Heuristics for the multi-vehicle covering tour problem
- A provably convergent heuristic for stochastic bicriteria integer programming
- An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method
- Introduction to Stochastic Programming
- The Covering Tour Problem
This page was built for publication: The bi-objective stochastic covering tour problem
