Heuristics for the multi-vehicle covering tour problem
From MaRDI portal
Publication:1818567
DOI10.1016/S0305-0548(99)00006-4zbMath0973.90019MaRDI QIDQ1818567
Gilbert Laporte, M. John Hodgson, Frédéric Semet, Mondher Hachicha
Publication date: 4 January 2000
Published in: Computers \& Operations Research (Search for Journal in Brave)
Related Items (35)
An integration of mixed VND and VNS: the case of the multivehicle covering tour problem ⋮ Column generation algorithms for bi-objective combinatorial optimization problems with a min-max objective ⋮ Metaheuristics for the distance constrained generalized covering traveling salesman problem ⋮ A multicut L-shaped based algorithm to solve a stochastic programming model for the mobile facility routing and scheduling problem ⋮ A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem ⋮ A variable neighborhood search for solving the multi-vehicle covering tour problem ⋮ A generalized model and a heuristic algorithm for the large-scale covering tour problem ⋮ Solving the multi-vehicle multi-covering tour problem ⋮ Time constrained maximal covering salesman problem with weighted demands and partial coverage ⋮ Multicriteria tour planning for mobile healthcare facilities in a developing country ⋮ A Markov decision process model on dynamic routing for target surveillance ⋮ The multi-vehicle cumulative covering tour problem ⋮ 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 ⋮ Imprecise Constrained Covering Solid Travelling Salesman Problem with Credibility ⋮ Design of an IT-driven decision support system for vehicle routing and scheduling. ⋮ Online covering salesman problem ⋮ Robust strategic planning for mobile medical units with steerable and unsteerable demands ⋮ Health Care Logistics, Emergency Preparedness, and Disaster Relief: New Challenges for Routing Problems with a Focus on the Austrian Situation ⋮ A simultaneous facility location and vehicle routing problem arising in health care logistics in the Netherlands ⋮ Multi-objective vehicle routing problems ⋮ An integer programming-based local search for the covering salesman problem ⋮ The bi-objective stochastic covering tour problem ⋮ A Neural-Network-Based Approach to the Double Traveling Salesman Problem ⋮ The multi-vehicle probabilistic covering tour problem ⋮ Iterative Column Generation Algorithm for Generalized Multi-Vehicle Covering Tour Problem ⋮ Capacitated ring arborescence problems with profits ⋮ Exact methods for mono-objective and bi-objective multi-vehicle covering tour problems ⋮ Solving the close-enough arc routing problem ⋮ A parallel variable neighborhood search for solving covering salesman problem ⋮ A covering traveling salesman problem with profit in the last mile delivery ⋮ Spatial coverage in routing and path planning problems ⋮ Using column generation to compute lower bound sets for bi-objective combinatorial optimization problems ⋮ A heuristic approach to the overnight security service problem
This page was built for publication: Heuristics for the multi-vehicle covering tour problem
