Lewis, Rhyd
2021-04-06
<p>We consider the problem of determining fixed-length routes on a map that start and end at the same location. We discuss two heuristic algorithms for this problem. The first is based on finding pairs of edge-disjoint paths that are then combined; the second uses local search techniques. In real-world applications, we might also be interested in establishing routes that look attractive, are safe to use, and do not stray too far from the starting point. A short discussion on these issues is also conducted.</p>
https://doi.org/10.5281/zenodo.4665508
oai:zenodo.org:4665508
Zenodo
https://zenodo.org/communities/gisruk_2021
https://doi.org/10.5281/zenodo.4665507
info:eu-repo/semantics/openAccess
Creative Commons Attribution 4.0 International
https://creativecommons.org/licenses/by/4.0/legalcode
GISRUK, 29th Annual GIS Research UK Conference, Cardiff, Wales, UK (Online), 14-16 April 2021
Finding Attractive Exercise Circuits in Street Maps
info:eu-repo/semantics/conferencePaper