• DocumentCode
    2910916
  • Title

    An evolutionary reincarnation algorithm

  • Author

    Prime, B. ; Hendtlass, Tim

  • Author_Institution
    Centre for Inf. Technol. Res., Swinburne Univ. of Technol., Melbourne, VIC
  • fYear
    2008
  • fDate
    1-6 June 2008
  • Firstpage
    737
  • Lastpage
    743
  • Abstract
    As there is little or no experimental experience of reincarnation in the natural world, attempts to add a reincarnation metaphor to an evolutionary algorithm must of necessity proceed cautiously. In previous work the authors have established that the reintroduction of previously stored gene values into the population can have a noticeable effect on the progress of evolution, this paper now considers a range of options for deciding which gene values to store, which to return and which individuals in the current population should receive the returned gene values. Consistent experimental results on three well known functions allow a suggestion to be made of, if not the best choices, at least a good choice selection to use on initial experiments on other problems.
  • Keywords
    evolutionary computation; evolutionary algorithm; evolutionary reincarnation algorithm; reincarnation metaphor; Algorithm design and analysis; Capacitive sensors; Competitive intelligence; Design optimization; Evolution (biology); Evolutionary computation; Genetics; Humans; Intelligent systems; Laboratories;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Evolutionary Computation, 2008. CEC 2008. (IEEE World Congress on Computational Intelligence). IEEE Congress on
  • Conference_Location
    Hong Kong
  • Print_ISBN
    978-1-4244-1822-0
  • Electronic_ISBN
    978-1-4244-1823-7
  • Type

    conf

  • DOI
    10.1109/CEC.2008.4630878
  • Filename
    4630878