Anzeige
Erschienen in:
2018 | OriginalPaper | Buchkapitel
An Optimization Algorithm Based on Multi-Dynamic Schema of Chromosomes
verfasst von : Radhwan Al-Jawadi, Marcin Studniarski
Erschienen in: Artificial Intelligence and Soft Computing
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Abstract
In this work, a new efficient evolutionary algorithm to enhance the global optimization search is presented, which applies double populations, each population divided into several groups. The first population is original and the second one is a copy of the first one but with different operators are applied to it. The operators used in this paper are dynamic schema, dynamic dissimilarity, dissimilarity, similarity and a random generation of new chromosomes. This algorithm is called Multi-Dynamic Schema with Dissimilarity and Similarity of Chromosomes (MDSDSC) which is a more elaborate version of our previous DSC and DSDSC algorithms. We have applied this algorithm to 20 test functions in 2 and 10 dimensions. Comparing the MDSDSC with the classical GA, DSC, DSDSC and, for some functions, BA and PSO algorithms, we have found that, in most cases, our method is better than the GA, BA and DSC.