An exact algorithm and a metaheuristic for the generalized vehicle routing problem with flexible fleet size

Computers and Operations Research

Volumn 43, Issue 1, 2014, Pages 9-19

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

^a INSTITUT DE RECHERCHE EN COMMUNICATIONS ET CYBERNÉTIQUE DE NANTES   (France)

^b UNIVERSITÉ DE NANTES   (France)

^c INTERUNIVERSITY RESEARCH CENTRE ON ENTERPRISE NETWORKS   (Canada)

Author keywords

Branch and cut; Generalized vehicle routing; Metaheuristic; Two commodity flow model

Indexed keywords

BRANCH-AND-CUT; BRANCH-AND-CUT ALGORITHMS; COMPUTATIONAL EXPERIMENT; FLOW MODEL; GENERALIZED VEHICLE ROUTING PROBLEMS; GREEDY RANDOMIZED ADAPTIVE SEARCH PROCEDURE; MATHEMATICAL FORMULATION; METAHEURISTIC;

ALGORITHMS; COMBINATORIAL OPTIMIZATION; ROUTING ALGORITHMS;

NETWORK ROUTING;

EID: 84884608873     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2013.08.017     Document Type: Article

References (20)

1. Augerat P, Belenguer JM, Benavent E, Corberán A, Naddef D, Rinaldi G. Computational results with a branch-and-cut code for the capacitated vehicle routing problem. Rapport de recherche, ARTEMIS-IMAG, Grenoble, France; 1995.
2. R. Baldacci, M.A. Boschetti, V. Maniezzo, and M. Zamboni Scatter search methods for the covering tour problem Ramesh Sharda, Stefan Vob, César Rego, Bahram Alidaee, Metaheuristic optimization via memory and evolution 2005 Verlag Springer 55 91
3. 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
4. R. Baldacci, A. Mingozzi, and R. Roberti Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints European Journal of Operational Research 218 2011 1 6
5. J.E. Beasley Route first-cluster second methods for vehicle routing Omega 11 1983 403 408
6. T. Bektaş, G. Erdoǧan, and S. Ropke Formulations and branch-and-cut algorithms for the generalized vehicle routing problem Transportation Science 45 3 2011 299 316
7. 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
8. G. Ghiani, and G. Improta An efficient transformation of the generalized vehicle routing problem European Journal of Operational Research 122 2000 11 17 (Pubitemid 30541668)
9. Kara I, Bektaş T. Integer linear programming formulation of the generalized vehicle routing problem. In: Proceedings of the 5th EURO/INFORMS joint international meeting; 2003.
10. 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
11. 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
12. G. Laporte, Y. Nobert, and M. Desrochers Optimal routing under capacity and distance restrictions Operations Research 33 1985 1058 1073
13. Lysgaard J. CVRPSEP: a package of separation routines for the capacitated vehicle routing problem. Working paper 03-04, Department of Management Science and Logistics, Aarhus School of Business, Denmark; 2003.
14. Matei O, Pop PC, Chira C. A genetic algorithm for solving the generalized vehicle routing problem. In: Corchado Rodriguez E-S, et al., editors. Proceedings of the HAIS 2010, Lecture notes in artificial intelligence, vol. 6077; 2010. p. 119-26.
15. 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
16. P.C. Pop, I. Kara, and A.H. Marc New mathematical models of the generalized vehicle routing problem and extensions Applied Mathematical Modelling 36 2011 97 107
17. Pop PC, Pintea CM, Zelina I, Dumitrescu D. Solving the generalized vehicle routing problem with an ACS-based algorithm. In Proceedings of the BICS 2008, vol. 1117. American Institute of Physics (AIP); 2009. p. 157-62.
18. 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
19. C. Prins Two memetic algorithms for heterogeneous fleet vehicle routing problems Engineering Applications of Artificial Intelligence 22 2009 916 928
20. C. Prins, N. Labadi, and M. Reghiouit Tour splitting algorithms for vehicle routing problems International Journal of Production Research 47 2008 507 535