Abstract
The Orienteering Problem (OP) is a routing problem which has many applications in logistics, tourism and defense. Given a set of nodes, where each node represents a Point of Interest (POI), the orienteering problem aims to design a tour leaving from a starting POI, visiting a subset of POIs and finally arriving at the ending POI. The objective of the problem is to maximize the total score of the visited POIs while the total travel time and the total cost of the route do not exceed two predefined thresholds. Each POI is characterized by a score, a position, a visit time, and a time window in which the POI can be visited. This problem is often investigated to develop tourism trip planning mobile applications. Usually these apps must be able to generate good solutions in few seconds. Therefore, the use of efficient heuristic approaches to find good quality solutions is needed. In this paper we present a genetic algorithm framework combined with some local search operators to deal with the analyzed problem.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Golden, B.L., Levy, L., Vohra, R.: The orienteering problem. Naval Res. Logist. 34(3), 307–318 (1987)
Kantor, M.G., Rosenwein, M.B.: The orienteering problem with time windows. J. Oper. Res. Soc. 43(6), 629–635 (1992)
Vincent, F.Y., Jewpanya, P., Ting, C.J., Redi, A.P.: Two-level particle swarm optimization for the multi-modal team orienteering problem with time windows. Appl. Soft Comput. 61, 1022–1040 (2017)
Gavalas, D., Konstantopoulos, C., Mastakas, K., Pantziou, G.: Mobile recommender systems in tourism. J. Netw. Comput. Appl. 39, 319–333 (2014)
Feillet, D., Dejax, P., Gendreau, M.: Traveling salesman problems with profits. Transp. Sci. 39(2), 188–205 (2005)
Ciancio, C., Ambrogio, G., Gagliardi, F., Musmanno, R.: Heuristic techniques to optimize neural network architecture in manufacturing applications. Neural Comput. Appl. 27(7), 2001–2015 (2016)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Ciancio, C., De Maio, A., Laganà , D., Santoro, F., Violi, A. (2018). A Genetic Algorithm Framework for the Orienteering Problem with Time Windows. In: Daniele, P., Scrimali, L. (eds) New Trends in Emerging Complex Real Life Problems. AIRO Springer Series, vol 1. Springer, Cham. https://doi.org/10.1007/978-3-030-00473-6_20
Download citation
DOI: https://doi.org/10.1007/978-3-030-00473-6_20
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-00472-9
Online ISBN: 978-3-030-00473-6
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)