博碩士論文 107322083 詳細資訊




以作者查詢圖書館館藏 以作者查詢臺灣博碩士 以作者查詢全國書目 勘誤回報 、線上人數:10 、訪客IP:18.191.234.62
姓名 陳彥安(Yen-An Chen)  查詢紙本館藏   畢業系所 土木工程學系
論文名稱 道路路面緊急搶修排程最佳化
相關論文
★ 橋梁檢測人力機具排班最佳化之研究★ 勤業務專責分工下消防人員每日勤務排班最佳模式之研究
★ 司機員排班作業最佳化模式之研究★ 科學園區廢水場實驗室檢驗員任務指派 最佳化模式之研究
★ 倉儲地坪粉光工程之最佳化模式研究★ 生下水道工程工作井佈設作業機組指派最佳化之研究
★ 急診室臨時性短期護理人力 指派最佳化之探討★ 專案監造人力調派最佳化模式研究
★ 地質鑽探工程人機作業管理最佳化研究★ 職業棒球球隊球員組合最佳化之研究
★ 鑽堡於卵礫石層施作機具調派最佳化模式之研究★ 職業安全衛生查核人員人力指派最佳化研究
★ 救災機具預置最佳化之探討★ 水電工程出工數最佳化之研究
★ 石門水庫服務台及票站人員排班最佳化之研究★ 空調附屬設備機組維護保養排程最佳化之研究
檔案 [Endnote RIS 格式]    [Bibtex 格式]    [相關文章]   [文章引用]   [完整記錄]   [館藏目錄]   至系統瀏覽論文 ( 永不開放)
摘要(中) 當道路新建完成,維持其服務水準於最佳狀態,使民眾通行無阻兼安全無虞,為道路養護的重要宗旨。除了日常每日例行巡檢養護的災害預防,當遭遇天然災害或其他突發事件時,第一時間需即時應變進行緊急修補的道路搶修小組更是從中扮演重要的角色。他們需要在最短的時間內完成臨時修補,以防坑洞隨著時間與使用持續擴大,造成額外的損害,而後續才會再經由其他養護工程內容進行完整的道路鋪面。過去雖然已經有研究針對緊急搶修工作隊進行探討,但多半著重於道路阻斷限制與後端物資配送最佳化之探討,與道路路面搶修小組同時扮演著搶修工作隊與物料需求補給之角色特性不盡相同,故其模式難以運用在道路路面搶修排程問題。
緣此,本研究利用時空網路流動與數學規劃,以系統最佳化的觀點,在總營運成本最小化目標下,考量實務上相關營運限制,以平均旅行時間構建一確定性道路路面緊急搶修模式。另外,本研究可定義為一含額外限制之整數網路流動問題,屬於NP-Hard問題,為了有效求解實務上大型問題,發展一啟發解法以求解問題,藉由分解問題之觀念,配合CPLEX數學規劃軟體進行模式求解。最後,為了測試本研究模式之實用績效,本研究以第一養護工程處中壢工務段為例,並參考2017年發生的尼莎與海棠雙颱風實際案例,設計三項不同規模大小之範例進行測試與分析,進而提出結論與建議。
摘要(英) When built a new road, maintaining its service level and make road users pass unimpeded is the most important purpose of road maintenance. In addition to the disaster prevention of daily routine inspection and maintenance, when encountering natural disasters or other emergencies, the work team that deal with emergency is also plays an important role. They need to complete temporary repairs in the shortest time to prevent the potholes from continuing to expand over time and use. Most of the emergency repair work schedule in the past were focus on the road blocking constraints and the optimization of logistical support, however, those properties are not similar with this case. In this case, the road emergency repair work team is playing the role of emergency repair team and logistical support at the same time, therefore, the model is difficult to apply to this case.
Hence, we employ network flow techniques, with a systemic optimization perspective and the objective of minimizing the total system cost, as well as the related operating constraints, to construct a deterministic road emergency repair scheduling model. Furthermore, this model is formulated as an integer multiple-commodity network flow problem which is characterized as NP-hard. In order to efficiently solve realistically large problems occurring
in practice, we use a problem decomposition technique a, coupled with the use of a mathematical programming solver CPLEX, to develop a heuristic algorithm. Then, the numerical tests are performed using the first maintenance office data associated with Taoyuan City , Taiwan. Referring to the actual case of the double typhoons Nisha and Begonia in 2017, three case study of different sizes were designed for evaluate the model and the solution algorithm in practice. At last, conclusions and suggestions will be given.
關鍵字(中) ★ 道路養護
★ 緊急搶修排程
★ 時空網路
★ 啟發解法
★ 整數網路流動
★ 最佳化
關鍵字(英) ★ road maintenance
★ road emergency repair scheduling
★ time-space network
★ heuristic
★ integer multiple-commodity network flow problem
★ optimization
論文目次 摘要 i
ABSTRACT ii
誌 謝 iii
目錄 iv
圖目錄 vi
表目錄 viii
第一章 緒論 1
1.1研究背景與動機 1
1.2研究目的與範圍 2
1.3研究方法與流程 3
第二章 文獻回顧 5
2.1災後工程緊急搶修作業排程 5
2.2道路養護 7
2.3車輛途程問題(vehicle routing problem,VRP) 8
2.4文獻評析 12
第三章 模式構建 13
3.1現況分析與問題描述 13
3.2模式架構 16
3.2.1模式基本假設 16
3.2.2時空網路圖 17
3.2.3符號說明 33
3.2.4數學定式 35
3.3模式驗證 40
3.4模式求解方法 48
3.4.1啟發式演算法架構 48
3.4.2啟發解應用 50
3.5小結 53
第四章 範例測試 54
4.1資料輸入 54
4.1.1儲存所與需求點相關資料 54
4.1.2運送及檢修相關資料 57
4.1.3成本相關資料 59
4.2模式發展 60
4.2.1問題規模 60
4.2.2電腦演算環境與設定 61
4.2.3模式輸入資料 62
4.2.4模式輸出資料 62
4.2.5演算法績效測試 63
4.3方案分析 63
4.4測試結果與分析 69
4.5敏感度分析 78
4.5.1罰金變動之敏感度分析 79
4.5.2超時額外成本變動之敏感度分析 81
4.5.3儲存所區位之敏感度分析 84
4.5.4物料需求量變動之敏感度分析 86
4.5.5維修時間變動之敏感度分析 91
4.6小結 96
第五章 結論與建議 97
5.1結論 97
5.2建議 98
5.3貢獻 99
參考文獻 100
參考文獻 1. 交通部公路總局,公路養護手冊,2019年。
2. 網路資料:交通部公路總局第一養護工程處。2019年,取自https://thbu1.thb.gov.tw/。
3. 古家福(2016),「隨機需求下防汛搶險器材佈署最佳化之研究」,碩士論文,國立中央大學土木工程研究所。
4. 康家瑜(2018),「大規模行人模擬及其於災害疏散之應用」,碩士論文,國立臺灣大學土木工程學研究所。
5. 張玖(2008),「精進臺灣市區道路養護管理策略之初步探討」,碩士論文,國立中央大學土木工程研究所。
6. 陳文德(2005),「台灣地區道路管理維護精進策略之研究」,碩士論文,國立中央大學土木工程研究所。
7. 陳永林(2003),「HDM-4 運用於國內高速公路養護管理之研究」,碩士論文,國立中央大學土木工程研究所。
8. 楊大輝、李綺容(2007),「需求變動下之航空貨運網路規劃」,運輸學刊,19卷2期,頁169-189。
9. 潘柏彰(2013),「公共服務簽約外包管理之研究 -以台中市道路養護為例」,碩士論文,東海大學行政管理暨政策學系研究所。
10. 謝家安(2008),「道路養護管理執行績效提升策略之研究-以龍潭鄉為例」,碩士論文,國立中央大學土木工程研究所。
11. 顏上堯、宋宏剛、林漢俊(2010),「防汛搶險器材調派最佳化之研究」,中國土木水利工程學刊,22卷3期,頁341-350。
12. 顏上堯、林妤玲、陳怡君(2020),「最佳化報廢機車回收場區位途程模式之研究」,中國土木水利工程學刊,32卷2期,頁135-146。
13. 顏上堯、范琇綾、 陳怡君(2016),「橋樑定期檢測作業排程最佳化模式之研究」,運輸計劃季刊,45卷1期,頁63-79。
14. 顏上堯、陳佳宏、 陳怡君、 廖建韋(2016),「日常營運下動態醫療物資輸配送規劃之研究」,中國土木水利工程學刊 ,28卷3期,頁175-184。
15. 顏上堯、黃紀涵、陳怡君(2018),「營建廢棄物清運車輛排程暨處理場選址最佳化之研究」,運輸計劃季刊,47第4期,頁297-318。
16. Alexey,K., Vladimir, Y. and Igor,P. (2018), “Evaluation of road repair efficiency in terms of ensuring traffic quality and safety”, Transportation Research Procedia, Vol.36, pp. 627-633.
17. Bodin L. and Golden B. (1981), “Classification in vehicle routing and scheduling.”, Networks, Vol. 11, pp.97-108.
18. Bodin, L., Golden, B., Assad, A. and Ball, M. (1983), “Routing and Scheduling of Vehicles and Crews, The State of the Art.”, Computer & Operations Research, Vol. 10 ,Issue 2, pp.63-211.
19. Chen, H.K., Chou, H.W., Ho, P.S. and Wang, H. (2011), “Real-time vehicle routing for repairing damaged infrastructures due to natural disasters. ”, Mathematical Problems in Engineering 2011, pp. 1-25.
20. Chiou, Y.C. and Lai, Y.H. (2008), “An integrated multi‐objective model to determine the optimal rescue path and traffic controlled arcs for disaster relief operations under uncertainty environments.”, Journal of Advanced Transportation Vol.42, Issue 4, pp. 493-519.
21. Chu, J., Yan, S., and Huang, H. (2017), “A Multi-Trip Split-Delivery Vehicle Routing Problem with Time Windows for Inventory Replenishment Under Stochastic Travel Times.”, Networks and Spatial Economics, Vol. 17 , Issue 1, pp. 41-68.
22. Desaulniers, G., Desrosiers, J., Dumas, Y., Solomon, M.M. and Soumis, F. (1997), “Daily aircraft routing and scheduling. ”, Management Science, Vol. 43, Issue 64, pp.841-855.
23. Doğan, A., Bilici, İ., Demiral, O. et al. (2020), “Building a Decision Support System for Vehicle Routing Problem: A Real-Life Case Study from Turkey.”, Lecture Notes in Mechanical Engineering, pp. 661-675.
24. Garey, M.R. and Johnson, D.S. (1979), “ Computers and Intractability: A Guide to the Theory of NP-Completeness.”, ISBN 0-7167-1045-5.
25. Garraín, D. and Lechón, Y. (2019), “Environmental footprint of a road pavement rehabilitation service in Spain”, Journal of Environmental Management, vol.252, Article 109646.
26. Haghani, A. and Oh, S. (1996), “Formulation and solution of a multi-commodity, multi-modal network flow model for disaster relief operations. ”, Transportation research Part A, Vol. 30, pp. 231-250.
27. Li, S. ,Ma,Z. and Teo, K.L. (2020), “A new model for road network repair after natural disasters: Integrating logistics support scheduling with repair crew scheduling and routing activities. ”,Computers & Industrial Engineering, vol.145, Article 106506.
28. Lu, C.C., Yan, S. and 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, Vol.93, pp. 479-500.
29. Mesquita, M. and Paixão, J. (1992), “Multiple depot vehicle scheduling problem: A new heuristic based on quasi-assignment algorithms.”, Computer-Aided Transit Scheduling, pp.167-180.
30. Sakiani, R., Seifi, A., and Khorshiddoust, R.R. (2020), “Inventory routing and dynamic redistribution of relief goods in post-disaster operations.”, Computers and Industrial Engineering, Vol. 140, Article106219.
31. Steinzen, I., Gintner, V. and Suhl, L. (2010), “A time-space network approach for the integrated vehicle-and crew-scheduling problem with multiple depots.”, Transportation Science, Vol. 44, Issue 3, pp.367-382.
32. Yan, S. and Chang, C. W. and Tang ,C. (2009), “Short-term work team scheduling models for effective road repair and management. ”, Transportation Planning and Technology , Vol. 32, Issue 3 , pp. 289-311.
33. Yan, S. and Chen, C.Y. (2011), “An optimization model and a solution algorithm for the many-to-many car pooling problem.”, Annals of Operations Research, Vol. 191,Issue 1, pp.37-71.
34. Yan, S. and Shih, Y.L. (2009), “Optimal emergency roadway repair and subsequent relief distribution, ”,Computers and Operations Research, Vol. 36, Issue 6, pp. 2049-2065.
35. Yan, S. and Shih, Y.L. (2007), “A time-space network model for work team schedulingafter a major disaster, ”, Journal of the Chinese Institute of Engineers, Vol. 30, No.1, pp. 63-75.
36. Yan, S., Lai, W.S. and Chen, M.N. (2008), “Production scheduling and truck dispatching of ready mixed concrete. ”, Transportation Research Part E, Vol. 44, pp.164-179.
37. Yan, S., Lin, C.K. & Chen, S.Y. (2012), “Optimal Scheduling of Logistical Support for an Emergency Roadway Repair Work Schedule.”, Engineering Optimization, Vol. 44, Issue 9, pp.1035-1055.
38. Yan, S., Lin, C.K.and Chen, S.Y. .(2014), “Logistical support scheduling under stochastic travel times given an emergency repair work schedule.”, Computers & Industrial Engineering. Vol.67, pp. 20-35.
39. Yan, S., Lin, J.R. and Lai, C.W. (2013), “The planning and real-time adjustment of courier routing and scheduling under stochastic travel times and demands.”, Transportation Research Part E: Logistics and Transportation Review, Vol. 53, pp.34-48.
40. Yan, S., Wang, S.S. and Wu, M.W. (2012), “A model with a solution algorithm for the cash transportation vehicle routing and scheduling problem.”,Computers & Industrial Engineering,Vol. 63, Issue2, pp.464-473.
41. Yan, S. and Young, H. F. (1996), “A decision support framework for multi-fleet routing and multi-stop flight scheduling, ” Transportation Research, Vol. 30A, pp.379-398.
42. Zhang, H. and Liu, M. (2015), “A chance-constrained programming model for medical resources order and distribution scheduling based on time-space network. ”, International Conference on Logistics, Informatics and Service Sciences (LISS), pp.1-5.
指導教授 顏上堯(Shang-Yao Yan) 審核日期 2020-7-20
推文 facebook   plurk   twitter   funp   google   live   udn   HD   myshare   reddit   netvibes   friend   youpush   delicious   baidu   
網路書籤 Google bookmarks   del.icio.us   hemidemi   myshare   

若有論文相關問題,請聯絡國立中央大學圖書館推廣服務組 TEL:(03)422-7151轉57407,或E-mail聯絡  - 隱私權政策聲明