Iterated local search for the team orienteering problem with time windows
From MaRDI portal
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
- scientific article; zbMATH DE number 6676558 (Why is no real title available?)
- scientific article; zbMATH DE number 2050711 (Why is no real title available?)
- A TABU search heuristic for the team orienteering problem
- 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 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
- 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 with Time Windows
- The orienteering problem
- The selective travelling salesman problem
- Variable neighborhood search: Principles and applications
Cited in
(59)- Design of diversified package tours for the digital travel industry: a branch-cut-and-price approach
- The synchronized multi-assignment orienteering problem
- Data-driven customer acceptance for attended home delivery
- The in‐house logistics routing problem
- New exact and heuristic algorithms to solve the prize-collecting job sequencing problem with one common and multiple secondary resources
- The orienteering problem: a survey
- 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
- Time dependent orienteering problem with time windows and service time dependent profits
- Agile Earth observation satellite scheduling: an orienteering problem with time-dependent profits and travel times
- A matheuristic approach to the orienteering problem with service time dependent profits
- Time-dependent tourist tour planning with adjustable profits
- An iterated local search algorithm for the single-vehicle cyclic inventory routing problem
- Capacitated ring arborescence problems with profits
- Anticipative dynamic slotting for attended home deliveries
- A tabu search algorithm for the probabilistic orienteering problem
- New mixed integer linear programming models and an iterated local search for the clustered traveling salesman problem with relaxed priority rule
- Combining incomplete search and clause generation: an application to the orienteering problems with time windows
- Efficient metaheuristics for the mixed team orienteering problem with time windows
- UAV routing for reconnaissance mission: a multi-objective orienteering problem with time-dependent prizes and multiple connections
- 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
- GRASP‐ILS and set cover hybrid heuristic for the synchronized team orienteering problem with time windows
- 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
- The multi-district team orienteering problem
- Solving the orienteering problem with time windows via the pulse framework
- The capacitated team orienteering problem with incomplete service
- Trip planning for visitors in a service system with capacity constraints
- 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
- A new mathematical model and a heuristic algorithm for the tourist trip design problem under new constraints: a real-world application
- An exact solution framework for multitrip vehicle-routing problems with time windows
- Algorithm selection for the team orienteering problem
- A tabu search algorithm for the multi-period inspector scheduling problem
- Scheduled penalty variable neighborhood search
- Effective neighborhood search with optimal splitting and adaptive memory for the team orienteering problem with time windows
- Metaheuristics with restart and learning mechanisms for the no-idle flowshop scheduling problem with makespan criterion
- A reinforcement learning approach to the orienteering problem with time windows
- A new accessibility based team orienteering approach for urban tourism routes optimization (a real life case)
- Evolution-inspired local improvement algorithm solving orienteering problem
- The multi-vehicle profitable pickup and delivery problem
- Coupling ant colony systems with strong local searches
- Column generation based heuristics for a generalized location routing problem with profits arising in space exploration
- The team orienteering problem with time windows: an LP-based granular variable neighborhood search
- Planning in tourism and public transportation. Attraction selection by means of a personalised electronic tourist guide and train transfer scheduling
- Formulations for the orienteering problem with additional constraints
- An iterative three-component heuristic for the team orienteering problem with time windows
- Solving the stochastic team orienteering problem: comparing simheuristics with the sample average approximation method
- Solving the stochastic time-dependent orienteering problem with time windows
- An iterated local search algorithm for the vehicle routing problem with backhauls
- ILS heuristics for the single-machine scheduling problem with sequence-dependent family setup times to minimize total tardiness
- A unified matheuristic for solving multi-constrained traveling salesman problems with profits
- The Migratory Beekeeping Routing Problem: Model and an Exact Algorithm
- A cooperative team orienteering optimisation model and a customised resolution metaheuristic
- A guided local search metaheuristic for the team orienteering problem
- An iterated local search algorithm for the lot-streaming flow shop scheduling problem
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)