research unit 1

This site is powered by Aigaion - A PHP/Web based management system for shared and annotated bibliographies. For more information visit


Type of publication:Inproceedings
Entered by:chita
TitleEfficient Heuristics for the Time Dependent Team Orienteering Problem with Time Windows
Bibtex cite IDRACTI-RU1-2014-8
Booktitle International Conference on Applied Algorithms - ICAA’2014
Year published 2014
Volume 8321
Pages 151-162
Publisher Springer-Verlag
The Time Dependent Team Orienteering Problem with Time Windows (TDTOPTW) can be used to model several real life problems. Among them, the route planning problem for tourists interested in visiting multiple points of interest (POIs) using public transport. The main objective of this problem is to select POIs that match tourist preferences, while taking into account a multitude of parameters and constraints and respecting the time available for sightseeing in a daily basis. TDTOPTW is NP-hard while almost the whole body of the related literature addresses the non time dependent version of the problem. The only TDTOPTW heuristic proposed so far is based on the assumption of periodic service schedules. Herein, we propose two efficient cluster-based heuristics for the TDTOPTW which yield high quality solutions, take into account time dependency in calculating travel times between POIs and make no assumption on periodic service schedules. The validation scenario for our prototyped algorithms included the metropolitan transit network and real POI sets compiled from Athens (Greece).
Gavalas, Damianos
Konstantopoulos, Charalampos
Mastakas, Konstantinos
Pantziou, Grammati
Vathis, Nikolaos
Publication ID1016