کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
476884 | 1446083 | 2012 | 6 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints](/preview/png/476884.png)
چکیده انگلیسی
This paper provides a review of the recent developments that had a major impact on the current state-of-the-art exact algorithms for the vehicle routing problem (VRP). The paper reviews mathematical formulations, relaxations and recent exact methods for two of the most important variants of the VRP: the capacitated VRP (CVRP) and the VRP with time windows (VRPTW). The paper also reports a comparison of the computational performances of the different exact algorithms for the CVRP and VRPTW.
► This paper reviews developments on algorithms for the vehicle routing problem (VRP).
► We consider two variants: the capacitated VRP and the VRP with time windows.
► We report a comparison of the computational performances of the exact algorithms.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 218, Issue 1, 1 April 2012, Pages 1–6
Journal: European Journal of Operational Research - Volume 218, Issue 1, 1 April 2012, Pages 1–6
نویسندگان
Roberto Baldacci, Aristide Mingozzi, Roberto Roberti,