中大機構典藏-NCU Institutional Repository-提供博碩士論文、考古題、期刊論文、研究計畫等下載:Item 987654321/47420
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 78728/78728 (100%)
Visitors : 33561746      Online Users : 667
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version


    Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/47420


    Title: 隨機旅行時間下跨校選授課專車排程規劃之研究;A scheduling and planning of choosing and teaching inter-school bus under stochastic travel time
    Authors: 陳怡君;Yi-chun Chen
    Contributors: 土木工程研究所
    Keywords: 跨校選授課專車;啟發解法;時空網路;隨機性旅行時間;含額外限制網路流動問題;Heuristic;Time-space network;Stochastic travel times;Inter-school bus;Multiple commodity network flow problem
    Date: 2011-08-04
    Issue Date: 2012-01-05 11:10:17 (UTC+8)
    Abstract: 近年來台灣地區大專院校林立,為加強學校之競爭力,各校間教學合作日益頻繁,校際間之選授課行為及跨校選授課專車亦因應而生。以台灣聯合大學系統為例,現行之跨校選授課專車,目的在於服務台灣聯合大學系統四校之教職員與學生,但跨校選授課專車之班表為人工經驗排班,且未考量實際旅行時間的隨機性,費時且缺乏系統性分析,故無法完善地服務搭乘需求。緣此,本研究針對跨校選授課專車之特性,考量學校立場,構建一隨機性跨校選授課專車排程模式,以期能提供學校方面作為有效規劃之輔助工具,並協助決策者有效地進行規劃。 本研究利用時空網路流動技巧與數學規劃方法,建立一多對多起迄需求之跨校選授課專車排程隨機模式,以最小總加權營運時間為目標,並於網路設計上加上時窗限制以滿足實務之營運條件。本研究並進一步修改隨機模式之履行時間為平均旅行時間,建立一確定性模式。此模式可定式為含額外限制之整數網路流動問題,屬NP-hard問題。為考量實務之大型問題,本研究亦配合CPLEX數學規劃套裝軟體,發展一啟發式演算法,以有效求解問題。最後評估本研究模式與啟發式解法之實用績效,以台灣聯合大學系統為範例進行測試,並針對不同參數進行敏感度分析與方案分析,結果顯示本模式與演算法在實務上可有效的運用,最後提出結論與建議。 With the increasing of universities in Taiwan in recent years, but few of these universities can claim to be a comprehensive research university due to limitation in size and lack of full coverage in disciplines. 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. Such a manual approach is considered to be inefficient and ineffective. In other words, stochastic disturbances arising from variations in car travel times in actual operations are neglected. Therefore, consider the properties of the inter-school bus problem and based on the perspective of school planner, we develop a system-optimized model in this research. The model is expected to be an effective tool for the schools and helps planners to solve problems. In this research, we employed network flow techniques and mathematical programming method, and build a stochastic inter-school bus scheduling model with many-to-many OD demand. 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. Since the problem sizes are expected to be huge in real practice, the models are difficult to be solved in a reasonable time. In addition, to evaluate the performance of stochastic 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 test results show the model to be good and that the solution method could be useful in practice. At last, conclusions and suggestions are given.
    Appears in Collections:[Graduate Institute of Civil Engineering] Electronic Thesis & Dissertation

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML654View/Open


    All items in NCUIR are protected by copyright, with all rights reserved.

    社群 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 ©   - 隱私權政策聲明