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
108
84
views
downloads
All versions This version
Views 108108
Downloads 8484
Data volume 58.8 MB58.8 MB
Unique views 101101
Unique downloads 7979
More info on how stats are collected.
Indexed in
Publication date:
April 6, 2021
DOI:
10.5281/zenodo.4665508

Zenodo DOI Badge

DOI 

10.5281/zenodo.4665508

Markdown 

[![DOI](https://zenodo.org/badge/DOI/10.5281/zenodo.4665508.svg)](https://doi.org/10.5281/zenodo.4665508)

reStructedText 

.. image:: https://zenodo.org/badge/DOI/10.5281/zenodo.4665508.svg
   :target: https://doi.org/10.5281/zenodo.4665508

HTML 

<a href="https://doi.org/10.5281/zenodo.4665508"><img src="https://zenodo.org/badge/DOI/10.5281/zenodo.4665508.svg" alt="DOI"></a>

Image URL 

https://zenodo.org/badge/DOI/10.5281/zenodo.4665508.svg

Target URL 

https://doi.org/10.5281/zenodo.4665508

Meeting:
29th Annual GIS Research UK Conference (GISRUK), Cardiff, Wales, UK (Online), 14-16 April 2021
License (for files):
Creative Commons Attribution 4.0 International

Versions

Version 1 10.5281/zenodo.4665508 Apr 6, 2021
Cite all versions? You can cite all versions by using the DOI 10.5281/zenodo.4665507. This DOI represents all versions, and will always resolve to the latest one. Read more.

Share

Cite as

Export