A Branch-and-Price Approach to the Vehicle Routing Problem with Simultaneous Distribution and Collection

References

• Ahuja R. K., Magnanti T. L., Orlin J. B.Network Flows (1993) (Prentice Hall, Englewood Cliffs, NJ) Google Scholar
• Angelelli E., Mansini R., Klose A., Speranza M. G., Van Wassenhove L. N. The vehicle routing problem with time windows and simultaneous pick-up and delivery. Lecture Notes in Economics and Mathematical Systems (2002) (Springer, Germany) 249–267Google Scholar
• Balas E., Zemel E. An algorithm for large zero-one knapsack problems. Oper. Res. (1980) 20:1130–1154Link, Google Scholar
• Beasley J. E., Christofides N. An algorithm for the resource constrained shortest path problem. Networks (1989) 19:379–394Crossref, Google Scholar
• Bianchessi N., Righini G. Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery. Comput. Oper. Res. (2006) . ForthcomingGoogle Scholar
• Casco D. O., Golden B. L., Wasil E. A., Golden B. L., Assad A. A. Vehicle routing with backhauls: Models, algorithms and case studies. Vehicle Routing: Methods and Studies (1988) (Elsevier Science)127–147Google Scholar
• Christofides N., Mingozzi A., Toth P. State-space relaxation procedures for the computation of bounds to routing problems. Networks (1981) 11:145–164Crossref, Google Scholar
• Desaulniers G., Desrosiers J., Ioachim I., Solomon M. M., Soumis F., Villeneuve D., Crainic T. G., Laporte G. A unified framework for deterministic time constrained vehicle routing and crew scheduling problems. Fleet Management and Logistics (1998) (Kluwer, Boston, MA) 57–93Crossref, Google Scholar
• Desrochers M., Desrosiers J., Solomon M. A new optimization algorithm for the vehicle routing problem with time windows. Oper. Res. (1992) 40:342–354Link, Google Scholar
• Desrosiers J., Dumas Y., Solomon M., Soumis F., Ball M. O., Magnanti T. L., Monma C. L., Nemhauser G. L. Time constrained routing and scheduling. Network Routing. Handbooks in Operations Research and Management Science (1995) Crossref, Google Scholar
• Dethloff J. Vehicle routing and reverse logistics: The vehicle routing problem with simultaneous delivery and pick-up. OR Spektrum (2001) 23:79–96Crossref, Google Scholar
• Dror M. Note on the complexity of the shortest path models for column generation in VRPTW. Oper. Res. (1992) 42(5):977–978Link, Google Scholar
• du Merle O., Villeneuve D., Desrosiers J., Hansen P. Stabilized column generation. Discrete Math. (1999) 194:229–237Crossref, Google Scholar
• Farley A. A. A note on bounding a class of linear programming problems, including cutting stock problems. Oper. Res. (1990) 38:922–923Link, Google Scholar
• Feillet D., Dejax P., Gendreau M., Guegen C. An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems. Networks (2004) 44:216–229Google Scholar
• Garey M. R., Johnson D. S.Computers and Intractability: A Guide to the Theory of NP-Completeness (1979) (Freeman & Co., New York) Google Scholar
• Gélinas S., Desrochers M., Desrosiers J., Solomon M. M. A new branching strategy for time constrained routing problems with application to backhauling. (1992) (Cahiers du GERAD G-92-13, HEC Montréal, Canada) Google Scholar
• Goetschalckx M., Jacobs-Blecha C. The vehicle routing problem with backhauls. Eur. J. Oper. Res. (1989) 42:39–51Crossref, Google Scholar
• Golden B., Baker E., Alfaro J., Schaffer J., Hammesfahr R. D. The vehicle routing problem with backhauling: Two approaches. Proc. 21st Annual Meeting S.E.TIMS (1985) . Myrtle Beach, SC, 90–92Google Scholar
• Irnich S., Villeneuve D. The shortest path problem with resource constraints and k-cycle elimination for k ≥ 3. (2003) (Cahiers du GERAD G-2003-55, HEC Montréal, Canada) Google Scholar
• Mingozzi A., Giorgi S., Baldacci R. An exact method for the vehicle routing problem with backhauls. Transportation Sci. (1999) 33:315–329Link, Google Scholar
• Rousseau L. M., Gendreau M., Feillet D. Interior point stabilization for column generation. (2003) . Tecnical report, LIA—Université d’Avignon, Avignon, FranceGoogle Scholar
• Toth P., Vigo D. An exact algorithm for the vehicle routing problem with backhauls. Transportation Sci. (1997) 31:372–385Link, Google Scholar
• Toth P., Vigo D. A heuristic algorithm for the symmetric and asymmetric vehicle routing problem with backhauls. Eur. J. Oper. Res. (1999) 113:528–543Crossref, Google Scholar
• Toth P., Vigo D. SIAM Monographs on Discrete Mathematics and Applications. The Vehicle Routing Problem (2002) (Philadelphia, PA)Crossref, Google Scholar
• Vanderbeck F., Wolsey L. A. An exact algorithm for IP column generation. Oper. Res. Lett. (1996) 19:151–159Crossref, Google Scholar
• Wade A. C., Salhi S. An investigation into a new class of vehicle routing problem with backhauls. Omega (2002) 30(6):479–487Crossref, Google Scholar
• Wolsey L.Integer Programming (1998) (Wiley-Interscience)Google Scholar