請用此 Handle URI 來引用此文件：
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/72753完整後設資料紀錄
| DC 欄位 | 值 | 語言 |
|---|---|---|
| dc.contributor.advisor | 朱致遠 | |
| dc.contributor.author | Shih-Kuan Yang | en |
| dc.contributor.author | 楊士寬 | zh_TW |
| dc.date.accessioned | 2021-06-17T07:05:17Z | - |
| dc.date.available | 2022-07-31 | |
| dc.date.copyright | 2019-07-31 | |
| dc.date.issued | 2019 | |
| dc.date.submitted | 2019-07-26 | |
| dc.identifier.citation | Beaudry, A., Laporte, G., Melo, T., & Nickel, S. (2010). Dynamic transportation of patients in hospitals. OR spectrum, 32(1), 77-107.
Berbeglia, G., Cordeau, J. F., & Laporte, G. (2012). A hybrid tabu search and constraint programming algorithm for the dynamic dial-a-ride problem. INFORMS Journal on Computing, 24(3), 343-355. Braekers, K., Caris, A., & Janssens, G. K. . (2014). Exact and meta-heuristic approach for a general heterogeneous dial-a-ride problem with multiple depots. Transportation Research Part B: Methodological, 67, 166-186. Cordeau, J. F. (2006). A branch-and-cut algorithm for the dial-a-ride problem. Operations Research, 54(3), 573-586. Cordeau, J. F., & Laporte, G. (2003). A tabu search heuristic for the static multi-vehicle dial-a-ride problem. Transportation Research Part B: Methodological, 37(6), 579-594. Coslovich, L., Pesenti, R., & Ukovich, W. (2006). A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem. European Journal of Operational Research, 175(3), 1605-1615. Diana, M., & Dessouky, M. M. (2004). A new regret insertion heuristic for solving large-scale dial-a-ride problems with time windows. Transportation Research Part B: Methodological, 38(6), 539-557. Fabri, A., & Recht, P. (2006). On dynamic pickup and delivery vehicle routing with several time windows and waiting times. . Transportation Research Part B: Methodological, 40(4), 335-350. Fisher, M. L., & Jaikumar, R. (1981). A generalized assignment heuristic for vehicle routing. Networks, 11(2), 109-124. Hyytiä, E., Penttinen, A., & Sulonen, R. . (2012). Non-myopic vehicle and route selection in dynamic DARP with travel time and workload objectives. Computers & Operations Research, 39(12), 3021-3030. Jaw, J. J., Odoni, A. R., Psaraftis, H. N., & Wilson, N. H. (1986). A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windows. Transportation Research Part B: Methodological, 20(3), 243-257. Luo, Y., & Schonfeld, P. (2007). A rejected-reinsertion heuristic for the static dial-a-ride problem. Transportation Research Part B: Methodological, 41(7), 736-755. Marković, N., Nair, R., Schonfeld, P., Miller-Hooks, E., & Mohebbi, M. (2015). Optimizing dial-a-ride services in Maryland: benefits of computerized routing and scheduling. Transportation Research Part C: Emerging Technologies, 55, 156-165. Mitrović-Minić, S., & Laporte, G. (2004). Waiting strategies for the dynamic pickup and delivery problem with time windows. Transportation Research Part B: Methodological, 38(7), 635-655. Santos, D. O., & Xavier, E. C. (2015). Taxi and ride sharing: A dynamic dial-a-ride problem with money as an incentive. Expert Systems with Applications, 42(19), 6728-6737. Sayarshad, H. R., & Chow, J. Y. . (2015). A scalable non-myopic dynamic dial-a-ride and pricing problem. Transportation Research Part B: Methodological, 81, 539-554. Sayarshad, H. R., & Gao, H. O. (2018). A scalable non-myopic dynamic dial-a-ride and pricing problem for competitive on-demand mobility systems. Transportation Research Part C: Emerging Technologies, 91, 192-208. Toth, P., & Vigo, D. (1996). Fast local search algorithms for the handicapped persons transportation problem. In Meta-Heuristics (pp. 677-690). Springer, Boston, MA. | |
| dc.identifier.uri | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/72753 | - |
| dc.description.abstract | 交通主管機關近年來嘗試利用需求反應式的撥召服務以滿足偏鄉地區之大眾運輸需求，本研究針對偏鄉地區之運輸需求特性探討撥召問題之求解，首先對文獻中的代表性撥召問題求解演算法進行比較，接著將等待策略應用於可行性檢查及固定路線時窗以改善過去的方法，最後針對不同參數及策略作案例測試。 | zh_TW |
| dc.description.abstract | The transportation agencies in Taiwan have attempted to satisfy public transportation demand in rural areas via dial-a-ride services. This research studies the dial-a-ride problems focusing on the characteristics of the demands in the rural areas. This study first compares the three representative solution algorithms of the dial-a-ride problem in the literature. To improve the past algorithms, this study applies the waiting strategy to the feasibility check and the waiting strategy to fix time window. Finally, this study tests algorithms under the different parameters and strategies. | en |
| dc.description.provenance | Made available in DSpace on 2021-06-17T07:05:17Z (GMT). No. of bitstreams: 1 ntu-108-R06521535-1.pdf: 3357665 bytes, checksum: ba912072cbe01f42e7dbc3c5f012351e (MD5) Previous issue date: 2019 | en |
| dc.description.tableofcontents | 口試委員審定書 i
誌謝 ii 中文摘要 iii ABSTRACT iv 目錄 v 圖目錄 vii 表目錄 ix 第一章、 緒論 1 1.1 研究動機 1 1.2 研究目的 2 第二章、 文獻回顧 3 第三章、 撥召問題與求解演算法 6 3.1 模式概念與架構 6 3.2 模式限制 8 3.2.1 時窗設定 8 3.2.2 目標式 10 3.2.3 限制式 11 3.3 靜態需求 11 3.3.1 The basic insertion heuristic 12 3.3.2 The parallel regret insertion 13 3.3.3 The rejected-reinsertion heuristic 17 3.3.4 路線改善 22 3.3.5 車隊大小 23 3.3.6 可行性檢查 23 3.3.7 固定時窗 24 3.3.8 等待策略 24 3.4 動態需求 26 第四章、 案例分析 28 4.1 案例產生 28 4.2 靜態需求案例 28 4.2.1 時窗大小分析 29 4.2.2 等待時間及等待策略分析 31 4.2.3 路線改善分析 40 4.3 動態需求案例 44 4.3.1 動態需求比例分析 45 4.3.2 不同策略下動態需求佔比分析 47 第五章、 結論 49 參考文獻 50 | |
| dc.language.iso | zh-TW | |
| dc.subject | 啟發式演算法 | zh_TW |
| dc.subject | 副大眾運輸服務 | zh_TW |
| dc.subject | 撥召問題 | zh_TW |
| dc.subject | 等待策略 | zh_TW |
| dc.subject | 偏鄉地區 | zh_TW |
| dc.subject | Paratransit services | en |
| dc.subject | Heuristics | en |
| dc.subject | Rural area | en |
| dc.subject | Waiting strategies | en |
| dc.subject | Dial-a-ride problem | en |
| dc.title | 偏鄉地區撥召問題求解方法之比較與改善 | zh_TW |
| dc.title | Comparison and improvement of solution methods of
dial-a-ride problems for rural areas | en |
| dc.type | Thesis | |
| dc.date.schoolyear | 107-2 | |
| dc.description.degree | 碩士 | |
| dc.contributor.oralexamcommittee | 許聿廷,蔡豐明,吳沛儒 | |
| dc.subject.keyword | 啟發式演算法,副大眾運輸服務,撥召問題,等待策略,偏鄉地區, | zh_TW |
| dc.subject.keyword | Heuristics,Paratransit services,Dial-a-ride problem,Waiting strategies,Rural area, | en |
| dc.relation.page | 51 | |
| dc.identifier.doi | 10.6342/NTU201902012 | |
| dc.rights.note | 有償授權 | |
| dc.date.accepted | 2019-07-26 | |
| dc.contributor.author-college | 工學院 | zh_TW |
| dc.contributor.author-dept | 土木工程學研究所 | zh_TW |
| 顯示於系所單位： | 土木工程學系 | |
文件中的檔案：
| 檔案 | 大小 | 格式 | |
|---|---|---|---|
| ntu-108-1.pdf 未授權公開取用 | 3.28 MB | Adobe PDF |
系統中的文件，除了特別指名其著作權條款之外，均受到著作權保護，並且保留所有的權利。