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

European Journal of Operational Research - Tập 226 - Trang 211-220 - 2013
Minh Hoàng Hà1,2, Nathalie Bostel3, André Langevin2, Louis-Martin Rousseau2
1LUNAM Université, IRCCyN, Ecole des Mines de Nantes, 4 rue Alfred Kastler, B.P. 20722, 44307 Nantes, France
2Department of Mathematics and Industrial, Engineering and CIRRELT, École Polytechnique, de Montréal, C.P. 6079, Succursale Centre-ville, Montréal, QC, Canada H3C 3A7
3LUNAM Université, IRCCyN & Université de Nantes, 58 rue Michel Ange, B.P. 420, 44606 Saint-Nazaire Cedex, France

Tài liệu tham khảo

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. Balas, 1986, On the set covering polytope: I. All the facets with coefficients in {0,1,2}, Mathematical Programming, 43, 57 Baldacci, 2005, Scatter search methods for covering tour problem, 55 Baldacci, 2004, An exact algorithm for the capacitated vehicle routing problem based on a two-commodity network flow formulation, Operations Research, 52, 723, 10.1287/opre.1040.0111 Beasley, 1983, Route first-cluster second methods for vehicle routing, Omega, 11, 03, 10.1016/0305-0483(83)90033-6 Clarke, 1964, Scheduling of vehicles from a central depot to a number of delivery points, Operations Research, 12, 568, 10.1287/opre.12.4.568 J. Current, Multiobjective Design of Transportation Networks, PhD dissertation, Johns Hopkins University, 1981. Doerner, 2008, Health care logistics, emergency preparedness, and disaster relief: New challenges for routing problems with a focus on the austrian situation, 527 Finke, 1984, A two-commodity network flow approach to the traveling salesman problem, Congressus Numerantium, 41, 167 Gendreau, 1997, The covering tour problem, Operations Research, 45, 568, 10.1287/opre.45.4.568 Gillett, 1974, A heuristic algorithm for the vehicle dispatch problem, Operations Research, 22, 340, 10.1287/opre.22.2.340 Golden, 2008, Advances in meter reading: heuristic solution of the close enough traveling salesman problem over a street network, 487 M.-H. Ha, N. Bostel, A. Langevin, L.-M. Rousseau, An exact algorithm for the close enough traveling salesman problem with arc covering constraints, in: Proceedings of the 1st International Conference on Operations Research and Enterprise Systems, Vilamoura, Algarve, Portugal, February 2012. Hachicha, 2000, Heuristics for the multi-vehicle covering tour problem, Computers and Operations Research, 27, 29, 10.1016/S0305-0548(99)00006-4 Hodgson, 1998, A covering tour model for planning mobile health care facilities in Suhum district, Ghana, Journal of Regional Science, 38, 621, 10.1111/0022-4146.00113 N. Jozefowiez, A column generation approach for the multi-vehicle covering tour problem, in: Proceedings of Recherche Opérationnelle et Aide à la Décision Française (ROADEF 2011), Saint-Etienne, France, March 2011. Labadi, 2008, A memetic algorithm for the vehicle routing problem with time windows, RAIRO-Operations Research, 42, 415, 10.1051/ro:2008021 Labbé, 1986, Maximizing user convenience and postal service efficiency in post box location, Belgian Journal of Operations Research, Statistics and Computer Science, 26, 21 Langevin, 1993, A two-commodity flow formulation for the traveling salesman and the makespan problems with time windows, Networks, 23, 631, 10.1002/net.3230230706 Laporte, 1985, Optimal routing under capacity and distance restrictions, Operations Research, 33, 1058, 10.1287/opre.33.5.1050 Lysgaard, 2004, A new branch-and-cut algorithm for the capacitated vehicle routing problem, Mathematical Programming, 100, 423, 10.1007/s10107-003-0481-8 Ngueveu, 2010, An effective memetic algorithm for the cumulative capacitated vehicle routing problem, Computers and Operations Research, 37, 1877, 10.1016/j.cor.2009.06.014 Prins, 2009, A GRASP x evolutionary local search hybrid for the vehicle routing problem, 35 Prins, 2009, Two memetic algorithms for heterogeneous fleet vehicle routing problems, Engineering Applications of Artificial Intelligence, 22, 916, 10.1016/j.engappai.2008.10.006 Prins, 2008, Tour splitting algorithms for vehicle routing problems, International Journal of Production Research, 47, 507, 10.1080/00207540802426599 Sánchez-García, 1998, On the set covering polytope: facets with coefficients in {0,1,2,3}, Annals of Operations Research, 81, 343, 10.1023/A:1018969410431 Simms, 1989, Fixed and mobile facilities in dairy practice, Veterinary Clinics of North America – Food Animal Practice, 5, 591, 10.1016/S0749-0720(15)30953-1 Swaddiwudhipong, 1995, Effect of a mobile unit on changes in knowledge and use of cervical cancel screening among rural thai women, International Journal of Epidemiology, 24, 493, 10.1093/ije/24.3.493