求解動態撥召問題 : 以復康巴士為例

機構典藏 > College of Business and Management > Graduate Institute & Department of Information Management > Thesis > Item 987654321/87736

Please use this identifier to cite or link to this item: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/87736

Title:	求解動態撥召問題 : 以復康巴士為例
Other Titles:	Solving the dynamic dial-a-ride problem : case study of fukang buses
Authors:	蔡孟儒;Tsai, Meng-Ru
Contributors:	淡江大學資訊管理學系碩士班鄭啟斌;Cheng, Chi-Bin
Keywords:	撥召服務;復康巴士;掃描法;0-1整數規劃;Dial-a-ride;Fukang Bus;Sweep Algorithm;0-1 Integer Programming
Date:	2013
Issue Date:	2013-04-13 11:37:33 (UTC+8)
Abstract:	復康巴士乃針對身心障礙者而設立之及門服務運輸系統；此類服務亦稱之為撥召運輸系統。復康巴士營運至今，規模漸大，而車輛利用率始終偏低。本研究之目的即在於改善現有派車與路徑規劃方式以提升車輛之利用率；由於考量動態需求，因而形成一個動態撥召問題，也增加了求解的複雜性。　　本研究以0-1整數規劃建模，並以先分群後規劃路徑策略分解原來問題。這樣的策略形成兩階段的求解過程：在第一階段以掃描法分配需求點至各鄰近車輛，第二階段則以最佳化軟體求解各車輛之路徑規劃。藉由多種分群組合的方式反覆找出較佳的解答。 Fukang bus is a door-to-door transportation service system in Taiwan established for the handicapped. Such type of service is also known as dial-a-ride transportation system. Though the scale of the Fukang bus becomes larger and larger, the performance of the system is not satisfactory due to the low utilization of vehicles. The purpose of this study is to improve the dispatch and routing of vehicles to enhance their utilization. This study focuses on the dynamic requests of service and hence makes the route planning a dynamic dial-a-ride problem, which also increases the difficulty in solving the problem. This study uses 0-1 integer programming to model the dynamic dial-a-ride problem, and adopts the cluster-first-routing-second strategy to solve the problem. Such a strategy divides the solution procedure to two stages. In the first stage, the sweep algorithm is employed to allocate demand nodes to their neighboring vehicles, and thus forming a set of single vehicle routing problems. In the second stage, an optimization solver is used to solve the route planning of each vehicle. By performing the sweep algorithm repeatedly with different stating nodes, we can find different combinations of demand clusters and then obtain different routing plans. A best solution is finally found from all combinations.
Appears in Collections:	[Graduate Institute & Department of Information Management] Thesis

Files in This Item:

File	Size	Format
index.html	0Kb	HTML	379	View/Open

Loading...