A parallel algorithm for the vehicle routing problem

INFORMS Journal on Computing

Volumn 23, Issue 2, 2011, Pages 315-330

  Groër, Chris ^a   Golden, Bruce ^b   Wasil, Edward ^c  

^a OAK RIDGE NATIONAL LABORATORY   (United States)

^b UNIVERSITY OF MARYLAND   (United States)

^c AMERICAN UNIVERSITY   (United States)

Author keywords

Heuristics; Metaheuristics; Optimization; Parallel computing; Vehicle routing

Indexed keywords

EID: 79955785654     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.1100.0402     Document Type: Article

References (44)

1. Agarwal, Y., K. Mathur, H. M. Salkin. 1989. A set-partitioning-based exact algorithm for the vehicle routing problem. Networks 19 (7) 731-749.
2. Alba, E., B. Dorronsoro. 2004. Solving the vehicle routing problem by using cellular genetic algorithms. J. Gottlieb, G. R. Raidl, eds. Evolutionary Computation in Combinatorial Optimization. Lecture Notes in Computer Science, Vol. 3004. Springer, Berlin, 11-20.
3. Alba, E., B. Dorronsoro. 2008. Cellular Genetic Algorithms. Springer, New York.
4. Alba, E., G. Luque. 2005. Measuring the performance of parallel metaheuristics. E. Alba, ed. Parallel Metaheuristics: A New Class of Algorithms. John Wiley & Sons, Hoboken, NJ, 43-62.
5. Alvarenga, G. B., G. R. Mateus, G. de Tomi. 2007. A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows. Comput. Oper. Res. 34 (6) 1561-1584. (Pubitemid 44556982)
6. Bixby A. 1998. Polyhedral analysis and effective algorithms for the capacitated vehicle routing problem. Ph. D. thesis, Northwestern University, Evanston, IL.
7. Bramel, J., D. Simchi-Levi. 2001. Set-covering-based algorithms for the capacitated VRP P. Toth, D. Vigo, eds. The Vehicle Routing Problem. Society for Industrial and Applied Mathematics, Philadelphia, 85-108.
8. Chao, I.-M., B. L. Golden, E. Wasil. 1995. An improved heuristic for the period vehicle routing problem. Networks 26 (1) 25-44.
9. Christofides, N., S. Eilon. 1969. An algorithm for the vehicledispatching problem. Oper. Res. Quart. 20 (3) 309-318.
10. Christofides, N., A. Mingozzi, P. Toth. 1979. The vehicle routing problem. N. Christofides, A. Mingozzi, P. Toth, C. Sandi, eds. Combinatorial Optimization. John Wiley & Sons, Chichester, UK, 315-338.
11. COIN-OR (COmputational INfrastructure for Operations Research). 2010. Retrieved August 6, 2010, VRPH. http://wwwcoin-or.org/projects/VRPH.xml.
12. Cordeau, J.-F., M. Gendreau, A. Hertz, G. Laporte, J.-S. Sormany. 2005. New heuristics for the vehicle routing problem. A. Langevin, D. Riopel, eds. Logistics Systems: Design and Optimization. Springer, New York, 279-297.
13. Crainic, T. G. 2008. Parallel solution methods for vehicle routing problems. B. L. Golden, S. Raghavan, E. A. Wasil, eds. The Vehicle Routing Problem: Latest Advances and New Challenges. Springer, New York, 171-198.
14. Crainic, T. G., H. Nourredine. 2005. Parallel metaheuristics applications. E. Alba, ed. Parallel Metaheuristics: A New Class of Algorithms. John Wiley & Sons, Hoboken, NJ, 447-494.
15. Dantzig, G. B., J. H. Ramser. 1959. The truck dispatching problem. Management Sci. 6 (1) 80-91.
16. Desrochers, M., J. Desrosiers, M. Solomon. 1992. A new optimization algorithm for the vehicle routing problem with time windows. Oper. Res. 40 (2) 342-354.
17. Doerner, K., R. F. Hartl, G. Kiechle, M. Lucká, M. Reimann. 2004. Parallel ant systems for the capacitated vehicle routing problem. J. Gottlieb, G. R. Raidl, eds. Evolutionary Computation in Combinatorial Optimization. Lecture Notes in Computer Science, Vol. 3004. Springer, Berlin, 72-83.
18. Dorronsoro, B., D. Arias, F. Luna, A. J. Nebro, E. Alba. 2007. A grid-based hybrid cellular genetic algorithm for very large scale instances of the CVRP W Smari, ed. 2007 High Performance Comput. Simulation Conf. (HPCS 2007), Prague, Czech Republic, 759-765. http://www.scs-europe.net/conf/ecms2007/ ecms2007-cd/ecms2007/ecms2007%20pdf/HPCS2007.pdf.
19. Franceschi, R. D., M. Fischetti, P. Toth. 2006. A new ILP-based refinement heuristic for vehicle routing problems. Math. Programming 105 (2-3) 471-499. (Pubitemid 41788330)
20. Gendreau, M., J.-Y. Potvin, O. Bräysy, G. Hasle, A. Løkketangen. 2008. Metaheuristics for the vehicle routing problem and its extensions: A categorized bibliography. B. L. Golden, S. Raghavan, E. A. Wasil, eds. The Vehicle Routing Problem: Latest Advances and New Challenges. Springer, New York, 143-169.
21. Golden, B. L., S. Raghavan, E. A. Wasil, eds. 2008. The Vehicle Routing Problem: Latest Advances and New Challenges. Springer, New York.
22. Golden, B. L., E. A. Wasil, J. P. Kelly, I-M. Chao. 1998. The impact of metaheuristics on solving the vehicle routing problem: Algorithms, problem sets, and computational results. T. G. Crainic, G. Laporte, eds. Fleet Management and Logistics. Kluwer Academic Publishers, Boston, 33-56.
23. Groër, C., B. Golden, E. Wasil. 2010. A library of local search heuristics for the vehicle routing problem. Math. Programming Comput. 2 (2) 79-101.
24. Hadjiconstantinou, E., N. Christofides, A. Mingozzi. 1995. A newexact algorithm for the vehicle routing problem based on q-paths and k-shortest paths relaxation. Ann. Oper. Res. 61 (1) 21-43.
25. Le Bouthillier, A., T. G. Crainic. 2005. A cooperative parallel metaheuristic for the vehicle routing problem with time windows. Comput. Oper. Res. 32 (7) 1685-1708.
26. Le Bouthillier, A., T. Crainic, P. Kropf. 2005. Towards a guided cooperative search. Technical Report CRT-05-09, Centre de recherche sur les transports, Université de Montréal, Montréal.
27. Li, F., B. Golden, E. Wasil. 2005. Very large-scale vehicle routing: New test problems, algorithms, and results. Comput. Oper. Res. 32 (5) 1165-1179.
28. Lin, S., B. W. Kernighan. 1973. An effective heuristic algorithm for the traveling-salesman problem. Oper. Res. 21 (2) 498-516.
29. Mester, D., O. Bräysy. 2007. Active-guided evolution strategies for large-scale vehicle routing problems. Comput. Oper. Res. 34 (10) 2964-2975. (Pubitemid 46356733)
30. Nagata, Y., O. Bräysy. 2008. Efficient local search limitation strategies for vehicle routing problems. J. van Hemert, C. Cotta, eds. Evolutionary Computation in Combinatorial Optimization. Lecture Notes in Computer Science, Vol. 4972. Springer, Berlin, 48-60.
31. Nagata, Y., O. Bräysy. 2009. Edge assembly-based memetic algorithm for the capacitated vehicle routing problem. Networks 54 (4) 205-215.
32. Or, I. H. 1976. Traveling salesman-type combinatorial problems and their relation to the logistics of blood banking. Ph. D. thesis, Northwestern University, Evanston, IL.
33. Osman, I. H. 1993. Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Ann. Oper. Res. 41 (1-4) 421-451.
34. Pisinger, D., S. Roøpke. 2007. A general heuristic for vehicle routing problems. Comput. Oper. Res. 34 (8) 2403-2435. (Pubitemid 46073431)
35. Prins, C. 2009. A GRASP × evolutionary local search hybrid for the vehicle routing problem. F. B. Pereira, J. Tavares, eds. Bioinspired Algorithms for the Vehicle Routing Problem. Studies in Computational Intelligence, Vol. 161. Springer, Berlin, 35-53.
36. Ralphs, T. K., L. Kopman, W. R. Pulleyblank, L. E. Trotter. 2003. On the capacitated vehicle routing problem. Math. Programming 94 (2-3) 343-359.
37. Rego, C. 2001. Node-ejection chains for the vehicle routing problem: Sequential and parallel algorithms. Parallel Comput. 27 (3) 201-222. (Pubitemid 32264539)
38. Rochat, Y., E. D. Taillard. 1995. Probabilistic diversification and intensification in local search for vehicle routing. J. Heuristics 1 (1) 147-167.
39. Schulze, J., T. Fahle. 1999. A parallel algorithm for the vehicle routing problem with time window constraints, Ann. Oper. Res. 86 585-607.
40. Taillard, E. 1993a. Parallel iterative search methods for vehicle routing problems. Networks 23 (8) 661-676.
41. Taillard, E. 1993b. Vehicle routeing instances. Retrieved August 6, 2010, http://mistic.heig-vd.ch/taillard/problemes.dir/vrp. dir/vrp.html.
42. Taillard, E., B. Boffey. 1999. A heuristic column generation method for the heterogeneous fleet VRP. RAIRO Oper. Res. 33 (1) 1-14. (Pubitemid 32082129)
43. Toth, P., A. Tramontani. 2008. An integer linear programming local search for capacitated vehicle routing problems. B. L. Golden, S. Raghavan, E. A. Wasil, eds. The Vehicle Routing Problem: Latest Advances and New Challenges. Springer, New York, 275-295.
44. Yellow, P. C. 1970. A computational modification to the savings method of vehicle scheduling. Oper. Res. Quart. 21 (2) 281-293.