CADE: A hybridization of Cultural Algorithm and Differential Evolution for numerical optimization
| Autor: | Ponnuthurai Nagaratnam Suganthan, Noor H. Awad, Mostafa Z. Ali, Robert G. Reynolds |
|---|---|
| Rok vydání: | 2017 |
| Předmět: |
0209 industrial biotechnology
education.field_of_study Information Systems and Management Optimization problem Function optimization Cultural algorithm business.industry Computer science Population Evolutionary algorithm 02 engineering and technology Computer Science Applications Theoretical Computer Science Set (abstract data type) 020901 industrial engineering & automation Artificial Intelligence Control and Systems Engineering Differential evolution 0202 electrical engineering electronic engineering information engineering Benchmark (computing) 020201 artificial intelligence & image processing Artificial intelligence business education Software |
| Zdroj: | Information Sciences. 378:215-241 |
| ISSN: | 0020-0255 |
| DOI: | 10.1016/j.ins.2016.10.039 |
| Popis: | Many real-world problems can be formulated as optimization problems. Such problems pose a challenge for researchers in the design of efficient algorithms capable of finding the best solution with the least computational cost. In this paper, a new evolutionary algorithm is proposed that combines the explorative and exploitative capabilities of two evolutionary algorithms, Cultural Algorithm (CA) and Differential Evolution (DE) algorithm. This hybridization follows the HTH (High-level Teamwork Hybrid) nomenclature in which two meta-heuristics are executed in parallel. The new algorithm named as CADE, manages an overall population which is shared between CA and DE simultaneously. Four modified knowledge sources have been used in proposed CA which are: topographical, situational, normative and domain. The role of the used acceptance function in belief space is to select the knowledge of the best individuals to update the current knowledge. A novel quality function is used to determine the participation ratio for both CA and DE, and then a competitive selection takes place in order to select the proportion of function evaluations allocated for each technique. This collaborative synergy emerges between the DE and CA techniques and is shown to improve the quality of solutions, beyond what each of these two algorithms alone. The performance of the algorithm is evaluated on a set of 50 scalable optimization problems taken from two sources. The first set of 35 came from existing benchmark sets available in the literature. The second set came from the 2014 IEEE Single Function optimization competition. The overall results show that CADE has a favorable performance and scalability behaviors when compared to other recent state-of-the-art algorithms. CADE's overall performance ranked at number 1 for each of the two sets of problems. It is suggested that CADE's success across such a broad spectrum of problem types and complexities bodes well for its application to new and novel applications. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect