Accessibility navigation

Computing journey start times with recurrent traffic conditions

Kala, R. and Warwick, K. (2014) Computing journey start times with recurrent traffic conditions. IET Intelligent Transportation Systems, 8 (8). pp. 681-687. ISSN 1751-956X

Full text not archived in this repository.

It is advisable to refer to the publisher's version if you intend to cite from this work. See Guidance on citing.

To link to this item DOI: 10.1049/iet-its.2013.0082


n this study, the authors discuss the effective usage of technology to solve the problem of deciding on journey start times for recurrent traffic conditions. The developed algorithm guides the vehicles to travel on more reliable routes that are not easily prone to congestion or travel delays, ensures that the start time is as late as possible to avoid the traveller waiting too long at their destination and attempts to minimise the travel time. Experiments show that in order to be more certain of reaching their destination on time, a traveller has to leave early and correspondingly arrive early, resulting in a large waiting time. The application developed here asks the user to set this certainty factor as per the task in hand, and computes the best start time and route.

Item Type:Article
ID Code:36731
Uncontrolled Keywords:Inspec keywords: traffic information systems; road traffic; vehicle routing Other keywords: reliable routes; journey start times; travel delays; recurrent traffic conditions; certainty factor; traveller Subjects: Traffic engineering computing

University Staff: Request a correction | Centaur Editors: Update this record

Page navigation