A two-stage heuristic with ejection pools and generalized ejection chains for the vehicle routing problem with time windows

INFORMS Journal on Computing

Volumn 19, Issue 3, 2007, Pages 443-457

  Lim, Andrew ^a   Zhang, Xingwen ^b  

^a HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

^b STANFORD UNIVERSITY   (United States)

Author keywords

Scheduling; Transportation; Vehicle routing

Indexed keywords

EID: 57749103197     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.1060.0186     Document Type: Article

References (39)

1. Ahuja, R. K., J. B. Orlin, D. Sharma. 2001. Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem. Math. Programming 91 71-97.
2. Ahuja, R. K., J. B. Orlin, S. Pallottino, M. P. Scaparra, M. G. Scutella. 2004. A multi-exchange heuristic for the single-source capacitated facility location problem. Management Sci. 50 749-760.
3. Bent, R., R Van Hentenryck. 2004a. Scenario-based planning for partially dynamic vehicle routing with stochastic customers. Oper. Res. 52 977-987.
4. Bent, R., P. Van Hentenryck. 2004b. A two-stage hybrid local search for the vehicle routing problem with time windows. Transportation Sci. 38 515-530.
5. Berger, J., M. Barkaoui, O. Bräysy, 2003. A route-directed hybrid genetic approach for the vehicle routing problem with time windows. INFOR 41 179-194.
6. Brandão, J. 1999. Metaheuristic for the vehicle routing problem with time windows. S. Voss, S. Martello, I. H. Osman, C. Roucairol, eds. Mela-Heuristics-Advances and Trends in Local Search Paradigms for Optimization. Kluwer Academic Publishers, Boston, MA, 19-36.
7. Bräysy, O. 2003. A reactive variable neighborhood search algorithm for the vehicle routing problem with time windows. INFORMS j. Comput. 15 347-368.
8. Bräysy, O., M. Gendreau. 2005a. Vehicle routing problem with time windows, part i: Route construction and local search algorithms. Transportation Sci. 39 104-118.
9. Bräysy, O., M. Gendreau. 2005b. Vehicle routing problem with time windows, part ii: Metaheuristics. Transportation Sci. 39 119-139.
10. Bräysy, O., G. Hasle, W. Dullaert. 2002. A fast local search algorithm for the vehicle routing problem with time windows. Working paper, SINTEF Applied Mathematics, Department of Optimization, Trondheim, Norway.
11. Bräysy, O., J. Berger, M. Barkaoui, W. Dullaert. 2003a. A threshold accepting metaheuristic for the vehicle routing problem with time windows. Central Eur. J. Oper. Res. 11 369-387.
12. Bräysy, O., G, Hasle, J. Berger, M, Barkaoui, 2003b, Systematic diversification metaheuristic for the vehicle routing problem with time windows. Working paper, SINTEF Applied Mathematics, Department of Optimization, Trondheim, Norway.
13. Campbell, A., M. Savelsbergh. 2005. Decision support for consumer direct grocery initiatives. Transportation Sci. 39 313-327.
14. Gambardella, L. M., E. Taillard, G. Agazzi. 1999. Macs-vrptw: A multiple ant colony system for vehicle routing problems with time windows. D. Cornc, M. Dorigo, F. Glover, eds. Nezv Ideas in Optimization. McGraw-Hill, London, 63-76.
15. Gehring, H., J. Homberger. 1999. A parallel hybrid evolutionary metaheuristic for the vehicle routing problem with time windows. Proc. of EUROGEN'99. University of Jyväskylä, Jyvaskylä, Finland, 57-64.
16. Gehring, H., J. Homberger. 2001. Parallelization of a two-phase metaheuristic for routing problems with time windows. Asia- Pacific J. Oper. Res. 18 35-47.
17. Glover, F. 1986. Future paths for integer programming and links to artificial intelligence. Comput. Oper. Res. 13 533-549.
18. Glover, F. 1991. Multilevel tabu search and embedded search neighborhoods for the traveling salesman problem. Working paper, College of Business and Administration, University of Colorado, Boulder, CO.
19. Glover, F. 1992. New ejection chain and alternating path methods for traveling salesman problems. O. Balci, R. Sharda, S. Zenios, eds. Computer Science and Operations Research: New Developments in Their Interfaces. Pergamon Press, Oxford, UK, 449-509.
20. Homberger, J., H. Gehring. 1999. Two evolutionary mcta-heuristics for the vehicle routing problem with time windows. INFOR 37 297-318.
21. Homberger, J., H. Gehring. 2005. A two-phase hybrid metaheuristic for the vehicle routing problem with time windows. Eur. J. Oper. Res. 162 220-238.
22. Ibaraki, T, S. Imahori, M. Kubo, T. Masuda, T. Uno, M. Yagiura. 2005. Effective local search algorithms for routing and scheduling problems with general time-window constraints. Transportation Sci. 39 206-232.
23. Joslin, D. E., D. P. Clements. 1999. "Squeaky wheel" optimization. J. Artificial Intelligence Res. 10 353-373.
24. Kilby, P., P. Prosser, P. Shaw. 1999. Guided local search for the vehicle routing problem with time windows. S. Voss, S. Martello, I. H. Osman, C. Roucairol, eds. Meta-Heuristics-Advances and Trends in Local Search Paradigms for Optimization. Kluwer Academic Publishers, Boston, MA, 473-486.
25. Kontoravdis, G. A., J. F. Bard. 1995. Grasp for the vehicle routing problem with time windows. ORSA j. Comput. 7 10-23.
26. Koskosidis, Y. A., W. B. Powell, M. M. Solomon. 1992. An optimization-based heuristic for vehicle routing and scheduling with soft time window constraints. Transportation Sci. 26 69-85.
27. Lau, H. C., M. Sim, K. M. Teo. 2003. Vehicle routing problem with time windows and a limited number of vehicles. Eur. J. Oper. Res. 148 559-569.
28. Lenstra, J. K., A. H. G. Rinnooy Kan. 1981. Complexity of vehicle routing and scheduling problems. Networks 11 221-227.
29. Li, H., A. Lim. 2001. Large scale time-constrained vehicle routing problems: A general metaheuristic framework with extensive experimental results. Technical report, School of Computing, National University of Singapore, Singapore.
30. Liu, F. H., S. Y. Shen. 1999. A route-neighborhood-based metaheuristic for vehicle routing problem with time windows. Eur. J. Oper. Res. 118 485-504.
31. Or, I. 1976. Traveling salesman-type combinatorial problems and their relation to the logistics of regional blood banking. Ph.D. thesis, Northwestern University, Evanston, IL.
32. Östergård, P. R. I. 2002. A fast algorithm for the maximum clique problem. Discrete Appl. Math. 120 197-207.
33. Potvin, J. Y, S. Bengio. 1996. The vehicle routing problem with time windows part ii: Genetic search. INFORMS J Comput. 8 165-172.
34. Potvin, J. Y, J. M. Rousseau. 1993. A parallel route building algorithm for the vehicle routing and scheduling problem with time windows. Eur. J. Oper. Res. 66 331-340.
35. Rochat, Y, E. Taillard. 1995. Probabilistic diversification and intensification in local search for vehicle routing. J. Heuristics 1 147-167.
36. Rousseau, L. M., M. Gendreau, G. Pesant. 2002. Using constraint- based operators to solve the vehicle routing problem with time windows. J. Heuristics 8 43-58.
37. Schulze, J., T. Fahle. 1999. A parallel algorithm for the vehicle routing problem with time window constraints. Ann. Oper. Res. 86 585-607.
38. Solomon, M. M. 1987. Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. 35 254-265.
39. TaiUard, E., P. Badeau, M. Gendreau, F. Guertin, J.-Y. Potvin. 1997. A tabu search heuristic for the vehicle routing problem with soft time windows. Transportation Sci. 31 170-186.