A unified tabu search heuristic for vehicle routing problems with time windows

Journal of the Operational Research Society

Volumn 52, Issue 8, 2001, Pages 928-936

  Cordeau, J F ^a   Laporte, G ^a   Mercier, A ^a  

^a HEC MONTRÉAL   (Canada)

Author keywords

Multi depot vehicle routing problem; Periodic vehicle routing problem; Tabu search; Time windows; Vehicle routing problem

Indexed keywords

ALGORITHMS; BENCHMARKING; HEURISTIC METHODS; ITERATIVE METHODS;

VEHICLE ROUTING PROBLEMS;

VEHICLES;

EID: 0035424778     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2601163     Document Type: Article

References (30)

1. Carter MW, Farvolden JM, Laporte G and Xu J (1996). Solving an integrated logistics problem arising in grocery distribution. INFOR34: 290-306.
2. Golden BL and Wasil EA (1987). Computerized vehicle routing in the soft drink industry. Opns Res35: 6-17.
3. Hamacher A (1997). Baumzerlegungen unter Nebenbedingun-gen - Ein Clusterverfahren zur Losung praktischer Vehicle-Routing-Probleme. PhD thesis, Mathematisches Institut, Universitat zu Koln.
4. Rochat Y and Semet F (1994). A tabu search approach for delivering pet food and flour in Switzerland. J Opl Res Soc45: 1233-1246.
5. Desrosiers J et al(1986). TRANSCOL: A multi-period school bus routing and scheduling system. TIMS Stud Mngt Sci22: 47-71.
6. Bell WJ et al(1983). Improving the distribution of industrial gases with an on-line computerized routing and scheduling optimizer. Interfaces13(6): 4-23.
7. Brown G, Ellis C, Graves G and Ronen D (1987). Real-time wide area dispatch of Mobil tank trucks. Interfaces17(1): 107-120.
8. Assad AA (1988). Modeling and implementation issues in vehicle routing. In: Golden BL and Assad AA (eds). Vehicle Routing: Methods and Studies. North-Holland: Amsterdam, pp 7-45.
9. Madsen OBG, Tosti K and Vaelds J (1995). A heuristic method for dispatching repair men. Ann Opns Res61: 213-226.
10. Chiang WC and Russell RA (1997). A reactive tabu search metaheuristic for the vehicle routing problem with time windows. INFORMS J Comp9: 417-430.
11. Homberger J and Gehring H (1999). Two evolutionary metaheuristics for the vehicle routing problem with time windows. INFOR37: 297-318.
12. Potvin JY and Bengio S (1996). The vehicle routing problem with time windows - part II: genetic search. INFORMS J Comp8: 165-172.
13. Potvin JY, Kervahut T, Garcia BL and Rousseau JM (1996). The vehicle routing problem with time windows - part I: Tabu search. INFORMS J Comp8: 158-164.
14. Rochat Y and Taillard eD (1995). Probabilistic diversification and intensification in local search for vehicle routing. J Heuristics1: 147-167.
15. Taillard ED et al(1997). A tabu search heuristic for the vehicle routing problem with soft time windows. Transport Sci31: 170-186.
16. Kohl N et al (1999). 2-path cuts for the vehicle routing problem with time windows. Transport Sci 33: 101-116.
17. Desaulniers G et al(1998). A unified framework for deterministic time constrained vehicle routing and crew scheduling problems. In: Crainic T and Laporte G (eds). Fleet Management and Logistics. Kluwer: Norwell, MA, pp 57-93.
18. Russell RA and Gribbin D (1991). A multiphase approach to the period routing problem. Networks21: 747-765.
19. Gaudioso M and Paletta G (1992). A heuristic for the periodic vehicle routing problem. Transport Sci26: 86-92.
20. Chao IM, Golden BL and Wasil EA (1995). A new heuristic for the period traveling salesman problem. Comp Oper Res22: 553-565.
21. Cordeau JF, Gendreau M and Laporte G (1997). A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks30: 105-119.
22. Chao IM, Golden BL and Wasil EA (1993). A new heuristic for the multi-depot vehicle routing problem that improves upon best-known solutions. Am J Math Mngt Sci13: 371-406.
23. Renaud J, Boctor FF and Laporte G (1996). An improved petal heuristic for the vehicle routing problem. J Opl Res Soc47: 329-336.
24. Baneijea-Brodeur M, Cordeau JF, Laporte G and Lasry A(1998). Scheduling linen deliveries in a large hospital. J Opl Res Soc49: 777-780.
25. Lenstra JK and Rinnooy Kan AHG (1981). Complexity of vehicle routing and scheduling problems. Networks11: 221-227.
26. Glover F (1986). Future paths for integer programming and links to artificial intelligence. Comp Oper Res13: 533-549.
27. Gendreau M, Hertz A, Laporte G and Stan M (1998). A generalized insertion heuristic for the traveling salesman problem with time windows. Opns Res43: 330-335.
28. Gendreau M, Hertz A and Laporte G (1992). New insertion and postoptimization procedures for the traveling salesman problem. Opns Res40: 1086-1094.
29. Solomon MM (1987). Algorithms for the vehicle routing and scheduling problems with time window constraints. Opns Res35: 254-265.
30. Russell RA (1995). Hybrid heuristics for the vehicle routing problem with time windows. Transport Sci29: 156-166.