A Study of Possible Travel Routes in Time-Dependent Networks
碩士 === 國立交通大學 === 運輸科技與管理學系 === 94 === Time dependent route guidance and travel estimation are important elements in a Advanced traveler information system（APTS）. Most previous researches focus on providing shortest paths; but neglect the occurrence probability. This shortage results in the extreme...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2006
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/25055363999717139974 |
| Summary: | 碩士 === 國立交通大學 === 運輸科技與管理學系 === 94 === Time dependent route guidance and travel estimation are important elements in a Advanced traveler information system（APTS）. Most previous researches focus on providing shortest paths; but neglect the occurrence probability. This shortage results in the extreme low probability of the provided route.
We propose three procedures to determine possible travel routes and their associated probabilities in a time-dependent network. The first and the second algorithm generate possible travel time range of the suggested path based on the algorithm proposed by Miller-Hooks and Mahmassani (1998). The third algorithm calculates the occurrence probabilities of a given route. The computation complexity of these three algorithms is also analyzed.
We use simulated data to evaluate performance of these three algorithms. The testing results shows that these algorithms are efficient and can provide useful information to travelers.
|
|---|