Title: A Memetic Algorithm for the Orienteering Problem with Hotel Selection
Authors: Divsalar, Ali ×
Vansteenwegen, Pieter
Sörensen, Kenneth
Cattrysse, Dirk #
Issue Date: 16-Aug-2014
Publisher: Elsevier
Series Title: European Journal of Operational Research vol:237 issue:1 pages:29-49
Abstract: In this paper, a memetic algorithm is developed to solve the orienteering problem with hotel
selection (OPHS). The algorithm consists of two levels: a genetic component mainly focuses on finding
a good sequence of intermediate hotels, whereas six local search moves embedded in a variable
neighborhood structure deal with the selection and sequencing of vertices between the hotels. A set of
176 new and larger benchmark instances of OPHS are created based on optimal solutions of regular
orienteering problems. Our algorithm is applied on these new instances as well as on 224 benchmark
instances from the literature. The results are compared with the known optimal solutions and with the
only other existing algorithm for this problem. The results clearly show that our memetic algorithm
outperforms the existing algorithm in terms of solution quality and computational time. A sensitivity
analysis shows the significant impact of the number of possible sequences of hotels on the difficulty of
an OPHS instance.
ISSN: 0377-2217
Publication status: published
KU Leuven publication type: IT
Appears in Collections:Centre for Industrial Management / Traffic & Infrastructure
× corresponding author
# (joint) last author

Files in This Item:
File Description Status SizeFormat
A Memetic Algorithm for the Orienteering Problem with Hotel Selection_.pdf Published 1401KbAdobe PDFView/Open


All items in Lirias are protected by copyright, with all rights reserved.

© Web of science