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

Resultado de la investigaciónrevisión exhaustiva

15 Citas (Scopus)

Resumen

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.
Idioma originalEnglish
Páginas (desde-hasta)408-419
Número de páginas12
PublicaciónComputers and Operations Research
Volumen78
DOI
EstadoPublished - 1 feb 2017
Publicado de forma externa

All Science Journal Classification (ASJC) codes

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

Huella Profundice en los temas de investigación de 'A hybrid variable neighborhood search for the Orienteering Problem with mandatory visits and exclusionary constraints'. En conjunto forman una huella única.

Citar esto