本研究提出的國軍災害防救預置兵力部署問題，是解決災前預置點的設施選址問題。與過去設施選址問題最大差異在於，問題的目標函數是最小化預置點的遭災風險與距離成本。為此，本研究提出一個基於覆蓋問題之兵力部署模型，同時提出兩階段的方法求解。另透過18組隨機生成的問題驗證演算法效能，並將計算結果與分支定界法進行比較。

In this study, the problem of pre-deployment of military disaster prevention and rescue forces is proposed to solve the problem of pre-location of facilities. The biggest difference from the past facility location problem is that the objective function of the problem is to minimize the disaster risk and distance cost of the preset point. In this paper, a force deployment model based on coverage problem is presented and a two-stage method is proposed. In addition, 18 randomly generated problems are used to verify the effectiveness of the algorithm, and the results are compared with the branch and bound method.