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

DOI10.1016/J.COR.2015.03.016zbMATH Open1348.90087OpenAlexW2022067434MaRDI QIDQ337623FDOQ337623

Authors: Damianos Gavalas, Charalampos Konstantopoulos, Konstantinos Mastakas, Nikolaos Vathis, Grammati 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

Recommendations

• Efficient metaheuristics for the mixed team orienteering problem with time windows
• Iterated local search for the team orienteering problem with time windows
• On the tour planning problem
• A new accessibility based team orienteering approach for urban tourism routes optimization (a real life case)
• A fast solution method for the time-dependent orienteering problem

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

• The orienteering problem
• The orienteering problem: a survey
• The team orienteering problem
• Heuristics for the multi-period orienteering problem with multiple time windows
• The team orienteering problem with time windows: an LP-based granular variable neighborhood search
• Coupling ant colony systems with strong local searches
• The orienteering problem with variable profits
• Iterated local search for the team orienteering problem with time windows
• The selective travelling salesman problem
• User-constrained multimodal route planning
• Approximation algorithms for time-dependent orienteering.
• A fast solution method for the time-dependent orienteering problem
• Title not available (Why is that?)
• 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
• Planning in tourism and public transportation. Attraction selection by means of a personalised electronic tourist guide and train transfer scheduling
• On the approximability of an interval scheduling problem
• Efficient models for timetable information in public transportation systems
• The maximum collection problem with time-dependent rewards
• Modified global \(k\)-means algorithm for minimum sum-of-squares clustering problems

Cited In (21)

• Generating constrained length personalized bicycle tours
• The time-dependent orienteering problem with time windows: a fast ant colony system
• The vacation planning problem: a multi-level clustering-based metaheuristic approach
• Time dependent orienteering problem with time windows and service time dependent profits
• Tour recommendation for groups
• Branch-and-check approaches for the tourist trip design problem with rich constraints
• Tourist trip design with heterogeneous preferences, transport mode selection and environmental considerations
• Attractive orienteering problem with proximity and timing interactions
• Iterated local search for the team orienteering problem with time windows
• Efficient metaheuristics for the mixed team orienteering problem with time windows
• Multi-vehicle prize collecting arc routing for connectivity problem
• Efficient meta-heuristics for the multi-objective time-dependent orienteering problem
• Trip planning for visitors in a service system with capacity constraints
• Heuristics for the time dependent team orienteering problem: application to tourist route planning
• A new mathematical model and a heuristic algorithm for the tourist trip design problem under new constraints: a real-world application
• A swarm intelligence graph-based pathfinding algorithm (SIGPA) for multi-objective route planning
• A new accessibility based team orienteering approach for urban tourism routes optimization (a real life case)
• On the tour planning problem
• A LP-based heuristic for a time-constrained routing problem
• Solving the stochastic time-dependent orienteering problem with time windows
• Design of diversified package tours for the digital travel industry: a branch-cut-and-price approach

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q337623)