File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: A genetic algorithm that adaptively mutates and never revisits

TitleA genetic algorithm that adaptively mutates and never revisits
Authors
Issue Date2009
Citation
IEEE Transactions on Evolutionary Computation, 2009, v. 13 n. 2, p. 454-472 How to Cite?
AbstractA novel genetic algorithm is reported that is non-revisiting: It remembers every position that it has searched before. An archive is used to store all the solutions that have been explored before. Different from other memory schemes in the literature, a novel binary space partitioning tree archive design is advocated. Not only is the design an efficient method to check for revisits, if any, it in itself constitutes a novel adaptive mutation operator that has no parameter. To demonstrate the power of the method, the algorithm is evaluated using 19 famous benchmark functions. The results are as follows. 1) Though it only uses finite resolution grids, when compared with a canonical genetic algorithm, a generic real-coded genetic algorithm, a canonical genetic algorithm with simple diversity mechanism, and three particle swarm optimization algorithms, it shows a significant improvement. 2) The new algorithm also shows superior performance compared to Covariance Matrix Adaptation Evolution Strategy (CMA-ES), a state-of-the-art method for adaptive mutation. 3) It can work with problems that have large search spaces with dimensions as high as 40. 4) The corresponding CPU overhead of the binary space partitioning tree design is insignificant for applications with expensive or time-consuming fitness evaluations, and for such applications, the memory usage due to the archive is acceptable. 5) Though the adaptive mutation is parameter-less, it shows and maintains a stable good performance. However, for other algorithms we compare, the performance is highly dependent on suitable parameter settings. © 2008 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/196704
ISSN
2015 Impact Factor: 5.908
2015 SCImago Journal Rankings: 4.308
ISI Accession Number ID

 

DC FieldValueLanguage
dc.contributor.authorYuen, SY-
dc.contributor.authorChow, CK-
dc.date.accessioned2014-04-24T02:10:35Z-
dc.date.available2014-04-24T02:10:35Z-
dc.date.issued2009-
dc.identifier.citationIEEE Transactions on Evolutionary Computation, 2009, v. 13 n. 2, p. 454-472-
dc.identifier.issn1089-778X-
dc.identifier.urihttp://hdl.handle.net/10722/196704-
dc.description.abstractA novel genetic algorithm is reported that is non-revisiting: It remembers every position that it has searched before. An archive is used to store all the solutions that have been explored before. Different from other memory schemes in the literature, a novel binary space partitioning tree archive design is advocated. Not only is the design an efficient method to check for revisits, if any, it in itself constitutes a novel adaptive mutation operator that has no parameter. To demonstrate the power of the method, the algorithm is evaluated using 19 famous benchmark functions. The results are as follows. 1) Though it only uses finite resolution grids, when compared with a canonical genetic algorithm, a generic real-coded genetic algorithm, a canonical genetic algorithm with simple diversity mechanism, and three particle swarm optimization algorithms, it shows a significant improvement. 2) The new algorithm also shows superior performance compared to Covariance Matrix Adaptation Evolution Strategy (CMA-ES), a state-of-the-art method for adaptive mutation. 3) It can work with problems that have large search spaces with dimensions as high as 40. 4) The corresponding CPU overhead of the binary space partitioning tree design is insignificant for applications with expensive or time-consuming fitness evaluations, and for such applications, the memory usage due to the archive is acceptable. 5) Though the adaptive mutation is parameter-less, it shows and maintains a stable good performance. However, for other algorithms we compare, the performance is highly dependent on suitable parameter settings. © 2008 IEEE.-
dc.languageeng-
dc.relation.ispartofIEEE Transactions on Evolutionary Computation-
dc.titleA genetic algorithm that adaptively mutates and never revisits-
dc.typeArticle-
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1109/TEVC.2008.2003008-
dc.identifier.scopuseid_2-s2.0-67349219650-
dc.identifier.volume13-
dc.identifier.issue2-
dc.identifier.spage454-
dc.identifier.epage472-
dc.identifier.isiWOS:000265091900016-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats