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

DOI10.1016/J.EJOR.2011.08.024zbMATH Open1244.90248OpenAlexW1996723851MaRDI QIDQ439335FDOQ439335

Authors: Shih-Wei Lin, Vincent F. Yu 

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

Recommendations

• An iterative three-component heuristic for the team orienteering problem with time windows
• Efficient metaheuristics for the mixed team orienteering problem with time windows
• Iterated local search for the team orienteering problem with time windows
• An effective large neighborhood search for the team orienteering problem with time windows
• A TABU search heuristic for the team orienteering problem
• The team orienteering problem with time windows: an LP-based granular variable neighborhood search

zbMATH Keywords

simulated annealingroutingtime windowteam orienteering problem

Mathematics Subject Classification ID

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

Cites Work

• The orienteering problem
• The orienteering problem: a survey
• Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• Solving the truck and trailer routing problem based on a simulated annealing heuristic
• Heuristics for the multi-period orienteering problem with multiple time windows
• Improvement heuristics for the vehicle routing problem based on simulated annealing
• A simulated annealing and hill-climbing algorithm for the traveling tournament problem
• A memetic algorithm for the team orienteering problem
• A fast and effective heuristic for the orienteering problem
• A simulated annealing methodology to distribution network design and management
• A tabu search heuristic for periodic and multi-depot vehicle routing problems
• Iterated local search for the team orienteering problem with time windows
• A TABU search heuristic for the team orienteering problem
• A path relinking approach for the team orienteering problem
• A heuristic for the multiple tour maximum collection problem
• A guided local search metaheuristic for the team orienteering problem
• Title not available (Why is that?)
• Simulated annealing heuristics for the dynamic facility layout problem
• Designing optimal aviation baggage screening strategies using simulated annealing
• The museum visitor routing problem

Cited In (20)

• The synchronized multi-assignment orienteering problem
• A new approach on auxiliary vehicle assignment in capacitated location routing problem
• Iterated local search for the team orienteering problem with time windows
• Optimization of gas metering maintenance services: A multiobjective vehicle routing problem with a set of predefined overlapping time windows
• Bi-objective orienteering for personal activity scheduling
• Efficient meta-heuristics for the multi-objective time-dependent orienteering problem
• Orienteering problem: a survey of recent variants, solution approaches and applications
• 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 tabu search algorithm for the multi-period inspector scheduling problem
• 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
• Multi-period orienteering with uncertain adoption likelihood and waiting at customers
• The multi-vehicle profitable pickup and delivery problem
• An iterative three-component heuristic for the team orienteering problem with time windows
• Addendum to ``Heuristics for the multi-period orienteering problem with multiple time windows
• A unified matheuristic for solving multi-constrained traveling salesman problems with profits
• A cooperative team orienteering optimisation model and a customised resolution metaheuristic
• Design of diversified package tours for the digital travel industry: a branch-cut-and-price approach

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

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