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

doi:10.1016/j.cor.2015.11.007

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 journal › Article › peer-review

26 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 language	English
Pages (from-to)	408-419
Number of pages	12
Journal	Computers and Operations Research
Volume	78
DOIs	https://doi.org/10.1016/j.cor.2015.11.007
Publication status	Published - 1 Feb 2017
Externally published	Yes

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

Access to Document

10.1016/j.cor.2015.11.007

Cite this

@article{a0dc9aa802c94a96b555718e5768f73b,

title = "A hybrid variable neighborhood search for the Orienteering Problem with mandatory visits and exclusionary constraints",

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.",

author = "{Palomo Martinez}, {Pamela Jocelyn} and Salazar-Aguilar, {M. Ang{\'e}lica} and Gilbert Laporte and Andr{\'e} Langevin",

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: {\textcopyright} 2015 Elsevier Ltd Copyright: Copyright 2016 Elsevier B.V., All rights reserved.",

year = "2017",

month = feb,

day = "1",

doi = "10.1016/j.cor.2015.11.007",

language = "English",

volume = "78",

pages = "408--419",

journal = "Computers and Operations Research",

issn = "0305-0548",

publisher = "Elsevier",

}

TY - JOUR

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

AU - Palomo Martinez, Pamela Jocelyn

AU - Salazar-Aguilar, M. Angélica

AU - Laporte, Gilbert

AU - Langevin, André

N1 - 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.

PY - 2017/2/1

Y1 - 2017/2/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84950118760&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84950118760&partnerID=8YFLogxK

U2 - 10.1016/j.cor.2015.11.007

DO - 10.1016/j.cor.2015.11.007

M3 - Article

SN - 0305-0548

VL - 78

SP - 408

EP - 419

JO - Computers and Operations Research

JF - Computers and Operations Research

ER -

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

Abstract

Bibliographical note

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this