固定時刻表下之一般性公路客運車輛排程模式研究

A Generic Vehicle Scheduling Model for Inter-City Bus Carriers under Fixed-Timetable

王晉元(Jin-Yuan Wang) ； 林至康(Chih-Kang Lin)

《運輸計劃季刊》 35卷1期 (2006/03) Pp. 107-130

https://doi.org/10.6402/TPJ.200603.0107

摘要

本研究以公路客運業者為研究對象，在時刻表固定情況下，構建符合臺灣地區現況之一般性多場站車輛排程模式，模式中除考量「最小閒置時間」、「最小營運車輛數」、「勤務中路線調動次數最少」與「勤務里程平均差總和最小」等實際營運需求外，更將「由模式中產生營運車輛數」及「多場站營運時所具有的空駛情況」等兩項重要特性納入模式中，俾使模式更具一般化與實用性。此外本研究更提出兩階段模式求解流程，配合線性函數轉換技巧，使得修正後模式具有0-1整數線性規劃之特性，更利於實務問題之求解使用。測試結果顯示，本研究所提出之模式不僅可滿足單一場站與多場站客運業者之需求，更表現出測試業者於車輛排程上仍有成本節省空間，充份驗證本研究之模式構建與轉換、參數特性證明、求解流程與測試結果等，均具有提供國內公路客運業者與學術界之參考價值。

關鍵字

一般性車輛排程模式 ； 多場站營運 ； 固定時刻表排程

並列摘要

In this paper we proposed a generic model for multiple depots vehicle scheduling problem (MDVSP) tinder fixed-timetable in Taiwan inter-city bus carriers. In this model, many practical factors are considered for bus carriers, such as minimization of vehicle idle time in the depot, number of vehicles, frequency of changing route, and mean mileage deviation in the duties. Besides, two important properties of MDVSP, ”number of required vehicles” and, ”deadhead trips occurred in multiple depot problem”, are also included in this model. A two-staged procedure for solving MDVSP which associates with a linear transference technique for this model was also proposed. The transferred model is not only a binary integer linear programming hut is also convenient to solve. Finally, we conducted two case studies of single and multiple depots using real operating data. The results indicated that the proposed model and the solution procedure are useful for practical operations.

並列關鍵字

Generic vehicle scheduling problem ； Multiple depots operation ； Fixed-timetable scheduling

參考文獻

交通部運輸研究所()。

游文松(2004)。公路客運人員與車輛排班之研究。中華大學科技與管理研究所。

廖椿煜(1985)。公路客運車輛排班調度制度之研究─以臺灣汽車客運公司為例。交通大學交通運輸研究所。

Dantzig, G. B.,Fulkerson, D. R.(1954).Minimizing the Number of Tankers to Meet a Fixed Schedule.Naval Res. Log. Quart..1,217-222.

Bodin, L.,Golden, B.,Assad, A.,Gall, M.(1983).Routing and Scheduling of Vehicles and Crews – the State of the Art.Computers & Operations Research.10,63-211.