کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
476249 | 699432 | 2008 | 17 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
A generalization of the traditional vehicle routing problem (VRP) is studied in this paper. Each customer may order several products, the vehicles are identical and have several compartments, each compartment being dedicated to one product. The demand of each customer for a product must be entirely delivered by one single vehicle. However, the different products required by a customer may be brought by several vehicles. Two algorithms to solve this problem are proposed: a memetic algorithm with a post-optimization phase based on path relinking, and a tabu search method. These algorithms are evaluated by adding compartments to classical VRP instances.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Operations Research - Volume 35, Issue 5, May 2008, Pages 1725–1741
Journal: Computers & Operations Research - Volume 35, Issue 5, May 2008, Pages 1725–1741
نویسندگان
Abdellah El Fallahi, Christian Prins, Roberto Wolfler Calvo,