A comparative study of stochastic `least-time' path algorithms in the context of the Nottingham urban network

Tools

Polenta, T and Hartley, JK ORCID: https://orcid.org/0000-0003-0727-9588, 2005. A comparative study of stochastic `least-time' path algorithms in the context of the Nottingham urban network. In: UKSIM 2003. Sixth National Conference of the United Kingdom Simulation Society, Cambridge, UK, 2-11 April 2003. Nottingham, UK: United Kingdom Simulation Society, pp. 194-200. ISBN 1842330888

Full text not available from this repository.

Abstract

This paper presents experimental results and analysis of the `actual' performance of two currently implemented stochastic 'least-time' path algorithms in the context of the Nottingham urban network. The suitability of each algorithm is judged in the context of the Nottingham urban network. The particularities and availability of the input data play a pivotal role in the assessment and evaluation of the two algorithms; as the quality of the optimal path solution is clearly dependent on the accuracy of the links' traversal times. However, the data sources being used in order to estimate and predict the links' traversal times are limited. For the time being, SCOOT data (information regarding the presence of vehicles, primarily used for traffic management) is the only source of available traffic information, in the context of the Nottingham urban network. Therefore, the characteristics of the traversal limes of links, which are equipped with SCOOT inductive loop detectors, are explored. Following experimental res

Item Type:	Chapter in book
Creators:	Polenta, T. and Hartley, J.K.
Publisher:	United Kingdom Simulation Society
Place of Publication:	Nottingham, UK
Date:	2005
ISBN:	1842330888
Divisions:	Schools > School of Science and Technology
Record created by:	EPrints Services
Date Added:	09 Oct 2015 10:13
Last Modified:	09 Jun 2017 13:22
URI:	https://irep.ntu.ac.uk/id/eprint/9636