کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4959337 | 1445946 | 2017 | 44 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Lifted polynomial size formulations for the homogeneous and heterogeneous vehicle routing problems
ترجمه فارسی عنوان
فرمولهای چندجملهای بزرگ شده برای مسائل مسیریابی همگن و ناهمگن خودرو
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
چکیده انگلیسی
We propose compact formulations for the symmetric and asymmetric capacitated vehicle routing problems. These formulations are obtained by lifting, using the Reformulation-Linearization Technique, a novel polynomial size ordered path-based formulation. We show that the strongest proposed formulation is equivalent to the strongest multi-commodity flow formulation presented so far. In addition, we propose polynomial size valid inequalities that aim at further tightening the proposed formulations. Also, the tightest formulation is extended to model the fleet size and mix vehicle routing problem with fixed costs. We show that the new derived model is not comparable with a state-of-the-art polynomial length formulation. We present the results of computational experiments that demonstrate the tightness of the proposed formulations and the impact of the valid inequalities.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 263, Issue 3, 16 December 2017, Pages 755-767
Journal: European Journal of Operational Research - Volume 263, Issue 3, 16 December 2017, Pages 755-767
نویسندگان
Valeria Leggieri, Mohamed Haouari,