• DocumentCode
    2083043
  • Title

    An improved genetic algorithm for the stable structures of (C60)N clusters

  • Author

    Shao, Guifang ; Wen, Yuhua ; Chen, Yaohua

  • Author_Institution
    Dept. of Pattern Recognition & Intell. Syst., Xiamen Univ., Xiamen, China
  • Volume
    1
  • fYear
    2008
  • fDate
    17-19 Nov. 2008
  • Firstpage
    476
  • Lastpage
    480
  • Abstract
    Genetic algorithm was employed to optimize the structures of (C60)N molecular clusters with the lowest energy. Aiming at an effective solution of stable structures, some improvements are made to traditional genetic algorithm. Firstly, gene is coded by the mixed method (real number and integral number) for initialized population quality. Secondly, a new selection mechanism based on roulette wheel and hamming distance is introduced. Thirdly, in order to enhance the chromosome diversity, a new self-adaptive crossover method is developed which combines 1-point crossover with uniform crossover. Finally, for the sake of improving the global searching capacity and avoiding the premature convergence, a feedback mutation based on dynamic encoding is put forward. The experiment results show that the improved genetic algorithm is good at rapidity and convergence as well as can search for the stable structure when N varies from 3 to 25.
  • Keywords
    biocomputing; genetic algorithms; molecular clusters; (C60)N molecular clusters; chromosome diversity; genetic algorithm; hamming distance; initialized population quality; roulette wheel; self-adaptive crossover method; stable structures; Adaptive control; Convergence; Design optimization; Genetic algorithms; Intelligent structures; Intelligent systems; Knowledge engineering; Monte Carlo methods; Pattern recognition; Physics;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Intelligent System and Knowledge Engineering, 2008. ISKE 2008. 3rd International Conference on
  • Conference_Location
    Xiamen
  • Print_ISBN
    978-1-4244-2196-1
  • Electronic_ISBN
    978-1-4244-2197-8
  • Type

    conf

  • DOI
    10.1109/ISKE.2008.4730978
  • Filename
    4730978