کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4959071 | 1445467 | 2017 | 24 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
An iterated tabu search for the multi-compartment vehicle routing problem
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: An iterated tabu search for the multi-compartment vehicle routing problem An iterated tabu search for the multi-compartment vehicle routing problem](/preview/png/4959071.png)
چکیده انگلیسی
We study a variant of the vehicle routing problem that allows vehicles with multiple compartments. The need for multiple compartments frequently arises in practical applications when there are several products of different quality or type, that must be kept or handled separately. The resulting problem is called the multi-compartment vehicle routing problem (MCVRP). We propose a tabu search heuristic and embed it into a iterated local search to solve the MCVRP. In several experiments we analyze the performance of the iterated tabu search and compare it to results from the literature. We find that it consistently produces solutions that are better than existing heuristic algorithms.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Operations Research - Volume 81, May 2017, Pages 192-202
Journal: Computers & Operations Research - Volume 81, May 2017, Pages 192-202
نویسندگان
Paulo Vitor Silvestrin, Marcus Ritt,