A branch-and-cut algorithm for solving the non-preemptive capacitated swapping problem

Name: A branch-and-cut algorithm for solving the non-preemptive capacitated swapping problem
Author: Erdoğan, Güneş, Cordeau, J.-F., Laporte, G.

İsim	A branch-and-cut algorithm for solving the non-preemptive capacitated swapping problem
Yazar	Erdoğan, Güneş, Cordeau, J.-F., Laporte, G.
Basım Tarihi:	2010-08-06
Basım Yeri	- Elsevier
Konu	Swapping problem, Robot arm travel, Non-preemptive, Capacitated, Mathematical programming, Branch-and-cut
Tür	Süreli Yayın
Dil	İngilizce
Dijital	Evet
Yazma	Hayır
Kütüphane:	Özyeğin Üniversitesi
Demirbaş Numarası	0166-218X
Kayıt Numarası	253c0600-4d5c-4933-99a8-18c69bd6a4c9
Lokasyon	Industrial Engineering
Tarih	2010-08-06
Notlar	Due to copyright restrictions, the access to the full text of this article is only available via subscription.
Örnek Metin	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

Kaynağa git Özyeğin Üniversitesi

Aramaya Dön

Özyeğin Üniversitesi

Kaynağa git

A branch-and-cut algorithm for solving the non-preemptive capacitated swapping problem

Yazar Erdoğan, Güneş, Cordeau, J.-F., Laporte, G.

Basım Tarihi 2010-08-06

Basım Yeri - Elsevier

Konu Swapping problem, Robot arm travel, Non-preemptive, Capacitated, Mathematical programming, Branch-and-cut

Tür Süreli Yayın

Dil İngilizce

Dijital Evet

Yazma Hayır

Kütüphane Özyeğin Üniversitesi

Demirbaş Numarası 0166-218X

Kayıt Numarası 253c0600-4d5c-4933-99a8-18c69bd6a4c9

Lokasyon Industrial Engineering

Tarih 2010-08-06

Notlar Due to copyright restrictions, the access to the full text of this article is only available via subscription.

Örnek Metin 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