摘要
台灣地區因地理位置處於複合式災害高危險之太平洋火環帶，潛在釀災風險與日本同居全球前十。重大自然災害發生情況下，具有無法預測及搶救刻不容緩之特性，如何在搶救黃金七十二小時內下達穩當的決策指令，以最短時間通行搶修與救援是救災行動中極為重要之議題。
本研究目標係針對救災時能根據得到的資訊計算出最快路徑的救援路線選擇，以利救援能在最短時間內，運送需求的醫療人力或物資，進入災區。使用之分析方法是依照救援行動和路徑損壞與可通行度融合Dijkstra 演算法程式化並以程式模型化，能以圖形化路徑顯示與文字化的任務說明來呈現結果，可輔助決策者即時進行最適路徑進行救援之解決方案。
關鍵字：Dijkstra、模型、建模、最快路徑、損壞、矩陣。
ABSTRACT
Taiwan is on the pacific ring of fire with high probability of compound disaster that is one of the top ten of high natural disaster threatened areas in the world. It’s very difficult to predict “when” the earthquake would occur, but somehow having the fastest way to get the rescue resource to the key issue to save more lives after disaster is to reach those disaster-striking regions as fast as possible for saving more lives is the key issue in the aftermath of disaster. This study aims at finding the fastest routes after impact with a model that has initial status of roads calculations integrating the Dijkstra algorithm. The output of this model may display the most appropriate route for helping the decision-maker to select the route in order to set out the rescue team and the necessary rescue resources.
Keywords: Dijkstra; Model; Fastest Route; Matrix
|