A simulated annealing heuristic for the team orienteering problem with time windows

DOI10.1016/j.ejor.2011.08.024zbMath1244.90248OpenAlexW1996723851MaRDI QIDQ439335

Vincent F. Yu, Shih-Wei Lin

Publication date: 16 August 2012

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2011.08.024

zbMATH Keywords

simulated annealingroutingtime windowteam orienteering problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Queues and service in operations research (90B22) Deterministic network models in operations research (90B10)

Related Items (17)

The multi-vehicle profitable pickup and delivery problem ⋮ Efficient meta-heuristics for the multi-objective time-dependent orienteering problem ⋮ Orienteering problem: a survey of recent variants, solution approaches and applications ⋮ A tabu search algorithm for the multi-period inspector scheduling problem ⋮ Heuristics for the time dependent team orienteering problem: application to tourist route planning ⋮ Bi-objective orienteering for personal activity scheduling ⋮ Effective neighborhood search with optimal splitting and adaptive memory for the team orienteering problem with time windows ⋮ Adaptive neighborhood simulated annealing for the heterogeneous fleet vehicle routing problem with multiple cross-docks ⋮ Design of diversified package tours for the digital travel industry: a branch-cut-and-price approach ⋮ Trip planning for visitors in a service system with capacity constraints ⋮ Optimization of gas metering maintenance services: A multiobjective vehicle routing problem with a set of predefined overlapping time windows ⋮ A new mathematical model and a heuristic algorithm for the tourist trip design problem under new constraints: a real-world application ⋮ A unified matheuristic for solving multi-constrained traveling salesman problems with profits ⋮ An iterative three-component heuristic for the team orienteering problem with time windows ⋮ A new approach on auxiliary vehicle assignment in capacitated location routing problem ⋮ Multi-period orienteering with uncertain adoption likelihood and waiting at customers ⋮ The synchronized multi-assignment orienteering problem

Cites Work

• Unnamed Item
• 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
• Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming
• Solving the truck and trailer routing problem based on a simulated annealing heuristic
• The museum visitor routing problem
• A memetic algorithm for the team orienteering problem
• A path relinking approach for the team orienteering problem
• A fast and effective heuristic for the orienteering problem
• A heuristic for the multiple tour maximum collection problem
• Improvement heuristics for the vehicle routing problem based on simulated annealing
• A TABU search heuristic for the team orienteering problem
• A simulated annealing methodology to distribution network design and management
• Designing optimal aviation baggage screening strategies using simulated annealing
• A guided local search metaheuristic for the team orienteering problem
• Simulated annealing heuristics for the dynamic facility layout problem
• A simulated annealing and hill-climbing algorithm for the traveling tournament problem
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• The orienteering problem
• A tabu search heuristic for periodic and multi-depot vehicle routing problems

This page was built for publication: A simulated annealing heuristic for the team orienteering problem with time windows