Study on the Shortest Reliable Path of Stochastic Time-Dependent Transportation Networks considering Waiting Time at Signalized Intersections
Theoretical research is conducted on finding the shortest path with stochastic and time-dependent characteristics of link travel time in urban road networks. Considering the influence of signalized intersections on travel time, the research first presents a function of waiting time at signalized int...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Hindawi-Wiley
2023-01-01
|
| Series: | Journal of Advanced Transportation |
| Online Access: | http://dx.doi.org/10.1155/2023/8298068 |
| _version_ | 1797752971690246144 |
|---|---|
| author | Yanming Sun Jie Li Shixian Liu |
| author_facet | Yanming Sun Jie Li Shixian Liu |
| author_sort | Yanming Sun |
| collection | DOAJ |
| description | Theoretical research is conducted on finding the shortest path with stochastic and time-dependent characteristics of link travel time in urban road networks. Considering the influence of signalized intersections on travel time, the research first presents a function of waiting time at signalized intersections and analyzes its characteristics. Then, considering the reliability of travel time, the travel time model under the min-max theorem is established, and a mathematical proof that the stochastic time-dependent traffic networks can be reduced to a deterministic time-dependent network is presented by using the first mathematical induction. Finally, based on analyzing the characteristics of the shortest path and minimum travel time, which vary with the start time, we propose solving the shortest path problem with a shortest path algorithm based on Dijkstra’s algorithm that takes the waiting time at signalized intersections into consideration. The research results showed that the algorithm proposed in this study does not depend on the acquisition of the probability distribution of travel time compared with the traditional algorithm. The range of uncertain travel time can be derived from historical data and travelers’ experiences, and the obtained shortest path has more robust time reliability. |
| first_indexed | 2024-03-12T17:12:12Z |
| format | Article |
| id | doaj.art-46a4098f6fc441af8da3233465e3d2de |
| institution | Directory Open Access Journal |
| issn | 2042-3195 |
| language | English |
| last_indexed | 2024-03-12T17:12:12Z |
| publishDate | 2023-01-01 |
| publisher | Hindawi-Wiley |
| record_format | Article |
| series | Journal of Advanced Transportation |
| spelling | doaj.art-46a4098f6fc441af8da3233465e3d2de2023-08-06T00:00:02ZengHindawi-WileyJournal of Advanced Transportation2042-31952023-01-01202310.1155/2023/8298068Study on the Shortest Reliable Path of Stochastic Time-Dependent Transportation Networks considering Waiting Time at Signalized IntersectionsYanming Sun0Jie Li1Shixian Liu2Shandong University of Science and TechnologyShandong University of Science and TechnologyShandong University of Science and TechnologyTheoretical research is conducted on finding the shortest path with stochastic and time-dependent characteristics of link travel time in urban road networks. Considering the influence of signalized intersections on travel time, the research first presents a function of waiting time at signalized intersections and analyzes its characteristics. Then, considering the reliability of travel time, the travel time model under the min-max theorem is established, and a mathematical proof that the stochastic time-dependent traffic networks can be reduced to a deterministic time-dependent network is presented by using the first mathematical induction. Finally, based on analyzing the characteristics of the shortest path and minimum travel time, which vary with the start time, we propose solving the shortest path problem with a shortest path algorithm based on Dijkstra’s algorithm that takes the waiting time at signalized intersections into consideration. The research results showed that the algorithm proposed in this study does not depend on the acquisition of the probability distribution of travel time compared with the traditional algorithm. The range of uncertain travel time can be derived from historical data and travelers’ experiences, and the obtained shortest path has more robust time reliability.http://dx.doi.org/10.1155/2023/8298068 |
| spellingShingle | Yanming Sun Jie Li Shixian Liu Study on the Shortest Reliable Path of Stochastic Time-Dependent Transportation Networks considering Waiting Time at Signalized Intersections Journal of Advanced Transportation |
| title | Study on the Shortest Reliable Path of Stochastic Time-Dependent Transportation Networks considering Waiting Time at Signalized Intersections |
| title_full | Study on the Shortest Reliable Path of Stochastic Time-Dependent Transportation Networks considering Waiting Time at Signalized Intersections |
| title_fullStr | Study on the Shortest Reliable Path of Stochastic Time-Dependent Transportation Networks considering Waiting Time at Signalized Intersections |
| title_full_unstemmed | Study on the Shortest Reliable Path of Stochastic Time-Dependent Transportation Networks considering Waiting Time at Signalized Intersections |
| title_short | Study on the Shortest Reliable Path of Stochastic Time-Dependent Transportation Networks considering Waiting Time at Signalized Intersections |
| title_sort | study on the shortest reliable path of stochastic time dependent transportation networks considering waiting time at signalized intersections |
| url | http://dx.doi.org/10.1155/2023/8298068 |
| work_keys_str_mv | AT yanmingsun studyontheshortestreliablepathofstochastictimedependenttransportationnetworksconsideringwaitingtimeatsignalizedintersections AT jieli studyontheshortestreliablepathofstochastictimedependenttransportationnetworksconsideringwaitingtimeatsignalizedintersections AT shixianliu studyontheshortestreliablepathofstochastictimedependenttransportationnetworksconsideringwaitingtimeatsignalizedintersections |