A unified modeling and solution framework for vehicle routing and local search-based metaheuristics

INFORMS Journal on Computing

Volumn 20, Issue 2, 2008, Pages 270-287

  Irnich, S ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

Local search; Resource constrained paths history; Rich vehicle routing problems; Vehicle routing

Indexed keywords

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

References (47)

1. Aarts, E., J. K. Lenstra. 1997, Local Search in Combinatorial Optimization. Wiley, Chichester, UK.
2. Ascheuer, N. 1995. Hamiltonian path problems in the on-line optimization of flexible manufacturing systems. PhD thesis, Technische Universität Berlin, Berlin.
3. Bräysy, O., M. Gendreau. 2005a. Vehicle routing with time windows, Part I: Route construction and local search algorithms. Transportation Sci. 39 104-118.
4. Bräysy, O., M. Gendreau. 2005b. Vehicle routing with time windows, Part II: Metaheuristics. Transportation Sci. 39 119-139.
5. Christofides, N., S. Eilon. 1969. An algorithm for the vehicle- dispatching problem. Oper. Res. Quart. 20 309-318.
6. Christofides, N., S. Eilon. 1972. Algorithms for large-scale travelling salesman problems. Oper. Res. Quart. 23 511-518.
7. Cordeau, J.-E, G. Desaulnicrs, J. Desrosiers, M. M. Solomon, F. Soumis. 2002. VRP with time windows. The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications, Chapter 7. SIAM, Philadelphia, 155-194.
8. Desaulnicrs, G., J. Desrosiers, M. M. Solomon. 2002. Accelerating strategies in column generation for vehicle routing and crew scheduling problems. Essays and Surveys in Metaheuristics. Operations Research/Computer Science Interface Series, Chapter 14. Kluwer, Boston, 309-324.
9. Desaulniers, G., J. Desrosiers, M, M. Solomon, eds, 2005. Column Generation. Springer, New York.
10. Desaulniers, G., F. Lessard, A. Hadjar. 2006. Tabu search, generalized k-path inequalities, and partial elementarily for the vehicle routing problem with time windows. Les Cahiers du GERAD G-2006-45, HEC Montréal, Montréal.
11. Desaulniers, G., J. Desrosiers, I. Ioachim, M. M. Solomon, F. Soumis, D. Villeneuve. 1998. A unified framework for deterministic time constrained vehicle routing and crew scheduling problems. T. G. Crainic, G. Laporte, eds. Fleet Management and Logistics, Chapter 3. Kluwer Academic Publishers, Boston, 57-93.
12. Desrochers, M., I. Desrosiers, M. Solomon. 1992. A new optimization algorithm for the vehicle routing problem with time windows. Oper. Res. 40 342-354.
13. Desrochcrs, M., J. K. Lenstra, M. W. P. Savelsbcrgh. 1990. A classification scheme for vehicle routing and scheduling problems. Eur. J. Oper. Res. 46 322-332.
14. Desrosiers, J., Y. Dumas, M. M. Solomon, F. Soumis. 1995. Time constrained routing and scheduling. M. O. Ball, T. L. Magnanti, C. L. Monma, G. L. Nemhauser, eds. Network Routing. Hand- hooks in Operations Research and Management Science, Vol. 8. Elsevier, Amsterdam, 35-139.
15. Fukasawa, R., J. Lysgaard, M. Poggi de Aragão, E. Uchoa, M. Reis, R. F. Werneck. 2006. Robust branch-and-cut-and-price for the capacitated vehicle routing problem. Math. Programming Ser. A. 106 491-511.
16. Funkc, B. 2003. Effiziente lokalc suche für vehicle routing und scheduling probleme mit ressourcenbeschrankungen. PhD thesis, Rheinisch-Westfälische Technische Hochschule Aachen University, Aachen, Germany.
17. Funke, B., T. Grünert, S. Irnich. 2005a. Local search for vehicle routing and scheduling problems: Review and conceptual integration. J. Heuristics 11 267-306.
18. Funke, B., T. Grünert, S. Irnich. 2005b. A note on single alternating cycle neighborhoods for the TSP. J. Heuristics 11 135-146.
19. Glover, F. 1996. Ejection chains, reference structures and alternating path structures for traveling salesman problems. Discrete Appl Math. 65 223-253.
20. Glover, R, M. Laguna. 1997. Tabu Search. Kluwer, Dordrecht, the Netherlands.
21. Hansen, P., N. Mladenović, 2001. Variable neighborhood search: Principles and applications. Eur. J. Oper. Res. 130 449-467.
22. Hansen, P., N. Mladenović. 2002. Developments of variable neighborhood search. Essays and Surveys in Metaheuristics. Operations Research/Computer Science Interface Series, Chapter 19. Kluwer, Boston, 415-439.
23. Hasle, G., A. Løkketangen, S. Martello. 2006. Rich models in discrete optimization: Formulation and resolution (ECCO XVI). Eur. J. Oper. Res. 175 1752-1753.
24. Hempsch, C, S. Irnich. 2007. Vehicle-routing problems with inter-tour resource constraints. Technical report 2007-01, Deutsche Post Endowed Chair of Optimization of Distribution Networks, Rheinisch-Westfälische Technische Hochschule Aachen University, Aachen, Germany, http://www.dpor.rwth-aachen.de.
25. Homberger, J., H. Gehring. 1999. Two evolutionary metaheuristics for the vehicle routing problem with time windows. Inform. Systems Oper. Res. 37 297-318.
26. Hoos, H. H., T. Stützle. 2005. Stochastic Local Search Foundations and Applications. Morgan Kaufmann Publishers, Elsevier, San Francisco.
27. Irnich, S. 2008. Resource extension functions: Properties, inversion, and generalization to segments. OR Spectrum 30(1) 113-148.
28. Irnich, S., G. Desaulniers. 2005. Shortest path problems with resource constraints. Column Generation, Chapter 2. Springer, New York, 33-65.
29. Irnich, S., B. Funke, T. Grünert. 2006. Sequential search and its application to vehicle-routing problems. Comput, Oper. Res. 33 2405-2429.
30. Janssens, G. K., R. Hartl, G. Hasle. 2006. Special issue on rich vehicle routing problems. Central Eur. J. Oper. Res. 14 103-104.
31. Jepsen, M., S. Spoorendonk, B. Petersen, D. Pisinger. 2006. A non- robust branch-and-cut-and-price algorithm for the vehicle routing problem with time windows. DIKU Technical Report 06/03, Department of Computer Science, University of Copenhagen, Copenhagen.
32. Kallehauge, B., J. Larsen, O. B. G Madsen, M. M. Solomon. 2005. Vehicle routing problem with time windows. Column Generation, Chapter 3. Springer, New York, 67-98.
33. Kernighan, B. W., S. Lin. 1970. An efficient heuristic procedure for partitioning graphs. Bell Syst. Tech. J. 49 291-307.
34. Kilby, P., P. Prosser, P. Shaw. 2000. A comparison of traditional and constraint-based heuristic methods on vehicle routing problems with side constraints. Constraints 5 389-414.
35. Kindervater, G. A. P., M. W. P. Savelsbergh. 1997. Vehicle routing: Handling edge exchanges. Local Search in Combinatorial Optimization, Chapter 10. Wiley, Chichester, UK, 337-360.
36. Laporte, G. 1992. The vehicle routing problem: An overview of exact and approximate algorithms. Eur. J. Oper. Res. 59 345-358.
37. Laporte, G. 1997. Vehicle routing. M. Dell'Amico, F. Maffioli, S. Martello, eds. Annotated Bibliographies in Combinatorial Optimization. Wiley, Chichester, UK, 223-240.
38. Lin, S., B. W. Kernighan. 1973. An effective heuristic algorithm for the traveling-salesman problem. Oper. Res. 21 498-516.
39. Lübbecke, M., J. Desrosiers. 2005. Selected topics in column generation. Oper. Res. 53 1007-1023.
40. Martin, O., S. W. Otto, E. W. Felten. 1992. Large-step Markov chains for the TSP incorporating local search heuristics. Oper. Res. Lett. 11 219-224.
41. Ribeiro, C. C, P. Hansen, eds. 2002. Essays and Surveys in Metaheuristics. Operations Research/Computer Science Interfaces Series. Kluwer, Boston.
42. Røpke, S., D. Pisinger. 2006. A unified heuristic for a large class of vehicle routing problems with backhauls. Eur. J. Oper. Res. 171 750-775.
43. Shaw, P. 1998. Using constraint programming and local search methods to solve vehicle routing problems. Technical report, Department of Computer Science, University of Strathclyde, Glasgow, Scotland.
44. Solomon, M. M. 1987. Algorithms for the vehicle routing and scheduling problem with time window constraints. Oper. Res. 35 254-265.
45. Toth, P., D. Vigo, eds. 2002. The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications. SIAM, Philadelphia.
46. Toth, P., D. Vigo. 2003. The granular tabu search and its application to the vehicle-routing problem. INFORMS J. Comput. 15 333-346.
47. Voß, S., D. Woodruff. 2002. Optimization Software Class Libraries. Kluwer Academic Publishers, Boston.