DocumentCode
1636713
Title
Messy genetic algorithm learns a classifier to design multiplexers
Author
Skurikhin, Alexei N. ; Surkan, Alvin J.
Author_Institution
Inst. of Phys. & Power Eng., Obninsk, Russia
fYear
1996
Firstpage
100
Lastpage
103
Abstract
A messy genetic algorithm uses an evolutionary method to produce a classifier system. This system produces designs as Boolean functions expressing solutions to multiplexer design problems. The system learns and produces solutions for 6-, 11- and 20-line multiplexers. The designs produced by an evolutionary method perform with 94%, 85% and 63% accuracy, respectively, for these three sizes of multiplexers. The results are compared with those from a simple genetic algorithm and with those from the BOOLE system of S.W. Wilson (1986). The efficiency in obtaining solutions depends on optimal selection of initial lengths of the building blocks. The mechanism that controls the probability of splicing strings is explored also. Experiments show that it is possible to limit chromosome lengths without sacrificing efficiency
Keywords
Boolean functions; CAD; genetic algorithms; learning (artificial intelligence); multiplexing; multiplexing equipment; pattern classification; probability; software performance evaluation; telecommunication computing; BOOLE system; Boolean functions; accuracy; chromosome lengths; classifier learning; efficiency; evolutionary method; initial building block length selection; messy genetic algorithm; multiplexer design; optimal selection; string splicing probability control mechanism; Algorithm design and analysis; Biological cells; Boolean functions; Couplings; Genetic algorithms; Mathematics; Multiplexing; Physics; Power engineering; Splicing;
fLanguage
English
Publisher
ieee
Conference_Titel
Evolutionary Computation, 1996., Proceedings of IEEE International Conference on
Conference_Location
Nagoya
Print_ISBN
0-7803-2902-3
Type
conf
DOI
10.1109/ICEC.1996.542341
Filename
542341
Link To Document