Determining rail network accessibility
Determining rail network accessibility
The usual representation of optimal path finding problems within transport networks is focused on well established algorithms for identifying the optimal path (or set of paths) between two specific network nodes. When the required solution is the identification of the optimal route between every possible pair of nodes in the network however, these algorithms are inefficient.
The Floyd-Warshall algorithm provides an efficient way to compare all possible paths through each pair of nodes more efficiently, requiring only N3 comparisons for a network of N nodes. To illustrate the potential of this approach to network analysis within transport research, this paper considers the issue of determining accessibility between railway stations (on the route between Weymouth and London Waterloo) served by a mixture of high-speed and stopping services.
A rail network is physically defined by the locations of tracks, but travel times are also dependent on whether stations are visited by high-speed services as well as stopping services. A single rail route therefore has to be represented not as a (topologically) straight line, but as a more traditional graph with high connectivity between nodes. Reformulating this into a matrix-based definition allows the Floyd-Warshall algorithm to efficiently determine the optimal routing (and hence travel times) between
Waterson, B.J.
60a59616-54f7-4c31-920d-975583953286
Box, S.
2bc3f3c9-514a-41b8-bd55-a8b34fd11113
April 2010
Waterson, B.J.
60a59616-54f7-4c31-920d-975583953286
Box, S.
2bc3f3c9-514a-41b8-bd55-a8b34fd11113
Waterson, B.J. and Box, S.
(2010)
Determining rail network accessibility.
5th IMA Conference on Mathematics in Transport, United Kingdom.
11 - 13 Apr 2010.
Record type:
Conference or Workshop Item
(Paper)
Abstract
The usual representation of optimal path finding problems within transport networks is focused on well established algorithms for identifying the optimal path (or set of paths) between two specific network nodes. When the required solution is the identification of the optimal route between every possible pair of nodes in the network however, these algorithms are inefficient.
The Floyd-Warshall algorithm provides an efficient way to compare all possible paths through each pair of nodes more efficiently, requiring only N3 comparisons for a network of N nodes. To illustrate the potential of this approach to network analysis within transport research, this paper considers the issue of determining accessibility between railway stations (on the route between Weymouth and London Waterloo) served by a mixture of high-speed and stopping services.
A rail network is physically defined by the locations of tracks, but travel times are also dependent on whether stations are visited by high-speed services as well as stopping services. A single rail route therefore has to be represented not as a (topologically) straight line, but as a more traditional graph with high connectivity between nodes. Reformulating this into a matrix-based definition allows the Floyd-Warshall algorithm to efficiently determine the optimal routing (and hence travel times) between
Text
2010_[27]_Rail_IMA.pdf
- Accepted Manuscript
More information
Published date: April 2010
Venue - Dates:
5th IMA Conference on Mathematics in Transport, United Kingdom, 2010-04-11 - 2010-04-13
Identifiers
Local EPrints ID: 74657
URI: http://eprints.soton.ac.uk/id/eprint/74657
PURE UUID: b62b100b-5f0a-4e24-ab2f-9d2796e90bc1
Catalogue record
Date deposited: 11 Mar 2010
Last modified: 30 Jan 2020 01:29
Export record
Contributors
Author:
S. Box
University divisions
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics
