کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
10347635 | 699252 | 2012 | 8 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem](/preview/png/10347635.png)
چکیده انگلیسی
The cumulative capacitated vehicle routing problem (CCVRP) is a variation of the classical capacitated vehicle routing problem in which the objective is the minimization of the sum of arrival times at customers, instead of the total routing cost. This paper presents an adaptive large neighborhood search heuristic for the CCVRP. This algorithm is applied to a set of benchmark instances and compared with two recently published memetic algorithms.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Operations Research - Volume 39, Issue 3, March 2012, Pages 728-735
Journal: Computers & Operations Research - Volume 39, Issue 3, March 2012, Pages 728-735
نویسندگان
Glaydston Mattos Ribeiro, Gilbert Laporte,