基于多目标优化的改航策略研究

随着我国航空运输的快速发展,由恶劣天气等原因导致的航班延误日益增多.传统的改航策略选取总延误损失最小为单一目标,不仅难以满足流量管理不同对象、不同阶段的需求,而且易造成空域利用率偏低.首先将改航策略与地面等待和空中等待相结合,然后综合考虑航空公司的利益,建立多目标优化模型,并采用稳定性和健壮性较强的多目标进化算法求解.最后选取全国典型繁忙日的实际飞行计划,进行了仿真验证.仿真结果表明,策略不仅可为航班动态地选择航路以避开容量限制区域,还可供流量管理部门参考不同目标来确定改航方案.     

空中交通流量管理中的改航策略研究

针对在恶劣天气下出现的大规模航班延误情况,根据机场和航路段的动态容量约束,建立了改航策略模型,并提出求解该模型的有效算法.选择全国航班时刻表进行仿真,仿真结果表明:该模型提供了在恶劣天气下更安全、更经济的航班改航策略,可为战术级流量管理提供辅助决策.     

保险损失费分布研究

对保险公司关注的保险总损失费的分布和平均总损失费的置信上限进行了初步研究.基于危险事故的保险损失费为服从指数分布的随机变量,在投保人数为泊松随机变量的条件下,根据各投保个体损失费分布参数的不同情况,导出某一时间内总损失费的分布密度和均值.在投保人数确定的条件下,研究了给定置信度下平均总损失费的置信上限,并给出了数字例.     

两个广义伽玛分布之间新的Kullback-Leibler距离

