以巢式序列架構求解國土防衛縱深作戰之兵力部署最佳化模型

Solving the Optimal Model of the Force Deployment for Homeland Defense in Depth with Nested Sequential Approach

賴智明(C. M. Lai) ； 陳秀靜(S. J. Chen)

《危機管理學刊》 19卷2期 (2022/09) Pp. 99-112

https://doi.org/10.6459/JCM.202209_19(2).0009

摘要

本研究採用最短路徑網路攔截問題為基礎，探討國土防衛縱深作戰的兵力部署策略，以雙層規劃建構「防禦者－侵略者」模型。同時提出兩種巢式序列架構的求解方法，上層採用進化式演算法（簡群演算法或基因演算法）求解伏擊點設置的最佳化問題，下層則以Dijkstra算法求解最短路徑問題，並透過實例問題進行實證分析與演算法之比較。

關鍵字

網路攔截 ； 雙層規劃 ； 巢式序列 ； 簡群演算法 ； Dijkstra算法

並列摘要

This study applied the shortest path network interdiction problem to optimize the force deployment for homeland defense in depth, and constructed a ＂defender-attacker＂ model by using bilevel programming. For solving the proposed model, two nested sequential approaches were proposed. The upper level uses an evolutionary algorithm (simplified swarm optimization or genetic algorithm) to optimize the selection of ambush points, and the lower level uses the Dijkstra algorithm to solve the shortest path problem. Numerical simulations on 18 real cases for model analysis and verification of methods were given.

並列關鍵字

Network Interdiction ； Bi-Level Programming ； Nested Sequential ； Simplified Swarm Optimization ； Dijkstra Algorithm

參考文獻

Hunzeker, M. A., Lanoszka, A., Davis, B., Fay, M., Goepner, E., Petrucelli, J. and Seng-White, E. (2018). A Question of Time: Enhancing Taiwan's Conventional Deterrence Posture: Center for Security Policy Studies.

Wollmer, R. (1964). Removing arcs from a network. Operations research, 12(6), 934-940.

Wood, R. K. (2010). Bilevel network interdiction models: Formulations and solutions. Network, 174, 175.

Smith, J. C., & Song, Y. (2020). A survey of network interdiction models and algorithms. European Journal of Operational Research, 283(3), 797-811.

Von Stackelberg, H. (1952). Theory of the market economy.