English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 80990/80990 (100%)
造訪人次 : 42756872      線上人數 : 2692
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋


    請使用永久網址來引用或連結此文件: http://ir.lib.ncu.edu.tw/handle/987654321/43285


    題名: 跨校選授課專車排程規劃之研究;Inter-school Bus Schedule Planning
    作者: 謝潤曉;Jun-hsiao Hsieh
    貢獻者: 土木工程研究所
    關鍵詞: 跨校選授課專車;含額外限制網路流動問題;時空網路;啟發解法;Inter-school bus;Time-space network;Heuristic;Multiple commodity network flow problem
    日期: 2010-07-16
    上傳時間: 2010-12-08 13:33:28 (UTC+8)
    出版者: 國立中央大學
    摘要: 近年來隨著台灣地區大專院校數量的增加,相對地學生人數與之劇增,各校間教學合作日益頻繁,校際間之選授課行為也因應而生,台灣聯合大學系統即為最佳範例。現行之跨校選授課專車,目的在於服務台灣聯合大學系統之教職員與學生,但跨校選授課專車之班表為人工經驗排班方式進行規劃,因缺乏系統性分析,故無法完善地服務搭乘需求。緣此,本研究針對跨校選授課專車之特性,以學校立場為考量,構建一系統最佳化模式,以期能提供學校方面作為有效規劃之輔助工具,並協助決策者有效地進行規劃。 本研究利用網路流動之技巧與數學規劃方法,建立一考量多對多起迄需求之跨校選授課專車排程模式,以最小車輛數及最小總加權營運時間為目標,於網路設計上,加上時窗限制以滿足實務之營運條件。本研究之模式為含額外限制之多目標整數網路流動問題,屬NP-hard問題,為有效率地求解大規模之問題,本研究利用問題分解策略,且配合CPLEX數學規劃套裝軟體,發展一有效之啟發式解法。最後評估本研究模式與啟發式解法之實用績效,以台灣聯合大學系統為範例測試,並針對不同之參數進行敏感度分析與方案分析,其測試結果良好,最後提出結論與建議。 In recent years, with the increasing of universities in Taiwan, the number of students rises as a result. With this situation, the behavior of having inter-school classes appears. The University System of Taiwan is the best example. Nowadays, the inter-school bus is set up to service the teachers and students of The University System of Taiwan, but the schedule is manually performed by planning personnel with experience in current practice. Without a systematic analysis, it cannot satisfy the demands perfectly. Therefore, in this research, consider the properties of the inter-school bus problem and based on the perspective of school planner, we develop a system-optimized model. The model is expected to be an effective tool for the school, also, it can help planner to solve problems. In this research, we employed network flow techniques and mathematical programming method, and build an inter-school bus scheduling model with many-to-many OD demand. The minimum number of vehicles and the minimum total weighted operating time is our target. In the network design, adds time window limit to meet the practical operating. Model is formulated as an integer multiple commodity network flow problem, which is characterized as NP-hard. To efficiently solve the problems whose sizes are expected to be huge in real practice, we developed a heuristic algorithm by use the problem decomposition strategy with CPLEX software. In addition, to evaluate the performance of inter-school bus model and solution algorithm practice, we take the University System of Taiwan as an example. Performing sensitive and scenario analysis for different parameters, and the result of the model test shows good. Finally, conclusions and suggestions are given. Key words: Inter-school bus, Time-space network, Heuristic, Multiple commodity network flow problem.
    顯示於類別:[土木工程研究所] 博碩士論文

    文件中的檔案:

    檔案 描述 大小格式瀏覽次數
    index.html0KbHTML717檢視/開啟


    在NCUIR中所有的資料項目都受到原著作權保護.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 隱私權政策聲明