Hybridized evolutionary local search algorithm for the team orienteering problem with time windows
From MaRDI portal
(Redirected from Publication:415560)
Recommendations
- Iterated local search for the team orienteering problem with time windows
- Efficient metaheuristics for the mixed team orienteering problem with time windows
- A hybrid adaptive large neighborhood search heuristic for the team orienteering problem
- Evolution-inspired local improvement algorithm solving orienteering problem
- An effective large neighborhood search for the team orienteering problem with time windows
- A guided local search metaheuristic for the team orienteering problem
- The team orienteering problem with time windows: an LP-based granular variable neighborhood search
Cites work
- scientific article; zbMATH DE number 6676558 (Why is no real title available?)
- scientific article; zbMATH DE number 5764858 (Why is no real title available?)
- scientific article; zbMATH DE number 5506214 (Why is no real title available?)
- scientific article; zbMATH DE number 4061010 (Why is no real title available?)
- scientific article; zbMATH DE number 4125195 (Why is no real title available?)
- scientific article; zbMATH DE number 1082108 (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 memetic algorithm for the team orienteering 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
- Approximation Algorithms for Orienteering and Discounted-Reward TSP
- Approximation algorithms for time-dependent orienteering.
- Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming
- Greedy randomized adaptive search procedures
- Heuristics for the multi-period orienteering problem with multiple time windows
- Iterated local search for the team orienteering problem with time windows
- Minimum directed 1-subtree relaxation for score orienteering problem
- On Prize‐collecting Tours and the Asymmetric Travelling Salesman Problem
- Solving the Orienteering Problem through Branch-and-Cut
- The Orienteering Problem with Time Windows
- The effective application of a new approach to the generalized orienteering problem
- The one-period bus touring problem: Solved by an effective heuristic for the orienteering tour problem and improvement algorithm
- The orienteering problem
- The orienteering problem: a survey
- The selective travelling salesman problem
- The team orienteering problem
- Using a genetic algorithm to solve the generalized orienteering problem
Cited in
(24)- A hybrid adaptive large neighborhood search heuristic for the team orienteering problem
- Multi-period orienteering with uncertain adoption likelihood and waiting at customers
- A TABU search heuristic for the team orienteering problem
- A memetic algorithm for the team orienteering problem
- Genetic algorithm with path relinking for the orienteering problem with time windows
- Bi-objective orienteering for personal activity scheduling
- Efficiently solving the thief orienteering problem with a max-min ant colony optimization approach
- Hybrid genetic algorithm for undirected traveling salesman problems with profits
- A path relinking approach for the team orienteering problem
- An iterative three-component heuristic for the team orienteering problem with time windows
- An effective large neighborhood search for the team orienteering problem with time windows
- A tabu search algorithm for the probabilistic orienteering problem
- 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
- An iterated local search algorithm for the team orienteering problem with variable profits
- Efficient meta-heuristics for the multi-objective time-dependent orienteering problem
- Orienteering problem: a survey of recent variants, solution approaches and applications
- The bus sightseeing problem
- The synchronized multi-assignment orienteering problem
- Centralized multi-visitor trip planning with activity reservations in crowded destinations
- Trip planning for visitors in a service system with capacity constraints
- Heuristics for the time dependent team orienteering problem: application to tourist route planning
- Effective neighborhood search with optimal splitting and adaptive memory for the team orienteering problem with time windows
- Efficient metaheuristics for the mixed team orienteering problem with time windows
This page was built for publication: Hybridized evolutionary local search algorithm 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 Q415560)