Algorithmic techniques for the Tourist Trip Design Problem
Αλγοριθμικές τεχνικές για το πρόβλημα σχεδιασμού τουριστικών διαδρομών
KeywordsILS ; Iterated Local Search ; Algorithms ; Team orienteering problem ; Tourist Trip Design Problem
This paper concentrates on the Tourist Trip design problem, a practical application of the Team Orienteering problem, providing an efficient visit schedule of points-of-interest based on predetermined scores. A slightly modified version of a well-known algorithm based on the Iterated Local Search (ILS) is utilized: in contrast to the original ILS algorithm, the tours created must visit the selected Points of Interest (POIs) not only within their time windows but also the remaining time after reaching a POI should be at least the suggested visit time for this POI. Otherwise, the visit is considered unfeasible. Furthermore, the user is allowed to modify the score of each proposed POI by certain percent based on the category it belongs to and on how many POIs of the same category s/he has seen along the part of the tours completed so far.