道路災害搶修與緊急物流配送問題之探討

以作者查詢圖書館館藏

、以作者查詢臺灣博碩士

、以作者查詢全國書目

、勘誤回報

、線上人數：34

、訪客IP：3.139.72.78

姓名

廖慧凱(Hui-Kai Liao) 查詢紙本館藏

畢業系所

土木工程學系

論文名稱

道路災害搶修與緊急物流配送問題之探討
(A study on network reconstruction and relief logistics)

相關論文

★ 圖書館系統通閱移送書籍之車輛途程問題	★ 起迄對旅行時間目標下高速公路匝道儀控之研究
★ 結合限制規劃法與螞蟻演算法求解運動排程問題	★ 共同邊界資料包絡分析法在運輸業之應用-以國內航線之經營效率為例
★ 雙北市公車乘客知覺服務品質、知覺價值、滿意度、行為意向路線與乘客之跨層次中介效果與調節式中介效果	★ Investigating the influential factors of public bicycle system and cyclist heterogeneity
★ A Mixed Integer Programming Formulation for the Three-Dimensional Unit Load Device Packing Problem	★ 高速公路旅行時間預測之研究--函數資料分析之應用
★ Behavior Intention and its Influential Factors for Motorcycle Express Service	★ Inferring transportation modes (bus or vehicle) from mobile phone data using support vector machine and deep neural network.
★ 混合羅吉特模型於運具選擇之應用-以中央大學到桃園高鐵站為例	★ Preprocessing of mobile phone signal data for vehicle mode identification using map-matching technique
★ 含額外限制式動態用路人均衡模型之研究	★ 動態起迄旅次矩陣推估模型之研究
★ 動態號誌時制控制模型求解演算法之研究	★ 不同決策變數下動態用路人均衡路徑選擇模型之研究

檔案

[Endnote RIS 格式]

[Bibtex 格式]

[相關文章]

[文章引用]

[完整記錄]

[館藏目錄]

[檢視]

[下載]

本電子論文使用權限為同意立即開放。
已達開放權限電子全文僅授權使用者為學術研究之目的，進行個人非營利性質之檢索、閱讀、列印。
請遵守中華民國著作權法之相關規定，切勿任意重製、散佈、改作、轉貼、播送，以免觸法。

摘要(中)

每當重大災害發生時，決策者必須在極短時間內將救災人員與救災機具做出適當的調度，以求有效的降低災區人員與財產之損失。本研究根據救災系統高階管理人員與中、低階技術人員對救災項目優先性的不同觀點，將救災問題建構為具主從關係(leader-follower)的雙層規劃模型(bi-level programming model)。上層問題為在黃金72小時內完成初部道路搶通，追求修復道路服務績效最大，以期達到系統最佳化；下層問題為物資配送問題，但不同於傳統含軟時窗限制與揀配貨物的車輛途程問題，本研究為建構在受破壞路網中貨物揀配的路線安排之模式，並以提出之演算法進行求解分析。以期在此階級式架構(hierarchical structure)下達到Stackelberg競局之系統均衡狀態，所獲結果作為執行疏散物流(relief logistics) 需求配送之主要依據。

摘要(英)

Natural disasters and accidents without serious concern often lead to dread consequences. Whereas the scarceness of resources affects the rescue performances largely, appropriate rescue deployment will be a main task to the decision maker. However, the preferred objectives between managing staff and operational staff are often hierarchical and conflicting so that the problem is modeled as a binary integer mathematical bilevel programming problem (BLPP) in accordance with Stackelberg game. Managing staff, as upper level, pursues to rescue most suffered people by recovering affected area with breakage in 72 hours, and operational staff, as lower level, seeks for a way to deliver or pick up the most relief goods and medical supplies as quick as possible. In particular, emergency vehicles and rescue troops are not necessarily required to go back to the depot where they depart. Decision maker attempts to service all the requests in the disaster area by forming efficient routes, at least nominally, subject to vehicle capacity, performance, and soft time window constraints. To deal with the linear 0-1 integer bilevel model, a heuristic algorithm will be developed to solve the hierarchical relief logistics in blocked areas problem through an iteratively intermediate solution which is generated by fixing upper level binary variables in turn from inducible region and then to reach a feasible solution. Finally, the result is applied to provide analytical information to decision maker for decision-making.

關鍵字(中)

★ 主從關係
★ 黃金72小時
★ 雙層規劃問題
★ 系統最佳化
★ 階級式結構
★ 疏散物流

關鍵字(英)

★ relief logistics
★ Stackelberg game
★ bilevel programming problem

論文目次

Chinese Abstract i
Abstract ii
Acknowledgement iii
Table of Contents v
List of Figure vii
List of Table viii
Chapter 1 Introduction 1
1.1 Research Background and Motivations 1
1.2 Research Field 3
1.3 Research Objectives 4
1.4 Assumptions 4
1.5 Research Flow Chart 7
Chapter 2 Literature Review 8
2.1 Bilevel Programming 10
2.2 Relief Logistics in Blocked Areas 14
2.3 VRPTW 18
Chapter3 Model Formulation 21
3.1 Notations 25
3.2 Mathematical Models 28
Chapter 4 Solution Algorithm 33
4.1 Linear 0-1 Integer Bilevel Programming 33
4.2 Route Construction 38
4.2.1 General Procedure of Route Construction 39
4.3 Route Improvement 40
4.3.1 Intra-route methods 41
4.3.2 Inter-route methods 41
Chapter 5 Computational Experiments 45
5.1 Test Problem Set 45
5.2 Test Results 49
5.2.1 Customers and available vehicles 49
5.2.2 Size of blocked areas and customers 52
5.2.3 Scenario 53
Chapter 6 Conclusions and Implications 55
6.1 Conclusion 55
6.2 Suggestions for Further Research 56
References 57
Appendix 62

參考文獻

