Abstract
When a tourist is visiting a large region with many attractions, frequently there is not enough time to reach all of them. Moreover when the journey takes more than a day, at the end of each day an accomodation place should be selected to continue the trip the next day. In this research, we introduce the Orienteering Problem with Hotel Selection and Time Windows (OPHS-TW) in order to model this real application. A set of 395 benchmark instances with known optimal solution are created and a hybrid Genetic Algorithm with a Variable Neighborhood Descent (GA-VND) phase is developed to efficiently solve the instances in a reasonable time.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Divsalar, A., Vansteenwegen, P., Cattrysse, D.: A Variable Neighborhood Search Method for the Orienteering Problem with Hotel Selection. Int. J. Prod. Econ. 145, 150–160 (2013)
Divsalar, A., Vansteenwegen, P., Sörensen, K., Cattrysse, D.: A Memetic Algorithm for the Orienteering Problem with Hotel Selection. Eur. J. Oper. Res. (2014)
Hu, Q., Lim, A.: An iterative three-component heuristic for the team orienteering problem with time windows. Eur. J. Oper. Res. 232, 276–286 (2014)
Koszelew, J., Ostrowski, K.: A Genetic Algorithm with Multiple Mutation which Solves Orienteering Problem in Large Networks. In: Bǎdicǎ, C., Nguyen, N.T., Brezovan, M. (eds.) ICCCI 2013. LNCS, vol. 8083, pp. 356–366. Springer, Heidelberg (2013)
Vansteenwegen, P., Souffriau, W., Vanden Berghe, G., Van Oudheusden, D.: Iterated local search for the team orienteering problem with time windows. Comput. Oper. Res. 36, 3281–3290 (2009)
Labadie, N., Mansini, R., Melechovsky, J., Wolfler Calvo, R., Melechovský, J.: The Team Orienteering Problem with Time Windows: An LP-based Granular Variable Neighborhood Search. Eur. J. Oper. Res. 220, 15–27 (2012)
Toth, P., Vigo, D.: The Granular Tabu Search and Its Application to the Vehicle-Routing Problem. INFORMS J. Comput. 15, 333–346 (2003)
Montemanni, R., Gambardella, L.M.: AN Ant Colony System for Team Orienteering Problems with Time Windows. Found. Comput. Decis. Sci. 34, 287–306 (2009)
Vansteenwegen, P., Souffriau, W., Van Oudheusden, D.: The orienteering problem: A survey. Eur. J. Oper. Res. 209, 1–11 (2011)
Schilde, M., Doerner, K.F., Hartl, R.F., Kiechle, G.: Metaheuristics for the bi-objective orienteering problem. Swarm Intell. 3, 179–201 (2009)
Vansteenwegen, P., Souffriau, W., Vanden Berghe, G., Van Oudheusden, D.: The City Trip Planner: An expert system for tourists. Expert Syst. Appl. 38, 6540–6546 (2011)
Angelelli, E., Speranza, M.G.: The periodic vehicle routing problem with intermediate facilities. Eur. J. Oper. Res. 137, 233–247 (2002)
Schneider, M., Stenger, A., Goeke, D.: The Electric Vehicle Routing Problem with Time Windows and Recharging Stations. Kaiserslautern (2012)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Divsalar, A., Vansteenwegen, P., Chitsaz, M., Sörensen, K., Cattrysse, D. (2014). Personalized Multi-day Trips to Touristic Regions: A Hybrid GA-VND Approach. In: Blum, C., Ochoa, G. (eds) Evolutionary Computation in Combinatorial Optimisation. EvoCOP 2014. Lecture Notes in Computer Science, vol 8600. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-44320-0_17
Download citation
DOI: https://doi.org/10.1007/978-3-662-44320-0_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-44319-4
Online ISBN: 978-3-662-44320-0
eBook Packages: Computer ScienceComputer Science (R0)