| Autor: |
Xie, Zhi-ying, He, Yuan-Rong, Jiang, Yuan-tong, Chen, Chih-Cheng |
| Jazyk: |
angličtina |
| Rok vydání: |
2021 |
| Předmět: |
|
| Zdroj: |
Scientific Programming. |
| ISSN: |
1058-9244 |
| DOI: |
10.1155/2021/9922466 |
| Popis: |
Real-time vehicle guidance effectively reduces traffic jams and improves the operational efficiency of urban transportation. The trip time on a route is considered as a random process that changes with time, and the shortest path selection requires a random dynamic model and the solution of a decision-making problem. Thus, the shortest trip time is the criterion to determine the dynamic path selection by a random dynamic programming (DP) model which discretizes the trip times in the continuous segments on the route. In this study, a numerical model of random dynamic programming is established by using a probability tree model and an AND/OR (AO∗) algorithm to select the path of the shortest trip time. The results show that the branches of the probability tree are only accumulated on the “quantity” and do not cause a “qualitative” change. The inefficient accumulation of “quantity” affects the efficiency of the algorithm, so it is important to separate the accumulation of “quantity” from node expansion. The accumulation of “quantity” changes the trip time according to the entering time into a segment, which demands an improved AO∗ algorithm. The new AO∗ algorithm balances between efficiency and the trip time and provides the optimal real-time vehicle guidance on the road. |
| Databáze: |
OpenAIRE |
| Externí odkaz: |
|
