酒後代駕調度排程最佳化之研究

以作者查詢圖書館館藏

、以作者查詢臺灣博碩士

、以作者查詢全國書目

、勘誤回報

、線上人數：98

、訪客IP：3.15.151.94

姓名

林曉青(Hsiao-Ching Lin) 查詢紙本館藏

畢業系所

土木工程學系

論文名稱

酒後代駕調度排程最佳化之研究

相關論文

★ 橋梁檢測人力機具排班最佳化之研究	★ 勤業務專責分工下消防人員每日勤務排班最佳模式之研究
★ 司機員排班作業最佳化模式之研究	★ 科學園區廢水場實驗室檢驗員任務指派最佳化模式之研究
★ 倉儲地坪粉光工程之最佳化模式研究	★ 生下水道工程工作井佈設作業機組指派最佳化之研究
★ 急診室臨時性短期護理人力指派最佳化之探討	★ 專案監造人力調派最佳化模式研究
★ 地質鑽探工程人機作業管理最佳化研究	★ 職業棒球球隊球員組合最佳化之研究
★ 鑽堡於卵礫石層施作機具調派最佳化模式之研究	★ 職業安全衛生查核人員人力指派最佳化研究
★ 救災機具預置最佳化之探討	★ 水電工程出工數最佳化之研究
★ 石門水庫服務台及票站人員排班最佳化之研究	★ 空調附屬設備機組維護保養排程最佳化之研究

檔案

[Endnote RIS 格式]

[Bibtex 格式]

[相關文章]

[文章引用]

[完整記錄]

[館藏目錄]

至系統瀏覽論文 ( 永不開放)

摘要(中)

為降低酒後駕駛的發生率及致死率，政府鼓勵民眾使用酒後代駕服務，隨著代駕服務的需求量日漸成長，業者如何負擔快速增加的代駕服務需求顯得至關重要。目前實務上代駕司機員以大眾運輸、共享運具、折疊式電動載具等方式，前往代駕服務起點或從代駕服務終點離開，此營運模式恐無法應對未來龐大的代駕服務需求量。有鑑於此，本研究以代駕業者之角度，考量顧客之人身安全，以是否要求代駕司機員之性別為基準將顧客分類，並以最小化系統總成本為目標，構建一代駕調度排程規劃模式，期能協助決策者有效率地進行調度作業排程及人車指派。
　　本研究利用時空網路流動技巧建構代駕調度排程規劃模式，此模式利用C++程式語言與數學規劃軟體CPLEX直接求解，並以圖形搜尋法進行流量分解。同時，為評估模式之實用性及績效，本研究以隨機生成之資料進行範例測試，並調整不同參數和任務需求規模進行敏感度及方案分析。結果顯示本模式能有效地使用資源，且運用於實務上之成效良好。

摘要(英)

To reduce the occurrence and fatality rate of drunk driving incidents, the government encourages the use of designated driving services. As the demand for such services rapidly increases, it becomes crucial for service providers to cope with the growing demand efficiently. Currently, designated drivers travel to the service starting points or leave from the service endpoints using public transportation, shared vehicles, or foldable electric vehicles. However, this operating mode may not be able to meet the future high demand for designated driving services. In view of this, this study considers the personal safety of customers and classifies them based on whether they request drivers of a specific gender from the perspective of designated driving companies. The objective is to minimize the total system cost by constructing a designated driving scheduling model, aiming to assist decision-makers in efficiently scheduling operations and assigning drivers and vehicles.
This study utilizes time-space network flow techniques to construct the designated driving scheduling model, and the model is solved directly using the C++ programming language in combination with the mathematical programming software CPLEX. To evaluate the practicality of the model, the study conducts example tests using randomly generated data and analyzes sensitivity and scenarios by adjusting different parameters and task demand scales. The results demonstrate that the model effectively utilizes resources and yields excellent outcomes when applied in practical settings.

關鍵字(中)

★ 酒後代駕
★ 調度排程
★ 流量分解法
★ 時空網路
★ 整數多商品網路流

