An iterative three-component heuristic for the team orienteering problem with time windows

DOI10.1016/j.ejor.2013.06.011zbMath1305.90415OpenAlexW2068092414MaRDI QIDQ2255940

Andrew E. B. Lim, Qian Hu

Publication date: 18 February 2015

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

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

zbMATH Keywords

heuristicroutingteam orienteering problem with time windows

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (16)

The multi-vehicle profitable pickup and delivery problem ⋮ A matheuristic approach to the orienteering problem with service time dependent profits ⋮ A multicut L-shaped based algorithm to solve a stochastic programming model for the mobile facility routing and scheduling problem ⋮ Orienteering problem: a survey of recent variants, solution approaches and applications ⋮ A tabu search algorithm for the multi-period inspector scheduling problem ⋮ Bi-objective orienteering for personal activity scheduling ⋮ Effective neighborhood search with optimal splitting and adaptive memory for the team orienteering problem with time windows ⋮ 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 ⋮ GRASP‐ILS and set cover hybrid heuristic for the synchronized team orienteering problem with time windows ⋮ The bus sightseeing problem ⋮ A new mathematical model and a heuristic algorithm for the tourist trip design problem under new constraints: a real-world application ⋮ Methods for multi-objective optimization: an analysis ⋮ A general framework for assessing the value of social data for disaster response logistics planning ⋮ Multi-period orienteering with uncertain adoption likelihood and waiting at customers ⋮ The synchronized multi-assignment orienteering problem

Cites Work

• Unnamed Item
• 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
• Simulated annealing: A tool for operational research
• Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem
• 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 team orienteering problem
• A fast and effective heuristic for the orienteering problem
• Improvement heuristics for the vehicle routing problem based on simulated annealing
• A TABU search heuristic for the team orienteering problem
• Simulated annealing metaheuristics for the vehicle routing problem with time windows
• The team orienteering problem with time windows: an LP-based granular variable neighborhood search
• Coupling ant colony systems with strong local searches
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• A survey of simulated annealing as a tool for single and multiobjective optimization
• The orienteering problem
• The Orienteering Problem with Time Windows
• A tabu search heuristic for periodic and multi-depot vehicle routing problems
• Solving the Orienteering Problem through Branch-and-Cut
• Handbook of metaheuristics

This page was built for publication: An iterative three-component heuristic for the team orienteering problem with time windows