Computing journey start times with recurrent traffic conditions

Rahul Kala, Kevin Warwick

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

In 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.
Original languageEnglish
Pages (from-to)681-687
JournalIET Intelligent Transport Systems
Volume8
Issue number8
DOIs
Publication statusPublished - 2014

Bibliographical note

This article is not yet on the repository.

Commonwealth Scholarship and Fellowship Program (2010)

Keywords

  • road traffic
  • traffic information systems
  • vehicle routing

Fingerprint Dive into the research topics of 'Computing journey start times with recurrent traffic conditions'. Together they form a unique fingerprint.

  • Cite this