A Two-Stage Heuristic with Ejection Pools and Generalized Ejection Chains for the Vehicle Routing Problem with Time Windows

References

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