Please use this identifier to cite or link to this item:
|Title:||Improving locality in binary representation via redundancy|
Al Mamun, A.
Evolutionary algorithm (EA)
|Source:||Chiam, S.C., Tan, K.C., Goh, C.K., Al Mamun, A. (2008-06). Improving locality in binary representation via redundancy. IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics 38 (3) : 808-825. ScholarBank@NUS Repository. https://doi.org/10.1109/TSMCB.2008.918071|
|Abstract:||Binary representation suffers from the problem of positional dependence, where the amplitude of phenotype variation is dependent on the position of the altered genotype bits. However, this is contrary to conventional variation operations that treat each genotype bit equally. Positional dependence can be attributed to the poor locality, which results in neighboring genotypes having low correlation in the phenotype space, reducing the effectiveness of systematic local search and evolutionary search based on small mutation steps. For this purpose, this paper will propose an alternative genotype-phenotype mapping for binary representation that introduces redundancy into the mapping and removes the exponential orderings between the alleles, hence improving the locality between the genotype and phenotype search space. Empirical study conducted based on distribution, locality, and mutation innovation revealed key algorithmic characteristics of the proposed code, and its practicality is validated by comparative studies based on different benchmark optimization problems. Possible approaches to resolve the overrepresentation problem due to redundancy will be suggested, exhibiting its flexibility and variability in implementation. © 2008 IEEE.|
|Source Title:||IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 7, 2017
WEB OF SCIENCETM
checked on Nov 29, 2017
checked on Dec 11, 2017
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.