کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4959987 | 1445962 | 2017 | 43 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Route relaxations on GPU for vehicle routing problems
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Route relaxations on GPU for vehicle routing problems Route relaxations on GPU for vehicle routing problems](/preview/png/4959987.png)
چکیده انگلیسی
State-Space Relaxation (SSR) is an approach often used to compute by dynamic programming (DP) effective bounds for many combinatorial optimization problems. Currently, the most effective exact approaches for solving many Vehicle Routing Problems (VRPs) are DP algorithms making use of SSR for computing their bounding components. In particular, most of these make use of the q-route and ng-route relaxations. The bounding procedures based on these relaxations provide good quality bounds but they are often time consuming to compute, even for moderate size instances. In this paper we investigate the use of GPU computing for solving q-route and ng-route relaxations. The results prove that the proposed GPU implementations are able to achieve remarkable computing time reductions, up to 40 times with respect to the sequential versions.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 258, Issue 2, 16 April 2017, Pages 456-466
Journal: European Journal of Operational Research - Volume 258, Issue 2, 16 April 2017, Pages 456-466
نویسندگان
Marco Antonio Boschetti, Vittorio Maniezzo, Francesco Strappaveccia,