:::

詳目顯示

回上一頁
題名:固定時刻表下之一般性公路客運車輛排程模式研究
書刊名:運輸計劃
作者:王晉元 引用關係林至康
作者(外文):Wang, Jin-yuanLin, Chih-kang
出版日期:2006
卷期:35:1
頁次:頁107-130
主題關鍵詞:一般性車輛排程模式多場站營運固定時刻表排程Generic vehicle scheduling problemMultiple depots operationFixed-timetable scheduling
原始連結:連回原系統網址new window
相關次數:
  • 被引用次數被引用次數:期刊(0) 博士論文(1) 專書(0) 專書論文(0)
  • 排除自我引用排除自我引用:0
  • 共同引用共同引用:0
  • 點閱點閱:12
本研究以公路客運業者為研究對象,在時刻表固定情況下,構建符合臺灣地區現況之一般性多場站車輛排程模式,模式中除考量「最小閒置時間」、「最小營運車輛數」、「勤務中路線調動次數最少」與「勤務里程平均差總和最小」等實際營運需求外,更將「由模式中產生營運車輛數」及「多場站營運時所具有的空駛情況」等兩項重要特性納入模式中,俾使模式更具一般化與實用性。此外本研究更提出兩階段模式求解流程,配合線性函數轉換技巧,使得修正後模式具有0-1 整數線性規劃之特性,更利於實務問題之求解使用。測試結果顯示,本研究所提出之模式不僅可滿足單一場站與多場站客運業者之需求,更表現出測試業者於車輛排程上仍有成本節省空間,充份驗證本研究之模式構建與轉換、參數特性證明、求解流程與測試結果等,均具有提供國內公路客運業者與學術界之參考價值。
In this paper, we proposed a generic model for multiple depots vehicle scheduling problem (MDVSP) under 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 but 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.
期刊論文
1.Bodin, L.、Golden, B.、Assad, A.、Ball, M.(1986)。Routing and scheduling of vehicles and crews: The state of the art。Computers and Operations Research,10,63-212。  new window
2.Bodin, L.、Golden, B. L.(1981)。Classification in Vehicle Routing and Scheduling。Networks,11,97-108。  new window
3.Lenstra, J. K.、Rinnooy Kan, A. H. G.(1981)。Complexity of Vehicle Routing and Scheduling Problem。Networks,11,221-227。  new window
4.Beasley, J. E.、Cao, B.(1996)。A Tree Search Algorithm for the Crew Scheduling Problem。European Journal of Operational Research,94(3),517-526。  new window
5.Desaulniers, G.、Desrosiers, J.、Dumas, Y.、Marc, S.、Rioux, B.、Solomon, M. M.、Soumis, F.(1997)。Crew Pairing at Air France。European Journal of Operational Research,97,245-259。  new window
6.顏上堯、杜宇平(2002)。A Network Model for Airline Cabin Crew Scheduling。European Journal of Operational Research,140(3),531-540。  new window
7.Dantzig, G. B.、Fulkerson, D. R.(1954)。Minimizing the Number of Tankers to Meet a Fixed Schedule。Naval Research Logistics Quarterly,1(3),217-222。  new window
8.Ribeiro, C.、Soumis, F.(1994)。A Column Generation Approach to the Multiple Depot Vehicle Scheduling Problem。Operations Research,42,41-52。  new window
9.Orloff, C. S.(1976)。Route Constrained Fleet Scheduling。Transportation Science,10(2),149-168。  new window
10.Carraresi, P.、Gallo, G.(1983)。Network Models for Vehicle and Crew Scheduling。European Journal of Operational Research,16(3),139-151。  new window
11.Paixao, J.、Branco, I. M.(1987)。A Quasi-assignment Algorithm for Bus Scheduling。Networks,17,249-270。  new window
12.Bertossi, A. A.、Carraresi, P.、Gallo, G.(1987)。On Some Matching Problems Arising in Vehicle Scheduling Models。Networks,17,271-281。  new window
會議論文
1.Ball, M.(1980)。A Comparison of Relaxations and Heuristic for Certain Crew and Vehicle Scheduling Problems。0。  new window
學位論文
1.游文松(2004)。公路客運人員與車輛排班之研究(碩士論文)。中華大學。  延伸查詢new window
2.蔡文昉(200106)。大眾運輸排班系統之研究(碩士論文)。國立交通大學。  延伸查詢new window
3.廖椿煜(1985)。公路客運車輛排班調度制度之研究-以臺灣汽車客運公司為例,0。  延伸查詢new window
圖書
1.Ford, L. R.、Fulkerson, D. R.(1962)。Flows in networks。New Jersey:Princeton University。  new window
2.Desrosiers, J.(1995)。Time Constrained Routing and Scheduling。Network Routing。Amsterdam, Netherlands/ New York, NY。  new window
其他
1.交通部運輸研究所(2004)。運輸資料分析,0。  延伸查詢new window
 
 
 
 
第一頁 上一頁 下一頁 最後一頁 top
QR Code
QRCODE