求解机场终端区飞机着陆调度问题的遗传算法

空中管制员需为到达的飞机安排跑道并计算着陆时间,以飞机空中延误最小为出发点研究了多跑道的飞机着陆调度问题,约束条件为每架飞机的着陆时间应落在规定的时间窗内及相邻两架飞机应满足最小时间间隔。针对该问题设计了一种遗传算法对问题进行求解,其中染色体由飞机排序链表和跑道链表组成,相应的交叉和变异算子也做了改进设计。仿真实验用数据库OR-Library中的实例验证了该算法的有效性。     

An efficient hybrid meta-heuristic for aircraft landing problem

Aircraft landing problem is to assign an airport's runways to the arrival aircrafts as well as to schedule the landing time of these aircrafts. In this paper, first a mixed integer goal programming model is developed. Then, due to the complexity of the problem, which is NP-hard, we design a hybrid meta-heuristic applying simulated annealing framework. The computational results show that the proposed algorithm can obtain the optimal solution for instances up to 100 aircrafts, and also it is capable of finding very high quality and comparable solutions for the problems with up to 500 aircrafts and 5 runways in a short time.     

基于IABC算法的舰载机着舰调度

舰载机有序、高效着舰是确保舰载机舰面保障计划如期进行的必要前提,为提高舰载机着舰效率并减轻传统人工着舰排序的负担,研究一种舰载机着舰调度算法.首先,以加权着舰完成时间和为优化目标,构建舰载机着舰调度的数学模型;其次,提出一种改进的人工蜂群算法用于模型求解,算法在基本人工蜂群算法的基础上引入遗传算法中的交叉算子、精英策略以及一系列自适应局部搜索策略,以增强算法的全局搜索性能,提高算法收敛速度;最后,通过着舰调度案例仿真和算法对比表明,改进的人工蜂群算法具备更强的优化性能和更好的鲁棒性,可以求解大规模舰载机着舰调度问题,具有工程实际应用价值.     

人工鱼群—粒子群混合算法优化进港航班排序

针对空中交通管理中的进港航班排序问题, 提出了人工鱼群—粒子群混合算法(AFPSO)这一航班排序算法来优化进港航班排序, 使时段内进港航班队列总延误时间最少。算法结合了基本人工鱼群算法(AFSA)和基本粒子群算法(PSO)各自的优点, 先以AFSA在全局寻找满意的解域, 再以PSO算法在这些解域中进行快速的局部搜索获得精确解, 最终使算法提高收敛速度和搜索精度。仿真结果表明, 在单跑道和双跑道情况下, AFPSO算法使得航班队列总延误时间比FCFS调度方法减少了20. 9%和34. 4%, 比基本AFSA减少了3. 2%和3. 5%。算法得到的满意解能够为自动化空中交通管理提供实时支持。     

飞机着陆调度排序算法的设计与实现

航空管制员必须为同时到达的每一架飞机计算着陆时间，使整体费用最小，同时还要注意一些硬性的限制条件。在某一时刻，给定管制员视野内的飞机数量，可以公式化为约束最优化问题，从而应用一定的算法来解决。该文提出了基于分枝定界的飞机着陆调度排序算法——ASAL，实验证明通过该算法能够很好地解决飞机着陆调度优化问题。     

飞机起飞调运航路规划方法研究

针对飞机从停机位到起飞位的调运航路规划问题,为了规划最优航路,首先采用栅格法建立了飞行场地和飞机的简化模型,根据飞行场地的飞机布列位置,应用蚁群优化算法,规划出所有飞机从停机位到不同的起飞位的调运航路;针对飞机运动时的转角约束条件,利用B样条对规划出的调运航路进行平滑处理。经仿真生成了安全、可行的最短调运航路。仿真结果表明,将蚁群算法和B样条相结合应用于飞机调运航路规划,可以满足飞机运动的约束条件且规划出的结果优化。     

终端区航班排序的遗传算法

为提高空域利用率和航班调度效率,建立了以航班延误总时间为目标函数的规划模型,利用遗传算法中的交叉和变异运算,针对多跑道航班排序问题设计了编码方式和遗传算子,进行了仿真计算,并与先到先服务算法进行了对比研究.同时,结合空中交通管制中的实际情况,引入了一些约束条件.以三跑道为例,仿真结果表明:与先到先服务算法相比,设计的遗传算法大大降低了时间延误,明显提高了航班调度效率.     

基于LSD检测的无人机视觉着陆定位算法

