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

NCUIR > Engineering College > Graduate Institute of Civil Engineering > Electronic Thesis & Dissertation > Item 987654321/1142

Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/1142

Title:	道路災害搶修與緊急物流配送問題之探討;A study on network reconstruction and relief logistics
Authors:	廖慧凱;Hui-Kai Liao
Contributors:	土木工程研究所
Keywords:	主從關係;黃金72小時;雙層規劃問題;系統最佳化;階級式結構;疏散物流;relief logistics;Stackelberg game;bilevel programming problem
Date:	2006-07-07
Issue Date:	2009-09-18 17:21:32 (UTC+8)
Publisher:	國立中央大學圖書館
Abstract:	每當重大災害發生時，決策者必須在極短時間內將救災人員與救災機具做出適當的調度，以求有效的降低災區人員與財產之損失。本研究根據救災系統高階管理人員與中、低階技術人員對救災項目優先性的不同觀點，將救災問題建構為具主從關係(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.
Appears in Collections:	[Graduate Institute of Civil Engineering] Electronic Thesis & Dissertation

Files in This Item:

File	Size	Format

社群 sharing

Loading...