碩士 / 國立交通大學 / 運輸科技與管理學系 / 97 / Many transport authorities and operative organizations develop positively transit trip planning systems for elevating level of services, but those algorithms just for one specifically cost, that cloud be number of transfer, travel time, free or walking distance, and not take into real-time information. Given the origin/destination pair, all transit pre-trip systems will find the lowest cost way, and any costs are independent and important. However, if we just take only one cost into plan, the solution may be irrationality, so this paper modified shortest path algorithm to solve this problem. Choosing a specifically cost be an objection and the others could be subjection. In this paper, firstly, we redefined the transit network due to some study indicated shortest path algorithm can’t use on it. Secondly, when passengers use the transit trip planning systems, it will load real-time information. Finally, the transit trip planning systems use the modified shortest path algorithm for planning. The purpose of this research is develops an algorithm, that can plan a trip with minimum main cost and under the other minor cost subject. This paper use travel time as main cost and the minor cost is number of transfer. Therefore, we test the accuracy by using a network which considering the real-time information of buses. The results have shown that the algorithm can generate the reasonable alternatives immediately.
| Identifer | oai:union.ndltd.org:TW/097NCTU5423035 |
| Creators | Jen, Fen-Chieh, 任芬傑 |
| Contributors | Wang, Jin-Yuan, 王晉元 |
| Source Sets | National Digital Library of Theses and Dissertations in Taiwan |
| Language | zh-TW |
| Detected Language | English |
| Type | 學位論文 ; thesis |
| Format | 55 |
Page generated in 0.0201 seconds