This paper discusses an algorithm developed for short-term travel time prediction. The benefits of the travel time information provision have been documented in the literature, ranging from spatio-temporal dispersal of traffic and less stressful driving to utilization of alternative modes of travel. Majority of present travel time information systems use instantaneous travel time i.e. summing of travel time information derived from velocity measurements at different sections of road simultaneously. Instantaneous travel time information requires less computational effort but accuracy decreases with the onset of congestion. The pattern matching technique used in this research is based on the assumption that traffic scenarios similar to present traffic condition may have occurred before. Present traffic pattern is defined using velocity measurements from traffic detectors along the length of road up to one hour before the present time. Instead of using simple patterns, weighted patterns are used for defining traffic situations. A database of historical traffic situations is stored for searching the closest matched patterns and minimum sauared difference is used as indicator of the closest matched patterns from historical database. Instead of selecting one most similar pattern, ten patterns are selected so that sudden changes in travel time prediction can be avoided. The results reported in this paper indicate that pattern matching technique is capable of predicting travel time with a high degree of accuracy (90 to 95 percent). This research clearly demonstrates the feasibility of using pattern matching technique for travel time prediction using traffic detector data.
|Number of pages||14|
|Journal||Proceedings - Conference of the Australian Road Research Board|
|Publication status||Published - 2003 Dec 1|
|Event||Proceedings - 21st ARRB and 11th REAAA Conference, Transport Our Highway to a Sustainable Future - Cairns, QLD, Australia|
Duration: 2003 May 18 → 2003 May 23
ASJC Scopus subject areas