臺灣人文及社會科學引文索引資料庫系統

:::

詳目顯示

回上一頁
第 1 筆 / 總合 1 筆   第一頁 上一頁 下一頁 最後一頁
/1頁
題名：線性軸輻路網接駁轉運最適整合模式之研究
作者：邱裕鈞 引用關係
作者(外文)：Yu-Chiun Chiou
校院名稱：國立交通大學
系所名稱：交通運輸研究所
指導教授：藍武王
學位類別：博士
出版日期：1999
主題關鍵詞：線性軸輻路網；接駁；轉運；遺傳演算法；Linear hub-and-spoke network；Feeder；Transfer；Genetic algorithms
原始連結：連回原系統網址new window
相關次數：
  • 被引用次數被引用次數:期刊(1) 博士論文(0) 專書(0) 專書論文(0)
  • 排除自我引用排除自我引用:1
  • 共同引用共同引用:0
  • 點閱點閱:0
本研究探討線性軸輻路網之接駁／轉運課題，首先利用遺傳演算法之編解碼技術，分別構建同時分組、逐步分組及種子分組三模式，俾進行路線分組，以決定路線間之接駁轉運關係，並與層級分組模式比較；其次，構建路網最佳化及排班最佳化模式，求解各路線分組之最佳路網型式及班距。目標函數係求解乘客候車成本（含起站、接駁站及轉運站）、乘客懲罰成本（含轉乘、接送）、業者成本（含營運、車隊），以及場站設置營運成本（含接駁站及轉運站）之總和最小化。
因路線分組模式本質上屬NP-hard問題，為瞭解各模式之尋優效度與效率，本研究以亂數產生之200個樣本進行測試，結果顯示種子分組之尋優效度最佳，但效率最差；逐步分組模式之尋優效度次佳，效率亦次佳。同時分組模式因染色體較長，尋優效度最差。以台汽公司60條國道直達路線為實例應用，發現種子分組尋優效果明顯優於其他模式，經接駁轉運設計後，形成1組直達集合（32條路線）、3組接駁集合（6條路線）及7組轉運集合（22條路線），總成本降低5.18%，顯示接駁轉運確能改善現行之直達服務方式。由敏感度分析知，車輛容量與乘客單位轉乘懲罰成本係影響接駁轉運成功與否之關鍵。因此，若能增加車輛容量，以提高接駁／轉運可能性，並妥為設計接駁站及轉運站之轉乘方式，以減少乘客之不便，將更能加強接駁／轉運系統之功效。
This study discusses the development and application of an integrated feeder/transfer system model in a linear hub-and-spoke network. At first, genetic algorithms are employed to determine the feeder/transfer relationship among routes by clustering the routes into different partition sets. Three models- simultaneous clustering method (SICM), stepwise clustering method (STCM) and cluster seed points method (CSPM)- basing on different coding/decoding techniques are developed and compared with a conventional statistics clustering model- the agglomerative hierarchical clustering method. Then, an algorithm integrating feeder/transfer location selecting, routing, and scheduling is proposed to solve the optimal network and headway for each partition set. The objective function is to minimize the total sum of passenger waiting cost (at origin ends, feeder stops and transfer stations), passenger inconvenience penalty cost (including change vehicles, pick-up and delivery), operator cost (including operation cost and fleet cost), set-up cost (including feeder stops and transfer stations).
Because of the NP-hard character of the routes clustering problem, it is essential to analyze the effectiveness and efficiency of these methods. A testing experiment of 200 randomly generated objects is designed to perform the comparison. The testing result shows that CSPM is the most effective but least efficient method, STCM is second most effective and efficient, SICM is least effective because of its long chromosome. A case study of 60 direct service routes operated by Taiwan Motor Transport Company shows an optimal condition can be reached by clustering these 60 direct-service routes into three feeder sets with 6 routes, seven transfer sets with 22 routes and one direct service with 32 routes. As a result, the total cost is lowered by 5.18%, illustrating that feeder/transfer systems can surely improve a direct service system. The sensitivity analysis indicates that bus seat capacity and change vehicle penalty cost are two key factors in designing a feeder/transfer system. It implies that expanding the bus seat capacity to increase the possibility of feeder/transfer passengers boarding and well designing the transfer arrangement to reduce the inconvenience in changing vehicles would further enhance the performance of an inter-city bus feeder/transfer system.
1.吳清醮[1987]，「大眾運輸準確轉車系統車輛排班之研究」，成功大學交通管理科學研究所，碩士論文。
2.張學孔[1991]，「最佳公車容量與成本特性之分析」，運輸計劃季刊，第二十卷第四期，頁373~405。
3.朱珮芸[1994]，「公車與捷運的協調發車時間」，台灣大學土木工程學研究所，碩士論文。
4.黃泰林[1994]，「構建智慧型適應性網路號誌控制模式之研究」，博士論文，成大交管所。
5.台灣省政府交通處[1996]，「高速公路交流道附近設置轉運站可行性研究」，委託亞聯工程顧問股份有限公司辦理。
6.王慶瑞[1996]，運輸系統規劃，亞聯工程顧問公司。
7.曾國雄、邱裕鈞、許書耕[1997]，「主線欄柵式收費站最佳區位遺傳演算尋優法與逐步尋優法之比較分析」，中國土木水利工程學刊，第九卷第一期，頁171-178。
8.許書耕、陳茂南、邱裕鈞[1997]，「高速公路客運轉運接駁系統運轉規劃」，運輸計劃季刊，第二十卷第三期，頁315-338。
9.林祥生[1997]，「管制環境下城際國道客運服務策略之最佳化分析」，交通大學交通運輸研究所，博士論文。
10.藍武王、林祥生[1997a]，「均質環境下城際國道客運服務策略之最佳化分析」，運輸學刊，第十卷第三期，頁39-78。
11.林祥生、藍武王[1997b]，「異質環境下城際國道客運服務策略之最佳化分析」，運輸學刊，第十卷第四期，頁21-58。
12.李克聰[1995]，「大眾運輸接駁系統最佳化研究」，國科會計畫。
13.藍武王、邱裕鈞[1999]，「線性軸輻路網接駁/轉運區位、路線與排班之規劃─遺傳演算法之應用」，將於運輸計劃季刊刊出。
14.Abkowitz, M. D. [1987], “Operational feasibility of timed transfer in transit systems,” Journal of Transportation Engineering, 113, pp.68-177.
15.Abramowitz, M., and Stegun, I. A. [1964], eds., Handbook of Mathematical Functions, U.S. Department if Commerce, National Bureau of Standards Applied Mathematical Series. 55, 1964.
16.Anderberg, M. R. [1973], Cluster Analysis for Applications, New York: Academic Press.
17.Andreasson, I. [1977], “Volvo approaches to computer-aided transportation planning,” Transportation Research Record, 657, pp.9-14.
18.Ali, A.I. and Thiagarajan, H. [1989], “A network relaxation based enumeration algorithm for set partitioning,” European Journal of Operational Research, 38, pp.76-85.
19.Arisawa, S. and Elmaghraby, S. E. [1977], “The hub and wheel scheduling problems: I. the hub scheduling problem: the myopic case,” Transportation Science, 11, pp.124-146.
20.Assad, A. A. [1980], “Modelling of rail networks: toward a routing/makeup model. Transportation Research, 14B, pp.101-114.
21.Aykin, T. [1995], ”Networking policies for hub-and-spoke systems with application to the air transportation system,” Transportation Science, 29, pp.201-221.
22.Aytug, H., Koehler, G. and Snowdon, J. L. [1994], “Genetic learning of dynamic scheduling within a simulation environment,” Computers and Operations Research, 21, pp.909-925.
23.Baker, J.J., J. Calkin and Sylvester, S. [1988], ”Multi-centered time transfer system for capital metro, Austin, Texas,” Transportation Research Record, 1202, pp.22-28.
24.Bookbinder, J. H. and Desilets, A. [1992], ”Transfer optimization in a transit network,” Transportation Science, 26, pp.106-118.
25.Brucker, P. [1978], ”On the complexity of clustering problems,” in:Beckmenn, M. and Kunzi, H.P.(eds.), Optimization and Operations Research. Lecture Notes in Economics and Mathematical Systems 157, Springer-Berlin, pp.45-54.
26.Cattrysse, D. G. and Wassenhove L.N.V. [1994], ”A set partitioning heuristic for the generalized assignment problem,” European Journal of Operational Research, 72, pp.167-174.
27.Chang S.K. [1990], Analytic Optimization of Bus Systems in Heterogeneous Environments, Ph.D. Dissertation, the University of Maryland.
28.Chang S.K. and P.M. Schonfeld[1991a], “Multiple period optimization of bus transit system,” Transportation Research, Vol. 25B, No.6, pp453-478.
29.Chang S.K. and P.M. Schonfeld[1991b], “Optimization models for comparing conventional and subcription bus feeder services,” Transportation Science, Vol. 25, No.4, pp281-298.
30.Conway, D. G. and Venkataramanan, M. A. [1994], “Genetic search and dynamic facility layout problem,” Computers and Operations Research, 21, pp.955-960.
31.Dobson, G. and Lederer, P. J. [1993], “Airline scheduling and routing in a hub-and-spoke system,” Transportation Science, 27, pp.281-297.
32.El-Darzi, E. [1988], Methods for Solving the Set Covering and Set Partitioning Problems Using Graph Theoretic (Relaxation) Algorithm, Ph.D. Dissertation, Brunel University.
33.El-Darzi, E. and Mitra G. [1995], “Graph theoretic relaxations of set covering and set paritioning problems,” European Journal of Operational Research, 87, pp.109-121.
34.Etcheberry, J. [1977], ”The set covering problem: a new implicit enumeration algorithm,” Operations Research, 25, pp.760-772.
35.Fisher, M.L., Jaikumar, R. and Van Wassenhove, L.N. [1986], ” A multiplier adiustment method for the generalized assignment problem,” Management Science, 32, 9, pp.1095-1103.
36.Garey, M.R., Johnson, D.S. and Stockmeyer, L. [1976], “Some simplified NP-complete graph problems,” Theoretic Computer Science, 1, pp.237-267.
37.Goldberg, D. [1989], Genetic Algorithm in Search, Optimization and Machine Learning, Addison Wesley.
38.Hall, R. W. [1985], “Vehicle scheduling at a transportation terminal with random delay en route,” Transportation Science, 19, pp.308-320.
39.Hagen, L. and Kahng, A. [1991], ”Fast spectral methods for ratios cut partitioning and clustering. Proceedings IEEE International Conference on Computer Aided Design, pp.10-13.
40.Hagen, L. and Kahng, A. [1992], ”New spectral methods for ratios cut partitioning and clustering. IEEE Trans-CAD, 11, 9, pp.1074-1085.
41.Hansen, P. and Delattre, M.[1978], ”Complete-link cluster analysis by graph coloring,” Journal of the American Statistical Association, 73, pp.297-403.
42.Hansen, P. and Jaumard, B. [1987], “Minimum sum of diameters clustering,” Journal of Classification, 4, pp.215-226.
43.Holland, J. H. [1975], Adaptation in Nature and Artificial Systems, University of Michigan press, Ann Arbor.
44.Jensen, R. E. [1969], “A dynamic programming algorithm for cluster analysis,” Operations Research, 12, pp.1034-1057.
45.Johnson, D.S., Aragon, L.A. McGeoch, L.A. and Schevon, C. [1989], ” Optimization by simulated annealing: an experimental evaluation; Part I. Graph partitioning,” Operations Research, 37, 6, pp.865-892.
46.Johnson, R.A. and Wichern D. W. [1988], Applied Multivariate Statistical Analysis, 2nd ed., Prentice-Hall Inc.
47.Karabakal, N., Bean, J.C. and Lohmann, J.R. [1992], A Steepest Descent Multiplier Adjustment Method for Generalized Assignment Problem. Report 91-11, University of Michigan, Ann Arbor, MI.
48.Kernighan, B.W. and Lin, S. [1970], “An efficient heuristic procedure for partitioning graphs, Journal of Bell System Technology, 49, pp.291-307.
49.Klastorin, T.D. [1985], “The P-median problem for cluster analysis: a comparative test using the mixture model approach,” Management Science, 31, 1, pp.84-95.
50.Kohonen, T. [1989], Self-Organization and Associative Memory (3rd ed.), Berlin: Springer-Verlag.
51.Lee, K. K. T. and Schonfeld, P. M. [1991], “Optimal slack time for timed transfer at a transit terminal,” Journal of Advanced Transportation, 25, pp.281-308.
52.Lin, F. T., Kao C. Y. and Hsu, C. C. [1993], “Applying the genetic approach to simulated annealing in solving some NP-hard problems,” IEEE Transactions on Systems, Man and Cybernetics, 23, pp.1752-1767.
53.MacQueen, J. [1967], ”Some methods for classification and analysis of multivariate observations,” Proceedings of Fifth Berkeley Symposium on Mathematical Statistics and Probability, 1, pp.281-297.
54.Martello, S. and Toth, P. [1981], “An algorithm for the generalized assignment problem,” Operational Research’81, 55.J.P. Brams(Ed.), North-Holland, New York.
Michalewicz, Z. [1992], Genetic Algorithms + Data Structures = Evolution Programs, 2nd, Springer-Verlag.
56.Moshe, E. C., Tovey, C. A. and Ammons, J. C. [1996], “Circuit partitioning via set partitioning and column generation,” Operations Research, 44, 1, pp. 65-76.
57.Mulvey J. M. and Crowder H. P. [1979],” Cluster analysis: An application of Lagrangian relaxation,” Management Science, 25, pp.329-340.
58.Nawijn, W.M. [1988], ”Optimizing the performance of a blood analyser: application of the set partitioning problem,” European Journal of Operational Research, 36, pp.167-173.
59.Nemhauster, G.L. and Weber, G.M. [1979], ”Optimal set partitioning, matching and Lagrangian duality,” Naval Research Logistics Quarterly, 26, pp.553-563.
60.Nordstrom, A. L. and Tufekci, S. [1994], “A genetic algorithm for the talent scheduling problem,” Computers and Operations Research, 21, pp.941-954.
61.Pirkul, H. and Rolland E. [1994], ”New heuristic solution procedures for the uniform graph partitioning problem: extensions and evaluation,” Computers and Operations Research, 21, pp.895-907.
62.Pinte'r, J. and Pesti, G. [1991], “Set partition by globally optimized cluster seed points,” European Journal of Operational Research, 51, pp.127-135.
63.Rapp M. H. and Gehner, C. D. [1976], ”Transfer optimization in an interactive graphic system for transit planning,” Transportation Research Record, 619, pp.22-29.
64.Reynolds, M. M. and Hixson, C. D. [1992], ”Transit vehicle meets system: a method for measuring transfer time between transit routes,” Transportation Research Record, 1349, pp.35-41.
65.Salzborn, F. J. M. [1980], ”Scheduling bus system with interchange,” Transportation Science, 14, pp.211-231.
66.Shih, M. C. [1994], A Design Methodology for Bus Transit Route Networks with Coordinated Operations, Ph.D. Dissertation, The University of Texas at Austin.
67.Savelsbergh M. [1997], “A branch-and-price algorithm for the generalized assignment problem,” Operations Research, 45, pp. 831-841.
68.Ting, C. J. [1997], Transfer Coordination in Transit Networks, Ph.D. Dissertation, The University of Maryland at College Park.
69.Trick, M. A. [1992], “A linear relaxation heuristic for the generalized assignment problem,” Naval Research Logistic, 39, pp.137-152.
70.van Nes, R., Hamerslag R. and Immer, B.H. [1988], “The design of public transport networks,” Transportation Research Record, 1202, pp.74-83.
71.Vuchic, V. R., Clarke, J. and Molinero, A. [1983], Timed Transfer System Planning, Design and Operation, US. Department of Transportation, DOT-I-83-28.
72.Ward, J.H. [1963], “Hierarchical grouping to optimize an objective function,” Journal of the American Statistical Association, 58, pp.236-244.
73.Welch, J. W. [1983], “Algorithmic complexity: three NP-hard problems in computational statistics,” Journal of Statistical Computation and Simulation, 15, pp.17-25.
 
 
 
 
第一頁 上一頁 下一頁 最後一頁 top
QR Code
QRCODE

臺灣人文及社會科學引文索引資料庫

目前上線人數：361（臺灣：357，外國：4） ／ 本年度總使用人次：2625314 ／ 訪客人次（自102年09月）：68425242
國家圖書館著作權聲明 Copyright © 2013 All rights reserved.
本館地址: 100201臺北市中山南路20號． 本館地圖及交通資訊．
總機：(02)23619132．最佳瀏覽解析度為1024x768以上