A variable neighborhood search method for the orienteering problem with hotel selection

A. Divsalar, P. Vansteenwegen and D. Cattrysse

International Journal of Production Economics, 2013, vol. 145, issue 1, 150-160

Abstract: In this paper, we present the orienteering problem with hotel selection (OPHS), an extension of the orienteering problem (OP). In the OPHS, a set of vertices with a score and a set of hotels are given. The goal is to determine a fixed number of connected trips that visits some vertices and maximizes the sum of the collected scores. Each trip is limited in length and should start and end in one of the hotels. We formulate the problem mathematically, explain the differences with related optimization problems and indicate what makes this problem inherently more difficult.

Keywords: Orienteering problem; Hotel selection; Variable neighborhood search (search for similar items in EconPapers)
Date: 2013
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (14)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0925527313000285
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:proeco:v:145:y:2013:i:1:p:150-160

DOI: 10.1016/j.ijpe.2013.01.010

Access Statistics for this article

International Journal of Production Economics is currently edited by Stefan Minner

More articles in International Journal of Production Economics from Elsevier
Bibliographic data for series maintained by Catherine Liu ().