首页 | 本学科首页   官方微博 | 高级检索  
     

基于递进制编码的遗传算法研究
引用本文:刘漫丹,钱锋.基于递进制编码的遗传算法研究[J].信息与控制,2004,33(5):614-617.
作者姓名:刘漫丹  钱锋
作者单位:华东理工大学自动化研究所,上海,200237
基金项目:国家 973计划资助项目 ( 2 0 0 2CB3 12 2 0 0 ),上海市“启明星”计划资助项目 ( 0 3QG14 0 14 )
摘    要:首先分析了编码的进制数对遗传算法收敛速度的影响.分析结果表明,当种群不稳定时,高进制编码较低进制编码具有更快地搜索至最优区域的能力,当种群较为稳定时,低进制编码较高进制编码具有更快地逼近最优点的能力.然后提出了基于递进制的遗传算法,该算法能提高优化问题的收敛速度,在优化参数较多时,与单一进制编码的遗传算法相比具有明显的优势.仿真实例也验证了这一结论.

关 键 词:遗传算法  递进制  编码  搜索能力
文章编号:1002-0411(2004)05-0614-04

Research on Genetic Algorithm Based on Degressive Carry Number Encoding
LIU Man-dan,QIAN Feng.Research on Genetic Algorithm Based on Degressive Carry Number Encoding[J].Information and Control,2004,33(5):614-617.
Authors:LIU Man-dan  QIAN Feng
Abstract:The influence of encoding mechanism on the convergence of genetic algorithm is analyzed. High carry number encoding has the ability of faster searching to optimization area, compared with low carry number encoding while the population is unstable. Low carry number encoding has the ability of faster searching to optimization value, compared with high carry number encoding while the population is stable. Then, the genetic algorithm based on degressive carry number encoding is proposed. The algorithm can improve the convergence speed of optimization problems, and this advantage is obvious while the parameters are excessive. Simulations validate the conclusion.
Keywords:genetic algorithm  degressive mechanism  encoding  searching ability
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号