Conference paper Open Access

Finding Attractive Exercise Circuits in Street Maps

Lewis, Rhyd

JSON-LD ( Export

  "description": "<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>", 
  "license": "", 
  "creator": [
      "affiliation": "School of Mathematics, Cardiff University, Wales", 
      "@type": "Person", 
      "name": "Lewis, Rhyd"
  "headline": "Finding Attractive Exercise Circuits in Street Maps", 
  "image": "", 
  "datePublished": "2021-04-06", 
  "url": "", 
  "@type": "ScholarlyArticle", 
  "@context": "", 
  "identifier": "", 
  "@id": "", 
  "workFeatured": {
    "url": "", 
    "alternateName": "GISRUK", 
    "location": "Cardiff, Wales, UK (Online)", 
    "@type": "Event", 
    "name": "29th Annual GIS Research UK Conference"
  "name": "Finding Attractive Exercise Circuits in Street Maps"
All versions This version
Views 114114
Downloads 8585
Data volume 59.5 MB59.5 MB
Unique views 107107
Unique downloads 8080


Cite as