A branch-and-cut algorithm for the non-preemptive capacitated swapping problem
A branch-and-cut algorithm for the non-preemptive capacitated swapping problem
This paper models and solves a capacitated version of the Non-Preemptive Swapping Problem. This problem is defined on a complete digraph G=(V,A), at every vertex of which there may be one unit of supply of an item, one unit of demand, or both. The objective is to determine a minimum cost capacitated vehicle route for transporting the items in such a way that all demands are satisfied. The vehicle can carry more than one item at a time. Three mathematical programming formulations of the problem are provided. Several classes of valid inequalities are derived and incorporated within a branch-and-cut algorithm, and extensive computational experiments are performed on instances adapted from TSPLIB
swapping problem, robot arm travel, non-preemptive, capacitated, mathematical programming, branch-and-cut
1599-1614
Erdogan, Gunes
468310a1-5c36-4c3d-8b39-079bd621b34b
Cordeau, Jean-Francois
e9482d91-4f26-49c0-b9e1-16ffd8f0c665
Laporte, Gilbert
b8210b8f-e942-4c5c-98b1-b55bd916aa70
6 August 2010
Erdogan, Gunes
468310a1-5c36-4c3d-8b39-079bd621b34b
Cordeau, Jean-Francois
e9482d91-4f26-49c0-b9e1-16ffd8f0c665
Laporte, Gilbert
b8210b8f-e942-4c5c-98b1-b55bd916aa70
Erdogan, Gunes, Cordeau, Jean-Francois and Laporte, Gilbert
(2010)
A branch-and-cut algorithm for the non-preemptive capacitated swapping problem.
Discrete Applied Mathematics, 158 (15), .
(doi:10.1016/j.dam.2010.05.025).
Abstract
This paper models and solves a capacitated version of the Non-Preemptive Swapping Problem. This problem is defined on a complete digraph G=(V,A), at every vertex of which there may be one unit of supply of an item, one unit of demand, or both. The objective is to determine a minimum cost capacitated vehicle route for transporting the items in such a way that all demands are satisfied. The vehicle can carry more than one item at a time. Three mathematical programming formulations of the problem are provided. Several classes of valid inequalities are derived and incorporated within a branch-and-cut algorithm, and extensive computational experiments are performed on instances adapted from TSPLIB
This record has no associated files available for download.
More information
e-pub ahead of print date: 29 June 2010
Published date: 6 August 2010
Keywords:
swapping problem, robot arm travel, non-preemptive, capacitated, mathematical programming, branch-and-cut
Organisations:
Centre of Excellence for International Banking, Finance & Accounting
Identifiers
Local EPrints ID: 204823
URI: http://eprints.soton.ac.uk/id/eprint/204823
ISSN: 0166-218X
PURE UUID: a9905c12-e3c2-4806-af8d-cdc50686681e
Catalogue record
Date deposited: 02 Dec 2011 09:34
Last modified: 14 Mar 2024 04:33
Export record
Altmetrics
Contributors
Author:
Gunes Erdogan
Author:
Jean-Francois Cordeau
Author:
Gilbert Laporte
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics