In this article, we propose TrajectMe, an algorithm that solves the orienteering problem with hotel selection in several cities, taking advantage of the tourists' trajectories extracted from location-based services. This method is an extension of the state-of-the-art memetic-based algorithm. To this end, we collect data from Foursquare and Flickr location-based services, reconstruct the trajectories of tourists. Next, we build a hotel graph model (HGM) using a set of trajectories and a set of hotels to infer typical sequences of hotels and point of interest (PoI). The HGM is applied in the initialization phase and in the genetic operations of the memetic algorithm to provide good sequences of hotels, whereas the associated sequence of PoIs are improved by applying local search moves. We evaluate our proposal using a large and real dataset from three Italian cities using up to 1000 hotels. The results show that our approach is effective and outperforms the state-of-the-art when using large real datasets. Our approach is better than the baseline algorithm by up to 208% concerning the solution score and proved to be more profitable toward PoI visiting time, being 54% better than state-of-the-art.
[1]
Nenad Mladenovic,et al.
Variable Neighborhood Descent
,
2018,
Handbook of Heuristics.
[2]
Dirk Cattrysse,et al.
A memetic algorithm for the orienteering problem with hotel selection
,
2014,
Eur. J. Oper. Res..
[3]
S. van Hoek,et al.
Tabu Search for the Orienteering Problem with Hotel Selection
,
2016
.
[4]
Raffaele Perego,et al.
On planning sightseeing tours with TripBuilder
,
2015,
Inf. Process. Manag..
[5]
Dirk Cattrysse,et al.
A variable neighborhood search method for the orienteering problem with hotel selection
,
2013
.
[6]
David E. Goldberg,et al.
Genetic Algorithms in Search Optimization and Machine Learning
,
1988
.
[7]
Kenneth Sörensen,et al.
A fast metaheuristic for the travelling salesperson problem with hotel selection
,
2015,
4OR.