Combining constraint programming, lagrangian relaxation and probabilistic algorithms to solve the vehicle routing problem

CEUR Workshop Proceedings

Volumn 616, Issue , 2010, Pages

  Guimarans, Daniel ^a   Herrero, Rosa ^a   Riera, Daniel ^b   Juan, Angel A ^b   Ramos, Juan José ^a  

^a UNIVERSITAT AUTÒNOMA DE BARCELONA   (Spain)

^b UNIVERSITAT OBERTA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

CAPACITATED VEHICLE ROUTING PROBLEM; CLARKE AND WRIGHT SAVINGS HEURISTIC; CONSTRAINT PROGRAMMING; LAGRANGIAN RELAXATION; LAGRANGIAN RELAXATIONS; PROBABILISTIC ALGORITHM; STARTING SOLUTIONS; VEHICLE ROUTING PROBLEMS;

ALGORITHMS; COMPUTER PROGRAMMING; CONSTRAINT THEORY; LAGRANGE MULTIPLIERS; NETWORK ROUTING; ROUTING ALGORITHMS;

COMBINATORIAL MATHEMATICS;

EID: 84893695595     PISSN: 16130073     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (25)

1. K. Apt and M. Wallace. Constraint Logic Programming using ECLiPSe. Cambridge University Press, 2007.
2. M. Boschetti and V. Maniezzo. Benders decomposition, lagrangean relaxation and metaheuristic design. Journal of Heuristics, 15:283-312, 2009.
3. G. Buxey. The vehicle scheduling problem and monte carlo simulation. Journal of Operational Research Society, 30:563-573, 1979.
4. G. Clarke and J. Wright. Scheduling of vehicles from a central depot to a number of delivering points. Operations Research, 12:568-581, 1964.
5. J. Cordeau, G. Laporte, M. Savelsbergh, and D. Vigo. Vehicle routing. In C. Barnhart and G. Laporte, editors, Handbook in Operations Research and Management Science, Volume 14, pages 367-428. Elsevier, Amsterdam, The Netherlands, 2007.
6. G. Dantzig and J. Ramser. The truck dispatching problem. Management Science, 6:80-91, 1959.
7. J. Faulin and A. A. Juan. The algacea-1 method for the capacitated vehicle routing problem. International Transactions in Operational Research, 15:1-23, 2008.
8. P. Festa and M. Resende. An annotated bibliography of grasp - part i: Algorithms. International Transactions in Operational Research, 16:1-24, 2009.
9. M. Fisher. The lagrangean relaxation method for solving integer programming problems. Management Science, 27:1-18, 1981.
10. E. Freuder, C. Bessiere, P. van Beek, H. Hoos, E. Tsang, W. van Hoeve, I. Katriel, R. Dechter, D. Cohen, P. Jeavons, P. Messeguer, F. Rossi, T. Schiex, I. Gent, K. Petrie, J. Puget, S. B.M, K. Marriot, P. Stuckey, M. Wallace, T. Fruhwirth, L. Michel, C. Schulte, M. Carlsson, J. Hooker, F. Benhamou, L. Granvilliers, C. Gervet, C. Gomes, T. Walsh, M. Koubarakis, B. Faltings, K. Brown, I. Miguel, P. Baptiste, P. Laborie, C. Le Pape, W. Nuijten, P. Kilby, P. Shaw, U. Junker, H. Simonis, R. Backofen, and D. Gilbert. In F. Rossi, P. van Beek, and T. Walsh, editors, Handbook of Constraint Programming, pages 29-83. Elsevier, 2006.
11. M. Gendreau, A. Hertz, and G. Laporte. A tabu search heuristic for the vehicle routing problem. Management Science, 40:1276-1290, 1994.
12. P. Hansen and N. Mladenovic. A tutorial on variable neighborhood search. Technical Report G-2003-46, Groupe d'Études et de Recherche en Analyse des Décisions (GERAD), Montreal, Canada, 2003.
13. G. Hasle and O. Kloster. Industrial vehicle routing, pages 397-435. Springer-Verlag, Berlin, Germany, 2007.
14. A. Juan, J. Faulin, J. Jorba, D. Riera, D. Masip, and B. Barrios. On the use of monte carlo simulation, cache and splitting techniques to improve the clarke and wright savings heuristics. Journal of the Operational Research Society, To be published.
15. G. Laporte. What you should know about the vehicle routing problem. Naval Research Logistics, 54:811-819, 2007.
16. A. Law. Simulation Modeling & Analysis. McGraw-Hill, 2007.
17. N. Mladenovic and P. Hansen. Variable neighborhood search. Computers & Operations Research, 24(11):1097-1100, 1997.
18. Y. Nagata. Edge assembly crossover for the capacitated vehicle routing problem. Lecture Notes in Computer Science, (4446), 2007.
19. G. Reinelt. The traveling salesman: computational solutions for tsp applications. Lecture notes in computer science, 840, 1994.
20. L. Rousseau, M. Gendreau, and G. Pesant. Using constraint-based operators to solve the vehicle routing problem with time windows. Journal of Heuristics, 8:43-58, 2002.
21. M. Savelsbergh. Local search in routing problems with time windows. Annals of Operations Research, 4:285-305, 1985.
22. M. Savelsbergh. Computer aided routing. Technical report, Centrum voor Wiskunde en Informatica, 1988.
23. C. Tarantilis and C. Kiranoudis. Boneroute: an adaptative memory-based method for effective fleet management. Annals of Operations Research, 115:227-241, 2002.
24. P. Toth and D. Vigo. The granular tabu search and its application to the vehicle routing problem. INFORMS Journal on Computing, 15:333-346, 2003.
25. R. Zamani and S. Lau. Embedding learning capability in lagrangean relaxation: An application to the travelling salesman problem. European Journal of Operational Research, 201(1):82-88, 2010.