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.
CITATION STYLE
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 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8600, pp. 194–205). Springer Verlag. https://doi.org/10.1007/978-3-662-44320-0_17
Mendeley helps you to discover research relevant for your work.