A Memetic-GRASP Algorithm for the Solution of the Orienteering Problem

DOI10.1007/978-3-319-18167-7_10zbMath1370.90224MaRDI QIDQ5357744

Magdalene Marinaki, Yannis Marinakis, Michael Politis, Nikolaos F. Matsatsinis

Publication date: 12 September 2017

Published in: Advances in Intelligent Systems and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-18167-7_10

zbMATH Keywords

local search; memetic algorithm; orienteering problem; greedy randomized adaptive search procedure

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90B06: Transportation, logistics and supply chain management

90C59: Approximation methods and heuristics in mathematical programming

90C27: Combinatorial optimization

Related Items

Orienteering problem: a survey of recent variants, solution approaches and applications, An efficient evolutionary algorithm for the orienteering problem, An improvement heuristic based on variable neighborhood search for a dynamic orienteering problem

Cites Work

• Unnamed Item
• Unnamed Item
• The orienteering problem: a survey
• Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming
• The museum visitor routing problem
• Algorithms to solve the orienteering problem: A comparison
• The team orienteering problem
• A fast and effective heuristic for the orienteering problem
• A TABU search heuristic for the team orienteering problem
• Greedy randomized adaptive search procedures
• A guided local search metaheuristic for the team orienteering problem
• A Gentle Introduction to Memetic Algorithms