Abstract
A simple functional equation of dynamic programming is used to generate optimal orienteering routes in mountainous country. Comparisons are made between computed and actual results, further refinements in the handling of data considered, and the benefits to competitors and organizers of orienteering-type events discussed.
Similar content being viewed by others
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Hayes, M., Norman, J. Dynamic Programming in Orienteering: Route Choice and the Siting of Controls. J Oper Res Soc 35, 791–796 (1984). https://doi.org/10.1057/jors.1984.161
Published:
Issue Date:
DOI: https://doi.org/10.1057/jors.1984.161