导弹车在多波次导弹齐射中的规划问题

Planning of Multi-wave Missile Salvo from Missile Vehicles

以最优化理论为基础,研究了导弹车多波次导弹齐射规划问题.通过Floyd算法以及问题中提出的条件,建立0-1整数规划模型,分别求出待机地域到一波次发射点、一波次发射点到转载地域和转载地域到二波次发射点三个阶段节点路线图;综合考虑各种因素,对车载发射装置在转载地域到二波次发射点阶段进行规划.针对一般多波次齐射问题,使用Floyd算法及0-1整数规划结合逆推法给出每个发射装置的出发时刻以及总的暴露时间.针对道路节点,通过比较增设任意2个不同转载点后的优化结果筛选出最佳的2个增设转载地域,考虑道路节点对其他所有节点的影响因子,利用评估复杂网络节点重要度的节点收缩方法进行求解,结合一般多波次齐射问题中解得的最优路径,筛选出最易受到敌方攻击的三个道路节点.

Based on the optimization theory,the missile vehicle multi-wave missile salvo planning is studied.Through the Floyd algorithm and the conditions proposed in the problem,a 0-1 integer programming model is established,and the node road maps of three phases—the standby area to a wave transmission point,a wave transmission point to the reprinted area and the reprinted area to the second wave transmission point —are obtained. Taking various factors into consideration,the vehicle launcher is planned from the transshipment area to the second wave launch stage. For general multi-wave salvo problems,the launch time and the total exposure time of each launcher are given using the Floyd algorithm and 0-1 integer programming combined with the inverse method. For road nodes,the best two additional reload regions are selected by comparing the optimization results after adding any two different reproducing points. Considering the influence factor of the road node on all other nodes,the node contraction method for evaluating the importance of complex network nodes is used to solve the problem. Combined with the optimal path solved in the general multi-wave salvo problem,the three road nodes that are most vulnerable to enemy attacks are selected.