簡易檢索 / 詳目顯示

回結果列表
研究生： 楊建志
Yang, Chien-Chih
論文名稱： 撥召公車問題之探討－應用於非營利組織
A Dial-a-Ride Problem Applied in Non-profit Organization
指導教授： 溫于平
Wen, Ue-Pyng
口試委員:
學位類別： 碩士
Master
系所名稱： 工學院 - 工業工程與工程管理學系
Department of Industrial Engineering and Engineering Management
論文出版年： 2010
畢業學年度： 98
語文別： 英文
論文頁數： 37
中文關鍵詞： 撥召公車問題 、路線規劃問題
外文關鍵詞： Dial-a-Ride, Vehicle Routing Problem
相關次數： 點閱：3  下載：0 
分享至:
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報

    • 摘要
    隨著社會福利的發展，老年人與身心障礙者的大眾運輸模式日益受到社會大眾的關注。撥召公車是一種有效且符合老年人與身心障礙者需求的運輸模式。一般而言，撥召公車的服務通常是由非營利組織提供。在本論文中，我們考慮一些特別的限制，例如提供撥召公車服務的組織需要滿足一定的汽車使用率才能向政府社會福利部門申請營運補助經費。我們發展出一個靜態且為固定時窗的混合整數數學模型並且將這個限制加入數學模型中。這個模型的目標函數為最短總旅行時間。實際上，撥召公車排班人員會利用時間矩陣來估計每個地點間的旅行時間，因此我們也利用相同的方式來估計旅行時間。我們把實際需求資料帶到本研究提出的模型中並且將得到的結果與排班人員所排出來的班表進行比較。從比較結果中可以發現到由本研究所提出的模型排出來的班表在汽車總旅行時間與汽車空駛時間上都有較佳的表現。另外，我們試著調整時間窗的大小，我們可以發現到若增加時間窗的範圍，目標函數值會隨之降低，但是計算時間也跟著增加。我們也將此模型應用在不同的汽車上限乘載量。本研究所提出的模型可以被應用在實際需求資料，而且此模式的表現結果比由排班人員所排出來的班表佳。

    關鍵字：撥召公車問題，路線規劃問題

    ABSTRACT
    For developing social welfare, convenient and safe vehicle routes for elderly and disabled has been paid attention. Dial-a-ride (DAR) is one of the efficient transit modes that satisfy the transportation demands of elderly and disabled. In general, DAR service is offered by non-profit organization. In this thesis, we consider the regulation for applying grants of the social welfare department of the government and develop a static mixed-integer model with hard time window. The objective function of the proposed model is to minimize the total traveling time. We estimate the traveling time by time matrix which is an approximate method using in real world. We solve the scheduling problems which were planned by experienced dispatchers by using the proposed model. The result of proposed model is used to compare the rough practicing model which is planned by the dispatchers. The results show that total traveling time and the vehicle riding time without passengers of the proposed model is better than the rough practicing schedule. Furthermore, we try to adjust the range of time window. Increasing the range of time window will reduce the objective function value but increasing the executing time. Besides, the proposed model can be applied by considering multiple riders in a vehicle. The proposed model can solve the DAR request data in real world and the performance of the result is better than the rough practicing schedule.

    Keywords: Dial-a-Ride, Vehicle Routing Problem

    TABLE OF CONTENTS 摘要 I ABSTRACT II 致謝詞 III TABLE OF CONTENTS IV LIST OF FIGURES VI LIST OF TABLES VII 1. INTRODUCTION 1 1.1 Background 1 1.2 Motivation 2 1.3 Purpose 3 1.4 Research Framework 4 2. LITERATURE REVIEW 5 2.1 Single Vehicle Problem 5 2.2 Multi-Vehicle Problem 6 2.2.1 Applications 6 2.2.2 Exact Solution Methods 8 2.2.3 Heuristic Methods 9 3. MODEL FORMULATION 11 3.1. Problem Statement 11 3.1.1. Static Mode 14 3.1.2. Request Type and Time Windows 14 3.1.3. Objective Functions 15 3.1.4. Regulations of Vehicles 16 3.2. Assumptions 16 3.3. Mathematical Formulation 17 4. NUMERICAL ANALYSIS 21 4.1 Time Matrix 21 4.2 Comparison with Rough Practicing (RP) Schedule 24 4.3 Performing in some scenarios 31 5. CONCLUSIONS 34 REFERENCES 36

    REFERENCES
    1. Berbeglia, G., J.F. Cordeau, I. Gribkovskaia, and G. Laporte. "Static pickup and delivery problems: a classification scheme and survey." TOP, 2007: 1-31.
    2. Bodin, LD, and TR Sexton. "The multi-vehicle subscriber dial-a-ride problem." TIMS studies in management sciences, 1986: 73-86.
    3. Borndörfer, R., F. Klostermeier, M. Grötschel, and C. Küttner. Telebus Berlin: Vehicle scheduling in a dial-a-ride system. Technical Report SC 97-23, Berlin: Konrad-Zuse-Zentrum für Informationstechnik, 1997.
    4. Cordeau, J.F. "A Branch-and-Cut Algorithm for the Dial-a-Ride Problem." Operations Research, 2006: 573-586.
    5. Cordeau, J.F., and G. Laporte. "A tabu search heuristic for the static multi-vehicle dial-a-ride problem." Transportation Research Part B: Methodological, 2003: 579-594.
    6. Cullen, F.H., J. J. Jarvis, and H. D. Ratliff. "Set partitioning based heuristics for interactive routing." Networks, 1981: 125 - 143.
    7. Desrosiers, J., Y. Dumas, and F. Soumis. "A dynamic programming solution of the large-scale single-vehicle dial-a-ride problem with time windows." American Journal of Mathematical and Management Sciences, 1986: 301-326.
    8. Diana, M., and M. M. Dessouky. "A new regret insertion heuristic for solving large-scale dial-a-ride problems with time windows." Transportation Research Part B: Methodological, 2004: 539-557.
    9. Dumas, Y., J. Desrosiers, and F. Soumis. "The pickup and delivery problem with time windows." European Journal of Operational Research, 1991: 7-22.
    10. Dumas, Y., J. Desrosiers, and F. Soumis. Large scale multi-vehicle dial-a-ride problems. Research report, Montreal: GERAD, 1989.
    11. Fabri, A., and P. Recht. "On dynamic pickup and delivery vehicle routing with several time windows and waiting times." Transportation Research Part B: Methodological, 2006: 335-350 .
    12. Fischetti, M., and P. Toth. "An Additive Bounding Procedure for Combinatorial Optimization Problems." Operations Research, 1989: 319-328.
    13. Jaw, J. J., A. R. Odoni, H.N. Psaraftis, and N. H.M. Wilson. "A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windows." Transportation Research Part B: Methodological, 1986: 243-257.
    14. Madsen, O. B.G., H. F. Ravn, and J. M. Rygaard. "A heuristic algorithm for a dial-a-ride prohlem with time windows, multiple capacities, and multiple objectives." Annals of Operations Research, 1995: 193-208.
    15. Melachrinoudis, E., A. B. Ilhan, and H. Min. "A dial-a-ride problem for client transportation in a health-care organization." Computers & Operations Research, 2007: 742-759.
    16. Nanry, W. P., and J. W. Barnes. "Solving the pickup and delivery problem with time windows using reactive tabu search." Transportation Research Part B: Methodological, 2000: 107-121.
    17. Psaraftis, H. N. "A Dynamic Programming Solution to the Single Vehicle Many-to-Many Immediate Request Dial-a-Ride Problem." Transportation Science, 1980: 130-154.
    18. Psaraftis, H. N. "An Exact Algorithm for the Single Vehicle Many-to-Many Dial-A-Ride Problem with Time Windows." Transportation Science, 1983: 351-357.
    19. Rekiek, B., A. Delchambre, and H. A. Saleh. "Handicapped Person Transportation: An application of the Grouping Genetic Algorithm." Engineering Applications of Artificial Intelligence, 2006: 511-520.
    20. Savelsbergh, M. W. P. "Local search in routing problems with time windows." Annals of Operations Research, 1985: 285-305.
    21. Sexton, T. R., and L. D. Bodin. "Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: I. Scheduling." Transportation Science, 1985: 378-410.
    22. Sexton, T. R., and L. D. Bodin. "Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: II. Routing." Transportation Science, 1985: 411-435.

    無法下載圖示 全文公開日期 本全文未授權公開 (校內網路)
    全文公開日期 本全文未授權公開 (校外網路)

    QR CODE