针对大规模国内机场资源配置问题的一种松弛算法  

A Relaxation Algorithm for Budget Allocation of Large-scale Domestic Airport Network Protection

作　　者：闫喜红[1] 郝世宇 闫雪 YAN Xihong;HAO Shiyu;YAN Xue(School of Mathematics and Statistics,Taiyuan Normal University,Jinzhong 030619,China)

机构地区：[1]太原师范学院数学与统计学院,山西晋中030619

出　　处：《太原师范学院学报（自然科学版）》2022年第4期1-5,共5页Journal of Taiyuan Normal University:Natural Science Edition

基　　金：研究生教育教学管理改革项目(2021YJJG262);2022年度太原师范学院研究生教育创新项目(SYYJSYC-2289)。

摘　　要：近年来,恐怖袭击事件在世界全球范围内迅速蔓延,民航是恐怖分子袭击的主要对象.为此,机场安全是当今社会关注的热点之一.为了提高国内机场网络的整体安全性,文献[7]针对机场的资源分配问题设计了0-1双层整数规划模型.由于该问题规模很大,文章设计了松弛割平面算法求解此双层优化模型.最后通过数值案例,说明了算法的有效性.In recent years, terrorist attacks have spread rapidly around the world, and civil aviation is the main target of terrorist attacks.To this end, airport security is one of the hot spots in today’s society.In order to improve the safety of domestic airports, a 0-1 two-layer integer programming modelis designed for the budget allocation problem of airports, and it is accurately solved by secant plane algorithm.Since this precise algorithm is ineffective for solving large-scale problems.Therefore, in this paper, a relaxation secant plane algorithm is designed to solve the bilayer optimization model,and the numerical effects of the two algorithms are compared by numerical experiments.

关 键 词：机场安全 松弛割平面算法 大规模 资源配置 

分 类 号：O224[理学—运筹学与控制论]