An exact algorithm and a metaheuristic for the multi-vehicle covering tour problem with a constraint on the number of vertices

From MaRDI portal
Publication:2253558

DOI10.1016/j.ejor.2012.11.012zbMath1292.90050OpenAlexW1978887754MaRDI QIDQ2253558

Louis-Martin Rousseau, Nathalie Bostel, Minh Hoàng Hà, André Langevin

Publication date: 27 July 2014

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2012.11.012




Related Items (21)

An integration of mixed VND and VNS: the case of the multivehicle covering tour problemColumn generation algorithms for bi-objective combinatorial optimization problems with a min-max objectiveA hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problemA variable neighborhood search for solving the multi-vehicle covering tour problemA generalized model and a heuristic algorithm for the large-scale covering tour problemSolving the multi-vehicle multi-covering tour problemA branch-and-price algorithm for location-routing problems with pick-up stations in the last-mile distribution systemThe vehicle routing problem with service level constraintsA multi-depot two-echelon vehicle routing problem with delivery options arising in the last mile distributionThe multi-vehicle cumulative covering tour problemA multi‐vehicle covering tour problem with speed optimizationThe two‐echelon routing problem with truck and dronesA data-driven optimization framework for routing mobile medical facilitiesThe capacitated mobile facility location problemOnline covering salesman problemA simultaneous facility location and vehicle routing problem arising in health care logistics in the NetherlandsThe multi-vehicle probabilistic covering tour problemIterative Column Generation Algorithm for Generalized Multi-Vehicle Covering Tour ProblemExact methods for mono-objective and bi-objective multi-vehicle covering tour problemsSpatial coverage in routing and path planning problemsA location-or-routing problem with partial and decaying coverage


Uses Software



This page was built for publication: An exact algorithm and a metaheuristic for the multi-vehicle covering tour problem with a constraint on the number of vertices