A composite very-large-scale neighborhood search algorithm for the vehicle routing problem

Handbook of Scheduling: Algorithms, Models, and Performance Analysis

Volumn , Issue , 2004, Pages 49-1-49-24

  Agarwal, Richa ^a   Ahuja, Ravindra K ^b   Laporte, Gilbert ^c   Shen, Zuo Jun Max ^b  

^a Georgia Institute of Technology   (United States)

^b University of Florida   (United States)

^c UNIVERSITÉ DE MONTRÉAL   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 77957316972     PISSN: None     EISSN: None     Source Type: Book    
DOI: None     Document Type: Chapter

References (30)

1. Ahuja, R. K., J. B. Orlin, and D. Sharma. 2003. A composite neighborhood search algorithm for the capacitated minimum spanning tree problem. Operations Research Letters 31, 185–194.
2. Baldacci, R., E. Hadjiconstantinou, and A. Mingozzi. 2004. An exact algorithm for the capacitated vehicle routing problem based on a two-commodity network flow formulation. Operations Research. (Unpublished).
3. Beasley, J. E., (1990). The Operations Research Library, Imperial College Management School, London U. K.; http://www.ms.ic.ac.uk/info.html, Date Accessed: 07/22/2002.
4. Christofides, N., A. Mingozzi, and P. Toth. 1979. The vehicle routing problem. In N. Christofides, A. Mingozzi, P. Toth, and C. Sandi (editors) Combinatorial Optimization. Wiley, Chichester.
5. Clarke, G. and J. W. Wright. 1964. Scheduling of vehicles from a central depot to a number of delivery points. Operations Research 12, 568–581.
6. Cordeau, J. F. and G. Laporte. 2003. A tabu search heuristic for the staticmulti-vehicle dial-a ride problem. Transportation Research B37, 579–594.
7. Cordeau, J. F., M. Gendreau, G. Laporte, J.-Y. Potvin, and F. Semet. 2002. A guide to vehicle routing heuristics. Journal of the Operational Research Society 53, 512–522.
8. Ergun, O. 2001. New Neighborhood Search Algorithms Based on Exponentially Large Neighborhoods. Ph. D. Thesis, Operations Research Center, Massachusetts Institute of Technology, Cambridge, MA.
9. Gendreau, M., A. Hertz, and G. Laporte. 1992. New insertion and postoptimization procedures for the traveling salesman problem. Operations Research 40, 1086–1094.
10. Gendreau, M., A. Hertz, and G. Laporte. 1994. A tabu search heuristic for the vehicle routing problem. Management Science 40, 1276–1290.
11. Gendreau, M., G. Laporte, and J.-Y. Potvin. 2002. Metaheuristics for the capacitated VRP. In P. Toth and D. Vigo (editors) The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications, Philadelphia.
12. Golden, B. L., A. A. Assad, and E. A. Wasil. 2002. Routing vehicles in the real world: Applications in the solid waste, beverage, food, dairy and newspaper industries. In P. Toth and D. Vigo (editors) The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications, Philadelphia.
13. Golden, B. L., E. A. Wasil, J. P. Kelly, and I-M. Chao. 1998. Metaheuristics in vehicle routing. In T. G. Crainic and G. Laporte (editors), Fleet Management and Logistics, Kluwer, Boston, pp. 33–56.
14. Laporte, G. and F. Semet. 2002. Classical heuristics for the capacitated VRP. In P. Toth and D. Vigo (editors) The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications, Philadelphia.
15. Lin, S. 1965. Computer solutions of the traveling salesman problem. Bell System Technical Journal 44, 1447–1459.
16. Lin, S. and B. Kernighan. 1973. An effective heuristic algorithm for the traveling salesman problem. Operations Research 21, 498–516.
17. Mitrović-Minić, S., R. Krishnamurti and G. Laporte. 2004. Double-horizon based heuristics for the dynamic pickup and delivery problem with time windows. Transportation Research B. (In press).
18. Naddef, D. and A. Rinaldi. 2002. Branch-and-cut algorithms for the capacitated VRP. In P. Toth and D. Vigo (editors) The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications, Philadelphia.
19. Or, I. 1976. Traveling Salesman Type Combinatorial Problems and Their Relation to the Logistics of Blood Banking. Ph. D. Thesis, Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, IL.
20. Osman, I. H. 1993. Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Annals of Operation Research 41, 421–451.
21. Owoc, M. and M. A. Sargious. 1992. The role of transportation in free trade competition. In N. Waters (editor) Canadian Transportation: Competing in a Global Context. Banff, Alberta.
22. Prins, C. 2004. A simple and effective evolutionary algorithm for the vehicle routing problem. Computers and Operations Research. (Unpublished).
23. Renaud, J., F. F. Boctor, and G. Laporte. 1996. An improved petal heuristic for the vehicle routing problem. Journal of the Operations Research Society 47, 329–336.
24. Rego, C. 1998. A Subpath ejection method for the vehicle routing problem. Management Science 44, 1447–1459.
25. Rochat, Y. and E. D. Taillard. 1995. Probabilistic diversifications and intensifications in local search for vehicle routing. Journal of Heuristics 1, 147–167.
26. Thompson, P. M. and J. B. Orlin. 1989. The theory of cyclic transfers. Working Paper Number: OR 200-89. Operations Research Center, MIT, Cambridge, MA.
27. Thompson, P. M. and H. N. Psaraftis. 1993. Cyclic transfer algorithms formultivehicle routing and scheduling problems. Operations Research 41, 935–946.
28. Van Breedam, A. 1994. An Analysis of the Behavior of Heuristics for the Vehicle Routing Problem for a Selection of Problems with Vehicle-Related, Customer-Related and Time-Related Constraints. Ph. D. Thesis, University of Antwerp.
29. Xu, J. and J. Kelly. 1996. A network flow-based tabu search heuristic for the vehicle routing problem. Transportation Science 30, 379–393.
30. Wark, P. and J. Holt. 1994. A repeated matching heuristic for the vehicle routing problem. Operational Research Society 45, 1156–1167.