Please use this identifier to cite or link to this item:
https://hdl.handle.net/10356/170837
Title: | An iterative cyclic tri-strategy hybrid stochastic fractal with adaptive differential algorithm for global numerical optimization | Authors: | Abdel-Nabi, Heba Ali, Mostafa Z. Awajan, Arafat Alazrai, Rami Daoud, Mohammad I. Suganthan, Ponnuthurai Nagaratnam |
Keywords: | Engineering::Electrical and electronic engineering | Issue Date: | 2023 | Source: | Abdel-Nabi, H., Ali, M. Z., Awajan, A., Alazrai, R., Daoud, M. I. & Suganthan, P. N. (2023). An iterative cyclic tri-strategy hybrid stochastic fractal with adaptive differential algorithm for global numerical optimization. Information Sciences, 628, 92-133. https://dx.doi.org/10.1016/j.ins.2023.01.065 | Journal: | Information Sciences | Abstract: | Many real-life problems can be formulated as numerical optimization problems. Such problems pose a challenge for researchers when designing efficient techniques that are capable of finding the desired solution without suffering from premature convergence. This paper proposes a novel evolutionary algorithm that blends the exploitative and explorative merits of two main evolutionary algorithms, namely the Stochastic Fractal Search (SFS) and a Differential Evolution (DE) variant. This amalgam has an effective interaction and cooperation of an ensemble of diverse strategies to derive a single framework called Iterative Cyclic Tri-strategy with adaptive Differential Stochastic Fractal Evolutionary Algorithm (Ic3-aDSF-EA). The component algorithms cooperate and compete to enhance the quality of the generated solutions and complement each other. The iterative cycles in the proposed algorithm consist of three consecutive phases. The main idea behind the cyclic nature of Ic3-aDSF-EA is to gradually emphasize the work of the best-performing algorithm without ignoring the effects of the other inferior algorithm during the search process. The cooperation of component algorithms takes place at the end of each cycle for information sharing and the quality of solutions for the next cycle. The algorithm's performance is evaluated on 43 problems from three different benchmark suites. The paper also investigates the application to a set of real-life problems. The overall results show that the proposed Ic3-aDSF-EA has a propitious performance and a reliable scalability behavior compared to other state-of-the-art algorithms. | URI: | https://hdl.handle.net/10356/170837 | ISSN: | 0020-0255 | DOI: | 10.1016/j.ins.2023.01.065 | Schools: | School of Electrical and Electronic Engineering | Rights: | © 2023 Published by Elsevier Inc. All rights reserved. | Fulltext Permission: | none | Fulltext Availability: | No Fulltext |
Appears in Collections: | EEE Journal Articles |
SCOPUSTM
Citations
50
5
Updated on May 4, 2025
Web of ScienceTM
Citations
50
1
Updated on Oct 21, 2023
Page view(s)
144
Updated on May 6, 2025
Google ScholarTM
Check
Altmetric
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.