Unit Bit Importance Evolutionary Algorithm

In Darwinian-type binary-coded genetic algo- rithms, there exist bit importance and convergent order of bit. Inspired from this phenomenon, we propose an evolutionary algorithm called Unit Bit Importance Evolutionary Algorithm (UBIEA). Compared with Darwinian-type genetic algorithms, UBIEA completel...

Full description

Saved in:
Bibliographic Details
Published inSoft computing (Berlin, Germany) Vol. 11; no. 2; pp. 115 - 122
Main Authors Hong, Yi, Ren, Qingsheng, Zeng, Jin
Format Journal Article
LanguageEnglish
Published Heidelberg Springer Nature B.V 01.01.2007
Subjects
Convergence
Evolutionary algorithms
Genetic algorithms
Online AccessGet full text

Cover

More Information
Summary:In Darwinian-type binary-coded genetic algo- rithms, there exist bit importance and convergent order of bit. Inspired from this phenomenon, we propose an evolutionary algorithm called Unit Bit Importance Evolutionary Algorithm (UBIEA). Compared with Darwinian-type genetic algorithms, UBIEA completely abandons commonly used genetic operators such as mutation and crossover. Its main idea is that: detecting bit importance, speeding up the convergence of important bits and maintaining the diversity of unimportant bits. Although our theoretic analyses are based on the assumption that all bits are independent and have different salience, UBIEA perhaps is usable in a larger framework which can be verified by numerical experiments.
ISSN:1432-7643
1433-7479
DOI:10.1007/s00500-006-0057-7