Heuristics for the time dependent team orienteering problem: Application to tourist route planning ? ??
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.
tourist trip design problem time dependent team orienteering problem with time windows iterated local search clustering