• DocumentCode
    349629
  • Title

    An adaptive alternation model in genetic algorithms considering landscape complexity

  • Author

    Kimura, S. ; Kobayashi, S.

  • Author_Institution
    Dept. of Comput. Intelligence & Syst. Sci., Tokyo Inst. of Technol., Japan
  • Volume
    1
  • fYear
    1999
  • fDate
    1999
  • Firstpage
    601
  • Abstract
    We propose a new adaptive algorithm which can maintain the diversity of population appropriately and accordingly can find more than one local optimum for a given function. The algorithm generates many children by a crossover operator. It estimates a local fitness landscape near the parents using the generated children. The estimated local landscape is utilized as a selection procedure. Furthermore, a mating restriction is implemented for effective search. By applying this algorithm to several benchmark problems, we show that it can converge the population on a global optimum for unimodal functions, and can find plural local optima for multimodal functions
  • Keywords
    algorithm theory; genetic algorithms; adaptive algorithm; adaptive alternation model; benchmark problems; children; crossover operator; genetic algorithms; landscape complexity; local fitness landscape; local optimum; multimodal functions; population diversity; selection procedure; Adaptive algorithm; Genetic algorithms; Genetic engineering; Joining processes; Maintenance engineering; Random variables;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Systems, Man, and Cybernetics, 1999. IEEE SMC '99 Conference Proceedings. 1999 IEEE International Conference on
  • Conference_Location
    Tokyo
  • ISSN
    1062-922X
  • Print_ISBN
    0-7803-5731-0
  • Type

    conf

  • DOI
    10.1109/ICSMC.1999.814160
  • Filename
    814160