A memetic-GRASP algorithm for the solution of the orienteering problem A memetic-GRASP algorithm for the solution of the orienteering problem Πλήρης Δημοσίευση σε Συνέδριο Conference Full Paper 2015-11-042015enThe last decade a large number of applications in logistics, tourism and other fields have been studied and modeled as Orienteering Problems (OPs). In the orienteering problem, a standard amount of nodes are given, each with a specific score. The goal is to determine a path, limited in length, from the start point to the end point through a subset of locations in order to maximize the total path score. In this paper, we present a new hybrid evolutionary algorithm for the solution of the Orienteering Problem. The algorithm combines a Greedy Randomized Adaptive Search Procedure (GRASP), an Evolutionary Algorithm and two local search procedures. The algorithm was tested in a number of benchmark instances from the literature and in most of them the best known solutions were found.http://creativecommons.org/licenses/by/4.0/105-1163rd International Conference on Modelling, Computation and Optimization in Information Systems and Management Sciences Matsatsinis Nikolaos Ματσατσινης Νικολαος Marinakis Ioannis Μαρινακης Ιωαννης Michael Politis Marinaki Magdalini Μαρινακη Μαγδαληνη Springer Verlag Memetic Algorithm Orienteering Problem