Open AccessA dynamic shortest path algorithm using multi‐step ahead link travel time prediction
Author(s) -
Lee YoungIhn,
Lee Seungjae,
Lee Shinhae,
Chon Jeunggyu
Publication year - 2005
Publication title -
journal of advanced transportation
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.577
H-Index - 46
eISSN - 2042-3195
pISSN - 0197-6729
DOI - 10.1002/atr.5670390103
Subject(s) - shortest path problem , algorithm , path (computing) , travel time , computer science , k shortest path routing , link (geometry) , yen's algorithm , constrained shortest path first , kalman filter , shortest path faster algorithm , mathematical optimization , dijkstra's algorithm , mathematics , artificial intelligence , engineering , theoretical computer science , graph , computer network , transport engineering , programming language
In this paper, a multi‐step ahead prediction algorithm of link travel speeds has been developed using a Kalman filtering technique in order to calculate a dynamic shortest path. The one‐step and the multi‐step ahead link travel time prediction models for the calculation of the dynamic shortest path have been applied to the directed test network that is composed of 16 nodes: 3 entrance nodes, 2 exit nodes and 11 internal nodes. Time‐varying traffic conditions such as flows and travel time data for the test network have been generated using the CORSIM model. The results show that the multi‐step ahead algorithm is compared more favorably for searching the dynamic shortest time path than the other algorithm.