The multi-depot vehicle routing problem with inter-depot routes

European Journal of Operational Research

Volumn 176, Issue 2, 2007, Pages 756-773

  Crevier, Benoit ^a   Cordeau, Jean François ^a   Laporte, Gilbert ^a  

^a HEC MONTRÉAL   (Canada)

Author keywords

Adaptative memory; Integer programming; Multi depot vehicle routing problem; Replenishment; Tabu search

Indexed keywords

ADAPTATIVE MEMORY; MULTI DEPOT VEHICLE ROUTING PROBLEM; TABU SEARCH;

COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; INTEGER PROGRAMMING; PROBLEM SOLVING;

OPERATIONS RESEARCH;

EID: 33749568121     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2005.08.015     Document Type: Article

References (34)

1. Angelelli E., and Speranza M.G. The application of a vehicle routing model to a waste-collection problem: Two case studies. Journal of the Operational Research Society 53 (2002) 944-952
2. Angelelli E., and Speranza M.G. The periodic vehicle routing problem with intermediate facilities. European Journal of Operational Research 137 (2002) 233-247
3. Brandão J.C.S., and Mercer A. A tabu search algorithm for the multi-trip vehicle routing and scheduling problem. European Journal of Operational Research 100 (1997) 180-191
4. Brandão J.C.S., and Mercer A. The multi-trip vehicle routing problem. Journal of the Operational Research Society 49 (1998) 799-805
5. F. Cano Sevilla, C. Simón de Blas, Vehicle routing problem with time windows and intermediate facilities, in: S.E.I.O.'03 Edicions de la Universitat de Lleida, 2003, pp. 3088-3096.
6. Chao I.-M., Golden B.L., and Wasil E.A. A new heuristic for the multi-depot vehicle routing problem that improves upon best-known solutions. American Journal of Mathematical and Management Sciences 13 (1993) 371-406
7. Cordeau J.-F., Gendreau M., and Laporte G. A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks 30 (1997) 105-119
8. Cordeau J.-F., Gendreau M., Laporte G., Potvin J.-Y., and Semet F. A guide to vehicle routing heuristics. Journal of the Operational Research Society 53 (2002) 512-522
9. Cordeau J.-F., Laporte G., and Mercier A. A unified tabu search heuristic for vehicle routing problems with time windows. Journal of the Operational Research Society 52 (2001) 928-936
10. Dueck G. New optimization heuristics: The great deluge algorithm and the record-to-record travel. Journal of Computational Physics 104 (1993) 86-92
11. Fagerholt K. Designing optimal routes in a liner shipping problem. Maritime Policy & Management 31 (2004) 259-268
12. B. Fleischmann, The vehicle routing problem with multiple use of vehicles, Working paper, Fachbereich Wirtschaftswissenschaften, Universität Hamburg, 1990.
13. Gendreau M., Hertz A., and Laporte G. New insertion and postoptimization procedures for the traveling salesman problem. Operations Research 40 (1992) 1086-1094
14. Gendreau M., Hertz A., and Laporte G. A tabu search heuristic for the vehicle routing problem. Management Science 40 (1994) 1276-1290
15. Gendreau M., Laporte G., and Potvin J.-Y. Metaheuristics for the capacitated vehicle routing problem. In: Toth P., and Vigo D. (Eds). The Vehicle Routing Problem. Monographs on Discrete Mathematics and Applications (2002), SIAM, Philadelphia 129-154
16. Gillett B.E., and Johnson J.G. Multi-terminal vehicle-dispatch algorithm. Omega 4 (1976) 711-718
17. Golden B.L., Magnanti T.L., and Nguyen H.Q. Implementing vehicle routing algorithms. Networks 7 (1977) 113-148
18. Jordan W.C. Truck backhauling on networks with many terminals. Transportation Research 21B (1987) 183-193
19. Jordan W.C., and Burns L.D. Truck backhauling on two terminal networks. Transportation Research 18B (1984) 487-503
20. Laporte G., Nobert Y., and Arpin D. Optimal solutions to capacitated multidepot vehicle routing problems. Congressus Numerantium 44 (1984) 283-292
21. Laporte G., Nobert Y., and Taillefer S. Solving a family of multi-depot vehicle routing and location-routing problems. Transportation Science 22 (1988) 161-172
22. Laporte G., and Semet F. Classical heuristics for the capacitated vehicle routing problem. In: Toth P., and Vigo D. (Eds). The Vehicle Routing Problem. Monographs on Discrete Mathematics and Applications (2002), SIAM, Philadelphia 109-128
23. Lin S. Computer solutions of the traveling salesman problem. Bell System Technical Journal 44 (1965) 2245-2269
24. Raft O.M. A modular algorithm for an extended vehicle scheduling problem. European Journal of Operational Research 11 (1982) 67-76
25. Renaud J., Laporte G., and Boctor F.F. An improved petal heuristic for the vehicle routing problem. Journal of the Operational Research Society 47 (1996) 329-336
26. Renaud J., Laporte G., and Boctor F.F. A tabu search heuristic for the multi-depot vehicle routing problem. Computers & Operations Research 23 (1996) 229-235
27. Rochat Y., and Taillard E.D. Probabilistic diversification and intensification in local search for vehicle routing. Journal of Heuristics 1 (1995) 147-167
28. Suprayogi, Yamato H., and Iskendar. Ship routing design for the oily liquid waste collection. Journal of the Society of Naval Architects of Japan 190 (2001) 325-335
29. Taillard E.D., Laporte G., and Gendreau M. Vehicle routing with multiple use of vehicles. Journal of the Operational Research Society 47 (1996) 1065-1070
30. Tillman F.A. The multiple terminal delivery problem with probabilistic demands. Transportation Science 3 (1969) 192-204
31. Tillman F.A., and Cain T.M. An upperbound algorithm for the single and multiple terminal delivery problem. Management Science 18 (1972) 664-682
32. Tillman F.A., and Hering R.W. A study of look-ahead procedure for solving the multiterminal delivery problem. Transportation Research 5 (1971) 225-229
33. Wren A., and Holliday A. Computer scheduling of vehicles from one or more depots to a number of delivery points. Operational Research Quarterly 23 (1972) 333-344
34. Zhao Q.-H., Wang S.-Y., Lai K.-K., and Xia G.-P. A vehicle routing problem with multiple use of vehicles. Advanced Modeling and Optimization 4 (2002) 21-40