کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
421273 | 684176 | 2010 | 16 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A branch-and-cut algorithm for solving the Non-Preemptive Capacitated Swapping Problem
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله

چکیده انگلیسی
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)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.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Applied Mathematics - Volume 158, Issue 15, 6 August 2010, Pages 1599–1614
Journal: Discrete Applied Mathematics - Volume 158, Issue 15, 6 August 2010, Pages 1599–1614
نویسندگان
Güneş Erdoğan, Jean-François Cordeau, Gilbert Laporte,