A Genetic Algorithm Based Solution of Hungarian Team Orienteering Competitions

In this paper, a special team orienteering problem is presented where a set of control points should be distributed among the members of the team while a course with fixed order of controls is need to be completed too. The aim of the team is to minimize the maximum route length of the members. In this paper, a simple genetic algorithm is proposed to solve this special team orienteering problem. The performance of the algorithm is evaluated on real competition examples and the results are compared to the solutions given by the real winners of the race.