A tabu search algorithm for the vehicle routing problem

Computers and Operations Research

Volumn 26, Issue 3, 1999, Pages 255-270

  Barbarosoglu, Gulay ^a   Ozgur, Demet ^a  

^a BOGAZICI UNIVERSITY   (Turkey)

Author keywords

Distribution; Metaheuristics; Tabu search; Vehicle routing problem

Indexed keywords

ALGORITHMS; CRITICAL PATH ANALYSIS; DISTRIBUTION OF GOODS; HEURISTIC METHODS; PROBLEM SOLVING; SCHEDULING; STATISTICAL METHODS; STRATEGIC PLANNING; TRANSPORTATION ROUTES;

METAHEURISTIC METHODS; TABU SEARCH ALGORITHMS; VEHICLE ROUTING PROBLEMS;

OPERATIONS RESEARCH;

ALGORITHM; METHODOLOGY; PLANNING METHOD; TRANSPORTATION PLANNING;

EID: 0033102291     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(98)00047-1     Document Type: Article

References (25)

1. Laporte G, Nobert Y. Exact algorithms for the vehicle routing problem. In: Martello S, Laporte G, Minoux M, Riberio C, editors. Surveys in Combinatorial Optimization, Amsterdam: North-Holland, 1987, 147-84.
2. Laporte G, Mercure H, Nobert Y. A branch-and-bound algorithm for a class of asymmetrical vehicle routing problems. Journal of Operational Research Society 1992;43:469-81.
3. Fisher ML. Optimal Solution of Vehicle Routing Problems and Minimum k-trees, Report 89-12-13, Decision Sciences Deparment, The Wharton School, Philadelphia, PA, 1989.
4. Christofides N, Hadjiconstantinou E, Mingozzi A. A New Exact Algorithm for the Vehicle Routing Problem Based on q-path and k-shortest Path Relaxations. Working Paper, The Management School, Imperial College, London, 1993.
5. Fisher ML, Jörnsten KO, Madsen OBG. Vehicle routing with time windows: Two optimization algorithms. Operations Research 1997;45:488-92.
6. Kohl N, Madsen OBG. An optimization algorithm for the vehicle routing problem with time windows based on Lagrangian relaxation. Operations Research 1997;45:395-406.
7. Bramel J, Simchi-Levi D. On the effectiveness of set covering formulations for the vehicle routing problem with time windows. Operations Research 1997;45:295-301.
8. Clarke G, Wright JW. Scheduling of vehicles from a central depot to a number of delivery points. Operations Research 1964;12:568-81.
9. Gillett B, Miller L. A heuristic algorithm for the vehicle dispatch problem. Operations Research 1974;22:340-49.
10. Christofides N, Mingozzi A, Toth P. The vehicle routing problem. In: Christofides N, Mingozzi A, Toth P, Sandi C. editors. Combinatorial Optimization, Chichester: Wiley, 1979;315-38.
11. Paessens H. The savings algorithm for the vehicle routing algorithm. European Journal of Operational Research 1988;34:336-44.
12. Desrochers M, Verhoog TW. A Matching Based Savings Algorithm for the Vehicle Routing Problem. Cahier du GERAD G-89-04, Ecole des Hautes Etudes Commerciales de Montreal, 1989.
13. Altinkemer K, Gavish B. Parallel savings based heuristic for the delivery problem. Operations Research 1991;39:456-69.
14. Laporte G. The vehicle routing problem: An overview of exact and approximate algorithms. European Journal of Operational Research 1992;59:345-58.
15. Willard JAG. Vehicle Routing Using r-optimal Tabu Search, M.Sc. Dissertation, The Management School, Imperial College, London, 1989.
16. Pureza VM, França PM. Vehicle Routing Problems Via Tabu Search Metaheuristic, Publication CRT-747, Centre de recherche sur les transports, Montreal, 1991.
17. Osman IH. Metastrategy Simulated Annealing and Tabu Search Algorithms for Combinatorial Optimization Problems. Ph.D. Dissertation, The Management School, Imperial College, London, 1991.
18. Osman IH. Metastrategy simulated annealing and tabu search algorithms for combinatorial optimization problems. Annals of Operations Research, 1993;41:421-51.
19. Taillard E. Parallel iterative search methods for vehicle routing problems. Networks 1993;23:661-72.
20. Gendreau M, Hertz A, Laporte G. A tabu search heuristic for the vehicle routing problem. Management Science 1994;40:1276-90.
21. Glover F. Heuristic for integer programming using surrogate constraints. Decision Sciences 1977;8:156-66.
22. Glover F. Tabu search, Part I. ORSA J. Computing 1989;1:190-206.
23. Glover F. Tabu search, Part II. ORSA J. Computing 1990;2:4-32.
24. Glover F, Taillard E, De Werra D. A user's guide to tabu search. Annals of Operations Resarch 1993;41:3-28.
25. Hadjiconstantinou E, Christofides N. An optimal procedure for solving basic vehicle routing problems, presented at the 35th Annual Conf. of The Canadian Operational Research Society, Halifax, Canada, 1993.