CAJ | 학술논문

通过对空中加油航路规划进行建模,利用遗传算法进行优化计算,解决了关于包括总耗油量和受油机飞行航程在内的航路规划问题.针对模型中的非线性约束条件,引入自适应可变惩罚以及对部分变量采用过滤法,另外在选择、交叉、变异环节采用适应度选择法、启发式交叉法、非一致变异法,充分利用遗传算法的全局优化特性,解决了局部过早收敛等问题.实际算例中,分别针对基于航线和基于区域2种加油模式进行计算,比较2种模式的优缺点,得出了空中加油的最优策略,并验证了针对此类问题遗传优化算法的有效性.
통과대공중가유항로규화진행건모,이용유전산법진행우화계산,해결료관우포괄총모유량화수유궤비행항정재내적항로규화문제.침대모형중적비선성약속조건,인입자괄응가변징벌이급대부분변량채용과려법,령외재선택、교차、변이배절채용괄응도선택법、계발식교차법、비일치변이법,충분이용유전산법적전국우화특성,해결료국부과조수렴등문제.실제산례중,분별침대기우항선화기우구역2충가유모식진행계산,비교2충모식적우결점,득출료공중가유적최우책략,병험증료침대차류문제유전우화산법적유효성.
Based on a model for the schedule of several times air refueling in the journey, the paper analyses and solves the journey programming problem involving the total fuel consumption and the flight distance of the deploying aircraft by the genetic algorithm (GA). By introducing auto-adaptive punishment, initial filtration, normalized geometric ranking, non-uniform mutation,heuristic crossover methods into GA, the problem related to nonlinear restriction and convergence in local area is solved. The practices prove the efficiency of GA and put forward an optimizing solution for the journey programming problem by computing and comparing the results based on the journey-based mode and area-based mode.