Formulations and Benders decomposition algorithms for multidepot salesmen problems with load balancing

European Journal of Operational Research

Volumn 216, Issue 1, 2012, Pages 83-93

  Bektaş, Tolga ^a  

^a UNIVERSITY OF SOUTHAMPTON   (United Kingdom)

Author keywords

Benders decomposition; Fixed destination; Multicommodity network design; Multiple Traveling Salesman Problem

Indexed keywords

BENDERS DECOMPOSITION; BENDERS DECOMPOSITION ALGORITHM; BINARY VARIABLES; COMPUTATION TIME; COMPUTATIONAL EXPERIMENT; EXACT SOLUTION; FIXED DESTINATION; MULTI-COMMODITY FLOW; MULTICOMMODITY NETWORKS; MULTIPLE TRAVELING SALESMAN PROBLEMS; NEW MODEL; OPTIMAL SOLUTIONS; OPTIMIZATION CODE; PREDEFINED RANGE;

ALGORITHMS; OPTIMAL SYSTEMS; TRAVELING SALESMAN PROBLEM;

PROBLEM SOLVING;

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

References (27)

1. T. Bekta The multiple traveling salesman problem: An overview of formulations and solution procedures Omega: The International Journal of Management Science 34 2006 209 219
2. J.F. Benders Partitioning procedures for solving mixed-variables programming problems Numerische Mathematik 4 1962 38 252
3. J.-F. Cordeau, M. Gendreau, and G. Laporte A tabu search heuristic for periodic and multi-depot vehicle routing problems Networks 30 1997 105 119 (Pubitemid 127360996)
4. M. Desrochers, and G. Laporte Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints Operations Research Letters 10 1991 27 36
5. M. Fischetti, D. Salvagnin, and A. Zanette A note on the selection of Benders' cuts Mathematical Programming 124 1-2 2010 175 182
6. Gavish, B.; Graves, S.C.; 1978. The traveling salesman problem and related problems. Working Paper GR-078-78, Operations Research Center, Massachusetts Institute of Technology.
7. B.L. Golden, S. Raghavan, and E.A. Wasil The Vehicle Routing Problem: Latest Advances and Recent Challenges Operations Research Computer Science Interfaces 2008 Springer New York
8. C. Groër, B. Golden, and E. Wasil The balanced billing cycle vehicle routing problem Networks 54 4 2009 243 254
9. G. Gutin, and A.P. Punnen The Traveling Salesman Problem and Its Variations 2007 Springer Netherlands
10. N. Jozefowiez, F. Semet, and E.-G. Talbi Multi-objective vehicle routing problems European Journal of Operational Research 189 2008 293 309 (Pubitemid 351288509)
11. I. Kara, and T. Bekta Integer linear programming formulations of multiple salesmen problems and its variations European Journal of Operational Research 174 2006 1449 1458 (Pubitemid 44209143)
12. R.V. Kulkarni, and P.R. Bhave Integer programming formulations of vehicle routing problems European Journal of Operational Research 20 1985 58 67 (Pubitemid 15480455)
13. G. Laporte The traveling salesman problem: An overview of exact and approximate algorithms European Journal of Operational Research 59 1992 231 237
14. G. Laporte, Y. Nobert, and D. Arpin Optimal solutions to capacitated multidepot vehicle routing problems Congressus Numerantium 44 1984 283 292
15. G. Laporte, Y. Nobert, and S. Taillefer Solving a family of multi-depot vehicle routing and location-routing problems Transportation Science 22 1988 161 172 (Pubitemid 18654114)
16. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kann, and D.B. Shmoys The Travelling Salesman Problem 1985 Wiley Chichester
17. T.L. Magnanti, and R.T. Wong Accelerating Benders decomposition: Algorithmic enhancement and model selection criteria Operations Research 29 1981 464 484 (Pubitemid 12437576)
18. D. McDaniel, and M. Devine A modified Benders' partitioning algorithm for mixed integer programming Management Science 24 3 1977 312 319
19. C.E. Miller, A.W. Tucker, and R.A. Zemlin Integer programming formulations and traveling salesman problems Journal of Association for Computing Machinery 7 1960 326 329
20. G. Nagy, and S. Salhi Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries European Journal of Operational Research 162 2005 126 141
21. Oberlin, P.; Rathinam, S.; Darbha, S.; 2009. A transformation for a heterogeneous, multiple depot, multiple traveling salesman problem. In: Proceedings of the 2009 American Control Conference, St. Louis, MO, pp. 1292-1297.
22. Oberlin, P.; Rathinam, S.; Darbha, S.A, 2009. A transformation for a multiple depot, multiple traveling salesman problem. In: Proceedings of the 2009 American Control Conference, St. Louis, MO, pp. 2636-2641.
23. T. Öncan, K. Altinel, and G. Laporte A comparative analysis of several asymmetric traveling salesman problem formulations Computers and Operations Research 36 3 2009 637 654
24. Orman, A.; Williams, P.; 2005. A survey of different integer programming formulations of the travelling salesman problem. Working Paper LSEOR 04.67, London School of Economics and Political Sciences, London.
25. N. Papadakos Practical enhancements to the Magnanti-Wong method Operations Research Letters 36 2008 444 449
26. P. Toth, and D. Vigo The Vehicle Routing Problem SIAM Monographs on Discrete Mathematics and Applications 2002 SIAM Philedelphia
27. TSPLIB. A library of travelling salesman and related problem instances, 1997. Available at: (accessed 29.11.09).