A theoretical development and analysis of jumping gene genetic algorithm
Research output: Journal Publications and Reviews (RGC: 21, 22, 62) › 21_Publication in refereed journal › peer-review
Author(s)
Related Research Unit(s)
Detail(s)
| Original language | English |
|---|---|
| Article number | 5937032 |
| Pages (from-to) | 408-418 |
| Journal / Publication | IEEE Transactions on Industrial Informatics |
| Volume | 7 |
| Issue number | 3 |
| Publication status | Published - Aug 2011 |
Link(s)
Abstract
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. © 2011 IEEE.
Research Area(s)
- Equilibrium, gene transposition, jumping genes, schema
Citation Format(s)
A theoretical development and analysis of jumping gene genetic algorithm. / Tang, Kit Sang; Yin, Richard J.; Kwong, Sam et al.
In: IEEE Transactions on Industrial Informatics, Vol. 7, No. 3, 5937032, 08.2011, p. 408-418.Research output: Journal Publications and Reviews (RGC: 21, 22, 62) › 21_Publication in refereed journal › peer-review
