苏贞, 黎明, 刘高航. 适用于欺骗问题优化的分段遗传算法[J]. 南昌航空大学学报(自然科学版), 2004, 18(3): 29-32.
引用本文: 苏贞, 黎明, 刘高航. 适用于欺骗问题优化的分段遗传算法[J]. 南昌航空大学学报(自然科学版), 2004, 18(3): 29-32.
shu
SU Zhen, LI Ming, LIU Gao-hang. A subsection genetic algorithm for optimization of deceptive problem[J]. Journal of nanchang hangkong university(Natural science edition), 2004, 18(3): 29-32.
Citation: SU Zhen, LI Ming, LIU Gao-hang. A subsection genetic algorithm for optimization of deceptive problem[J]. Journal of nanchang hangkong university(Natural science edition), 2004, 18(3): 29-32.
shu

适用于欺骗问题优化的分段遗传算法

A subsection genetic algorithm for optimization of deceptive problem

    摘要
  • 摘要: 为了有助于克服遗传算法中的模式欺骗性问题,本文基于遗传算法在不同阶段运行性能的不同,并且借鉴新达尔文主义中生物进化的选择机理,分析和探讨了一种适应性分段遗传算法,并且通过试验证明了该方法的有效性.

     

    Abstract: In order to help genetic algorithms to overcome the schema deceptive problems,this paper analyses and describes a subsection genetic algorithm,which is based upon the different performances of genetic algorithms in different phase and the selection mechanism of biology evolution in Neo-Darwinism theory.It has been proved effective through experimentation.

     

    • HTML全文
    • 参考文献(4)
    • 相关文章
    • 施引文献
  • 资源附件(0)

/

返回文章
返回