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

DOI10.1016/j.cor.2015.03.016zbMath1348.90087OpenAlexW2022067434MaRDI QIDQ337623

Damianos Gavalas, Nikolaos Vathis, Charalampos Konstantopoulos, Konstantinos Mastakas, Grammati E. Pantziou

Publication date: 10 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2015.03.016

zbMATH Keywords

clusteringiterated local searchtime dependent team orienteering problem with time windowstourist trip design problem

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (11)

Time dependent orienteering problem with time windows and service time dependent profits ⋮ Efficient meta-heuristics for the multi-objective time-dependent orienteering problem ⋮ Heuristics for the time dependent team orienteering problem: application to tourist route planning ⋮ Multi-vehicle prize collecting arc routing for connectivity problem ⋮ The time-dependent orienteering problem with time windows: a fast ant colony system ⋮ A swarm intelligence graph-based pathfinding algorithm (SIGPA) for multi-objective route planning ⋮ Branch-and-check approaches for the tourist trip design problem with rich constraints ⋮ A new mathematical model and a heuristic algorithm for the tourist trip design problem under new constraints: a real-world application ⋮ Tourist trip design with heterogeneous preferences, transport mode selection and environmental considerations ⋮ Solving the stochastic time-dependent orienteering problem with time windows ⋮ The vacation planning problem: a multi-level clustering-based metaheuristic approach

Cites Work

• Unnamed Item
• Heuristics for the time dependent team orienteering problem: application to tourist route planning
• Hybridized evolutionary local search algorithm for the team orienteering problem with time windows
• A simulated annealing heuristic for the team orienteering problem with time windows
• The orienteering problem: a survey
• Heuristics for the multi-period orienteering problem with multiple time windows
• Iterated local search for the team orienteering problem with time windows
• The selective travelling salesman problem
• Modified global \(k\)-means algorithm for minimum sum-of-squares clustering problems
• Planning in tourism and public transportation. Attraction selection by means of a personalised electronic tourist guide and train transfer scheduling
• The team orienteering problem
• On the approximability of an interval scheduling problem
• Approximation algorithms for time-dependent orienteering.
• The team orienteering problem with time windows: an LP-based granular variable neighborhood search
• Coupling ant colony systems with strong local searches
• A fast solution method for the time-dependent orienteering problem
• User-Constrained Multimodal Route Planning
• Efficient models for timetable information in public transportation systems
• The orienteering problem
• The orienteering problem with variable profits
• The maximum collection problem with time-dependent rewards

This page was built for publication: Heuristics for the time dependent team orienteering problem: application to tourist route planning