關鍵字(英)

論文目次

第一章緒論 1
1.1 研究背景與動機 1
1.2 研究目的與範圍 2
1.3 研究方法與流程 2
第二章文獻回顧 4
2.1 酒後代駕之相關文獻 4
2.2 車輛途程問題之相關文獻 5
2.3 多商品時空網路之相關文獻 7
2.4 文獻評析 8
第三章模式構建 9
3.1 問題描述 9
3.2 代駕調度排程規劃模式 10
3.2.1 模式基本假設 10
3.2.2 代駕調度排程規劃模式時空網路 11
3.2.3 符號說明與數學定式 21
3.2.4 模式驗證 23
3.3 圖形搜尋流量分解法 27
3.4 小結 28
第四章範例測試 29
4.1 資料輸入 29
4.1.1 代駕任務相關資料 29
4.1.2 調度車輛及代駕司機員相關資料 30
4.1.3 網路與其他相關參數 30
4.2 模式發展 32
4.2.1 問題規模 32
4.2.2 模式輸入資料 33
4.2.3 模式輸出資料 33
4.3 測試結果與分析 34
4.4 敏感度分析 39
4.4.1 男性司機人數之敏感度分析 39
4.4.2 女性司機人數之敏感度分析 42
4.4.3 車輛數之敏感度分析 44
4.4.4 替代執行任務成本之敏感度分析 46
4.4.5 車輛乘載限制人數之敏感度分析 48
4.4.6 車輛發車日薪之敏感度分析 50
4.4.7 車輛營運公里成本之敏感度分析 52
4.4.8 司機步行單位成本之敏感度分析 54
4.4.9 女性司機執行無要求任務之成本之敏感度分析 56
4.5 方案分析 58
4.5.1 代駕任務規模之方案分析 58
4.6 小結 60
第五章結論與建議 62
5.1 結論 62
5.2 建議 63
5.3 貢獻 63
第六章參考文獻 64
第七章附錄 67
附錄一　測試範例流量分解後之排程結果 67

參考文獻

〔1〕顏上堯、林妤玲和陳怡君：〈最佳化報廢機車回收場區位途程模式之研究〉，《中國土木水利工程學刊》，第32卷，第2期，2020，135-146頁。
〔2〕顏上堯、張紫鈺和陳怡君：〈防災避難疏散排程規劃之研究〉，《運輸學刊》，第27卷，第4期，2015，565-588頁。
〔3〕衛生福利部國民健康署：18歲以上人口過去一年飲酒率。2015年4月30日，取自https://data.gov.tw/dataset/14486。
〔4〕Arslan, A., Agatz, N., & Srour, F. J. (2023). Model Formulations for Pickup and Delivery Problems in Designated Driver Services. Available at SSRN.
〔5〕Bergen, G., Yao, J., Shults, R. A., Romano, E., & Lacey, J. H. (2014). Characteristics of designated drivers and their passengers from the 2007 National Roadside Survey in the United States. Traffic injury prevention, 15(3), 273-277.
〔6〕Chen, C.-Y., Yan, S., & Wu, Y.-S. (2019). A model for taxi pooling with stochastic vehicle travel times. International Journal of Sustainable Transportation, 13(8), 582-596.
〔7〕Chu, J. C., Yan, S., & Chen, K.-L. (2012). Optimization of earth recycling and dump truck dispatching. Computers & Industrial Engineering, 62(1), 108-118.
〔8〕Chu, J. C., Yan, S., & Huang, H.-J. (2017). A multi-trip split-delivery vehicle routing problem with time windows for inventory replenishment under stochastic travel times. Networks and Spatial Economics, 17, 41-68.
〔9〕Chung, J., Joo, H. H., & Moon, S. (2014). Designated driver service availability and its effects on drunk driving behaviors. The BE Journal of Economic Analysis & Policy, 14(4), 1543-1567.
〔10〕Ghilas, V., Demir, E., & Van Woensel, T. (2016). An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows and scheduled lines. Computers & Operations Research, 72, 12-30.
〔11〕Johnsen, L. C., & Meisel, F. (2022). Interrelated trips in the rural dial-a-ride problem with autonomous vehicles. European Journal of Operational Research, 303(1), 201-219.
〔12〕Litman, T. (2009). Transportation cost and benefit analysis. Victoria Transport Policy Institute, 31, 1-19.
〔13〕Lu, C.-C., Yan, S., & Huang, Y.-W. (2018). Optimal scheduling of a taxi fleet with mixed electric and gasoline vehicles to service advance reservations. Transportation Research Part C: Emerging Technologies, 93, 479-500.
〔14〕Ma, C., He, R., & Zhang, W. (2018). Path optimization of taxi carpooling. PLoS One, 13(8), e0203221.
〔15〕Masmoudi, M. A., Hosny, M., Demir, E., & Pesch, E. (2020). Hybrid adaptive large neighborhood search algorithm for the mixed fleet heterogeneous dial-a-ride problem. Journal of Heuristics, 26, 83-118.
〔16〕Masson, R., Lehuédé, F., & Péton, O. (2013). An adaptive large neighborhood search for the pickup and delivery problem with transfers. Transportation Science, 47(3), 344-355.
〔17〕Masson, R., Lehuédé, F., & Péton, O. (2014). The dial-a-ride problem with transfers. Computers & Operations Research, 41, 12-23.
〔18〕Parragh, S. N., Cordeau, J.-F., Doerner, K. F., & Hartl, R. F. (2012). Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints. OR spectrum, 34, 593-633.
〔19〕Pfeiffer, C., & Schulz, A. (2022). An ALNS algorithm for the static dial-a-ride problem with ride and waiting time minimization. OR spectrum, 44(1), 87-119.
〔20〕Salzman, O., & Stern, R. (2020). Research challenges and opportunities in multi-agent path finding and multi-agent pickup and delivery problems. Paper presented at the Proceedings of the 19th International Conference on Autonomous Agents and MultiAgent Systems.
〔21〕Sombuntham, P., & Kachitvichayanukul, V. (2010). A particle swarm optimization algorithm for multi-depot vehicle routing problem with pickup and delivery requests. Paper presented at the World Congress on Engineering 2012. July 4-6, 2012. London, UK.
〔22〕Tellez, O., Vercraene, S., Lehuédé, F., Péton, O., & Monteiro, T. (2018). The fleet size and mix dial-a-ride problem with reconfigurable vehicle capacity. Transportation Research Part C: Emerging Technologies, 91, 99-123.
〔23〕Ulmer, M. W., Thomas, B. W., Campbell, A. M., & Woyak, N. (2021). The restaurant meal delivery problem: Dynamic pickup and delivery with deadlines and random ready times. Transportation Science, 55(1), 75-100.
〔24〕Wang, S., Yin, J., & Khan, R. U. (2021). Integrated optimization strategy for sustainable shared designated driver ferry vehicle scheduling. Journal of Advanced Transportation, 2021, 1-11.
〔25〕Watson, A., & Watson, B. (2009). The effectiveness of designated driver programs. Journal of the Australasian College of Road Safety, 20(2), 32-37.
〔26〕Yan, S., Chen, C.-Y., & Chang, S.-C. (2013). A car pooling model and solution method with stochastic vehicle travel times. IEEE Transactions on Intelligent Transportation Systems, 15(1), 47-61.
〔27〕Yan, S., Chu, J. C., Hsiao, F.-Y., & Huang, H.-J. (2015). A planning model and solution algorithm for multi-trip split-delivery vehicle routing and scheduling problems with time windows. Computers & Industrial Engineering, 87, 383-393.
〔28〕Yao, Z., Nie, L., Yue, Y., He, Z., Ke, Y., Mo, Y., & Wang, H. (2023). Network periodic train timetabling with integrated stop planning and passenger routing: A periodic time–space network construct and ADMM algorithm. Transportation Research Part C: Emerging Technologies, 153, 104201.

指導教授

顏上堯

審核日期

2023-8-11

推文