A Column Generation Algorithm for a Rich Vehicle-Routing Problem

References

• Amor H. B. Stabilization de l'algorithme de génération de colonnes. (2002) . Ph.D. thesis, École Polytechnique de MontréalGoogle Scholar
• Archetti C., Mansini R., Speranza M. Complexity and reducibility of the skip delivery problem. Transportation Sci. (2005) 39(2):182–187Link, Google Scholar
• Archetti C., Savelsbergh M., Speranza M. An optimization-based heuristic for the split delivery vehicle routing problem. (2006a) . Technical report, Department of Quantitative Methods, University of Brescia, Brescia, ItalyGoogle Scholar
• Archetti C., Savelsbergh M., Speranza M. Worst-case analysis for split delivery vehicle routing problems. Transportation Sci. (2006b) 40(2):226–234Link, Google Scholar
• Baldacci R., Battarra M., Vigo D., Golden B., Raghavan S., Wasil E. Routing a heterogeneous fleet of vehicles. The Vehicle Routing Problem: Latest Advances and New Challenges (2007) (Springer-Verlag, Heidelberg, Germany) Google Scholar
• Beasley J., Christofides N. An algorithm for the resource constrained shortest path problem. Networks (1989) 19:379–394Crossref, Google Scholar
• Ben Amor H., Desrosiers J., Valerio de Carvalho J. M. Dual-optimal inequalities for stabilized column generation. Oper. Res. (2006) 54(3):454–463Link, Google Scholar
• Bianchessi N., Righini G. Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery. Comput. Oper. Res. (2007) 34(2):578–594Crossref, Google Scholar
• Braeysy O., Gendreau M. Vehicle routing problem with time windows, part i: Route construction and local search algorithms. Transportation Sci. (2005a) 39(1):104–118Link, Google Scholar
• Braeysy O., Gendreau M. Vehicle routing problem with time windows, part ii: Metaheuristics. Transportation Sci. (2005b) 39(1):104–118Link, Google Scholar
• Dell'Amico M., Righini G., Salani M. A branch-and-price approach to the vehicle routing problem with simultaneous distribution and collection. Transportation Sci. (2006) 40(2):235–247Link, Google Scholar
• Desaulniers G., Desrosiers J., Solomon M.Column Generation (2005) (Springer, Heidelberg, Germany) GERAD 25th Anniversary SeriesCrossref, Google Scholar
• Desaulniers G., Lavigne J., Soumis F. Multi-depot vehicle scheduling problems with time windows and waiting costs. Eur. J. Oper. Res. (1998) 111(3):479–494Crossref, Google Scholar
• Desrochers G., Soumis F. A generalized permanent labelling algorithm for the shortest path problem with time windows. INFOR (1988) 26:191–212Google Scholar
• Dondo R., Cerdà J. A reactive MILP approach to the multidepot heterogeneous fleet vehicle routing problem with time windows. Internat. Trans. Oper. Res. (2006) 13(5):441–459Crossref, Google Scholar
• Dror M. Note on the complexity of the shortest path models for column generation in VRPTW. Oper. Res. (1994) 42:977–978Link, Google Scholar
• Dror M., Trudeau P. Savings by split delivery routing. Transportation Sci. (1989) 23:141–145Link, Google Scholar
• Dror M., Laporte G., Trudeau P. Vehicle routing with split deliveries. Discrete Appl. Math. (1994) 50:239–254Crossref, Google Scholar
• Dumas Y., Desrosiers J., Soumis F. The pickup and delivery problem with time windows. Eur. J. Oper. Res. (1991) 54(1):7–22Crossref, Google Scholar
• Elhallaoui I., Desaulniers G., Metrane A., Soumis F. Bi-dynamic constraint aggregation and subproblem reduction. Comput. Oper. Res. (2008) 35(5):1713–1724Crossref, Google Scholar
• Feillet D., Dejax P., Gendreau M., Gueguen C. An exact algorithm for the elementary shortest path with resource constraints: Application to some vehicle routing problems. Networks (2004) 44(3):216–229Crossref, Google Scholar
• Fukasawa R., Lysgaard J., de Aragao M., Reis M., Uchoa E., Werneck R. Robust branch-and-cut-and-price for the capacitated vehicle routing problem. Math. Programming (2006) 106(3):491–511Crossref, Google Scholar
• Golden B., Raghavan R., Wasil E.The Vehicle Routing Problem: Latest Advances and New Challenges (2008) (Springer, Heidelberg, Germany) Crossref, Google Scholar
• Hadjar A., Marcotte O., Soumis F. A branch-and-cut algorithm for the multiple depot vehicle scheduling problem. Oper. Res. (2006) 54:130–149Link, Google Scholar
• Ibaraki T., Kubo M., Masuda T., Uno T., Yagiura M. Effective local search algorithms for the vehicle routing problem with general time windows. Transportation Sci. (2005) 39(2):206–232Link, Google Scholar
• Koskosidis Y., Powell W., Solomon M. An optimization-based heuristic for vehicle routing and scheduling with soft time window constraints. Transportation Sci. (1992) 26:69–85Link, Google Scholar
• Liberatore F., Righini G., Salani M. A pricing algorithm for the vehicle routing problem with soft time windows. (2006) . Technical Report 100, Note del Polo, Università degli Studi di Milano, Milano, ItalyGoogle Scholar
• Ribeiro C., Soumis F. A column gneration approach to the multiple-depot vehicle scheduling problem. Oper. Res. (1994) 142:41–52Link, Google Scholar
• Righini G., Salani M. New dynamic programming algorithms for the resource-constrained elementary shortest path problem. Networks (2008) 51:155–170Crossref, Google Scholar
• Righini G., Salani M. Symmetry helps: Bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints. Discrete Optim. (2006) 3(3):255–273Crossref, Google Scholar
• Rousseau L., Gendreau M., Feillet D. Interior point stabilization for column generation. (2003) . Technical Report PO2003-39-X, Centre de Recherche sur les Transports, Montreal, CanadaGoogle Scholar
• Savelsbergh M., Sol M. The general pickup and delivery problem. Transportation Sci. (1995) 29:17–29Link, Google Scholar
• Solomon M. Vehicle routing and scheduling with time windows constraints: Models and algorithms. (1983) . Ph.D. thesis, University of Pennsylvania, PhiladelphiaGoogle Scholar
• Toth P., Vigo D.The Vehicle Routing Problem (2002) (Society for Industrial and Applied Mathematics (SIAM), Philadelphia) Crossref, Google Scholar
• Xu H., Chen Z., Rajagopal S., Arunapuram S. Solving a practical pickup and delivery problem. Transportation Sci. (2003) 37(3):347–364Link, Google Scholar
• Yepes V., Medina J. Economic heuristic optimization for heterogeneous fleet VRPHESTW. J. Transportation Engrg. (2006) 132(4):303–311Crossref, Google Scholar