Search
 
loader loading subjects...
cover
Genetic Algorithm Solving Orienteering Problem in Large Networks
Joanna Karbowska-Chilińska, Jolanta Koszelew, Krzysztof Ostrowski, Paweł Zabielski
28 - 38
10.3233/978-1-61499-105-28
Frontiers in Artificial Intelligence and Applications
Volume 243: Advances in Knowledge-Based and Intelligent Information and Engineering Systems
Abstract

This paper proposes an effective genetic algorithm (GA) with inserting as well as removing mutation so as to solve the Orienteering Problem (OP). In order to obtain improved results we have taken into consideration not only the total profit but also the travel length for the given path. The computer experiments that have been conducted on a large transport network (approximately 900 vertices) present better solutions in comparison to the well-known Guided Local Search (GLS) method. It should be stated that GA is significantly faster than GLS.

$35.00 / €27.50 / £22.00
Add PDF to cart