The Time-Dependent Orienteering Problem with Time Windows (TDOPTW) is a combinatorial optimization problem defined on graphs. Its real life applications are particularly associated with tourist trip planning in trans-port networks, where travel time between two points depends on the moment of travel start. In the paper an effective TDOPTW solution (evolutionary algorithm with local search operators) was presented and applied to gen-erate attractive tours in real public transport networks of Białystok and Athens. The method achieved very high-quality solutions in a short execution time.

Ostrowski, K. (2018). An effective metaheuristic for tourist trip planning in public transport networks. Applied Computer Science, 14(2), 5-19. doi:10.23743/acs-2018-09

Ostrowski, Krzysztof. "An Effective Metaheuristic for Tourist Trip Planning in Public Transport Networks." Applied Computer Science 14, no. 2 (2018): 5-19.

K. Ostrowski, "An effective metaheuristic for tourist trip planning in public transport networks," Applied Computer Science, vol. 14, no. 2, pp. 5-19, 2018.

Ostrowski K. An effective metaheuristic for tourist trip planning in public transport networks. Applied Computer Science. 2018;14(2):5-19.