Classical and modern heuristics for the vehicle routing problem

International Transactions in Operational Research

Volumn 7, Issue 4-5, 2000, Pages 285-300

  Laporte, G ^a   Gendreau, M ^b   Potvin, J Y ^b   Semet, F ^c  

^a HEC MONTRÉAL   (Canada)

^b UNIVERSITÉ DE MONTRÉAL   (Canada)

^c UNIVERSITÉ DE VALENCIENNES   (France)

Author keywords

Routing; Search algorithms

Indexed keywords

EID: 0001454173     PISSN: 09696016     EISSN: 14753995     Source Type: Journal    
DOI: 10.1111/j.1475-3995.2000.tb00200.x     Document Type: Article

References (52)

1. Agarwal, Y., Mathur, K., Salkin, H.M., 1989. A set-partitioning-based exact algorithm for the vehicle routing problem. Networks 19, 731-749.
2. Altinkemer, K., Gavish, B., 1991. Parallel savings based heuristic for the delivery problem. Operations Research 39, 456-469.
3. Balinski, M.L., Quandt, R.E., 1964. On an integer program for a delivery program. Operations Research 12, 300-304.
4. Barr, R.S., Golden, B.L., Kelly, J.P., Resende, M.G.C., Stewart Jr, W.R., 1995. Designing and reporting on computational experiments with heuristic methods. Journal of Heuristics 1, 9-32.
5. Bramel, J.B., Simchi-Levi, D., 1995. A location based heuristic for general routing problems. Operations Research 43, 649-660.
6. Christofides, N., Mingozzi, A., Toth, P., 1979. The vehicle routing problem. In: Christofides, N., Mingozzi, A., Toth, P., Sandi, C. (Eds.), Combinatorial Optimization. Wiley, Chichester.
7. Clarke, G., Wright, J.W., 1964. Scheduling of vehicles from a central depot to a number of delivery points. Operations Research 12, 568-581.
8. Desrochers, M., Verhoog, T.W., 1989. A matching based savings algorithm for the vehicle routing problem. Les Cahiers du GERAD G-89-04, École des Hautes Etudes Commerciales de Montréal.
9. Dror, M., Levy, L., 1986. A vehicle routing improvement algorithm: comparison of a ‘Greedy’ and a ‘Matching’ implementation for inventory routing. Computers and Operations Research 13, 33-45.
10. Fahrion, R., Wrede, W., 1990. On a principle of chain-exchange for vehicle-routing problems (1-VRP). Journal of the Operational Research Society 41, 821-827.
11. Fisher, M.L., Jaikumar, R., 1981. A generalized assignment heuristic for vehicle routing. Networks 11, 109-124.
12. Foster, B.A., Ryan, D.M., 1976. An integer programming approach to the vehicle scheduling problem. Operations Research 27, 367-384.
13. Gaskell, T.J., 1967. Bases for vehicle fleet scheduling. Operational Research Quarterly 18, 218.
14. Gendreau, M., Hertz, A., Laporte, G., 1994. A tabu search heuristic for the vehicle routing problem. Management Science 40, 1276-1290.
15. Gendreau, M., Hertz, A., Laporte, G., 1992. New insertion and post optimization procedures for the traveling salesman problem. Operations Research 40, 1086-1094.
16. Gillett, B.E., Miller, L.R., 1974. A heuristic algorithm for the vehicle dispatch problem. Operations Research 22, 240-349.
17. Glover, F., Laguna, M., 1993. Tabu Search. In: Reeves, C.R. (Ed.), Modern Heuristic Techniques for Combinatorial Problems. Blackwell, Oxford.
18. Glover, F., Laguna, M., 1997. Tabu Search. Kluwer, Boston.
19. Golden, B.L., Magnanti, T.L., Nguyen, H.Q., 1977. Implementing vehicle routing algorithms. Networks 7, 113-148.
20. Golden, B.L., Wasil, E.A., Kelly, J.P., Chao, I-M., 1998. Metaheuristics in vehicle routing. In: Crainic, T.G., Laporte, G. (Eds.), Fleet Management and Logistics. Kluwer, Boston.
21. Hadjiconstantinou, E., Christophides, N., Mingozzi, A., 1995. A new exact algorithm for the vehicle routing problem based on q-paths and k-shortest path relaxations. In: Gendreau M., Laporte G. (Eds.). Freight Transportation, Annals of Operations Research, vol. 61, 21-43.
22. Hertz, A., Taillard, É.D., de Werra, D., 1997. Tabu search. In: Aarts, E.H.L., Lenstra, J.K. (Eds.), Local Search in Combinatorial Optimization. Wiley, Chichester.
23. Johnson, D.S., McGeoch, L.A., 1997. The traveling salesman problem: a case study. In: Aarts, E.H.L., Lenstra, J.K. (Eds.), Local Search in Combinatorial Optimization. Wiley, Chichester.
24. Kinderwater, G.A.P., Savelsbergh, M.W.P., 1997. Vehicle routing: handling edge exchanges. In: Aarts, E.H.L., Lenstra, J.K. (Eds.), Local Search in Combinatorial Optimization. Wiley, Chichester.
25. Laporte, G., Semet, F., 2000. Classical heuristics for the vehicle routing problem. In: Toth P., Vigo D. (Eds.), The Vehicle Routing Problem.
26. Lin, S., 1965. Computer solutions of the traveling salesman problem. Bell System Technical Journal 44, 2245-2269.
27. Lin, S., Kernighan, B., 1973. An effective heuristic algorithm for the traveling salesman problem. Operations Research 21, 498-516.
28. Miliotis, P., 1976. Integer programming approaches to the travelling salesman problem. Mathematical Programming 10, 367-378.
29. Mole, R.H., Jameson, S.R., 1976. A sequential route-building algorithm employing a generalized savings criterion. Operational Research Quarterly 27, 503-511.
30. Nelson, M.D., Nygard, K.E., Griffin, J.H., Shreve, W.E., 1985. Implementation techniques for the vehicle routing problem. Computers and Operations Research 12, 273-283.
31. Or, I., 1976. Traveling salesman-type combinatorial optimization problems and their relation to the logistics of regional blood banking. Ph.D. dissertation, Northwestern University, Evanston, IL.
32. Osman, I.H., 1993. Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Annals of Operations Research 41, 421-451.
33. Paessens, H., 1988. The savings algorithm for the vehicle routing problem. European Journal of Operational Research 34, 336-344.
34. Potvin, J.-Y., Kervahut, T., Garcia, B.L., Rousseau, J.-M., 1992. The vehicle routing problem with time windows. Part I: Tabu search. INFORMS Journal on Computing 8, 158-164.
35. Rego, C., Roucairol, C., 1996. A parallel tabu search algorithm using ejection chains for the vehicle routing problem. In: Osman, I.H., Kelly, J.P. (Eds.), Meta-Heuristics: Theory and Applications. Kluwer, Boston.
36. Renaud, J., Boctor, F.F., Laporte, G., 1996a. A fast composite heuristic for the symmetric traveling salesman problem. INFORMS Journal on Computing 8, 134-143.
37. Renaud, J., Boctor, F.F., Laporte, G., 1996b. An improved petal heuristic for the vehicle routing problem. Journal of the Operational Research Society 47, 329-336.
38. Rochat, Y., Taillard, É.D., 1995. Probabilistic diversification and intensification in local search for vehicle routing. Journal of Heuristics 1, 147-167.
39. Ryan, D.M., Hjorring, C., Glover, F., 1993. Extensions of the petal method for vehicle routing. Journal of the Operational Research Society 44, 289-296.
40. Salhi, S., Rand, G.K., 1987. Improvements to vehicle routing heuristics. Journal of the Operational Research Society 38, 293-295.
41. Stewart Jr, W.R., Golden, B.L., 1984. A Lagrangean relaxation heuristic for vehicle routing. European Journal of Operational Research 15, 84-88.
42. Taillard, É.D., 1993. Parallel iterative search methods for vehicle routing problems. Networks 23, 661-673.
43. Thompson, P.M., Psaraftis, H.N., 1993. Cyclic transfer algorithms for the multi vehicle routing and scheduling problems. Operations Research 41, 935-946.
44. Toth, P., Vigo, D., 1998. Granular tabu search. Working paper, DEIS, University of Bologna.
45. Toth, P., Vigo, D., 2000. The vehicle routing problem. SIAM, Philadelphia Monograph on Discrete Mathematics and Applications.
46. 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. dissertation, University of Antwerp.
47. Volgenant, A., Jonker, R., 1983. The symmetric traveling salesman problem and edge exchange in minimal 1-trees. European Journal of Operational Research 12, 394-403.
48. Wark, P., Holt, J., 1994. A repeated matching heuristic for the vehicle routing problem. Journal of the Operational Research Society 45, 1156-1167.
49. Wren, A., 1971. Computers in Transport Planning and Operation. Ian Allan, London.
50. Wren, A., Holliday, A., 1972. Computer scheduling of vehicles form one or more depots to a number of delivery points. Operational Research Quarterly 23, 333-344.
51. Xu, J., Kelly, J.P., 1996. A network flow-based tabu search heuristic for the vehicle routing problem. Transportation Science 30, 379-393.
52. Yellow, P., 1970. A computational modification to the savings method of vehicle scheduling. Operational Research Quarterly 21, 281-283.