A memetic algorithm for the team orienteering problem

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

Aziz Moukrim, Duc-Cuong Dang, 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

metaheuristicselective vehicle routing problemdestruction/constructionoptimal split

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (23)

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 ⋮ An efficient evolutionary algorithm for the orienteering problem ⋮ Algorithm selection for the team orienteering problem ⋮ An effective hybrid search algorithm for the multiple traveling repairman problem with profits ⋮ 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 ⋮ The team orienteering problem with time windows: an LP-based granular variable neighborhood search ⋮ Efficient frameworks for greedy split and new depth first search split procedures for routing problems ⋮ Trip planning for visitors in a service system with capacity constraints ⋮ Hybridized evolutionary local search algorithm for the team orienteering problem with time windows ⋮ Hybrid genetic algorithm for undirected traveling salesman problems with profits ⋮ A PSO based algorithm with an efficient optimal split procedure for the multiperiod vehicle routing problem with profit ⋮ A new mathematical model and a heuristic algorithm for the tourist trip design problem under new constraints: a real-world application ⋮ A simulated annealing heuristic for the team orienteering problem with time windows ⋮ A general framework for assessing the value of social data for disaster response logistics planning ⋮ A memetic algorithm for the team orienteering problem ⋮ A memetic algorithm for the orienteering problem with hotel selection ⋮ Consistent vehicle routing with pickup decisions -- insights from sport academy training transfers ⋮ 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

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

This page was built for publication: A memetic algorithm for the team orienteering problem