• DocumentCode
    3002247
  • Title

    Genetic algorithm with dual species

  • Author

    Li Junhua ; Ming, Li ; Li Junhua

  • Author_Institution
    Key Lab. of Nondestructive Test, Nanchang HangKong Univ., Nanchang
  • fYear
    2008
  • fDate
    1-3 Sept. 2008
  • Firstpage
    2572
  • Lastpage
    2575
  • Abstract
    In this paper, a new genetic algorithm with two species is proposed. Our dual species genetic algorithm (DSGA) composes of two subpopulation that constitute of same size individuals. The subpopulations have different characteristics, such as crossover probability and mutation operator. In one subpopulation, the parents with higher similarity are cross with higher rate; mutate with general mutation operator. So that, the new algorithm can obtains good exploitation ability. In the other subpopulation, the parents with smaller similarity are cross with higher rate; mutate with big mutation rate. So that, the new algorithm can gets good exploration ability. The performance of our DSGA is compare to that of a single population genetic algorithm (SPGA) and Multi-population genetic algorithm with two populations (2PMGA). The experimental results show that the proposed method can gain higher global convergence rate and higher speed.
  • Keywords
    genetic algorithms; probability; crossover probability; dual species genetic algorithm; exploration ability; multipopulation genetic algorithm; mutation operator; single population genetic algorithm; subpopulation; Automatic testing; Automation; Convergence; Educational institutions; Genetic algorithms; Genetic mutations; Laboratories; Logistics; Nondestructive testing; Robustness; Genetic algorithms; adaptive crossover probability; multi-population genetic algorithms;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Automation and Logistics, 2008. ICAL 2008. IEEE International Conference on
  • Conference_Location
    Qingdao
  • Print_ISBN
    978-1-4244-2502-0
  • Electronic_ISBN
    978-1-4244-2503-7
  • Type

    conf

  • DOI
    10.1109/ICAL.2008.4636604
  • Filename
    4636604