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="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:creator>Lewis, Rhyd</dc:creator>
  <dc:date>2021-04-06</dc:date>
  <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:identifier>https://zenodo.org/record/4665508</dc:identifier>
  <dc:identifier>10.5281/zenodo.4665508</dc:identifier>
  <dc:identifier>oai:zenodo.org:4665508</dc:identifier>
  <dc:relation>doi:10.5281/zenodo.4665507</dc:relation>
  <dc:rights>info:eu-repo/semantics/openAccess</dc:rights>
  <dc:rights>https://creativecommons.org/licenses/by/4.0/legalcode</dc:rights>
  <dc:title>Finding Attractive Exercise Circuits in Street Maps</dc:title>
  <dc:type>info:eu-repo/semantics/conferencePaper</dc:type>
  <dc:type>publication-conferencepaper</dc:type>
</oai_dc:dc>
114
85
views
downloads
All versions This version
Views 114114
Downloads 8585
Data volume 59.5 MB59.5 MB
Unique views 107107
Unique downloads 8080

Share

Cite as