In this paper we present a genetic algorithm (GA) which solves the Orienteering Problem (OP). In the article, performance of the algorithm is analysed as a function of mutations number. In addition, GA results were compared with known local search methods: greedy randomized adaptive search procedure (GRASP) and guided local search method (GLS). The computer tests were conducted on large network of 908 cities in Poland. As a result, the GA performance was considerably better then local search methods in terms of both: results quality and execution time.
['Jolanta Koszelew', 'Krzysztof Ostrowski']
A Genetic Algorithm with Multiple Mutation which Solves Orienteering Problem in Large Networks