在Kullback-Leibler距离的基础上,对Kullback-Leibler距离进行改进,给出了新的Kullback-Leibler距离,并讨论了它的性质.计算了两个不同广义伽玛分布之间新的Kullback-Leibler距离.推导出伽玛分布、Weibull分布、Rayleigh分布、正态分布、指数分布新的Kullback-Leibler距离.另外在新的KullbackLeibler距离下,还得到digamma函数Ψ(x)=(Γ'(x)/(Γ(x))为单调递增函数.     

簇飞行航天器网络节点距离分布的高斯近似

簇飞行航天器因其节点间几何结构松散,节点间相对有界成为分布式空间系统研究热点之一.基于建立的簇飞行航天器节点移动模型,运用经验统计的分析方法,研究了簇飞行航天器节点间距离分布,采用高斯函数拟合,近似得到了节点距离分布的概率密度函数;为便于分析,还采用八阶多项式拟合节点距离分布的概率密度函数,并与高斯函数拟合残差和相对熵比较分析.结果表明,高斯函数效果更好,为研究簇飞行航天器网络性能提供重要理论基础.     

基于风速随机变量的植物种子风传播距离概率模型

种子风传播过程是植被地理分布及其对环境变化响应的关键.植物种子风传播距离是种子风传播能力的重要特征.建立种子风传播距离模型对准确预测植被地理分布变化十分关键.首先基于物理学中动力学原理,推导出了种子风传播动力学方程,基于风速对数正态分布和维布尔分布模式,推导出了植物种子风传播距离概率模型,并给出了计算步骤.同时,以6种蒲公英为例,分析了不同植物在不同地点和不同月份种子风传距离的概率密度特征.算例表明,不同植物、不同地点和不同时间种子风传播距离概率密度不同,并且种子风传播距离概率密度在风速为对数正态分布下比维布尔分布下要高,传播距离概率密度较高最大传播距离在维布尔分布下比对数正态分布下要远.未来研究种子风传播距离模型需要考虑近地面层空气动力学参数和风速分布其它模式.     

基于遗传算法的座位优化控制模型

座位优化控制是航空运输界增加利润的有效方法 .基于旅客的需求预测 ,可以利用数学规划模型为不同的航段和票价组合计算座位销售上限或者销售竞价 ,从而达到单个航班收入最大化的目的 .常用的方法可分为确定模型和概率模型 ,但对多航段多舱位的优化问题 ,由于出现了复杂的组合和约束 ,这些模型必须简化 .提出了基于遗传算法的座位优化控制模型 ,并和常用的优化方法进行了仿真对比 .研究结果表明 ,遗传算法应用于座位优化 ,可得到满意的解 ,同时 ,遗传算法简化了复杂的约束关系 ,易于实现 ,具有明显的优势 .     

基于动力响应的桥梁移动载荷识别

研究了桥梁在动荷载下的响应及其移动载荷的识别方法。将桥梁简化为空间各向同性板模型,使用解析法分析其动力响应,并采用时域法进行移动载荷的识别。通过有限元软件,对桥梁进行动力响应分析,得到桥梁危险位置的加速度时程曲线,并编写程序实现移动荷载识别的仿真计算。     

基于HSV色彩空间的瓷砖选色搜索算法

针对2021年第十三届"华中杯"大学生数学建模挑战赛A题,首先,基于HSV色彩空间,通过对自定分量进行权重调整,得到改进后的HSV分量改进距离,实现对颜色接近程度的判断,并通过验证,表明该公式效果良好;然后,以新增颜色对所有颜色的距离和最大为目标,寻找空间中颜色点分布最稀疏的区域,确定应优先增加的瓷砖颜色;最后,建立新增颜色后表现效果与成本的估算函数,找到了表现效果与成本的最佳平衡点,解决了新增颜色的选择问题.     

PM2.5扩散模型及预测研究

以武汉为例,以高斯扩散模型为基础研究PM2.5的扩散与衰减规律,充分考虑影响PM2.5扩散的因素,分析地面与建筑物边界反射、干沉积、雨洗湿沉积及湿度的影响,逐步改进高斯扩散模型,并引入时间t,计算当点源持续污染情况下,污染源上风和下风L公里处的浓度.通过数值仿真,得到距污染源下风向距离一定条件下污染扩散浓度的分布规律,预估突发情形下PM2.5的扩散距离及安全区域,结合三维图及平面图分析危险区及安全区.最后,结合小波理论及神经网络理论,提出小波神经网络的结构及算法,并通过Matlab实现了对PM2.5值的预测,并取得较高的预测拟合度.     

基于动态环境的机场航班实时调度优化研究

在对天气、空中管制等动态环境引起航班延误所造成的各主体利益损失分析及目标追求的基础上,建立单一机场航班动态实时调度微调两阶段优化模型,其中目标函数为追求航空公司、乘客利益和机场保障的经济损失加权和最小化,采用遗传算法优化求解.从最大效率利用终端区空域的角度,评估航班调度方案.具体的算例表明采用本方法能依据动态环境不断优化微调需更新的航班时刻表,达到兼顾各方利益提高机场综合服务水平的目的,证明了方法的可行性.     

Nodal distance distributions in cluster flight spacecraft network

The high-speed flight of cluster flight spacecraft modules increases the uncertainty of network topology. In order to better design the orbital of the cluster flight spacecraft and improve the performance of cluster flight spacecraft network (CFSN), this paper studies the nodal distance distributions (NDDs). First, based on twin-satellites mode, the mobility model of nodes is established. And then by adopting empirical statistical method and curve fitting method, the solution of the nodal distance density function in the CFSN is obtained. Second, the probability density function is applied to the model distance-dependent path loss, and the probability density of path loss under the model is analyzed. Finally, the distributions of maximum and minimum distance among multiple nodes and the threshold range of nodal connection distance are derived, and the probabilistic connectivity matrix of any time slot in the orbital hyper-period and spatial–temporal evolution graphs under different thresholds is obtained. The analytical results verify the feasibility of the model and the approximate solution of the NDDs in this paper. This method also provides a theoretical reference for the nodal connection in irregular wireless networks.     

无人机协同任务的优化方案

研究的是多架无人机协同完成侦察、中继等作战任务的方案优化问题.对于侦查任务,首先建立了以总行进路径最短为目标的非线性0-1规划模型,求得单架加载S-1无人机无法完成任务,故又建立了以两组行进路径之和最短和组间路程差最小为目标函数的目标群分组的非线性0-1规划模型,得到最优分组方案.然后,由于S-2的扫描范围广,无需行遍所有目标点即可完成任务,故建立以扫描所有目标点为约束条件,遍历点数最少为目标的非线性0-1规划模型,求得仅需经过18个点即可完全扫描所有68个目标点.接下来,在满足S-1和S-2扫描每个目标点的时间差小于4h的前提下,得到了最优的飞行方案.对于中继任务,通过调整无人机的起飞时间,减少通过雷区的任意两架无人机的位置差异,得到仅需1架中继无人机的最优飞行方案.     

A minimum-exposure,minimum-elevation military aircraft heuristic route selection model

An heuristic route selection model is presented for developing military aircraft routes through hostile terrain. The capability of modern air defence systems has forced military aircraft to utilize low level flight to avoid detection and increase survivability. By identifying the high and low elevation points within an area, the model determines their exposure values, which are used with their height and internode distance to calculate a penalty for flying to a point from the current position. In developing a route, the model utilizes basic information concerning air defence deployment, initial and destination points, and terrain data, to specify a minimum-exposure, minimum-elevation route. The results include the development of eight routes for 10 by 10 km areas, and six larger terrain areas varying in size from 20 by 20 km to 35 by 35 km. Validation shows the heuristic to be extremely competitive with visual procedures, and to require considerably less time.     

单架飞机受干扰后飞机路径恢复多项式算法研究

飞机路径恢复是航班调整中保证航班能够运行的必要条件之一,而传统目标下的飞机路径优化问题是NP-hard的。本文针对单架飞机受到干扰后,基于最小最大目标的同机型飞机路径最优化问题,给出了一个新的多项式时间算法。首先基于航空公司调整航班的常用原则,提出把最大航班延误时间最小化作为问题的目标。然后根据问题的一些特点和目标形式,设计出解构造算法,得到飞机路径恢复问题的最优解,并分析出算法的复杂度为O(n²)。相对于一般的最小最大二分图匹配算法(复杂度为O(n³log(n))),该算法具有较小的时间复杂度。最后用实例验证了解构造算法的有效性。该研究结果将为航空公司减少航班延误提供理论和方法支持。     

On air traffic flow management with rerouting. Part II: Stochastic case

We present a framework for modeling multistage mixed 0-1 problems for the air traffic flow management problem with rerouting (ATFMRP) under uncertainty in the airport arrival and departure capacity, the air sector capacity and the flight demand. The model allows for flight cancelation, if necessary. It considers several types of objective functions to minimize, namely, total ground and air holding cost, penalization of the alternative routes to the scheduled one for each flight, delay cost for the flights to arrive to the airports and the air sector nodes, and penalization for advancing the arrival of the flights to the airport over the scheduled period. A scenario tree based scheme is used to represent the Deterministic Equivalent Model (DEM) of the stochastic mixed 0-1 program with full recourse. The nonanticipativity constraints that equate the so named common 0-1 and continuous variables from the same group of scenarios in each period are implicitly satisfied in the compact representation of DEM. Some computational experience is reported for medium-scale instances. The model is so tight that none of the instances of the testbed but two of them requires to execute the branch-and-cut phase of the MIP optimization engine of choice.     

Locating a minisum annulus: a new partial coverage distance model

The problem is to find the best location in the plane of a minisum annulus with fixed width using a partial coverage distance model. Using the concept of partial coverage distance, those demand points within the area of the annulus are served at no cost, while for ‘uncovered’ demand points there will be additional costs proportional to their distances to the annulus. The objective of the problem is to locate the annulus such that the sum of distances from the uncovered demand points to the annulus (covering area) is minimized. The distance is measured by the Euclidean norm. We discuss the case where the radius of the inner circle of the annulus is variable, and prove that at least two demand points must be on the boundary of any optimal annulus. An algorithm to solve the problem is derived based on this result.     

高超声速飞行器纵向动力系统平衡态集的拓扑结构研究

以高超声速飞行器纵向运动的空气动力学模型和结构动力学模型为依据,采用数值分析的方法,研究了高超声速飞行器动力系统平衡点集的拓扑结构.首先根据高超声速飞行器在巡航阶段的飞行边界的限制条件得到在给定的飞行高度和马赫数下的平衡点集,由此近似估算出了高超声速飞行器的飞行包线.然后根据得到的平衡点集,分别研究了高超声速飞行器的迎角、升降舵偏角和发动机的燃料当量比与飞行马赫数和高度的关系,并进行了数值拟合,在此基础上分别描绘了以上三个拟合关系式的曲面关系图。     

Aircraft proximity termination conditions for 3D turn centric modes

International airspace design is undergoing significant change that requires formal and rigorous mathematical specifications to assure the safety of flight operations. Aircraft proximity management is one such area. The Point of Closest Approach (PCA) between aircraft flightpaths is the position along a flightpath at which the minima in relative range occurs. To date, PCA has been estimated primarily based on the assumption of a linear extrapolation of the velocity vectors of each aircraft involved, however, this assumption is limiting and aircraft in turning flight must also be considered. A generalised geometric and vector construction for the determination of PCA is presented. A solution based on a characterization of Fermat’s method for stationary points is presented that results in a complex transcendental equation. By casting the equation in a determinant structure a co-linearity condition is revealed between three unique 2D points. A novel aspect is that one of these points is a fixed reference point that lies on either the vector between the aircraft turn centres or on one of its extensions providing a reference to determine the location of the PCA. The analytic method can be readily applied in a laboratory test environment or in an automated guidance context. The rigorous proof enables a higher confidence in achieving dependable operations in a safety critical context and in the adequacy of test strategies when developing algorithms for aircraft avionics.