留言板

尊敬的读者、作者、审稿人, 关于本刊的投稿、审稿、编辑和出版的任何问题, 您可以本页添加留言。我们将尽快给您答复。谢谢您的支持!

姓名
邮箱
手机号码
标题
留言内容
验证码
Volume 9 Issue 6
Dec.  2002
数据统计

分享

计量
  • 文章访问数:  229
  • HTML全文浏览量:  56
  • PDF下载量:  10
  • 被引次数: 0
Yan Wang, Hongwei Sun, and Yikang Sun, A hybrid genetic algorithm based on mutative scale chaos optimizationstrategy, J. Univ. Sci. Technol. Beijing, 9(2002), No. 6, pp. 470-473.
Cite this article as:
Yan Wang, Hongwei Sun, and Yikang Sun, A hybrid genetic algorithm based on mutative scale chaos optimizationstrategy, J. Univ. Sci. Technol. Beijing, 9(2002), No. 6, pp. 470-473.
引用本文 PDF XML SpringerLink
Information

A hybrid genetic algorithm based on mutative scale chaos optimizationstrategy

  • 通讯作者:

    Yan Wang    E-mail: wangyanmmto@sina.com

  • In order to avoid such problems as low convergent speed and local optimal solution in simple genetic algorithms, a new hybrid genetic algorithm is proposed. In this algorithm, a mutative scale chaos optimization strategy is operated on the population after a genetic operation. And according to the searching process, the searching space of the optimal variables is gradually diminished and the regulating coefficient of the secondary searching process is gradually changed which will lead to the quick evolution of the population. The algorithm has such advantages as fast search, precise results and convenient using etc. The simulation results show that the performance of the method is better than that of simple genetic algorithms.
  • Information

    A hybrid genetic algorithm based on mutative scale chaos optimizationstrategy

    + Author Affiliations
    • In order to avoid such problems as low convergent speed and local optimal solution in simple genetic algorithms, a new hybrid genetic algorithm is proposed. In this algorithm, a mutative scale chaos optimization strategy is operated on the population after a genetic operation. And according to the searching process, the searching space of the optimal variables is gradually diminished and the regulating coefficient of the secondary searching process is gradually changed which will lead to the quick evolution of the population. The algorithm has such advantages as fast search, precise results and convenient using etc. The simulation results show that the performance of the method is better than that of simple genetic algorithms.
    • loading

    Catalog


    • /

      返回文章
      返回