Iterated local search for the team orienteering problem with time windows

DOI10.1016/j.cor.2009.03.008zbMath1175.90239OpenAlexW2075600171MaRDI QIDQ833556

Pieter Vansteenwegen, Wouter Souffriau, Dirk D. L. van Oudheusden, Greet vanden Berghe

Publication date: 14 August 2009

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://lirias.kuleuven.be/handle/123456789/675577

zbMATH Keywords

meta-heuristicsiterated local searchteam orienteering problem with time windows

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (51)

The multi-vehicle profitable pickup and delivery problem ⋮ A matheuristic approach to the orienteering problem with service time dependent profits ⋮ An iterated local search algorithm for the single-vehicle cyclic inventory routing problem ⋮ Time dependent orienteering problem with time windows and service time dependent profits ⋮ UAV routing for reconnaissance mission: a multi-objective orienteering problem with time-dependent prizes and multiple connections ⋮ Efficient meta-heuristics for the multi-objective time-dependent orienteering problem ⋮ Orienteering problem: a survey of recent variants, solution approaches and applications ⋮ The multi-district team orienteering problem ⋮ Scheduled penalty variable neighborhood search ⋮ Solving the orienteering problem with time windows via the pulse framework ⋮ A tabu search algorithm for the multi-period inspector scheduling problem ⋮ Heuristics for the time dependent team orienteering problem: application to tourist route planning ⋮ A hybrid variable neighborhood search for the orienteering problem with mandatory visits and exclusionary constraints ⋮ Bi-objective orienteering for personal activity scheduling ⋮ An efficient evolutionary algorithm for the orienteering problem ⋮ Algorithm selection for the team orienteering problem ⋮ Evolution-inspired local improvement algorithm solving orienteering problem ⋮ The capacitated team orienteering problem with incomplete service ⋮ Effective neighborhood search with optimal splitting and adaptive memory for the team orienteering problem with time windows ⋮ A reinforcement learning approach to the orienteering problem with time windows ⋮ Metaheuristics with restart and learning mechanisms for the no-idle flowshop scheduling problem with makespan criterion ⋮ The team orienteering problem with time windows: an LP-based granular variable neighborhood search ⋮ Coupling ant colony systems with strong local searches ⋮ Column generation based heuristics for a generalized location routing problem with profits arising in space exploration ⋮ Design of diversified package tours for the digital travel industry: a branch-cut-and-price approach ⋮ The orienteering problem: a survey ⋮ Trip planning for visitors in a service system with capacity constraints ⋮ Formulations for the orienteering problem with additional constraints ⋮ Combining incomplete search and clause generation: an application to the orienteering problems with time windows ⋮ GRASP‐ILS and set cover hybrid heuristic for the synchronized team orienteering problem with time windows ⋮ The in‐house logistics routing problem ⋮ Hybridized evolutionary local search algorithm for the team orienteering problem with time windows ⋮ New mixed integer linear programming models and an iterated local search for the clustered traveling salesman problem with relaxed priority rule ⋮ A new mathematical model and a heuristic algorithm for the tourist trip design problem under new constraints: a real-world application ⋮ A simulated annealing heuristic for the team orienteering problem with time windows ⋮ A unified matheuristic for solving multi-constrained traveling salesman problems with profits ⋮ An Exact Solution Framework for Multitrip Vehicle-Routing Problems with Time Windows ⋮ Efficient metaheuristics for the mixed team orienteering problem with time windows ⋮ ILS heuristics for the single-machine scheduling problem with sequence-dependent family setup times to minimize total tardiness ⋮ Solving the stochastic time-dependent orienteering problem with time windows ⋮ An iterative three-component heuristic for the team orienteering problem with time windows ⋮ An Iterated Local Search Algorithm for the Lot-Streaming Flow Shop Scheduling Problem ⋮ Agile Earth observation satellite scheduling: an orienteering problem with time-dependent profits and travel times ⋮ A Tabu search algorithm for the probabilistic orienteering problem ⋮ Capacitated ring arborescence problems with profits ⋮ An iterated local search algorithm for the vehicle routing problem with backhauls ⋮ Anticipative dynamic slotting for attended home deliveries ⋮ Planning in tourism and public transportation. Attraction selection by means of a personalised electronic tourist guide and train transfer scheduling ⋮ The Migratory Beekeeping Routing Problem: Model and an Exact Algorithm ⋮ The synchronized multi-assignment orienteering problem ⋮ New exact and heuristic algorithms to solve the prize-collecting job sequencing problem with one common and multiple secondary resources

Cites Work

• Unnamed Item
• Unnamed Item
• The selective travelling salesman problem
• An iterated local search algorithm for the time-dependent vehicle routing problem with time windows
• Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming
• 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
• A tabu search heuristic for the undirected selective travelling salesman problem
• A TABU search heuristic for the team orienteering problem
• 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
• New dynamic programming algorithms for the resource constrained elementary shortest path problem
• The orienteering problem
• The Orienteering Problem with Time Windows
• A tabu search heuristic for periodic and multi-depot vehicle routing problems
• On approximating a geometric prize-collecting traveling salesman problem with time windows
• Computer Solutions of the Traveling Salesman Problem
• Variable neighborhood search: Principles and applications

This page was built for publication: Iterated local search for the team orienteering problem with time windows