跳到主要內容

臺灣博碩士論文加值系統

(18.97.14.84) 您好!臺灣時間:2024/12/03 21:53
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果 :::

詳目顯示

我願授權國圖
: 
twitterline
研究生:李思謙
研究生(外文):Lee, Szu-Chien
論文名稱:軌道運輸系統行前旅次規劃問題之研究
論文名稱(外文):An Application of Shortest Path Methods to A Pre-trip Planning System of Taiwan Railway Companies
指導教授:李治綱李治綱引用關係
指導教授(外文):Lee Chi-Kang
學位類別:碩士
校院名稱:國立成功大學
系所名稱:交通管理(科學)學系
學門:運輸服務學門
學類:運輸管理學類
論文種類:學術論文
論文出版年:1997
畢業學年度:85
語文別:中文
論文頁數:107
中文關鍵詞:行前旅次規劃軌道運輸最短路徑高速鐵路
外文關鍵詞:pre-trip planningshortest pathrail transportationhierarchical network
相關次數:
  • 被引用被引用:3
  • 點閱點閱:101
  • 評分評分:
  • 下載下載:0
  • 收藏至我的研究室書目清單書目收藏:2
隨著高鐵的規劃、台鐵的營運改善以及各地捷運系統之陸續興建,本
研究乃針對國內未來包含台鐵、高鐵與捷運之軌道運輸系統,探討其發展
行前旅次規劃系統之可行性。 本研究首先就國外鐵路旅次行前旅次規
劃問題之求解方法進行探討與瞭解,並根據國內未來軌道運輸系統之發展
構建一適當之實證路網。之後,我們使用標記設定法與時空網路以及
DYNET演算法與間斷性動態網路,以求解國內軌道運輸系統之行前旅次規
劃問題,同時並探討這些方法在實務上之應用情形。而本研究亦根據實務
上之需要,以YEN的多條最短路徑方法為本研究所使用之一條最短路徑方
法,發展多條最短路徑方法,並利用多條最短路徑方法之特性改善求解品
質,使得我們在求解軌道運輸系統之行前旅次規劃問題時,能夠搜尋出更
符合旅客需要之乘車方式。 經過本研究之測試,我們能夠利用多條最
短路徑方法為旅客提供多種最佳乘車建議,使旅客能根據其需要而從這些
乘車方式中選擇其最滿意之方式。同時我們也能利用本研究之品質改善方
法,改善一種乘車方式與多種乘車方式之搜尋品質。

In order to improve the utilization of public transportation
services,it is important to establish a pre-trip planing system
such that we canintegrate related service information of all
transportation companies aswell as to generate valuable trip
suggestions to possible trip makers.In this study, a prototype
trip planning system for the planed Taiwanrailway system is
discussed, which includes the western area's high speedrail, the
around island Taiwan railway, and some connecting transit
andcommuter rail lines. In the study, two issues on the trip
planning system are discussedin detail: first, how to create a
network data with sensible meaning inthe real world and
practical size for the computation works; and secondly,how to
select and use appropriate shortest path methods to generate
valuabletrip suggestions. A hierarchical network structure is
proposed for thesystem, in which only one fourth of railway
stations are considered in themain network as the nodes with
transfer possibility, and the possibleconnections between the
other stations and the main stations are consideredin the
second-level network. Only the trip planning problem on the
mainnetwork is investigated with the shortest path methods,
because the solutionof the problem on the second-level network
is in general straight forward.Then we use label setting method
matching with time-space network and DYNETalgorithm matching
with discrete dynamic network to solute the pre-tripplanning
problem of domestic rail transportation system through
thehierarchical network we proposed. Because of the practical
needs, we alsodeveloped k-shortest path method basing on the one
shortest path methodswe used to improve the trip suggestion
qualities. The major findings of the study are as follows:
1.We can reduce thenetwork data by using hierarchical network
structure. 2.Compared with the label setting method matching
with time-space network, DYNET algorithm matching with discrete
dynamic network has less running time. 3.By the means of k-
shortest path method, we can offer more than one kind of trip
suggestion for trip makers, and we can also provide the trip
suggestion with less transferring times for trip makers.

QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top