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

Volumn 226, Issue 2, 2013, Pages 211-220

  Hà, Minh Hoàng ^a,c   Bostel, Nathalie ^b   Langevin, André ^c   Rousseau, Louis Martin ^c  

^a ECOLE DES MINES DE NANTES   (France)

^b UNIVERSITÉ DE NANTES   (France)

^c INTERUNIVERSITY RESEARCH CENTRE ON ENTERPRISE NETWORKS   (Canada)

Author keywords

Branch and cut; Covering tour; Metaheuristic; Two commodity flow model

Indexed keywords

BRANCH-AND-CUT; BRANCH-AND-CUT ALGORITHMS; COMPUTATIONAL RESULTS; COVERING TOUR; EXACT ALGORITHMS; FLOW MODEL; INTEGER PROGRAMMING FORMULATIONS; LOCAL SEARCH; METAHEURISTIC; MULTI-VEHICLES; TEST PROBLEM;

INTEGER PROGRAMMING;

ALGORITHMS;

EID: 84872103520     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2012.11.012     Document Type: Article

References (28)

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. E. Balas, and Shu Ming Ng On the set covering polytope: I. All the facets with coefficients in {0, 1, 2} Mathematical Programming 43 1-3 1986 57 69
3. R. Baldacci, M.A. Boschetti, V. Maniezzo, and M. Zamboni Scatter search methods for covering tour problem Ramesh Sharda, Stefan Vob, César Rego, Bahram Alidaee, Metaheuristic Optimization Via Memory and Evolution 2005 Springer-Verlag 55 91
4. R. Baldacci, E. Hadjiconstantinou, and A. Mingozzi An exact algorithm for the capacitated vehicle routing problem based on a two-commodity network flow formulation Operations Research 52 2004 723 738
5. J.E. Beasley Route first-cluster second methods for vehicle routing Omega 11 1983 03 408
6. G. Clarke, and J.W. Wright Scheduling of vehicles from a central depot to a number of delivery points Operations Research 12 1964 568 581
7. J. Current, Multiobjective Design of Transportation Networks, PhD dissertation, Johns Hopkins University, 1981.
8. K-F. Doerner, and R-F. Hartl Health care logistics, emergency preparedness, and disaster relief: New challenges for routing problems with a focus on the austrian situation The Vehicle Routing Problem: Latest Advances and New Challenges 2008 Springer 527 550
9. G.A. Finke, A. Claus, and E. Gunn A two-commodity network flow approach to the traveling salesman problem Congressus Numerantium 41 1984 167 178
10. M. Gendreau, G. Laporte, and F. Semet The covering tour problem Operations Research 45 1997 568 576
11. B. Gillett, and L. Miller A heuristic algorithm for the vehicle dispatch problem Operations Research 22 1974 340 349
12. B. Golden, S. Raghavan, and E. Wasil Advances in meter reading: heuristic solution of the close enough traveling salesman problem over a street network The Vehicle Routing Problem: Latest Advances and New Challenges 2008 Springer 487 501
13. 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.
14. M. Hachicha, M.J. Hodgson, G. Laporte, and F. Semet Heuristics for the multi-vehicle covering tour problem Computers and Operations Research 27 2000 29 42
15. M-J. Hodgson, G. Laporte, and F. Semet A covering tour model for planning mobile health care facilities in Suhum district, Ghana Journal of Regional Science 38 1998 621 638
16. 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.
17. L. Labadi, C. Prins, and M. Reghioui A memetic algorithm for the vehicle routing problem with time windows RAIRO-Operations Research 42 2008 415 431
18. M. Labbé, and G. Laporte Maximizing user convenience and postal service efficiency in post box location Belgian Journal of Operations Research, Statistics and Computer Science 26 1986 21 35
19. A. Langevin, M. Desrochers, J. Desrosiers, S. Gélinas, and F. Soumis A two-commodity flow formulation for the traveling salesman and the makespan problems with time windows Networks 23 1993 631 640
20. G. Laporte, Y. Nobert, and M. Desrochers Optimal routing under capacity and distance restrictions Operations Research 33 1985 1058 1073
21. J. Lysgaard, A.N. Letford, and R.W. Eglese A new branch-and-cut algorithm for the capacitated vehicle routing problem Mathematical Programming 100 2004 423 445
22. S.U. Ngueveu, C. Prins, and R. Wolfler Calvo An effective memetic algorithm for the cumulative capacitated vehicle routing problem Computers and Operations Research 37 2010 1877 1885
23. C. Prins A GRASP x evolutionary local search hybrid for the vehicle routing problem F.B. Pereira, J. Tavares, Bio-inspired Algorithms for the Vehicle Routing Problem, Studies in Computational Intelligence 2009 Springer-Verlag 35 53
24. C. Prins Two memetic algorithms for heterogeneous fleet vehicle routing problems Engineering Applications of Artificial Intelligence 22 2009 916 928
25. C. Prins, N. Labadi, and M. Reghiouit Tour splitting algorithms for vehicle routing problems International Journal of Production Research 47 2008 507 535
26. M. Sánchez-García, M.I. Sobrón, and B. Vitoriano On the set covering polytope: facets with coefficients in {0, 1, 2, 3} Annals of Operations Research 81 1998 343 356
27. J-C. Simms Fixed and mobile facilities in dairy practice Veterinary Clinics of North America-Food Animal Practice 5 1989 591 601
28. W. Swaddiwudhipong, C. Chaovakiratipong, P. Nguntra, P. Lerdlukanavonge, and S. Koonchote Effect of a mobile unit on changes in knowledge and use of cervical cancel screening among rural thai women International Journal of Epidemiology 24 1995 493 498