A branch-and-cut algorithm for solving the Non-Preemptive Capacitated Swapping Problem

Discrete Applied Mathematics

Volumn 158, Issue 15, 2010, Pages 1599-1614

  Erdoǧan, Güneş ^a   Cordeau, Jean François ^b   Laporte, Gilbert ^b  

^a OZYEGIN UNIVERSITY   (Turkey)

^b HEC MONTRÉAL   (Canada)

Author keywords

Branch and cut; Capacitated; Mathematical programming; Non preemptive; Robot arm travel; Swapping problem

Indexed keywords

BRANCH-AND-CUT; BRANCH-AND-CUT ALGORITHMS; CAPACITATED VEHICLES; COMPLETE DIGRAPH; COMPUTATIONAL EXPERIMENT; MINIMUM COST; NON-PREEMPTIVE; PAPER MODELS; ROBOT ARMS; VALID INEQUALITY;

GRAPH THEORY; ROBOT PROGRAMMING; ROBOTIC ARMS;

MATHEMATICAL PROGRAMMING;

EID: 77955421549     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2010.05.025     Document Type: Article

References (17)

1. S. Anily, M. Gendreau, and G. Laporte The swapping problem on a line SIAM Journal on Computing 29 1999 327 335
2. S. Anily, M. Gendreau, G. Laporte, The preemptive swapping problem on a tree, Networks (2011) (forthcoming).
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 Journal on Computing 17 1988 849 869
5. C. Bordenave, M. Gendreau, G. Laporte, A branch-and-cut algorithm for the preemptive swapping problem, (2008) (submitted for publication).
6. C. Bordenave, M. Gendreau, and G. Laporte A branch-and-cut algorithm for the non-preemptive swapping problem Naval Research Logistics 56 2009 478 486
7. C. Bordenave, M. Gendreau, and G. Laporte Heuristics for the mixed swapping problem Computers & Operations Research 37 2010 108 114
8. P. Chalasani, and R. Motwani Approximating capacitated routing and delivery problems SIAM Journal on Computing 15 1993 29 60
9. G. Erdoǧan, J.-F. Cordeau, G. Laporte, A branch-and-cut algorithm for the non-preemptive capacitated swapping problem, Technical Report, CIRRELT-2008-44, CIRRELT, Montreal, Canada, 2008.
10. L.F. Escudero An inexact algorithm for the sequential ordering problem European Journal of Operational Research 37 1988 236 249
11. G.N. Frederickson, and D.J. Guan Preemptive ensemble motion planning on a tree SIAM Journal on Computing 21 1992 1130 1152
12. G.N. Frederickson, and D.J. Guan Nonpreemptive ensemble motion planning on a tree Journal of Algorithms 15 1993 29 60
13. G.N. Frederickson, M.S. Hecht, and C.E. Kim Approximation algorithms for some routing problems SIAM Journal on Computing 7 1978 178 193
14. H. Hernández-Pérez, and J.-J. Salazar-Gonzlez A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery Discrete Applied Mathematics 145 2004 126 139
15. H. Hernández-Pérez, and J.-J. Salazar-Gonzlez The one-commodity pickup-and-delivery traveling salesman problem: inequalities and algorithms Networks 50 2007 258 272
16. H. Hernández-Pérez, and J.-J. Salazar-Gonzlez The multi-commodity one-to-one pickup-and-delivery traveling salesman problem European Journal of Operational Research 196 2009 987 995
17. H.D. Sherali Equivalent weights for lexicographic multi-objective programs: characterizations and computations European Journal of Operational Research 11 1982 367 379