针对复杂电磁干扰和拒止环境下固定翼无人机自主着陆的应用场景,提出了一种基于LSD的无人机视觉着陆定位算法,通过检测跑道的左右边线以及起始线对无人机进行定位;根据机场跑道的形态学特征,构建机场跑道数据模型,并对实验所用相机进行标定,采用灰度化和高斯滤波对采集到的图像进行预处理,采用LSD直线检测算法以提取跑道的直线特征,设计几何滤波策略从直线特征中提取出跑道的三条边线,采用蒙版技术以提高检测算法的抗干扰能力;根据相机成像原理推导出基于线检测的PNP定位算法,通过检测得到的机场跑道线在像素坐标系下的位置信息求出无人机相对于跑道的三维位置;分别在视景仿真环境和真实机场环境进行检测和定位解算,结果满足无人机着陆定位实时性和准确性的要求,从而验证了视觉着陆定位算法的有效性。     

Aircraft landing problems with aircraft classes

This article focuses on the aircraft landing problem that is to assign landing times to aircraft approaching the airport under consideration. Each aircraft’s landing time must be in a time interval encompassing a target landing time. If the actual landing time deviates from the target landing time additional costs occur which depend on the amount of earliness and lateness, respectively. The objective is to minimize overall cost. We consider the set of aircraft being partitioned into aircraft classes such that two aircraft of the same class are equal with respect to wake turbulence. We develop algorithms to solve the corresponding problem. Analyzing the worst case run-time behavior, we show that our algorithms run in polynomial time for fairly general cases of the problem. Moreover, we present integer programming models. We show by means of a computational study how optimality properties can be used to increase efficiency of standard solvers.     

基于多目标分阶段的跑道调度计划算法*

针对多条跑道环境下离港飞机调度问题,提出了一种基于多目标、两阶段算法。算法第一阶段以飞机重量类型为主要分解参数,生成离港飞机序列。该参数在跑道调度计划问题上比其他参数更具影响力和稳定性。算法第二阶段从离港飞机队列池中选取可用序列,将特殊航班指配到目标类型序列中,生成优化的飞行航班时刻表。实验表明,采用两阶段跑道调度计划算法进行多跑道离港飞机调度比采用先来先服务算法调度在跑道总吞吐量上有明显改善,能有效降低机场航班延误,提高跑道运营效率。     

Heuristic algorithms for assigning and scheduling flight missions in a military aviation unit

We consider an operations planning problem in a military aviation unit that performs a number of flight missions with multiple identical aircrafts. The problem is to assign the flight missions to the aircrafts and to schedule these assigned missions on each aircraft. Sequence-dependent setup times are required between the missions, and multiple aircrafts may be needed for a mission, but the aircrafts assigned to the same mission should start the mission simultaneously. We develop heuristic algorithms for the problem with the objective of minimizing makespan, i.e., the time by which all the missions have been completed. For evaluation of the performance of the algorithms, a series of computational tests was performed on a number of problem instances, and results show that the proposed algorithms give good or near optimal solutions in a reasonable amount of time.     

Scheduling aircraft landings to balance workload of ground staff

Scheduling landings of aircrafts is an essential problem which is continuously solved as part of the daily operations of an airport control tower. All planes in the airspace of an airport are to be assigned to landing slots by the responsible air-traffic controller. The support of this decision problem with suited optimization approaches has a long lasting tradition in operations research. However, none of the former approaches investigates the impact of the landing sequence on the workload of ground staff. The paper on hand presents three novel objectives for the aircraft landing problem, which aim at leveling the workload of ground staff by evenly spreading: (1) number of landed passengers, (2) landings per airline, and (3) number of landed passengers per airline over the planning horizon. Mathematical models along with complexity results are developed and exact and heuristic solution procedures are presented.     

A novel trajectory planning strategy for aircraft emergency landing using Gauss pseudospectral method

To improve the survivability during an emergency situation, an algorithm for aircraft forced landing trajectory planning is proposed. The method integrates damaged aircraft modelling and trajectory planning into an optimal control framework, in order to deal with the complex aircraft flight dynamics, a solving strategy based on Gauss pseudospetral method （GPM） is presented. A 3-DOF nonlinear mass-point model taking into account the wind is developed to approximate the aircraft flight dynamics after loss of thrust. The solution minimizes the forced landing duration, with respect to the constraints that translate the changed dynamics, flight envelope limitation and operational safety requirements. The GPM is used to convert the trajectory planning problem to a nonlinear programming problem （NLP）, which is solved by sequential quadratic programming algorithm. Simulation results show that the proposed algorithm can generate the minimum-time forced landing trajectory in event of engine-out with high efficiency and precision.     

知识化制造环境下航空发动机装配线调度及自重构

航空发动机装配工序数量多、工序间装配约束复杂. 当产品需求变化时, 人工调整存在响应速度慢、装配效率低等问题. 以最小化产品完工成本、工序提前期惩罚成本及班组重构成本加权和为目标, 建立了航空发动机装配线调度和装配班组自重构优化模型. 提出一种新的基于工序局部最优排序的分解算法, 将调度问题分解为单个装配组上工序顺序优化问题. 设计了一种工序后向插入搜索策略. 最后提出装配线调度及自重构集成优化算法. 通过数值试验,验证了模型与算法的有效性.     

