A hybrid variable neighborhood search for the Orienteering Problem with mandatory visits and exclusionary constraints

Citation data:

Computers & Operations Research, ISSN: 0305-0548, Vol: 78, Page: 408-419

Publication Year:
2017
Usage 322
Abstract Views 321
Link-outs 1
Captures 18
Readers 16
Exports-Saves 2
Social Media 72
Shares, Likes & Comments 72
Citations 9
Citation Indexes 9
DOI:
10.1016/j.cor.2015.11.007
Author(s):
Pamela J. Palomo-Martínez; M. Angélica Salazar-Aguilar; Gilbert Laporte; André Langevin
Publisher(s):
Elsevier BV
Tags:
Computer Science; Mathematics; Decision Sciences
article description
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.