• DocumentCode
    3316495
  • Title

    Adaptive crossover operator based on locality and convergence

  • Author

    Ko, Myung-Sook ; Kang, Tae-Won ; Hwang, Chong-Sun

  • Author_Institution
    Dept. of Comput. Sci. & Eng., Korea Univ., Seoul, South Korea
  • fYear
    1996
  • fDate
    4-5 Nov 1996
  • Firstpage
    18
  • Lastpage
    22
  • Abstract
    In this paper, we propose an adaptive crossover operator (ACO) for function optimization. ACO performs local improvement by restricting the crossover range in adaptive way. This approach is based on bias value which restrict the location of crossover point. Bias value is computed by the fitness function value performance ratio, and the number of generations. As generations progress, the portion of chromosome to apply ACO becomes much smaller. ACO scheme can reduce the computation complexity and escape from getting stuck local optimum and also by maintaining diversity if can maintain the balance between exploration and exploitation. Several experiments have been carried our to compare the performance of adaptive scheme and standard scheme. Compared to simple GA, the proposed method is faster and more accurate in finding global optimum
  • Keywords
    adaptive systems; computational complexity; genetic algorithms; ACO; GA; adaptive crossover operator; adaptive crossover range restriction; bias value; chromosome; computation complexity; convergence; fitness function value performance ratio; genetic algorithm; global optimum; local improvement; locality; Acceleration; Biological cells; Computer science; Convergence; Genetic algorithms; Genetic mutations; Stochastic processes;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Intelligence and Systems, 1996., IEEE International Joint Symposia on
  • Conference_Location
    Rockville, MD
  • Print_ISBN
    0-8186-7728-7
  • Type

    conf

  • DOI
    10.1109/IJSIS.1996.565046
  • Filename
    565046