A heuristic algorithm for finding attractive fixed-length circuits in street maps

Lewis, Rhyd ORCID: https://orcid.org/0000-0003-1046-811X 2020. A heuristic algorithm for finding attractive fixed-length circuits in street maps. Presented at: International Conference on Computational Logistics, Enschede, The Netherlands, 28–30 Sept 2020. Computational Logistics. Lecture Notes in Computer Science. , vol.12433 Springer Verlag, pp. 384-395. 10.1007/978-3-030-59747-4_25

Preview

PDF - Accepted Post-Print Version Download (894kB) | Preview

Abstract

In this paper we consider the problem of determining fixed-length routes on a street map that start and end at the same location. We propose a heuristic for this problem based on finding pairs of edge-disjoint shortest paths, which can then be combined into a circuit. Various heuristics and filtering techniques are also proposed for improving the algorithm’s performance.

Item Type:	Conference or Workshop Item (Paper)
Date Type:	Publication
Status:	Published
Schools:	Schools > Mathematics
Publisher:	Springer Verlag
ISSN:	0302-9743
Date of First Compliant Deposit:	28 September 2020
Date of Acceptance:	30 July 2020
Last Modified:	07 Nov 2022 11:17
URI:	https://orca.cardiff.ac.uk/id/eprint/135151

Citation Data

Cited 1 time in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item