• DocumentCode
    2816143
  • Title

    An informed operator approach to tackle diversity constraints in evolutionary search

  • Author

    Bhattacharya, Maumita

  • Author_Institution
    Gippsland Sch. of Comput. & Inf. Technol., Monash Univ., Clayton, Vic., Australia
  • Volume
    2
  • fYear
    2004
  • fDate
    5-7 April 2004
  • Firstpage
    326
  • Abstract
    As the evolutionary search progresses, it is important to avoid reaching a state where the genetic operators can no longer produce superior offspring, prematurely. This is likely to occur when the search space reaches a homogeneous or near-homogeneous configuration converging to a local optimal solution. Maintaining a certain degree of population diversity is widely believed to help curb this problem. The proposed technique presented here, uses informed genetic operations to reach promising, but un/under-explored areas of the search space, while discouraging local convergence. Elitism is used at a different level aiming at convergence. The proposed technique´s improved performance in terms solution precision and convergence characteristics is observed on a number of benchmark test functions with a genetic algorithm (GA) implementation.
  • Keywords
    genetic algorithms; search problems; Elitism; GA implementation; benchmark test functions; convergence characteristics; diversity constraints; evolutionary search; genetic algorithm; informed operator approach; population diversity; Benchmark testing; Encoding; Evolutionary computation; Genetic algorithms; Information technology; Space technology; State-space methods;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Technology: Coding and Computing, 2004. Proceedings. ITCC 2004. International Conference on
  • Print_ISBN
    0-7695-2108-8
  • Type

    conf

  • DOI
    10.1109/ITCC.2004.1286656
  • Filename
    1286656