Author
Erdoğan, Güneş, Cordeau, J.-F., Laporte, G.
Publication Date
2010-08-06
Publication Place
-
Elsevier
Subject
Swapping problem, Robot arm travel, Non-preemptive, Capacitated, Mathematical programming, Branch-and-cut
Type
Periodical
Language
English
Digital
Yes
Manuscript
No
Library
Özyeğin University
Library Asset ID
0166-218X
Record ID
253c0600-4d5c-4933-99a8-18c69bd6a4c9
Library Location
Industrial Engineering
Date
2010-08-06
Notes
Due to copyright restrictions, the access to the full text of this article is only available via subscription.
Sample Text
This paper models and solves a capacitated version of the Non-Preemptive Swapping Problem. This problem is defined on a complete digraph , 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 abranch-and-cut algorithm, and extensive computational experiments are performed on instances adapted from TSPLIB.
DOI
10.1016/j.dam.2010.05.025
Cilt
158
