CAJ | 학술논문

为了在复杂的机库环境中,尽可能缩短舰载机出库时间,优化其出库顺序,对舰载机多机出库调度优化问题进行了研究.首先,对该问题进行分析,建立了适合优化的数学模型.其次,设计了一种适合优化舰载机多机出库调度问题的算法—NGA算法,该算法是在遗传算法(GA)的基础上,对原有交叉和变异策略进行改变以适应所求解问题,并融入执行路径探测和规划的通视图算法后形成的.最后,分别将该方法和枚举法应用于求解尼米兹级航母舰载机多机出库调度优化问题T4.仿真结果为基于NGA算法所得的最短出库时间为801 s,最短移动距离为1 098.3 m;基于枚举法结果为800.4 s和1097.6 m.由结果可知,NGA算法计算结果与枚举法相差较小,可以应用于求解舰载机多机出库调度问题.
위료재복잡적궤고배경중,진가능축단함재궤출고시간,우화기출고순서,대함재궤다궤출고조도우화문제진행료연구.수선,대해문제진행분석,건립료괄합우화적수학모형.기차,설계료일충괄합우화함재궤다궤출고조도문제적산법—NGA산법,해산법시재유전산법(GA)적기출상,대원유교차화변이책략진행개변이괄응소구해문제,병융입집행로경탐측화규화적통시도산법후형성적.최후,분별장해방법화매거법응용우구해니미자급항모함재궤다궤출고조도우화문제T4.방진결과위기우NGA산법소득적최단출고시간위801 s,최단이동거리위1 098.3 m;기우매거법결과위800.4 s화1097.6 m.유결과가지,NGA산법계산결과여매거법상차교소,가이응용우구해함재궤다궤출고조도문제.
In order to reduce carrier plane hangar-exporting time and optimize sequence in complicated hangar environment,it researched the carrier plane hangar-exporting optimization problem. Firstly,the mathematic model of carrier plane hangar-exporting optimization problem is established. Secondly,it designed NGA algorithm which is suitable for solving the problem. NGA changed original crossover and variation tactics of GA in order to suit hangar-exporting problem,and combined Visibility Graph Algorithm which is used to detect and plan route. Finally,it used NGA and enumeration to solve the carrier plane hangar-exporting optimization problem (T4) in hangar of Nimetz aircraft carrier separately. Results are that the shortest hangar-exporting time is 801 s and shortest distance is 1098.3m based on NGA; based on enumeration it is 800.4 s and 1 097.6 m. From the results,we can know that the difference of results based on NGA and enumeration is small,and it is suitable for using NGA to solve the carrier plane hangar-exporting optimization problem.