Now showing items 1-2 of 2
Algorithms for Large Orienteering Problems
In this thesis, we have developed algorithms to solve large-scale Orienteering Problems. The Orienteering Problem is a combinatorial optimization problem were given a weighted complete graph with vertex profits and a maximum ...
An efficient evolutionary algorithm for the orienteering problem
This paper deals with the Orienteering Problem, which is a routing problem. In the Orienteering Problem, each node has a profit assigned and the goal is to find the route that maximizes the total collected profit subject ...