检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:王书勤 黄茜 WANG Shuqin;HUANG Qian(Department of Military Command,Officers College of PAP,Chengdou 610213,China;Department of Basic Courses,Officers College of PAP,Chengdou 610213,China)
机构地区:[1]武警警官学院分队指挥系,四川成都610213 [2]武警警官学院基础部,四川成都610213
出 处:《运筹与管理》2024年第4期1-6,共6页Operations Research and Management Science
基 金:军内“十四五”规划项目(145BZB180001000X,WJ2022B010100)。
摘 要:封控是武警部队遂行多样性任务中经常采用的一种重要军事行动,关系到多样化任务遂行的成败。为进一步提高武警部队在多点封控行动中的兵力分配的精确性和科学性,文中基于武警部队驻地分散实际,考虑各封控小组对各封控点成功率不同及到各封控点的距离不相等等因素,以实现各封控点成功率最大化和以小组开进的路程和最短为目标,建立了多点封控行动中的兵力分配模型。依据问题特点进行了遗传算法编码和适应度函数设计,将遗传算法(Genetic Algorithm, GA)和模拟退火算法(Simulated Annealing, SA)相结合,提出了一种GA-SA算法,实验仿真结果验证了算法的有效性及较遗传算法和模拟退火算法的优越性。Sealing and controlling action is an important military action,is often used in diversified tasks by the PAP,and has a very close relationship with the completion of diversified tasks.The force assignment problem in multipoint sealing and controlling action is how to assign force based on these actual situations,and these actual situations often contain the decentralized troop stations,the different force conditions(like equipment,the number and quality of force,etc.)of each station and the different distances from station to control point,etc.And at the same time,it is best to achieve the goal of minimizing the cost of completing the task and getting the maximum sealing and controlling action probability.Because the problem often contains multiple troop stations and task points,it is always a NP difficult problem when the problem scale is large.Finding the optimal force assignment plan for the problem becomes a thought-provoking question.In literature review,it is found that there are many studies about the force assignment problem of other military operations,but they seldom pay attention to the force assignment problem of multipoint sealing and controlling action of PAP.So,in order to find the optimal plan for the sealing and controlling action force assignment quickly and accurately,and improve the accuracy and scientificity of the sealing and controlling action force assignment further,a force assignment model for multipoint sealing and controlling action is established,this model contains two objective functions,one is maximizing the sealing and controlling action probability of each control point,and the other is minimizing the total moving distance of all groups,the model considers the different sealing and controlling action probabilities and moving distances of each group.Because the model is a multi-objective mixed integer programming model,and contains maximum-minimum objective function,when the problem scale is large,it will be difficult to obtain its optimal solution by traditional algorithms.So a G
关 键 词:封控成功率 兵力分配模型 GA-SA算法 多目标规划
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.219.151.249