The Study of Time-Dependent Shortest Path Problem
碩士 === 國立交通大學 === 運輸工程與管理系 === 88 === This paper focuses on developing an algorithm for time-dependent shortest path problems to provide travelers an efficient and an effective 「pre-trip」 information for route choice. We propose three algorithms in this study：1.the first algorithm does not consider...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2000
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/86718800799384462397 |