• DocumentCode
    944030
  • Title

    A Jumping Gene Paradigm for Evolutionary Multiobjective Optimization

  • Author

    Chan, T.M. ; Man, K.F. ; Kwong, S. ; Tang, K.S.

  • Author_Institution
    City Univ. of Hong Kong, Hong Kong
  • Volume
    12
  • Issue
    2
  • fYear
    2008
  • fDate
    4/1/2008 12:00:00 AM
  • Firstpage
    143
  • Lastpage
    159
  • Abstract
    A new evolutionary computing algorithm on the basis of the ldquojumping genesrdquo (JG) phenomenon is proposed in this paper. It emulates the gene transposition in the genome that was discovered by Nobel Laureate, Barbara McClintock, in her work on the corn plants. The principle of JGs that is adopted for evolutionary computing is outlined. The procedures for executing the computational optimization are provided. A large number of constrained and unconstrained test functions have been utilized to verify this new scheme. Its performances on convergence and diversity have been statistically examined and comparisons with other evolutionary algorithms are carried out. It has been discovered that this new scheme is robust and able to provide outcomes quickly and accurately. A stringent measure of binary-indicator is also applied for algorithm classification. The outcome from this test indicates that the JG paradigm is a very competitive scheme for multiobjective optimization and also a compatible evolutionary computing scheme when speed in convergence, diversity, and accuracy are simultaneously required.
  • Keywords
    evolutionary computation; optimisation; evolutionary computing algorithm; evolutionary multiobjective optimization; jumping gene paradigm; unconstrained test functions; Genetic algorithms (GAs); jumping genes (JGs); multiobjective evolutionary algorithms (MOEAs); optimization; test functions;
  • fLanguage
    English
  • Journal_Title
    Evolutionary Computation, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    1089-778X
  • Type

    jour

  • DOI
    10.1109/TEVC.2007.895269
  • Filename
    4358765