透過您的圖書館登入
IP:3.21.248.47
  • 學位論文

考慮不確定性分析之車輛途程問題

Uncertainty analysis on Dial-a-Ride Problem

指導教授 : 楊康宏
若您是本文的作者,可授權文章由華藝線上圖書館中協助推廣。

摘要


台灣的社會服務中,身障者服務早已經成為一個健全社會不可或缺的項目之一,隨著法案的頒布以及大眾對於平等生活權之重視,對於身障人士在交通運輸需求上,可利用復康巴士作為身障者達成遠距旅程戶到戶的交通需求。 復康巴士屬於撥召問題(Dial-a-Ride Problem),在問題定義中,有多台復康巴士,由同一場站去接送多組的乘客需求,每位乘客需求皆有時間窗限制,而問題定義與車輛途程問題含時間窗限制(Vehicle Routing Problem with Time window)相似,復康巴士需於時間窗限制內抵達乘客需求點進行服務。本研究透過了解撥召問題之特性,編寫符合此特性之車輛排程演算法;接著,利用演算法求解之結果去探究撥召問題之服務時間、車輛速度以及時間窗長度在考慮不確定性狀況下,對求解結果之影響。結果顯示,車輛總等待時間的部分在服務時間遞增時呈現上升趨勢,在車輛速度遞增時呈現下降趨勢,在時間窗長度遞增時呈現下降趨勢;接著,車輛總旅程時間的部分在服務時間與時間窗長度遞增時無明顯變動趨勢,在車輛速度遞增時呈現下降趨勢;最後,車輛使用數量部分在服務時間遞增時無明顯變動,在車輛速度遞增時呈現下降趨勢,在時間窗長度遞增時呈現下降趨勢。

並列摘要


Social services in Taiwan already become an integral part of a complete society, especially service of disablement. With the promulgation of the bill and noticing about importance of equal rights of life, in the aspect of transporting disabled persons, Dial-a-Ride service is the best way to satisfy a long-distance request for disabilities and let them to reach the destination from door to door. Fu-kang Bus are classified to Dial-a-Ride Problem(DARP), in the definition of the problem, more than one vehicles from a certain station to pick a group of passengers, each demand has a time window constrain. DARP is similar to the Vehicle Routing Problem with Time Windows, all of the services need to be hell within the time window. Through this study, we want to understand the characteristics of the DARP, and then propose a vehicle routing heuristic algorithm. Using this algorithm to analyse three parameters concluding service time, speed of vehicle and time window period under uncertainty condition. And then we discuss the effect of solution results. The results showed that the total waiting time of vehicles showing a upward trend when service time is increasing, showing a downward trend when the vehicle speed is increasing, showing a downward trend when the time window length increments; on the other part, the total traveling time of vehicles have no significant change while increasing the service time and length of time windows, however, when the vehicle speed is increasing it showing a downward trend; Finally, when the service time in increments , the number of vehicles using have no significant change, when the vehicle speed is increasing, it showing a downward trend, when the time window length increments it showing dropped.

參考文獻


張凱勝. (2004). 台北市復康巴士與捷運整合服務之研究. (碩士), 國立台灣大學.
蘇昭銘, 楊琮平. (2000). 先進撥召公車營運管理系統之研究. 中華管理學報, 1, 89-114.
魏建宏, 王穆衡, 蔡欽同, 辛孟鑫. (2007). 台北市復康巴士路線規劃問題之研究. 運輸學刊, 19, 301-332.
陳家和, 丁慶榮. (2005). 應用螞蟻演算法於時窗限制車輛途程問題之研究. 運輸學刊, 3, 261-280.
林奕隆. (2011). 應用蜂群最佳化演算法求解撥召問題-以復康巴士為例. (碩士), 中央大學.

延伸閱讀