Iterated local search for the team orienteering problem with time windows

DOI10.1016/J.COR.2009.03.008MaRDI QIDQ833556zbMATH OpenOpenAlexFDO

Authors Pieter Vansteenwegen, Wouter Souffriau, Greet Vanden Berghe, D. Van Oudheusden

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

iterated local searchmeta-heuristicsteam orienteering problem with time windows

Mathematics Subject Classification ID

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

Recommendations

• Efficient metaheuristics for the mixed team orienteering problem with time windows
• A guided local search metaheuristic for the team orienteering problem
• A simulated annealing heuristic for the team orienteering problem with time windows
• Heuristics for the time dependent team orienteering problem: application to tourist route planning
• An iterative three-component heuristic for the team orienteering problem with time windows

Cites work

• A fast and effective heuristic for the orienteering problem
• A guided local search metaheuristic for the team orienteering problem
• A heuristic for the multiple tour maximum collection problem
• A path relinking approach for the team orienteering problem
• A tabu search heuristic for periodic and multi-depot vehicle routing problems
• A TABU search heuristic for the team orienteering problem
• A tabu search heuristic for the undirected selective travelling salesman problem
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• An exact algorithm for team orienteering problems
• An iterated local search algorithm for the time-dependent vehicle routing problem with time windows
• Computer Solutions of the Traveling Salesman Problem
• Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming
• scientific article; zbMATH DE number 6676558 (Why is no real title available?)
• scientific article; zbMATH DE number 2050711 (Why is no real title available?)
• New dynamic programming algorithms for the resource constrained elementary shortest path problem
• On approximating a geometric prize-collecting traveling salesman problem with time windows
• The orienteering problem
• The Orienteering Problem with Time Windows
• The selective travelling salesman problem
• Variable neighborhood search: Principles and applications

Cited in

(64)

• Planning in tourism and public transportation. Attraction selection by means of a personalised electronic tourist guide and train transfer scheduling
• A matheuristic approach to the orienteering problem with service time dependent profits
• 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
• Formulations for the orienteering problem with additional constraints
• A unified matheuristic for solving multi-constrained traveling salesman problems with profits
• Efficient metaheuristics for the mixed team orienteering problem with time windows
• Solving the stochastic time-dependent orienteering 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
• Column generation based heuristics for a generalized location routing problem with profits arising in space exploration
• A tabu search algorithm for the probabilistic orienteering problem
• Anticipative dynamic slotting for attended home deliveries
• 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
• 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
• Algorithm selection for the team orienteering problem
• Design of diversified package tours for the digital travel industry: a branch-cut-and-price approach
• An iterative three-component heuristic for the team orienteering problem with time windows
• Agile Earth observation satellite scheduling: an orienteering problem with time-dependent profits and travel times
• Capacitated ring arborescence problems with profits
• The multi-vehicle profitable pickup and delivery problem
• A guided local search metaheuristic for the team orienteering problem
• Evolution-inspired local improvement algorithm solving orienteering problem
• An iterated local search algorithm for the vehicle routing problem with backhauls
• 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
• A new accessibility based team orienteering approach for urban tourism routes optimization (a real life case)
• Trip planning for visitors in a service system with capacity constraints
• An iterated local search algorithm for the single-vehicle cyclic inventory routing problem
• 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
• The capacitated team orienteering problem with incomplete service
• 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 Migratory Beekeeping Routing Problem: Model and an Exact Algorithm
• An exact solution framework for multitrip vehicle-routing problems with time windows
• An iterated local search algorithm for the lot-streaming flow shop scheduling problem
• 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
• The orienteering problem: a survey
• 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
• Solving the stochastic team orienteering problem: comparing simheuristics with the sample average approximation method
• A cooperative team orienteering optimisation model and a customised resolution metaheuristic
• Centralized multi-visitor trip planning with activity reservations in crowded destinations
• Route recombination for deterministic and non-deterministic orienteering problems with time windows: a dynamic programming approach
• Data-driven customer acceptance for attended home delivery
• Time-dependent tourist tour planning with adjustable profits
• ILS heuristics for the single-machine scheduling problem with sequence-dependent family setup times to minimize total tardiness
• The team orienteering problem with variable time windows
• Branch-and-cut-and-price for agile Earth observation satellite scheduling
• The dynamic team orienteering problem
• A learning-based granular variable neighborhood search for a multi-period election logistics problem with time-dependent profits
• Domain-independent dynamic programming

This page was built for publication: Iterated local search 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 Q833556)