基于干扰估计的非对称运动下飞机刹车系统模型预测控制

针对飞机在非对称运动下的双侧机轮协调控制问题, 提出一种基于滑模干扰估计的模型预测控制方法. 首先, 通过对飞机制动过程横纵方向力矩机理分析并分别考虑左右机轮对刹车性能的影响, 建立全面刻画系统动态的地面滑跑动力学模型. 在此基础上, 设计滑模观测器对侧风干扰进行实时估计, 利用补偿机制实现对侧风扰动的有效抑制. 此外, 提出基于前轮荷载状态门限特征和结合系数阈值范围特征的分析方法, 解决切换跑道环境辨识问题. 设计非线性模型预测算法, 实现飞机纵向防滑刹车和横向跑道纠偏的协调控制. 最后, 在侧风干扰、跑道切换以及不对称着陆等情况下进行仿真实验, 验证了所提出的控制策略能够有效提升刹车系统的防滑效率及纠偏性能.     

基于模糊控制的进场飞机排序

针对日益增长的空中交通需求所带来的严重航班延误,利用模糊控制理论设计对终端区进场飞机的调度排序算法。把管制员调度航班考虑的主要因素作为输入,制定模糊规则,建立模糊控制器,输出比较合理的飞机排定着陆顺序。     

Mutation Hopfield neural network and its applications

In this paper, a new operator is proposed to optimize the traditional Hopfield neural network (HNN). The key idea is to incorporate the global search capability of the Estimation of Distribution Algorithms (EDAs) into the HNN, which typically has a powerful local search capability and fast operation. On account of this property of the EDA, our proposed algorithm also exhibits a powerful global search capability. In addition, the possible infeasible solutions generated during the re-sampling period of the EDA are eliminated by the HNN. Therefore, the merits of both these methods are combined in a unified framework. The proposed model is tested on a numerical example, the max-cut problem. The new and optimized model yielded a better performance than certain traditional intelligent optimization methods, such as HNN, genetic algorithm (GA). The proposed mutation Hopfield neural network (MHNN) is also used to solve a practical problem, aircraft landing scheduling (ALS). Compared with first-come-first-served sequence, MHNN sequence reduces both total landing time and total delay.     

火箭返回着陆问题高精度快速轨迹优化算法

针对垂直起降可重复使用运载火箭子级返回着陆问题,提出一种高精度快速轨迹优化算法.算法将凸化技术与伪谱离散方法有机结合,将非凸、非线性优化问题转化为凸优化问题,进而充分利用凸优化求解快速性、收敛确定性以及伪谱法离散精度高的理论基础.在优化精度方面,建立了高保真优化模型,分析了发动机开机/终端时刻值设计对轨迹最优性的影响;采用flip-Radau谱法对连续最优控制问题进行离散,并利用伪谱法的独特离散时域映射,将开机和终端时刻设计为特殊控制变量,提高了优化结果的精度和最优性.在快速性方面,为利用凸优化方法求解非凸问题,基于一种新的信赖域更新策略,提出了改进序列凸化算法,减少了算法迭代次数,提高了算法收敛性能.数值实验验证了算法的有效性.高精度的优化结果和较高的计算速度,使得算法具有发展为在线最优制导方法的潜力.     

Modeling,simulation and analysis of aircraft arresting system using bond graph approach

Aircraft arrester systems are used to arrest the incoming aircrafts in case of emergency landing and aborted take off situations. This paper presents an approach for modeling, simulation and analysis of aircraft arresting system using bond graphs for electronically controlled, hydraulically operated multi disc friction type of braking arrangement. A detailed dynamic model of the aircraft arrester system is modeled through bond graphs in which the various sub-systems of the total system are created as capsules (sub-system objects). Detailed analysis for each of these sub-systems is carried out and then final results are obtained. The simulation is carried out for different aircraft weights and landing speeds.     

精确求解进港飞机调度双目标优化问题的epsilon约束算法

随着机场客流的持续增长,航班延误日益严重。同时,对于机场最重要的跑道资源而言,积雪结冰等会造成 飞机 打滑,从而出现事故。对于机场管理者,周期性地维护跑道至关重要,以防雨雪天气出现飞机打滑事故。该研究主要针对跑道上的 航班调度问题,考虑恶劣天气环境下跑道的周期性维护(如周期性喷洒除雪盐等)。为了在保证航班的服务质量的同时提高机场跑道的使用效率,文中以最小化航班总延误和跑道使用时间为优化的双目标。首先,提出该双目标优化问题混合整数规划模型;其次,为了精确求解出Pareto前沿,开发出epsilon约束算法;最后,给出算例来说明模型和算法的可行性。通过数学规划理论建模并开发精确求解算法,为机场资源优化研究提供参考。