Heuristic Methods Applied to Orienteering

Abstract

A general description of the sport of orienteering in its two forms known as orienteering event and score orienteering event is given. The similarities between the latter and the generalized travelling salesman problem are underlined, and a common mathematical model is deduced. A ‘good’, if not ‘optimal’ solution of the corresponding problem by means of an efficient and computationally feasible method is derived and discussed. This solution is obtained by the use of either of two algorithms based on approximate methods. The two algorithms are given, and their efficiency is tested on a number of illustrative problems. Finally, a comparison between the two forms of the sport of orienteering is made.