A Greedy Randomized Adaptive Search Procedure for the Orienteering Problem with Hotel Selection

Somayeh Sohrabi, Koorush Ziarati and Morteza Keshtkaran

European Journal of Operational Research, 2020, vol. 283, issue 2, 426-440

Abstract: The Orienteering Problem with Hotel Selection (OPHS) is one of the most recent variants of the Orienteering Problem (OP). The sequence of hotels has a significant effect on the quality of the OPHS solutions. According to prior studies, it is not efficient to consider all feasible sequences of hotels for constructing a tour. For this reason, solution methods for this problem should be independent of the Total Number of Feasible Sequences of hotels (TNFS).

Keywords: Metaheuristics; Orienteering Problem with Hotel Selection; Orienteering Problem; Greedy Randomized Adaptive Search Procedure; Dynamic programming (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S037722171930921X
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:ejores:v:283:y:2020:i:2:p:426-440

DOI: 10.1016/j.ejor.2019.11.010

Access Statistics for this article

European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati

More articles in European Journal of Operational Research from Elsevier
Bibliographic data for series maintained by Catherine Liu ().