1. Bard, J. F., 1990, “A branch and bound algorithm for the bilevel programming problem,” SIAM Journal of Scientific and Statistical Computing, Vol. 11, No. 2, pp.281-292.
2. Bard, J. F., 1998, Practical Bilevel Optimization – Algorithms and Applications, Kluwer academic publishers, Dordrecht/Boston/London.
3. Ben-Ayed, O., 1993, “Bilevel linear programming,” Computers and Operation Research, Vol. 20, pp.485-501.
4. Bialas, W. F. and Karwan, M. H., 1984, “Two-level linear programming,” Management Science, Vol. 30, No. 8, pp. 1004-1020.
5. Bräysy, O. and Gendreau, M., 2002, “Tabu search heuristics for the vehicle routing problem with time windows,” TOP, Vol. 10, No. 2, pp.211-237.
6. Bräysy, O. and Gendreau, M., 2005a, “Vehicle routing problem with time windows, part I: route construction and local search algorithms,” Transportation Science, Vol. 39, No. 1, pp.104-118.
7. Bräysy, O. and Gendreau, M., 2005b, “Vehicle routing problem with time windows, part II: metaheuristics,” Transportation Science, Vol. 39, No. 1, pp. 119-139.
8. Calvete, H. I. and Galé, C., 2004, “A note on ‘bilevel fractional linear programming problem,” European Journal of Operational Research, Vol. 152, pp. 296–299.
9. Calvete, H. I., Galé, C., Oliveros, M. J. and Sánchez-Valverde, B., 2004, “Vehicle routing problems with soft time windows: an optimization based approach,” Monografías del Seminario Matemático García de Galdeano, Vol. 31, pp. 295–304.
10. Chang, M.S., Chen, S.R. and Hsueh, C.F., 2003, “Real-time vehicle routing problem with time windows and simultaneous delivery/pickup demands,” Journal of the Eastern Asia Society for Transportation Studies, Vol. 5, pp. 2273-2286.
11. Chen, H.K., C.F. Hsueh and M.S. Chang, 2006, “The real-time time-dependent vehicle routing problem,” Transportation Research Part E. (Accepted)
12. Chiang, W.C. and Russell, R. A., 2004, “A metaheuristic for vehicle-routing problem with soft time windows,” Journal of the Operational Research Society, Vol. 55, pp. 1298-1310.
13. Chiu, Y. C., Korada, P., and Mirchandani, P. B., 2005, “Dynamic traffic management for evacuation,” Transportation Research Board 2005 Annual Meeting, Washington D.C., USA.
14. Colson, B., Marcotte, P., and Savard, G. 2005, “Bilevel programming: a survey,” A Quarterly Journal of Operation Research, Vol. 3, pp. 87-107.
15. Dempe, S., 2002, Foundation of bilevel programming, Kulwer Academic Publishers, Dordrecht, The Netherlands.
16. Feng, C.M. and Wang, T.C., 2005, “Seismic emergency rehabilitation scheduling for rural highways,” Transportation Planning Journal, Vol. 34, No. 2, pp. 177-210.
17. Frederiks, T. J. and Still, G. J., 2002, “Linear bilevel problems: genericity results and an efficient method for computing local minima,” Mathematical Methods of Operations research 55, pp. 383-400,
18. Fortuny-Amat, J. and McCarl, B., 1981, “A representation and economic interpretation of a two-level programming problem,” Journal of Operation Research Society, Vol. 32, pp. 783-792.
19. Frangioni, A., 1995, “On a new class of bilevel programming problems and its use for reformulating mixed integer problems,” European Journal of Operational Research Theory and Methodology, Vol. 82, pp. 615-646.
20. Gao, Z., Wu, J. and S, H., 2005, “Solution algorithm for the bilevel discrete network design problem,” Transportation Research Part B, Vol. 39, pp. 479-495.
21. Gendreau, M., Guertin, F., Potvin, J.Y., and Taillard, E., 1999, “Parallel tabu search for real-time vehicle routing and dispatching,” Transportation Science, Vol. 33, pp.381-390.
22. Gümüs, Z. H. and Floudas, C. A., 2003, “Global optimization of mix-integer bilevel programming problems,” Computational Management Science, Vol. 2, pp. 181-212.
23. Han, D.L., and Yuan, F., 2005, “Evacuation modeling and operations using dynamic traffic assignment and most desirable destination approaches,” Paper Presented at the Transportation Research Board 2005 Annual Meeting, Washington D.C., USA.
24. Hsueh, C.F., 2005, “Vehicle routing problems and the issues of integrating production and distribution,” Ph.D. Thesis, National Central University, Taiwan.
25. Hsueh, C.F., Chen, H.K., and Chou, H.W., 2005, “Vehicle routing for relief logistics in natural disasters,” Transportation Research Part E. (Submitted to the special issue on emergency logistics management)
26. Hsu, S. and Wen, U., 1989, “A review of linear bilevel programming problems,” Proceedings of the National Science Council, Republic of China, Part A: Physical Science and Engineering, Vol. 13, pp. 53-61.
27. Jeroslow, R. G., 1985, “The polynomial hierarchy and simple model for competitive analysis,” Mathematical Programming, Vol. 32, pp.146-164.
28. Lau, H.C., Sim, M. and Teo, K.M., 2003, “Vehicle routing problem with time windows and a limited number of vehicles,” European Journal of Operational Research, Vol. 148, pp. 559-569.
29. Lau, H.C. and Liang, Z., 2002, “Pickup and delivery with time windows: algorithms and test case generation,” International Journal on Artificial Intelligence Tools, Vol. 11, No. 3, pp. 455-472.
30. Liu, C.H. 2005, Study on Truck and Tailor Routing Problem with Time Window Constraints, Master Thesis, National Central University, Taiwan. (In Chinese)
31. Mathur, K. and Puri, M. C., 1995, “A bilevel bottleneck programming problem,” European Journal of Operational Research Theory and Methodology, Vol. 86, pp. 337-344.
32. May, M.D., 1999, “The model and solution algorithms for on-line vehicle routing problem with time windows,” Ph.D. Thesis, National Central University, Taiwan.(In Chinese)
33. Moore, J. T. and Bard, J. F., 1990, “The mixed integer linear bilevel programming problem,” Operations Research, Vol. 38, No. 5, pp. 911-921.
34. Özdamar, L., Ekinci, E. and Küçükyazaci, B., 2004, “Emergency logistics planning in natural disasters,” Annals of Operations Research, Vol. 129, pp. 217-245.
35. Psaraftis, H. N., 1995, “Dynamic vehicle routing: status and prospects,” Annuals of Operations Research, Vol. 61, pp. 143-164.
36. Si, Y.L., 2003, Study on rehabilitation scheduling and relief supplies logistics in post-disaster, Master Thesis, National Central University, Taiwan. (In Chinese)
37. Solomon, M. M., 1987, “Algorithms for the vehicle routing and scheduling problems with time windows constraints,” Operations Research, Vol. 35, pp.254-265.
38. Soismaa, M., 1999, “A note on efficient solutions for the linear bilevel programming problem,” European Journal of Operational Research Theory and Methodology, Vol. 112, pp. 427-431.
39. Vicente, L. N., Savarg, G., and Judice J. J., 1994, “Descent approaches for quadratic bilevel programming,” Journal of Optimization Theory and Applications, Vol. 81, pp. 379-399.
40. Vicente, L. N., Savard, G., and Judice, J. J., 1996, “The discrete linear bilevel programming problem,” Journal of Optimization Theory and Applications, Vol. 89, pp. 597-614.
41. Wan, C.Y. and Hu, S.R. 2005, “A study on emergency evacuation and rescue network reconstruction for natural disasters with multi-class users travel behavior constraints,” Journal of Eastern Asia Society for Transportation Studies, Vol. 6, pp. 4269-4284.
42. Wen, U. and Hsu, S., 1991, “Linear bilevel programming problems – a review,” Journal of Operational Research Society, Vol. 42, pp.125-133.
43. Wen, U. P. and Yang, Y. H., 1990, “Algorithms for solving integer two-level linear programming problem” Computers and Operational Research, Vol. 17, No. 2, pp. 133-142.
44. Zilberstein, S. and Russell, S., 1996, “Optimal composition of real-time systems,” Artificial Intelligence, Vol. 82, No.1-2, pp. 181-213.

指導教授

陳惠國(Huey-Kuo Chen)

審核日期

2006-7-21

推文