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

In the swapping problem (SP), every vertex of a complete graph may supply and demand an object of a known type. A vehicle of unit capacity starting and ending its tour at an arbitrary vertex is available for carrying objects of given types between vertices. The SP consists of determining a minimum cost route that allows the vehicle to satisfy every supply and demand. This article investigates the preemptive version of the SP in which the objects are allowed to be dropped at temporary locations along the route. The problem is modeled as a mixed integer linear program which is solved by branch-and-cut. Computational results on random geometric instances containing up to 100 vertices and eight object types are reported. © 2011 Wiley Periodicals, Inc. NETWORKS, 2011 © 2012 Wiley Periodicals, Inc.

[1]  Juan José Salazar González,et al.  A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery , 2004, Discret. Appl. Math..

[2]  L. Escudero.  An inexact algorithm for the sequential ordering problem , 1988 .

[3]  Gilbert Laporte,et al.  Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints , 1991, Oper. Res. Lett..

[4]  Greg N. Frederickson,et al.  Preemptive Ensemble Motion Planning on a Tree , 1992, SIAM J. Comput..

[5]  Michel Gendreau,et al.  Heuristics for the mixed swapping problem , 2010, Comput. Oper. Res..

[6]  Michel Gendreau,et al.  A branch‐and‐cut algorithm for the nonpreemptive swapping problem , 2009 .

[7]  Norbert Ascheuer,et al.  Hamiltonian path problems in the on-line optimization of flexible manufacturing systems , 1996 .

[8]  James B. Orlin,et al.  A faster algorithm for finding the minimum cut in a graph , 1992, SODA '92.

[9]  Michel Gendreau,et al.  The preemptive swapping problem on a tree , 2011, Networks.

[10]  Michel Gendreau,et al.  A branch‐and‐cut algorithm for the nonpreemptive swapping problem , 2009 .

[11]  Andrew V. Goldberg,et al.  A new approach to the maximum flow problem , 1986, STOC '86.

[12]  Adam N. Letchford,et al.  Multistars, partial multistars and the capacitated vehicle routing problem , 2002, Math. Program..

[13]  Adam N. Letchford,et al.  A new branch-and-cut algorithm for the capacitated vehicle routing problem , 2004, Math. Program..

[14]  Refael Hassin,et al.  The swapping problem , 1992, Networks.

[15]  Michael Jünger,et al.  A Branch & Cut Algorithm for the Asymmetric Traveling Salesman Problem with Precedence Constraints , 2000, Comput. Optim. Appl..

[16]  Vasek Chvátal,et al.  Edmonds polytopes and weakly hamiltonian graphs , 1973, Math. Program..

[17]  M. Padberg,et al.  On the symmetric travelling salesman problem II , 1979 .

[18]  Egon Balas,et al.  The precedence-constrained asymmetric traveling salesman polytope , 1995, Math. Program..

[19]  K. Ruland,et al.  The pickup and delivery problem: Faces and branch-and-cut algorithm , 1997 .

[20]  Mikhail J. Atallah,et al.  Efficient Solutions to Some Transportation Problems with Applications to Minimizing Robot Arm Travel , 1988, SIAM J. Comput..

[21]  Gilbert Laporte,et al.  Static pickup and delivery problems: a classification scheme and survey , 2007 .

[22]  R. A. Zemlin,et al.  Integer Programming Formulation of Traveling Salesman Problems , 1960, JACM.

[23]  Juan-José Salazar-González,et al.  The one-commodity pickup-and-delivery traveling salesman problem: Inequalities and algorithms , 2007 .

[24]  Martin Grötschel,et al.  On Identifying in Polynomial Time Violated Subtour Elimination and Precedence Forcing Constraints for the Sequential Ordering Problem , 1990, Conference on Integer Programming and Combinatorial Optimization.

[25]  Denis Naddef,et al.  Efficient separation routines for the symmetric traveling salesman problem I: general tools and comb separation , 2002, Math. Program..

[26]  Martin Grötschel,et al.  A Cutting Plane Approach to the Sequential Ordering Problem (with Applications to Job Scheduling in Manufacturing) , 1993, SIAM J. Optim..

[27]  Juan José Salazar González,et al.  The one‐commodity pickup‐and‐delivery traveling salesman problem: Inequalities and algorithms , 2007, Networks.

[28]  Michel Gendreau,et al.  The Swapping Problem on a Line , 1999, SIAM J. Comput..

[29]  Jean-François Cordeau,et al.  A Branch-and-Cut Algorithm for the Dial-a-Ride Problem , 2006, Oper. Res..