Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4959138 | Computers & Operations Research | 2017 | 32 Pages |
Abstract
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.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Pamela J. Palomo-MartÃnez, M. Angélica Salazar-Aguilar, Gilbert Laporte, André Langevin,