舰载机回收任务的优化调度算法及仿真

Optimization schedule algorithm and simulation to recycle planes on carrier

针对舰载机回收过程中,飞行甲板跑道容量的瓶颈问题,比较了几种常见的排序算法,并运用Mat-lab和Lingo软件分别对先来先服务、基于最早到达时刻、滑动窗3种算法进行了计算机仿真。仿真结果表明,滑动窗排序法排序结果最好。最后,指出了滑动窗初始窗口飞机数目和移动步长对算法复杂度和排序结果的影响。

Aiming at the problem of the runway capacity in the course of recycling, several usual sequencing algorithms for recycling task were compared. The first-come-first-serviced,sequencing algo-rithm based on the earliest estimated arrival time and sliding sequencing window were all simulated by Matlab and Lingo software. The result shows that the schedule result of the sliding sequencing window algorithm is the best. Finally, the effect of different original number of planes and moving step was pointed out.