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

Pamela Jocelyn Palomo Martinez, M. Angélica Salazar-Aguilar, Gilbert Laporte, André Langevin

Research output: Contribution to journalArticlepeer-review

13 Citations (Scopus)

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.
Original languageEnglish
Pages (from-to)408-419
Number of pages12
JournalComputers and Operations Research
Volume78
DOIs
Publication statusPublished - 1 Feb 2017
Externally publishedYes

Bibliographical note

Funding Information:
This work was supported by CONACYT , PROMEP/103.5/13/6644 , FIME-UANL and by the Canadian Natural Sciences and Engineering Research Council under grant 39682-10 . This support is gratefully acknowledged. Thanks are due to the referees for their valuable comments.

Publisher Copyright:
© 2015 Elsevier Ltd

Copyright:
Copyright 2016 Elsevier B.V., All rights reserved.

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Modelling and Simulation
  • Management Science and Operations Research

Fingerprint Dive into the research topics of 'A hybrid variable neighborhood search for the Orienteering Problem with mandatory visits and exclusionary constraints'. Together they form a unique fingerprint.

Cite this