کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4959138 | 1445470 | 2017 | 32 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A hybrid variable neighborhood search for the Orienteering Problem with mandatory visits and exclusionary constraints
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: A hybrid variable neighborhood search for the Orienteering Problem with mandatory visits and exclusionary constraints A hybrid variable neighborhood search for the Orienteering Problem with mandatory visits and exclusionary constraints](/preview/png/4959138.png)
چکیده انگلیسی
This paper addresses a variant of the Orienteering Problem in which some constraints related to mandatory visits and incompatibilities among nodes are taken into account. A hybrid algorithm based on a reactive GRASP and a general VNS is proposed. Computational experiments over a large set of instances show the efficiency of the algorithm. Additionally, we also validate the performance of this algorithm on some instances taken from the literature of the traditional Orienteering Problem.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Operations Research - Volume 78, February 2017, Pages 408-419
Journal: Computers & Operations Research - Volume 78, February 2017, Pages 408-419
نویسندگان
Pamela J. Palomo-MartÃnez, M. Angélica Salazar-Aguilar, Gilbert Laporte, André Langevin,