A memetic algorithm for the team orienteering problem

DOI10.1007/s10288-008-0094-4zbMath1186.90012MaRDI QIDQ972625

Duc-Cuong Dang, Aziz Moukrim, Hermann Bouly

Publication date: 21 May 2010

Published in: 4OR (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10288-008-0094-4

zbMATH Keywords

metaheuristic; selective vehicle routing problem; destruction/construction; optimal split

Mathematics Subject Classification ID

90B06: Transportation, logistics and supply chain management

90C59: Approximation methods and heuristics in mathematical programming

90C27: Combinatorial optimization

Related Items

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, Efficient frameworks for greedy split and new depth first search split procedures for routing problems, A memetic algorithm for the team orienteering problem, The team orienteering problem with time windows: an LP-based granular variable neighborhood search

Cites Work

• Unnamed Item
• Competitive memetic algorithms for arc routing problems
• A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
• A memetic algorithm for the team orienteering problem
• The fleet size and mix problem for capacitated arc routing
• The team orienteering problem
• A heuristic for the multiple tour maximum collection problem
• A TABU search heuristic for the team orienteering problem
• A simple and effective evolutionary algorithm for the vehicle routing problem
• An exact algorithm for team orienteering problems
• Lower and upper bounds for the mixed capacitated arc routing problem
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints