A branch-and-cut algorithm for the preemptive swapping problem

Networks

Volumn 59, Issue 4, 2012, Pages 387-399

  Bordenave, Charles ^a   Gendreau, Michel ^a   Laporte, G ^a  

^a HEC MONTRÉAL   (Canada)

Author keywords

branch and cut; precedence relationships; swapping problem; vehicle routing

Indexed keywords

ARBITRARY VERTICES; BRANCH-AND-CUT; BRANCH-AND-CUT ALGORITHMS; CARRYING OBJECTS; COMPLETE GRAPHS; COMPUTATIONAL RESULTS; MINIMUM COST; MIXED INTEGER LINEAR PROGRAM; PRECEDENCE RELATIONSHIPS; SUPPLY AND DEMAND; SWAPPING PROBLEM; UNIT CAPACITY;

ECONOMICS; INTEGER PROGRAMMING; NETWORKS (CIRCUITS); VEHICLE ROUTING;

ELECTRIC CURRENT CARRYING CAPACITY (CABLES);

EID: 84861823382     PISSN: 00283045     EISSN: 10970037     Source Type: Journal    
DOI: 10.1002/net.20447     Document Type: Article

References (21)

1. S. Anily, and, R. Hassin, The swapping problem, Networks 22 (1992), 419-433.
2. S. Anily, M. Gendreau, and, G. Laporte, The swapping problem on a line, SIAM J Comput 29 (1999), 327-335.
3. S. Anily, M. Gendreau, and, G. Laporte, The preemptive swapping problem on a tree, Networks, In press.
4. D. L. Applegate, R. E. Bixby, V. Chvátal, and, W. J. Cook, Concorde TSP solver, Available at:, 1995. Accessed on December 12, 2007.
5. N. Ascheuer, M. Jünger, and, G. Reinelt, A branch & cut algorithm for the asymmetric traveling salesman problem with precedence constraints, Comput Optim Appl 17 (2000), 61-84.
6. E. Balas, M. Fischetti, and, W. R. Pulleyblank, The precedence- constrained asymmetric traveling salesman polytope, Math Program 68 (1995), 241-265.
7. C. Bordenave, M. Gendreau, and, G. Laporte, A branch-and-cut algorithm for the non-preemptive swapping problem, Naval Res Logistics 56 (2009), 478-486.
8. C. Bordenave, M. Gendreau, and, G. Laporte, Heuristics for the mixed swapping problem, Comput Oper Res 37 (2010), 108-114.
9. V. Chvátal, Edmonds polytopes and weakly hamiltonian graphs, Math Program 5 (1973), 29-40.
10. M. Desrochers, and, G. Laporte, Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints, Oper Res Lett 10 (1991), 27-36.
11. L. F. Escudero, An inexact algorithm for the sequential ordering problem, Eur J Oper Res 37 (1988), 236-249.
12. A. Goldberg, and, R. Tarjan, A new approach to the maximum-flow problem, J ACM 35 (1988), 921-940.
13. M. Grötschel, and, M. W. Padberg, On the symmetric traveling salesman problem I: Inequalities, Math Program 16 (1979), 265-280. (Pubitemid 9461203)
14. J. Hao, and, J. B. Orlin, A faster algorithm for finding the minimum cut in a graph, Proc-3rd Ann ACM-SIAM Symp Discrete Algorithms, Orlando, Florida, 1992.
15. H. Hernández-Pérez, and, J. J. Salazar-González, A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery, Discrete Appl Math 145 (2004), 126-139.
16. H. Hernández-Pérez, and, J. J. Salazar-González, The one-commodity pickup-and-delivery traveling salesman problem: Inequalities and algorithms, Networks 50 (2007), 258-272.
17. A. N. Letchford, R. W. Eglese, and, J. Lysgaard, Multistars, partial multistars and the capacitated vehicle routing problem, Math Program 94 (2002), 21-40. (Pubitemid 44744729)
18. J. Lysgaard, CVRPSEP package, Available at, 2004. Accessed on December 12, 2007.
19. J. Lysgaard, A. N. Letchford, and, R. W. Eglese, A new branch-and-cut algorithm for the capacitated vehicle routing problem, Math Program 100 (2004), 423-445. (Pubitemid 40878095)
20. C. E. Miller, A. W. Tucker, and, R. A. Zemlin, Integer programming formulations and traveling salesman problems, J ACM 7 (1960), 326-329.
21. D. Naddef, and, S. Thienel, Efficient separation routines for the symmetric traveling salesman problem I: General tools and comb separation, Math Program 92 (2002), 237-255. (Pubitemid 44744768)