• DocumentCode
    1844735
  • Title

    A Novel Simplex Hybrid Genetic Algorithm

  • Author

    Xiao, Hongfeng ; Tan, Guanzheng

  • Author_Institution
    Sch. of Inf. Sci. & Eng., Central South Univ., Changsha
  • fYear
    2008
  • fDate
    18-21 Nov. 2008
  • Firstpage
    1801
  • Lastpage
    1806
  • Abstract
    In simplex hybrid genetic algorithm, widely using Nelder-Mead simplex method (NMSM) would lead to precocity of genetic algorithm and increase in computation quantity, so a novel simplex hybrid genetic algorithm is proposed in this paper. First, we propose a new efficient simplex crossover operator. Second, using the successful experiences of dividing the vertexes in NMSM into the best vertex, the worst vertex and worse vertex, the population in genetic algorithm also is divided into three niches: the best niches, the worst niche and worse niches, into which NMSM, simplex multiple-direction search and the efficient simplex crossover operator are embedded respectively. By these means, the main idea of "classifying niche and then treating them by their categories" is implemented and then the novel simplex hybrid genetic algorithm (Simplex-NHGA) is built up. At last, five standard test functions are used to verify the correctness and efficiency of simplex-NHGA.
  • Keywords
    convergence; genetic algorithms; mathematical operators; search problems; Nelder-Mead simplex method; best niche; convergence; genetic algorithm precocity; simplex crossover operator; simplex hybrid genetic algorithm; simplex multiple-direction search; worst niche; Algorithm design and analysis; Artificial neural networks; Computer networks; Convergence; Embedded computing; Genetic algorithms; Genetic engineering; Information science; Reflection; Simulated annealing; Nelder-Mead simplex method; category process; hybrid genetic algorithm; niche; simplex crossover operator;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Young Computer Scientists, 2008. ICYCS 2008. The 9th International Conference for
  • Conference_Location
    Hunan
  • Print_ISBN
    978-0-7695-3398-8
  • Electronic_ISBN
    978-0-7695-3398-8
  • Type

    conf

  • DOI
    10.1109/ICYCS.2008.277
  • Filename
    4709247