The Orienteering problem (OP) can be modelled as a weighted graph with set of vertices where each has a score. The main OP goal is to find a route that maximises the sum of scores, in addition the length of the route not exceeded the given limit. In this paper we present our genetic algorithm (GA) with inserting as well as removing mutation solving the OP. We compare our results with other local search methods such as: the greedy randomised adaptive search procedure (GRASP) (in addition with path relinking (PR)) and the guided local search method (GLS). The computer experiments have been conducted on the large transport network (908 cities in Poland). They indicate that our algorithm gives better results and is significantly faster than the mentioned local search methods. © 2013 Springer-Verlag.
CITATION STYLE
Karbowska-Chilińska, J., & Zabielski, P. (2013). A genetic algorithm vs. local search methods for solving the orienteering problem in large networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7828 LNAI, pp. 11–20). https://doi.org/10.1007/978-3-642-37343-5_2
Mendeley helps you to discover research relevant for your work.