Formulations and branch-and-cut algorithms for the generalized vehicle routing problem

Transportation Science

Volumn 45, Issue 3, 2011, Pages 299-316

  Bekta̧s, Tolga ^a   Erdǒgan, Günȩs ^b   Røpke, Stefan ^c  

^a UNIVERSITY OF SOUTHAMPTON   (United Kingdom)

^b OZYEGIN UNIVERSITY   (Turkey)

^c TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

Author keywords

Branch and cut; Generalized vehicle routing; Integer programming

Indexed keywords

ROUTING ALGORITHMS; VEHICLE ROUTING; VEHICLES;

BRANCH AND CUT; BRANCH-AND-CUT ALGORITHMS; CAPACITATED VEHICLES; COMPUTATIONAL RESULTS; GENERALIZED VEHICLE ROUTING PROBLEMS; INTEGER LINEAR PROGRAMMING FORMULATION; MULTI-COMMODITY FLOW;

INTEGER PROGRAMMING;

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

References (25)

1. Araque, J. R., G. Kudva, T. L. Morin, J. F. Pekny. 1994. A branch and cut algorithm for vehicle routing problems. Ann. Oper. Res. 50(1) 37-59.
2. Asef-Vaziri, A., G. Laporte. 2005. Loop based facility planning and material handling. Eur. J. Oper. Res. 164(1) 1-11.
3. Asef-Vaziri, A., G. Laporte, C. Sriskandarajah. 1996. Some applications of the generalized traveling salesman problem. J. Oper. Res. Soc. 47(12) 1461-1467. (Pubitemid 126604601)
4. Baldacci, R., E. Bartolini, G. Laporte. 2010. Some applications of the generalized vehicle routing problem. J. Oper. Res. Soc. 61(7) 1072-1077.
5. Baldacci, R., P. Toth, D. Vigo. 2007. Recent advances in vehicle routing exact algorithms. 4OR: A Quart. J. Oper. Res. 5(4) 269-298.
6. Bautista, J., E. Fernández, J. Pereira. 2008. Solving an urban waste collection problem using ants heuristics. Comput. Oper. Res. 35(9) 3020-3033. (Pubitemid 351186815)
7. Cordeau, J.-F., G. Laporte. 2006. Modeling and optimization of vehicle routing and arc routing problems. G. Appa, L. Pitsoulis, H. P. Williams, eds. Handbook on Modelling for Discrete Optimization (International Series in Operations Research and Management Science). Vol. 88. Springer, New York, 151-191.
8. Cordeau, J.-F., G. Laporte. M. W. P. Savelsbergh, D. Vigo. 2007. Vehicle routing. C. Barnhart, G. Laporte, eds. Handbooks in Operations Research and Management Science: Transportation. Vol. 14. Elsevier, Amsterdam, 367-428.
9. Feillet, D., P. Dejax, M. Gendreau. 2005. Traveling salesman problems with profits. Transportation Sci. 39(2) 188-205. (Pubitemid 40748589)
10. Fischetti, M., J. J. S. Gonzalez, P. Toth. 1995. The symmetric generalized traveling salesman polytope. Networks 26(2) 113-123.
11. Fischetti, M., J. J. S. Gonzalez, P. Toth. 1997. A branch-and-cut algorithm for the symmetric generalized traveling salesman problem. Oper. Res. 45(3) 378-394. (Pubitemid 127684716)
12. Gavish, B., S. C. Graves. 1978. The traveling salesman problem and related problems. Technical report OR 078-78, Massachusetts Institute of Technology, Cambridge, MA.
13. Ghiani, G., G. Improta. 2000. An efficient transformation of the generalized vehicle routing problem. Eur. J. Oper. Res. 122(1) 11-17. (Pubitemid 30541668)
14. Gouveia, L. 1995. A result on projection for the vehicle routing problem. Eur. J. Oper. Res. 85(3) 610-624.
15. Kara, I., T. Bekta̧s. 2003. Integer linear programming formulation of the generalized vehicle routing problem. Presented at the EURO/INFORMS Joint Internat. Meeting, Istanbul, July 6-10, Turkey.
16. Kara, I., G. Laporte, T. Bekta̧s. 2003. A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for the capacitated vehicle routing problem. Eur. J. Oper. Res. 158(3) 793-795.
17. Kirkpatrick, S. Jr., C. D. Gelatt, M. P. Vecchi. 1983. Optimization by simulated annealing. Science 220(4598) 671-680.
18. Laporte, G. 2007. What you should know about the vehicle routing problem. Naval Res. Logist. 54(8) 811-819. (Pubitemid 350189025)
19. Letchford, A. N., J. J. S. Gonzalez. 2006. Projection results for vehicle routing. Math. Programming 105(2-3) 251-274. (Pubitemid 41788320)
20. Lysgaard, J. 2003. CVRPSEP: A package of separation routines for the capacitated vehicle routing problem. Working paper 03-04, Department of Management Science and Logistics, Aarhus School of Business, Denmark.
21. Martello, S., P. Toth. 1990. Knapsack Problems: Algorithms and Computer Implementations. John Wiley, Chichester, UK.
22. Miller, C. E., A. W. Tucker, R. A. Zemlin. 1960. Integer programming formulations and traveling salesman problems. J. Assoc. Comput. Machinery 7(4) 326-329.
23. Pisinger, D., S. Røpke. 2007. A general heuristic for vehicle routing problems. Comput. Oper. Res. 34(8) 2403-2435. (Pubitemid 46073431)
24. Røpke, S., D. Pisinger. 2006. An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transportation Sci. 40(4) 455-472. (Pubitemid 44746135)
25. Shaw, P. 1998. Using constraint programming and local search methods to solve vehicle routing problems. M. Maher, J.-F. Puget, eds. Principles and Practice of Constraint Programming- CP98 (Lecture Notes in Computer Science). Vol. 1520. Springer- Verlag, New York, 417-431. (Pubitemid 128151602)