Conference paper Open Access

Finding Attractive Exercise Circuits in Street Maps

Lewis, Rhyd

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.

Files (699.7 kB)
Name Size
GISRUK2021_paper_18.pdf
md5:8efe0336d30774323bf3bf53c9461e13
699.7 kB Download
113
84
views
downloads
All versions This version
Views 113113
Downloads 8484
Data volume 58.8 MB58.8 MB
Unique views 106106
Unique downloads 7979

Share

Cite as