By Topic

A Theoretical Development and Analysis of Jumping Gene Genetic Algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Kit Sang Tang ; Department of Electronic Engineering, City University of Hong Kong, Hong Kong ; Richard J. Yin ; Sam Kwong ; Kai Tat Ng
more authors

Recently, gene transpositions have gained their power and attentions in computational evolutionary algorithm designs. In 2004, the Jumping Gene Genetic Algorithm (JGGA) was first proposed and two new gene transposition operations, namely, cut-and-paste and copy-and-paste, were introduced. Although the outperformance of JGGA has been demonstrated by some detailed statistical analyses based on numerical simulations, more rigorous theoretical justification is still in vain. In this paper, a mathematical model based on schema is derived. It then provides theoretical justifications on why JGGA is superiority in searching, particularly when it is applied to solve multiobjective optimization problems. The studies are also further verified by solving some optimization problems and comparisons are made between different optimization algorithms.

Published in:

IEEE Transactions on Industrial Informatics  (Volume:7 ,  Issue: 3 )