Stronger multi-commodity flow formulations of the Capacitated Vehicle Routing Problem

European Journal of Operational Research

Volumn 244, Issue 3, 2015, Pages 730-738

  Letchford, Adam N ^a   Salazar González, Juan José ^b  

^a LANCASTER UNIVERSITY   (United Kingdom)

^b UNIVERSIDAD DE LA LAGUNA   (Spain)

Author keywords

Integer programming; Multi commodity flows; Vehicle routing

Indexed keywords

COMBINATORIAL OPTIMIZATION; NP-HARD; POLYNOMIAL APPROXIMATION; VEHICLE ROUTING; VEHICLES;

CAPACITATED VEHICLE ROUTING PROBLEM; COMBINATORIAL OPTIMIZATION PROBLEMS; COMPUTATIONAL RESULTS; CONTINUOUS RELAXATION; INTEGER PROGRAMMING FORMULATIONS; MULTI-COMMODITY FLOW; SET PARTITIONING; STRONGLY NP-HARD;

INTEGER PROGRAMMING;

EID: 84926415712     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2015.02.028     Document Type: Article

References (27)

1. Agarwal Y., Mathur K., and Salkin H.M. A set-partitioning-based exact algorithm for the vehicle routing problem Networks 19 1989 731 749
2. Baldacci R., Christofides N., and Mingozzi A. An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts Mathematical Programming 115 2008 351 385
3. Baldacci R., Hadjiconstantinou E., and Mingozzi A. An exact algorithm for the capacitated vehicle routing problem based on a two-commodity network flow formulation Operation Research 52 2004 723 738
4. Balinski M.L., and Quandt R.E. On an integer program for a delivery problem Operation Research 12 1964 300 304
5. Ball M., Magnanti T., Monma C., and Nemhauser G. Handbooks in operations research and management science: Vol. 8. Network routing 1995 North Holland Amsterdam
6. Bellman R.E. Dynamic programming 1957 Princeton University Press. Princeton, NJ
7. Dantzig G.B., and Ramser R.H. The truck dispatching problem Management Science 6 1959 80 91
8. Desaulniers G., Desrosiers J., Erdmann A., Solomon M.M., and Soumis F. VRP with pickup and delivery P. Toth, D. Vigo, The vehicle routing problem 2001 SIAM.
9. Foster B.A., and Ryan D.M. An integer programming approach to the vehicle scheduling problem Operational Research Quarterly 27 1976 367 384
10. Fukasawa R., Lysgaard J., de Aragão M.P., Reis M., Uchoa E., and Werneck R.F. Robust branch-and-cut-and-price for the capacitated vehicle routing problem Mathematical Programming 106 2006 491 511
11. Garvin W.W., Crandall H.W., John J.B., and Spellman R.A. Applications of linear programming in the oil industry Management Science 3 1957 407 430
12. Gavish, B. (1984). The delivery problem: New cutting planes procedures. In Presented at the TIMS XXVI conference, Copenhagen.
13. Gavish B., and Graves S. The traveling salesman problem and related problems 1979 Graduate School of Management, University of Rochester New York Working Paper
14. Golden B., Raghavan S., and Wasil E. The vehicle routing problem: Latest advances and new challenges 2008 Springer New York
15. Gouveia L. A result on projection for the vehicle routing problem European Journal of Operational Research 85 1995 610 624
16. Grötschel M., Lovász L., and Schrijver A. The ellipsoid method and its consequences in combinatorial optimization Combinatorica 1 1981 169 197
17. Hernández-Pérez H., and Salazar-González J.J. The multi-commodity one-to-one pickup-and-delivery traveling salesman problem European Journal of Operational Research 196 2009 987 995
18. Hoffman A.J. Some recent applications of the theory of linear inequalities to extremal combinatorial analysis R. Bellman, M. Hall, Proceedings of symposia in applied mathematics: Vol. X. Combinatorial analysis 1960 AMS Providence, RI
19. Kara I., Kara B.Y., and Yetis M.K. Energy minimizing vehicle routing problem A. Dress, Y. Xu, B. Zhu, Lecture notes in computer science: Vol. 4616. Combinatorial optimization and applications 2007 Springer Berlin-Heidelberg 62 71
20. Laporte G., and Nobert Y. A branch and bound algorithm for the capacitated vehicle routing problem OR Spektrum 5 1983 77 85
21. Letchford A.N., Eglese R.W., and Lysgaard J. Multistars, partial multistars and the capacitated vehicle routing problem Mathematical Programming 94 2002 21 40
22. Letchford A.N., and Salazar-González J.J. Projection results for vehicle routing Mathematical Programming 105 2006 251 274
23. Lysgaard J., Letchford A.N., and Eglese R.W. A new branch-and-cut algorithm for the capacitated vehicle routing problem Mathematical Programming 100 2004 423 445
24. Martinelli R., Pecin D., and Poggi M. Efficient elementary and restricted non-elementary route pricing European Journal of Operational Research 239 2014 102 111
25. Naddef D., and Rinaldi G. Branch-and-cut algorithms for the capacitated VRP P. Toth, D. Vigo, The vehicle routing problem 2001 SIAM.
26. Papernov B.A. On existence of multicommodity flows (in Russian) A.A. Fridman, Studies in discrete optimization 1976 Nauka. Moscow
27. Toth P., andVigo D. The vehicle routing problem 2001 SIAM