Personalized Multi-day Trips to Touristic Regions: A Hybrid GA-VND Approach
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.
KeywordsOrienteering problem Hotel selection Time windows Genetic algorithm Variable neighborhood descent
Unable to display preview. Download preview PDF.
- 2.Divsalar, A., Vansteenwegen, P., Sörensen, K., Cattrysse, D.: A Memetic Algorithm for the Orienteering Problem with Hotel Selection. Eur. J. Oper. Res. (2014)Google Scholar
- 8.Montemanni, R., Gambardella, L.M.: AN Ant Colony System for Team Orienteering Problems with Time Windows. Found. Comput. Decis. Sci. 34, 287–306 (2009)Google Scholar
- 13.Schneider, M., Stenger, A., Goeke, D.: The Electric Vehicle Routing Problem with Time Windows and Recharging Stations. Kaiserslautern (2012)Google Scholar