کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
480242 | 1446067 | 2012 | 14 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
An adaptive large neighborhood search heuristic for the Pollution-Routing Problem
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: An adaptive large neighborhood search heuristic for the Pollution-Routing Problem An adaptive large neighborhood search heuristic for the Pollution-Routing Problem](/preview/png/480242.png)
چکیده انگلیسی
The Pollution-Routing Problem (PRP) is a recently introduced extension of the classical Vehicle Routing Problem with Time Windows which consists of routing a number of vehicles to serve a set of customers, and determining their speed on each route segment so as to minimize a function comprising fuel, emission and driver costs. This paper presents an adaptive large neighborhood search for the PRP. Results of extensive computational experimentation confirm the efficiency of the algorithm.
► A heuristic algorithm is described for the Pollution-Routing Problem (PRP).
► A speed optimization algorithm is offered to minimize fuel and driver costs.
► The algorithm is highly effective in solving PRP instances of up to 200 nodes.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 223, Issue 2, 1 December 2012, Pages 346–359
Journal: European Journal of Operational Research - Volume 223, Issue 2, 1 December 2012, Pages 346–359
نویسندگان
Emrah Demir, Tolga Bektaş, Gilbert Laporte,