A branch-and-cut algorithm for the nonpreemptive Swapping Problem

Naval Research Logistics

Volumn 56, Issue 5, 2009, Pages 478-486

  Bordenave, Charles ^a   Gendreau, Michel ^a   Laporte, Gilbert ^a,b  

^a UNIVERSITÉ DE MONTRÉAL   (Canada)

^b HEC MONTRÉAL   (Canada)

Author keywords

Branch and cut; Swapping Problem; Vehicle routing

Indexed keywords

ARBITRARY VERTICES; BRANCH-AND-CUT; BRANCH-AND-CUT ALGORITHMS; COMPLETE GRAPHS; COMPUTATIONAL RESULTS; FINAL STATE; INITIAL STATE; NON-PREEMPTIVE; OPTIMAL SOLUTIONS; RANDOM INSTANCE; SWAPPING PROBLEM; UNIT CAPACITY;

GRAPH THEORY; VEHICLES;

VEHICLE ROUTING;

EID: 67749113349     PISSN: 0894069X     EISSN: 15206750     Source Type: Journal    
DOI: 10.1002/nav.20361     Document Type: Article

References (16)

1. S. Anily and J. Bramel, Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries, Naval Res Log 46(1999), 654-670.
2. S. Anily, M. Gendreau, and G. Laporte, Theswapping problem on a line, SIAM J Comput 29(1999), 327-335.
3. S. Anily and R. Hassin, The swapping problem, Networks 22(1992), 419-433.
4. M. J. Atallah and S. R. Kosaraju, Efficient solutions to some transportation problems with applications to minimizing robot arm travel, SIAM J Comput 17(1988), 849-869.
5. M. O. Ball and M. J. Magazine, Sequencing of insertions in printed circuit board assembly, Oper Res 36(1988), 192-201.
6. P. Chalasani and R. Motwani, Approximating capacitated routing and delivery problems, SIAM J Comput 28(1999), 2133-2149.
7. V. Chvátal, Edmonds polytopes and weakly hamiltonian graphs, Math Progr 5(1973), 29-40.
8. G. Cornuéjols, J. Fonlupt, and D. Naddef, The traveling salesman problem on a graph and some related integer polyhedra, Math Progr 33(1985), 1-27.
9. M. Grötschel and M. W. Padberg, On the symmetric traveling salesman problem I: Inequalities, Math Progr 16(1979), 265-280.
10. J. Hao and J. B. Orlin, "A faster algorithm for finding the minimum cut in a graph," In Proceedings of the Third Annual ACM-SIAM Symposium on Discrete Algorithms, Orlando, Florida, 1992.
11. H. Hernández-Pérez and J. J. Salazar-Gonzalez, A branch-andcut algorithm foratraveling salesman problem with pickup and delivery, Discr Appl Math 145(2004), 126-139.
12. H. Hernández-Pérez and J. J. Salazar-González, The onecommodity pickup-and-delivery traveling salesman problem: Inequalities and algorithms, Networks 50(2007), 258-272.
13. A. N. Letchford, R. W. Eglese, and J. Lysgaard, Multistars, partial multistars and the capacitated vehicle routing problem, Math Progr 94(2002), 21-40.
14. J. Lysgaard, CVRPSEP package (2004, Available at: http://www.hha.dk/~lys/ ). Accessed March 19, 2008.
15. J. Lysgaard, A. N. Letchford, and R. W. Eglese, A new branchand-cut algorithm for the capacitated vehicle routing problem, Math Progr 100(2004), 423-445.
16. D. Naddef and S. Thienel, Efficient separation routines for the symmetric traveling salesman problem I: General tools and comb separation, Math Progr 92(2002), 237-255.