The Schedule-based Transit Pre-Trip Planning Algorithm

• Main Author: 何文基
• Other Authors: 蘇昭銘
• Format: Others
• Language: zh-TW
• Published: 2006
• Online Access: http://ndltd.ncl.edu.tw/handle/35765955616157287972

碩士 === 中華大學 === 運輸科技與物流管理學系碩士班 === 94 === Many transport authorities and operation organizations develop positively transit trip planning systems for increase level of services, but those systems fail to take into account transit service schedule. It is clear that cause the user’s inconvenience. A network analysis model is the key component to provide trip itinerary planning. However, most path finding algorithms for highway network are not suitable for transit networks due to some unique characteristics differences between transit and highway networks, such as time-dependent services, different transit routes on the same street, non-symmetric routing with respect to an origin/destination pair and transit transfers depend on the arrival time of another transit. The purpose of this research is proposed a schedule-based transit trip planning algorithm based on characteristics of transit network. Therefore, we also test the accuracy by using a network which considering the timetables of buses and railway systems. The results show that the algorithm can generate the reasonable alternative immediately.