A two-phase hybrid metaheuristic for the vehicle routing problem with time windows

European Journal of Operational Research

Volumn 162, Issue 1, 2005, Pages 220-238

  Homberger, Jörg ^a,b   Gehring, Hermann ^a  

^a UNIVERSITY OF HAGEN   (Germany)

^b NONE   (Germany)

Author keywords

Evolution strategy; Hybridization; Metaheuristics; Tabu search; Time windows; Vehicle routing

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; HEURISTIC METHODS; PROBLEM SOLVING; ROUTERS;

EVOLUTION STRATEGY; HYBRIDIZATION; METAHEURISTICS; TABU SEARCH; TIME WINDOWS; VEHICLE ROUTING;

OPERATIONS RESEARCH;

EID: 8444235112     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2004.01.027     Document Type: Conference Paper

References (37)

1. Ablay P. Optimieren mit Evolutionsstrategien. Spektrum der Wissenschaft. 7:1987;104-115.
2. Chiang W.C., Russell R.A. Simulated annealing metaheuristics for the vehicle routing problem with time windows. Annals of Operations Research. 63:1996;3-27.
3. Chiang W.C., Russell R.A. A reactive tabu search metaheuristic for the vehicle routing problem with time windows. INFORMS Journal on Computing. 9:1997;417-430.
4. Clarke G., Wright J.W. Scheduling of vehicles from a central depot to a number of delivery points. Operations Research. 12:1964;568-581.
5. Gambardella, L.M., Taillard, E., Agazzi, G., 1999. MACS-VRPTW: A multiple ant colony system for vehicle routing problems with time windows. Technical Report IDSIA-06-99, Lugano, Switzerland.
6. Gehring, H., Homberger, J., 1999. A parallel hybrid evolutionary metaheuristic for the vehicle routing problem with time windows. In: Miettinen, K., Mäkelä, M.M., Toivanen, J. (Eds.), Proceedings of EUROGEN99 - Short Course on Evolutionary Algorithms in Engineering and Computer Science, 57-64. Reports of the Department of Mathematical Information Technology, No. A 2/1999, University of Jyväskylä, Finland.
7. Gietz M. Computergestützte Tourenplanung mit zeitkritischen Restriktionen. Physica. 1994.
8. Glover F. Future paths for integer programming and links to artificial intelligence. Computers and Operations Research. 13:1986;533-549.
9. Glover F., Kelley J.P., Laguna M. Genetic algorithms and tabu search: Hybrids for optimization. Computers and Operations Research. 22:1995;111-134.
10. Hansen P., Mladenovic N. An introduction to variable neighbourhood search. Voss S., Martello S., Osman I.H., Roucairol C. Meta-Heuristics - Advances and Trends in Local Search Paradigms for Optimization. 1999;431-458 Kluwer, Boston.
11. Hoffmeister F., Bäck T. Genetic algorithms and evolution strategies: Similarities and differences. Schwefel H.-P., Männer R. Parallel Problem Solving from Nature - 1st Workshop. PPSN I, Dortmund, Germany, October 1-3, 1990, Proceedings :1991;447-461 Springer, Berlin.
12. Homberger J., Gehring H. Two evolutionary metaheuristics for the vehicle routing problem with time windows. Laporte G., Semet F. Metaheuristics for Location and Routing Problems. Information Systems and Operational Research. 37(Special issue):1999;297-318.
13. Kilby P., Prosser P., Shaw P. Guided local search for the vehicle routing problem with time windows. Voss S., Martello S., Osman I.H., Roucairol C. Meta-Heuristics - Advances and Trends in Local Search Paradigms for Optimization. 1999;473-486 Kluwer, Boston.
14. Kontoravdis G., Bard J.F. A GRASP for the vehicle routing problem with time windows. ORSA Journal on Computing. 7:1995;10-23.
15. Lenstra J., Rinnooy Kan A. Complexity of vehicle routing and scheduling problems. Networks. 11:1981;221-227.
16. Lin S. Computer solutions of the traveling salesman problem. Bell System Technical Journal. 44:1965;2245-2269.
17. Liu F., Shen S. A route-neighbourhood-based metaheuristic for vehicle routing problem with time windows. European Journal of Operational Research. 118:1999;485-504.
18. Neitzel, W., 1977. Tourenplanung - Problemdarstellung und Lösungsverfahren für Ein-Depot-Probleme. Peter Lang, Frankfurt/M.
19. Or, I., 1976. Traveling salesman-type combinatorial problems and their relation to the logistics of blood banking. Ph.D. thesis, Department of Industrial Engineering and Management Science, Northwestern University, Evanston, IL.
20. Osman I.H. Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Annals of Operations Research. 41:1993;421-451.
21. Osman I.H., Kelly J.P. Meta-heuristics: An overview. Osman I.H., Kelly J.P. Meta-Heuristics - Theory and Applications. 1997;1-21 Kluwer, Boston.
22. Potvin J.Y., Bengio S. The vehicle routing problem with time windows - Part II: Genetic search. INFORMS Journal on Computing. 8:1996;165-172.
23. Potvin J.Y., Rousseau J.M. An exchange heuristic for routing problems with time windows. Journal of the Operational Research Society. 46:1995;1433-1446.
24. Potvin J.Y., Kervahut T., Garcia B.L., Rousseau J.M. The vehicle routing problem with time windows - Part I: Tabu search. INFORMS Journal on Computing. 8:1996;158-164.
25. Russell R.A. Hybrid heuristics for the vehicle routing problem with time windows. Transportation Science. 29:1995;156-166.
26. Savelsbergh M.W.P. Local search in routing problems with time windows. Annals of Operations Research. 4:1985;285-305.
27. Savelsbergh M.W.P. The vehicle routing problem with time windows: Minimizing route duration. ORSA Journal on Computing. 4:1992;146-154.
28. Schulze J., Fahle T. Parallel algorithm for the vehicle routing problem with time window constraints. Beasley J.E., Sharaiha Y.M. Combinatorial Optimization: Recent Advances in Theory and Praxis. Special issue of Annals of Operations Research. 86:1999;585-607.
29. Schwefel H.P. Numerical Optimization of Computer Models. 1981;John Wiley & Sons, Chichester.
30. Semet F., Taillard É.D. Solving real-life vehicle routing problems efficiently using tabu search. Annals of Operations Research. 41:1993;469-488.
31. Shaw P. Using constraint programming and local search methods to solve vehicle routing problems. Maher M., Puget J.F. Principles and Practice of Constraint Programming - Proceedings of the 4th International Conference, Pisa, Italy. 1998;417-431 Springer, Berlin.
32. Solomon M.M. Algorithms for the vehicle routing and scheduling problems with time window constraints. Operations Research. 35:1987;254-265.
33. Solomon M.M., Desrosiers J. Time window constrained routing and scheduling problems. Transportation Science. 22:1988;1-13.
34. Taillard E., Badeau P., Gendreau M., Guertin F., Potvin J.Y. A tabu search heuristic for the vehicle routing problem with soft time windows. Transportation Science. 31:1997;170-186.
35. Thangiah S.R., Nygard K.E., Juell P.L. GIDEON: a genetic algorithm system for vehicle routing with time windows. Proceedings of the 7th Conference on Artificial Intelligence for Applications, Miami, FL. 1991;322-328 IEEE Press, New York.
36. Thangiah, S.R., Osman, I.H., Sun, T., 1995. Hybrid genetic algorithms, simulated annealing and tabu search methods for vehicle routing problems with time windows. Technical Report UKC/OR94/4, Institute of Mathematics and Statistics, University of Kent, Canterbury, UK.
37. Van Landeghem H.R.G. A bi-criteria heuristic for the vehicle routing problem with time windows. European Journal of Operational Research. 36:1988;217-226.