Heuristics for the time dependent team orienteering problem: Application to tourist route planning

0.00 Avg rating—0 Votes

Article ID:	iaor201527118
Volume:	62
Issue:	6
Start Page Number:	36
End Page Number:	50
Publication Date:	Oct 2015
Journal:	Computers and Operations Research
Authors:	Gavalas Damianos, Konstantopoulos Charalampos, Mastakas Konstantinos, Pantziou Grammati, Vathis Nikolaos
Keywords:	vehicle routing & scheduling, combinatorial optimization, programming: multiple criteria, transportation: general, recreation & tourism

Abstract:

Tourist Trip Design Problem (TTDP): near‐optimal multiple‐day tourist tours maximizing tourist satisfaction (profit).

Time Dependent Team Orienteering Problem with Time Windows (TDTOPTW): Modeling TTDP incorporating public transit transfers.

First heuristic algorithms incorporating time dependency (with no assumption on periodicity) in travel costs.

The start/end locations of any route are arbitrarily defined within the tourist destination area, at runtime.

Testing on new TTDP‐tailored benchmark instances based on POIs and the public transit network of Athens, Greece.

Reviews

Required fields are marked *. Your email address will not be published.