Articles
Permanent URI for this collection
Browse
Browsing Articles by Author "Abu Doush, Iyad"
Now showing 1 - 4 of 4
Results Per Page
Sort Options
- PublicationA hybrid Harris Hawks optimizer for economic load dispatch problems(2023)
;Al-Betar, Mohammed Azmi ;Awadallah, Mohammed A. ;Makhadmeh, Sharif Naser ;Abu Doush, Iyad; ;Alshathri, SamahAbd Elaziz, MohamedThis paper proposes a hybridized version of the Harris Hawks Optimizer (HHO) with adaptive-hill-climbing optimizer to tackle economic load dispatch (ELD) problems. ELD is an important problem in power systems that is tackled by finding the optimal schedule of the generation units that minimize fuel conceptions under a set of constraints. Due to the complexity of ELD search space, as it is rigid and deep, the exploitation of HHO is improved by hybridizing it with a recent local search method called adaptive-hill climbing. The HHO can navigate several potential search space regions, while adaptive-hill climbing is used to deeply search for the local optimal solution in each potential region. To evaluate the proposed approach, six versions of ELD cases with various complexities and constraints have been used which are the 6 generation units with 1263 MW of load demand, 13 generation units with 1800 MW of load demand, 13 generation units with 2520 MW of load demand, 15 generation units with 2630 MW of load demand, 40 generation units with 10500 MW of load demand, and 140 generation units with 49342 MW of load demand. Furthermore, the proposed algorithm is evaluated on two ELD real-world cases which are 6 units-1263 MW and 15units-2630 MW. The results show that the proposed algorithm can achieve a significant performance for the majority of the experimented cases. It can achieve the best-reported solution for the ELD case with 15 generation units when compared to 15 well-established methods. Additionally, it obtains the second-best for the ELD case with 140 generation units when compared to 10 well-established methods. In conclusion, the proposed method can be an alternative to solve ELD problems which is efficient.Scopus© Citations 33 43 10 - PublicationAn enhanced binary Rat Swarm Optimizer based on local-best concepts of PSO and collaborative crossover operators for feature selection(2022)
; ;Awadallah, Mohammed A. ;Al-Betar, Mohammed Azmi ;Braik, Malik Shehadeh ;Hammouri, Abdelaziz I.Abu Doush, IyadIn this paper, an enhanced binary version of the Rat Swarm Optimizer (RSO) is proposed to deal with Feature Selection (FS) problems. FS is an important data reduction step in data mining which finds the most representative features from the entire data. Many FS-based swarm intelligence algorithms have been used to tackle FS. However, the door is still open for further investigations since no FS method gives cutting-edge results for all cases. In this paper, a recent swarm intelligence metaheuristic method called RSO which is inspired by the social and hunting behavior of a group of rats is enhanced and explored for FS problems. The binary enhanced RSO is built based on three successive modifications: i) an S-shape transfer function is used to develop binary RSO algorithms; ii) the local search paradigm of particle swarm optimization is used with the iterative loop of RSO to boost its local exploitation; iii) three crossover mechanisms are used and controlled by a switch probability to improve the diversity. Based on these enhancements, three versions of RSO are produced, referred to as Binary RSO (BRSO), Binary Enhanced RSO (BERSO), and Binary Enhanced RSO with Crossover operators (BERSOC). To assess the performance of these versions, a benchmark of 24 datasets from various domains is used. The proposed methods are assessed concerning the fitness value, number of selected features, classification accuracy, specificity, sensitivity, and computational time. The best performance is achieved by BERSOC followed by BERSO and then BRSO. These proposed versions are comparatively assessed against 25 well-regarded metaheuristic methods and five filter-based approaches. The obtained results underline their superiority by producing new best results for some datasets.Scopus© Citations 54 88 31 - PublicationAn Intensive and Comprehensive Overview of JAYA Algorithm, its Versions and Applications(2022)
; ;Al‑Betar, Mohammed Azmi ;Awadallah, Mohammed A. ;Abu Doush, IyadAssaleh, KhaledIn this review paper, JAYA algorithm, which is a recent population-based algorithm is intensively overviewed. The JAYA algorithm combines the survival of the fittest principle from evolutionary algorithms as well as the global optimal solution attractions of Swarm Intelligence methods. Initially, the optimization model and convergence characteristics of JAYA algorithm are carefully analyzed. Thereafter, the proposed versions of JAYA algorithm have been surveyed such as modified, binary, hybridized, parallel, chaotic, multi-objective and others. The various applications tackled using relevant versions of JAYA algorithm are also discussed and summarized based on several problem domains. Furthermore, the open sources code of JAYA algorithm are identified to provide enrich resources for JAYA research communities. The critical analysis of JAYA algorithm reveals its advantages and limitations in dealing with optimization problems. Finally, the paper ends up with conclusion and possible future enhancements suggested to improve the performance of JAYA algorithm. The reader of this overview will determine the best domains and applications used by JAYA algorithm and can justify their JAYA-related contributions.Scopus© Citations 110 125 59 - PublicationRecent advances in Grey Wolf Optimizer, its versions and applications: Review(2023)
; ;Makhadmeh, Sharif Naser ;Al-Betar, Mohammed Azmi ;Abu Doush, Iyad ;Awadallah, Mohammed A. ;Kassaymeh, SofianMirjalili, SeyedaliThe Grey Wolf Optimizer (GWO) has emerged as one of the most captivating swarm intelligence methods, drawing inspiration from the hunting behavior of wolf packs. GWO’s appeal lies in its remarkable characteristics: it is parameter-free, derivative-free, conceptually simple, user-friendly, adaptable, flexible, and robust. Its efficacy has been demonstrated across a wide range of optimization problems in diverse domains, including engineering, bioinformatics, biomedical, scheduling and planning, and business. Given the substantial growth and effectiveness of GWO, it is essential to conduct a recent review to provide updated insights. This review delves into the GWO-related research conducted between 2019 and 2022, encompassing over 200 research articles. It explores the growth of GWO in terms of publications, citations, and the domains that leverage its potential. The review thoroughly examines the latest versions of GWO, categorizing them based on their contributions. Additionally, it highlights the primary applications of GWO, with computer science and engineering emerging as the dominant research domains. A critical analysis of the accomplishments and limitations of GWO is presented, offering valuable insights. Finally, the review concludes with a brief summary and outlines potential future developments in GWO theory and applications. Researchers seeking to employ GWO as a problem-solving tool will find this comprehensive review immensely beneficial in advancing their research endeavors.23Scopus© Citations 17