Fast ejection chain algorithms for vehicle routing with time windows

Lecture Notes in Computer Science

Volumn 3636, Issue , 2005, Pages 78-89

  Sontrop, Herman ^a   Van Der Horn, Pieter ^a   Uetz, Marc ^b  

^a PHILIPS RESEARCH LABORATORIES   (Netherlands)

^b MAASTRICHT UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; PROBLEM SOLVING; TRAVELING SALESMAN PROBLEM;

FAST EJECTION CHAIN ALGORITHM; LOCAL SEARCH ALGORITHM; VEHICLE ROUTING PROBLEMS WITH TIME WINDOW CONSTRAINTS (VRPTW);

ALGORITHMS;

EID: 27144503846     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11546245_8     Document Type: Conference Paper

References (17)

1. E. H. L. Aarts and J. K. Lenstra. Local search in combinatorial optimization. Wiley, Chichester, UK, 1996.
2. C. Blum and A. Roli. Metaheuristics in combinatorial optimization: Overview and conceptual comparison. ACM Comput. Surv., 35(3):268-308, 2003.
3. G. Clark and J. W. Wright. Scheduling of vehicles from a central depot to a number of delivery points. Operations Research, 12:568-581, 1964.
4. M. den Besten, T. Stützle, and M. Dorigo. Design of iterated local search algorithms. In E. J. W. Boers, J. Gottlieb, P. L. Lanzi, R. E. Smith, S. Cagnoni, E. Hart, G. R. Raidl, and H. Tijink, editors, Applications of Evolutionary Computing, volume 2037 of Lecture Notes in Computer Science, pages 441-451, 2001.
5. D. Gamboa, C. Rego, and F. Glover. Implementation analysis of efficient heuristic algorithms for the traveling salesman problem. Computers and Operations Research, 2005. To appear.
6. P. L. George and H. Borouchaki. Delaunay Triangulation and Meshing, Applications to Finite Elements. Hermes, 1998.
7. F. Glover. Ejection chains, reference structures and alternating path methods for traveling salesman problems. Discrete Applied Mathematics, 65:223-253, 1996.
8. F. Glover and M. Laguna. Tabu Search. Kluwer, Dordrecht, NL, 1998.
9. P. Kilby, P. Prosser, and P. Shaw. Guided local search for the vehicle routing problem. In S. Voss, S. Martello, I. H. Osman, and C. Roucairol, editors, Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, pages 473-486. Kluwer, Boston, MA, 1997.
10. S. Lin and B. W. Kernighan. An effective heuristic for the traveling salesman problem. Operations Research, 21:498-516, 1973.
11. H. R. Lourenco, O. Martin, and T. Stützle. Iterated local search. In F. Glover and G. Kochenberger, editors, The Handbook of Metaheuristics, pages 321-353. Kluwer, Norwell, MA, 2002.
12. O. C. Martin and S. W. Otto. Combining Simulated Annealing with Local Search Heuristics, volume 63 of Annals of Operations Research, pages 57-75. 1996.
13. C. Rego. A subpath ejection method for the vehicle routing problem. Management Science, 44(10): 1447-1459, 1998.
14. Y. Rochat and É. D. Taillard. Probalistic diversification and intensification in local search for vehicle routing. Journal of Heuristics, 1:147-167, 1995.
15. M. Solomon. Algorithms for the vehicle routing and scheduling problem with time window constraints. Operations Research, 35:254-265, 1987.
16. P. Toth and D. Vigo. The Vehicle Routing Problem. Society for Industrial and Applied Mathematics, Philadelphia, PA, 2002.
17. J. Xu and J. Kelly. A network-flow based tabu search heuristic for the vehicle routing problem. Transportation Science, 30:379-393, 1996.