Conference paper Open Access

Finding Attractive Exercise Circuits in Street Maps

Lewis, Rhyd

DataCite XML Export

<?xml version='1.0' encoding='utf-8'?>
<resource xmlns:xsi="" xmlns="" xsi:schemaLocation="">
  <identifier identifierType="DOI">10.5281/zenodo.4665508</identifier>
      <creatorName>Lewis, Rhyd</creatorName>
      <affiliation>School of Mathematics, Cardiff University, Wales</affiliation>
    <title>Finding Attractive Exercise Circuits in Street Maps</title>
    <date dateType="Issued">2021-04-06</date>
  <resourceType resourceTypeGeneral="ConferencePaper"/>
    <alternateIdentifier alternateIdentifierType="url"></alternateIdentifier>
    <relatedIdentifier relatedIdentifierType="DOI" relationType="IsVersionOf">10.5281/zenodo.4665507</relatedIdentifier>
    <rights rightsURI="">Creative Commons Attribution 4.0 International</rights>
    <rights rightsURI="info:eu-repo/semantics/openAccess">Open Access</rights>
    <description descriptionType="Abstract">&lt;p&gt;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.&lt;/p&gt;</description>
All versions This version
Views 114114
Downloads 8585
Data volume 59.5 MB59.5 MB
Unique views 107107
Unique downloads 8080


Cite as