Hybridized evolutionary local search algorithm for the team orienteering problem with time windows

DOI10.1007/s10732-010-9153-zzbMath1237.90200MaRDI QIDQ415560

Jan Melechovský, Roberto Wolfler Calvo, Nacima Labadie

Publication date: 8 May 2012

Published in: Journal of Heuristics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10732-010-9153-z

zbMATH Keywords

GRASP; time windows; team orienteering problem; ELS

Mathematics Subject Classification ID

90C59: Approximation methods and heuristics in mathematical programming

90C27: Combinatorial optimization

Related Items

The bus sightseeing problem, Efficient meta-heuristics for the multi-objective time-dependent orienteering problem, Orienteering problem: a survey of recent variants, solution approaches and applications, Heuristics for the time dependent team orienteering problem: application to tourist route planning, Bi-objective orienteering for personal activity scheduling, A unified matheuristic for solving multi-constrained traveling salesman problems with profits, The team orienteering problem with time windows: an LP-based granular variable neighborhood search, The synchronized multi-assignment orienteering problem, An iterative three-component heuristic for the team orienteering problem with time windows, Multi-period orienteering with uncertain adoption likelihood and waiting at customers, Effective neighborhood search with optimal splitting and adaptive memory for the team orienteering problem with time windows, Trip planning for visitors in a service system with capacity constraints

Uses Software

• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• The selective travelling salesman problem
• Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming
• A memetic algorithm for the team orienteering problem
• The effective application of a new approach to the generalized orienteering problem
• A path relinking approach for the team orienteering problem
• The team orienteering problem
• A fast and effective heuristic for the orienteering problem
• Minimum directed 1-subtree relaxation for score orienteering problem
• The one-period bus touring problem: Solved by an effective heuristic for the orienteering tour problem and improvement algorithm
• A tabu search heuristic for the undirected selective travelling salesman problem
• A TABU search heuristic for the team orienteering problem
• Greedy randomized adaptive search procedures
• Approximation algorithms for time-dependent orienteering.
• A guided local search metaheuristic for the team orienteering problem
• An exact algorithm for team orienteering problems
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• Using a Genetic Algorithm to Solve the Generalized Orienteering Problem
• 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
• Approximation Algorithms for Orienteering and Discounted-Reward TSP
• On Prize‐collecting Tours and the Asymmetric Travelling Salesman Problem