摘要
为保障海域安全稳定,当远海海域发生紧急安全问题时,需要派遣飞机从大陆保障基地出发进行远程支援。本文研究了在随机多需求环境下,中继保障网络的最优化设计问题,给出了规范化的问题描述以及问题的混合整数规划模型,根据事发点发生意外事件的频率以及保障需求量作为需求的权重建立目标函数。模型以中继保障点的位置以及最优支援路线作为决策变量,以保障资源作为约束条件,实现了连续与离散相结合的选址方法来优化中继保障点,并运用几何近似方法将模型中的欧式距离非线性约束转化为线性约束。所建模型可应用数学模型建模语言和求解器进行最优化求解,直接获得多种不确定需求环境下的期望最优网络设计及支援路径。基于给定的3种任务类型,经过模拟案例验证,所建立模型可满足对实际规模的中继保障网络优化设计。
In order to ensure the safety and stability of sea area,when an emergency security event occurs in the offshore area,it is often necessary to send aircraft from the mainland base to support and secure the event remotely.The optimal design problem of relay support network under stochastic and multi-demand environment is studied,the normalized problem description and mixed integer programming(MILP)model of the problem are given,and the objective function is established according to the frequency of unexpected events at the incident point and the support demand as the weight of demand.Taking the location of relay support points and the optimal support route as decision variables and the support resources as constraints,the MILP model realizes the location method combining continuous and discrete to optimize the selection of relay points,and uses the geometric approximation method to transform the Euclidian distance nonlinear constraint into linear constraint.The proposed MILP model can be optimized by using mathematical modeling language and solver,and the desired optimal network design and support path can be obtained directly under various uncertain demand environments.Based on the given three types of tasks,the simulation computation show that the proposed MILP model can meet the actual scale of the network design problem with relay.
作者
杨培
肖依永
王宏宇
YANG Pei;XIAO Yiyong;WANG Hongyu(School of Reliability and Systems Engineering, Beihang University, Beijing 100191, China;Aviation School of Chinese people’s Liberation Army, Beijing 101116, China)
出处
《系统工程与电子技术》
EI
CSCD
北大核心
2021年第7期1838-1847,共10页
Systems Engineering and Electronics
基金
国家自然科学基金(71871003)资助课题。
关键词
中继保障网络设计
最低成本路径
离散连续选址
network design with relay
least cost route
discrete and continuous location