The University of Southampton
University of Southampton Institutional Repository

Driveable routes: solving shortest path problems in practice

Driveable routes: solving shortest path problems in practice
Driveable routes: solving shortest path problems in practice
With the increasing use of geographical information systems (GIS) and route planning software, users have demanded faster, more realistic routes. Traditionally, operational researchers have focused on developing fast exact and heuristic procedures for the point-to-point shortest path problem. To complement these advancements, we extend the functionality of route planning by describing a number of user-driven route planning requirements and an approach for handling them. A linear time graph modifcation technique is used for modelling routing problems within a real-life traffic network. The work facilitates `driveable' routes. We also provide a simple heuristic for speeding-up Dijkstra's algorithm which does not rely on preprocessing. Our experiments on the UK road network indicate that optimality can be maintained in practice by considering on average only 12% of the search space
transport, shortest paths, dijkstra's algorithm, geographical information systems
CORMSIS-09-15
University of Southampton
Bennell, J.
38d924bc-c870-4641-9448-1ac8dd663a30
Pearson, N.A.
9e4bee84-20b4-4ba0-9c39-246373fe46d6
Potts, C.N.
58c36fe5-3bcb-4320-a018-509844d4ccff
Bennell, J.
38d924bc-c870-4641-9448-1ac8dd663a30
Pearson, N.A.
9e4bee84-20b4-4ba0-9c39-246373fe46d6
Potts, C.N.
58c36fe5-3bcb-4320-a018-509844d4ccff

Bennell, J., Pearson, N.A. and Potts, C.N. (2009) Driveable routes: solving shortest path problems in practice (Discussion Papers in Centre for Operational Research, Management Science and Information Systems, CORMSIS-09-15) Southampton, UK. University of Southampton

Record type: Monograph (Discussion Paper)

Abstract

With the increasing use of geographical information systems (GIS) and route planning software, users have demanded faster, more realistic routes. Traditionally, operational researchers have focused on developing fast exact and heuristic procedures for the point-to-point shortest path problem. To complement these advancements, we extend the functionality of route planning by describing a number of user-driven route planning requirements and an approach for handling them. A linear time graph modifcation technique is used for modelling routing problems within a real-life traffic network. The work facilitates `driveable' routes. We also provide a simple heuristic for speeding-up Dijkstra's algorithm which does not rely on preprocessing. Our experiments on the UK road network indicate that optimality can be maintained in practice by considering on average only 12% of the search space

Full text not available from this repository.

More information

Published date: 2009
Keywords: transport, shortest paths, dijkstra's algorithm, geographical information systems

Identifiers

Local EPrints ID: 71390
URI: https://eprints.soton.ac.uk/id/eprint/71390
PURE UUID: 387c4dbf-32bc-4785-b141-e3b2e93b454e

Catalogue record

Date deposited: 10 Feb 2010
Last modified: 19 Jul 2017 00:00

Export record

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

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of https://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×