A hybrid variable neighborhood search for the orienteering problem with mandatory visits and exclusionary constraints
This paper addresses the Orienteering Problem (OP) with mandatory visits and exclusionary constraints. An efficient procedure based on a reactive GRASP and a general VNS is proposed. Extensive computational results on artificial instances are analyzed. Additionally, the performance of the proposed procedure is validated on a set of instances taken from the literature of the traditional OP.
variable neighborhood search orienteering problem selective traveling salesman problem greedy randomized adaptive search procedure