An exact algorithm and a metaheuristic for the multi-vehicle covering tour problem with a constraint on the number of vertices-Reference-Cited by-同舟云学术

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

Published:2013-04 Issue:2 Volume:226 Page:211-220
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

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

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modelling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference28 articles.

1. P. Augerat, J.M. Belenguer, E. Benavent, A. Corberán, D. Naddef, G. Rinaldi, Computational results with a branch and cut code for the capacitated vehicle routing problem, Rapport de recherche, ARTEMIS-IMAG, Grenoble, France, 1995.

2. On the set covering polytope: I. All the facets with coefficients in {0,1,2};Balas;Mathematical Programming,1986

3. Scatter search methods for covering tour problem;Baldacci,2005

4. An exact algorithm for the capacitated vehicle routing problem based on a two-commodity network flow formulation;Baldacci;Operations Research,2004

5. Route first-cluster second methods for vehicle routing;Beasley;Omega,1983

Cited by 49 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The bike routeing problem with energy constraints;International Journal of Systems Science: Operations & Logistics;2024-02-05

2. A flow‐based model for the multivehicle covering tour problem with route balancing;International Transactions in Operational Research;2023-11-06

3. A capacitated multi-vehicle covering tour problem on a road network and its application to waste collection;European Journal of Operational Research;2023-11

4. Heuristics for the Profitable Close-Enough Arc Routing Problem;Expert Systems with Applications;2023-11

5. A fast simulated annealing heuristic for the multi-depot two-echelon vehicle routing problem with delivery options;Transportation Letters;2023-09-18