Lewis, R. ![]() ![]() |
Preview |
PDF
- Accepted Post-Print Version
Available under License Creative Commons Attribution. Download (699kB) | Preview |
Official URL: http://doi.org/10.5281/zenodo.4665508
Abstract
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.
Item Type: | Conference or Workshop Item (Paper) |
---|---|
Date Type: | Published Online |
Status: | Published |
Schools: | Mathematics |
Date of First Compliant Deposit: | 13 April 2021 |
Date of Acceptance: | 1 March 2021 |
Last Modified: | 09 Nov 2022 10:43 |
URI: | https://orca.cardiff.ac.uk/id/eprint/140461 |
Actions (repository staff only)
![]() |
Edit Item |