کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
10225902 | 1701224 | 2019 | 38 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A branch-and-price algorithm for a vehicle routing with demand allocation problem
ترجمه فارسی عنوان
الگوریتم شاخه و قیمت برای مسیریابی خودرو با مشکل تقسیم تقاضا
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
مسیریابی مشکل ترافیک مسیریابی خودرو لجستیک و توزیع، شعبه و قیمت، برنامه نویسی دینامیک،
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
چکیده انگلیسی
We investigate the vehicle routing with demand allocation problem where the decision-maker jointly optimizes the location of delivery sites, the assignment of customers to (preferably convenient) delivery sites, and the routing of vehicles operated from a central depot to serve customers at their designated sites. We propose an effective branch-and-price (B&P) algorithm that is demonstrated to greatly outperform the use of commercial branch-and-bound/cut solvers such as CPLEX. Central to the efficacy of the proposed B&P algorithm is the development of a specialized dynamic programming procedure that extends works on elementary shortest path problems with resource constraints in order to solve the more complex column generation pricing subproblem. Our computational study demonstrates the efficacy of the proposed approach using a set of 60 problem instances. Moreover, the proposed methodology has the merit of providing optimal solutions in run times that are significantly shorter than those reported for decomposition-based heuristics in the literature.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 272, Issue 2, 16 January 2019, Pages 523-538
Journal: European Journal of Operational Research - Volume 272, Issue 2, 16 January 2019, Pages 523-538
نویسندگان
Mohammad Reihaneh, Ahmed Ghoniem,