约束引导的反舰导弹航路规划遗传算法  

A Constrained Driven Genetic Algorithm for Path Planning of Anti-ship Missile

作　　者：刘钢[1] 老松杨[1] 侯绿林[1] 谭东风[1] 

机构地区：[1]国防科学技术大学信息系统工程重点实验室,长沙410073

出　　处：《弹道学报》2012年第4期11-17,共7页Journal of Ballistics

基　　金：国家自然科学基金项目(70571084;61074121);国家部委"十一五"科研计划基金项目(513040404-1)

摘　　要：为了提高遗传算法对航路规划问题的求解效率,提出了一种约束引导的航路规划遗传算法(CD-GA).与传统GA不同的是,该算法在优化过程中使用航路节点间的关联约束来实时限定基因值的准确变化范围.为了使染色体与航路的表达方式更加接近,采用定长实数的矩阵编码方式;采用一种分步递归初始化策略生成初始种群,保证其中均是非劣个体;在算法迭代过程中,分别采用一种连续多点分步交叉策略和扰动连续修复变异策略进行交叉和变异,使得算法搜索空间逐步减小,从而加速算法收敛.仿真实验结果表明,该算法能够显著提高遗传算法的全局搜索性能,并且算法收敛速度快,稳定性好.To improve the efficiency of path planning solved by Genetic Algorithm（GA）, a CD-GA （Constraint Driven GA） for path planning was proposed. Compared with traditional GA,the association constraints among path nodes were applied to immediately limit accurate variation-rang of genetic value in the process of optimization by the algorithm. To make the chromosome be close to the characteristics of path, fixed-length real-number matrix encoding method was applied. The initial populations were generated by an initialization strategy with sequential recursion to ensure the individuals to be superior. In the iteration process of algorithm, the crossover and mutation were carried out using successive-multipoints sequential crossover strategy and disturbance-sequential-restoration mutation strategy respectively, and the search space of the algorithm decreased gradually,thereby the convergence of the algorithm was accelerated. The result of simulation test shows that the proposed algorithm can improve the overall searching ability of GA obviously,and the algorithm has quick convergence and good stability.

关 键 词：反舰导弹 航路规划 约束引导 遗传算法 

分 类 号：TJ762.34[兵器科学与技术—武器系统与运用工程] V249[航空宇航科学与技术—飞行器设计]