کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
6895067 1445936 2018 9 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
The Set Orienteering Problem
ترجمه فارسی عنوان
مشکل تعیین مسیریابی
کلمات کلیدی
مسیریابی مشکل برنامه ریزی ماتریالیسم،
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر علوم کامپیوتر (عمومی)
چکیده انگلیسی
In this paper, we study the Set Orienteering Problem which is a generalization of the Orienteering Problem where customers are grouped in clusters and a profit is associated with each cluster. The profit of a cluster is collected only if at least one customer from the cluster is visited. A single vehicle is available to collect the profit and the objective is to find the vehicle route that maximizes the profit collected and such that the route duration does not exceed a given threshold. We propose a mathematical formulation of the problem and a matheuristic algorithm. Computational tests are made on instances derived from benchmark instances for the Generalized Traveling Salesman Problem with up 1084 vertices. Results show that the matheuristic produces robust and high-quality solutions in a short computing time.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 267, Issue 1, 16 May 2018, Pages 264-272
نویسندگان
, , ,