A memetic algorithm for the team orienteering problem
From MaRDI portal
Recommendations
- A TABU search heuristic for the team orienteering problem
- Hybridized evolutionary local search algorithm for the team orienteering problem with time windows
- An effective PSO-inspired algorithm for the team orienteering problem
- Solving the team orienteering problem with cutting planes
- A Branch-and-Cut Algorithm for Solving the Team Orienteering Problem
Cites work
- A heuristic for the multiple tour maximum collection problem
- A memetic algorithm for the team orienteering problem
- A simple and effective evolutionary algorithm for the vehicle routing problem
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- A TABU search heuristic for the team orienteering problem
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- An exact algorithm for team orienteering problems
- Competitive memetic algorithms for arc routing problems
- scientific article; zbMATH DE number 3126094 (Why is no real title available?)
- Lower and upper bounds for the mixed capacitated arc routing problem
- The fleet size and mix problem for capacitated arc routing
- The team orienteering problem
Cited in
(27)- An efficient evolutionary algorithm for the orienteering problem
- A general framework for assessing the value of social data for disaster response logistics planning
- A memetic algorithm for the orienteering problem with mandatory visits and exclusionary constraints
- A TABU search heuristic for the team orienteering problem
- The team orienteering problem with time windows: an LP-based granular variable neighborhood search
- Consistent vehicle routing with pickup decisions -- insights from sport academy training transfers
- Algorithm selection for the team orienteering problem
- An effective hybrid search algorithm for the multiple traveling repairman problem with profits
- A PSO based algorithm with an efficient optimal split procedure for the multiperiod vehicle routing problem with profit
- An effective PSO-inspired algorithm for the team orienteering problem
- A memetic algorithm for the multiperiod vehicle routing problem with profit
- Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
- A guided local search metaheuristic for the team orienteering problem
- A memetic algorithm for the orienteering problem with hotel selection
- A hybrid adaptive large neighborhood search heuristic for the team orienteering problem
- 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
- Heuristic solutions for the vehicle routing problem with time windows and synchronized visits
- The selective vehicle routing problem in a collaborative environment
- Orienteering problem: a survey of recent variants, solution approaches and applications
- 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 Memetic-GRASP Algorithm for the Solution of the Orienteering Problem
- Efficient frameworks for greedy split and new depth first search split procedures for routing problems
- Hybrid genetic algorithm for undirected traveling salesman problems with profits
- A new mathematical model and a heuristic algorithm for the tourist trip design problem under new constraints: a real-world application
- A memetic algorithm for the team orienteering problem
This page was built for publication: A memetic algorithm for the team orienteering problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q972625)
