Using artificial neural networks to solve the orienteering problem

In the orienteering problem, the authors are given a transportation network in which a start point and an end point are specified. Other points have associated scores. Given a fixed amount of time, the goal is to determine a path from start to end through a subset of locations in order to maximize the total path score. This problem has received a considerable amount of attention in the last ten years. The traveling salesman problem is a variant of the orienteering problem. This paper applies a modified, continuous Hopfield neural network to attack this NP-hard optimization problem. In it, the authors design an effective energy function and learning algorithm. Unlike some applications of neural networks to optimization problems, this approach is shown to perfrom quite well.