A branch-and-price approach to the vehicle routing problem with simultaneous distribution and collection

Transportation Science

Volumn 40, Issue 2, 2006, Pages 235-247

  Dell'Amico, Mauro ^a   Righini, Giovanni ^b   Salani, Matteo ^b  

^a UNIVERSITY OF MODENA AND REGGIO EMILIA   (Italy)

^b UNIVERSITY OF MILAN   (Italy)

Author keywords

Branch and price; Dynamic programming; Reverse logistics; Vehicle routing

Indexed keywords

BENCHMARKING; DYNAMIC PROGRAMMING; OPTIMIZATION; PROBLEM SOLVING; THEOREM PROVING; TRANSPORTATION; TRANSPORTATION ROUTES;

BRANCH AND PRICE; BRANCHING STRATEGIES; REVERSE LOGISTICS; VEHICLE ROUTING;

OPERATIONS RESEARCH;

EID: 33646750831     PISSN: 00411655     EISSN: 15265447     Source Type: Journal    
DOI: 10.1287/trsc.1050.0118     Document Type: Article

References (28)

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