Conference paper Open Access

Finding Attractive Exercise Circuits in Street Maps

Lewis, Rhyd

Dublin Core Export

<?xml version='1.0' encoding='utf-8'?>
<oai_dc:dc xmlns:dc="" xmlns:oai_dc="" xmlns:xsi="" xsi:schemaLocation="">
  <dc:creator>Lewis, Rhyd</dc:creator>
  <dc:description>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.</dc:description>
  <dc:title>Finding Attractive Exercise Circuits in Street Maps</dc:title>
All versions This version
Views 114114
Downloads 8585
Data volume 59.5 MB59.5 MB
Unique views 107107
Unique downloads 8080


Cite as