Formulations for the orienteering problem with additional constraints

Pamela Jocelyn Palomo Martinez, M. Angélica Salazar-Aguilar, Victor Albornoz

Resultado de la investigaciónrevisión exhaustiva

1 Cita (Scopus)

Resumen

This paper addresses a variant of the Orienteering Problem taking into account mandatory visits and exclusionary constraints (conflicts among nodes). Five mixed integer linear formulations are adapted from the Traveling Salesman Problem literature in order to provide a robust formulation for this problem. The main difference among these formulations lies in the way they deal with the subtour elimination constraints. The performance of the proposed formulations is evaluated over a large set of instances. Computational results reveal that the model that avoids subtours by means of a single-commodity flow formulation allows to solve to optimality more instances than the other formulations, within a time limit of 1 h.
Idioma originalEnglish
Páginas (desde-hasta)503-545
Número de páginas43
PublicaciónAnnals of Operations Research
Volumen258
N.º2
DOI
EstadoPublished - 1 nov 2017
Publicado de forma externa

All Science Journal Classification (ASJC) codes

  • Decision Sciences(all)
  • Management Science and Operations Research

Huella Profundice en los temas de investigación de 'Formulations for the orienteering problem with additional constraints'. En conjunto forman una huella única.

Citar esto