隨機旅行時間下跨校選授課專車排程規劃之研究

A scheduling and planning of choosing and teaching inter-school bus under stochastic travel time

陳怡君(Yi-chun Chen)

指導教授 ： 顏上堯

國立中央大學/工學院/土木工程學系/碩士(2011年)

摘要

近年來台灣地區大專院校林立，為加強學校之競爭力，各校間教學合作日益頻繁，校際間之選授課行為及跨校選授課專車亦因應而生。以台灣聯合大學系統為例，現行之跨校選授課專車，目的在於服務台灣聯合大學系統四校之教職員與學生，但跨校選授課專車之班表為人工經驗排班，且未考量實際旅行時間的隨機性，費時且缺乏系統性分析，故無法完善地服務搭乘需求。緣此，本研究針對跨校選授課專車之特性，考量學校立場，構建一隨機性跨校選授課專車排程模式，以期能提供學校方面作為有效規劃之輔助工具，並協助決策者有效地進行規劃。
本研究利用時空網路流動技巧與數學規劃方法，建立一多對多起迄需求之跨校選授課專車排程隨機模式，以最小總加權營運時間為目標，並於網路設計上加上時窗限制以滿足實務之營運條件。本研究並進一步修改隨機模式之履行時間為平均旅行時間，建立一確定性模式。此模式可定式為含額外限制之整數網路流動問題，屬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.

並列關鍵字

Heuristic ； Time-space network ； Stochastic travel times ； Inter-school bus ； Multiple commodity network flow problem

參考文獻

29. 楊大輝、李綺容(2007)，「需求變動下之航空貨運網路規劃」，運輸學刊，第十九卷，第二期，第169-189頁。

32. 韓復華、朱政威(2010)，「通勤交通車路線問題模式與巨集啟發式解法」，運輸計劃季刊，第三十九卷，第二期，133-164頁。

35. 顏上堯、齊志仁、湯慶輝(2005)，「隨機需求下多目標長途客運排程模式之研究」，運輸計畫季刊，第三十四卷，第一期，第93-118頁。

10. 邱明琦、陳春益、林佐鼎(2002)，「海運貨櫃排程模式之研究」，運輸計劃季刊，第三十一卷，第三期，第495-522頁。

20. 陳春益、邱明琦(2002)，「貨櫃航線網路設計模式之研究」，運輸計劃季刊，第三十一卷，第二期，第267-298頁。