Azad Abdullah Ameen

Dr. Azad Abdullah Ameen

Computer Science, Charmo University, Sulaymaniyah, Iraq
orcid
Dr. Azad Abdullah Ameen is a Lecturer in the Department of C...

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
8 May 2023 in Applied Sciences
Verified
Journal Article
Open access
PDF file
Azad Abdullah AmeenAzad Abdullah Ameen
Azad Abdullah Ameen
Tarik RashidTarik Rashid
Tarik Rashid
SAshavan askar
shavan askar
Child drawing development optimization (CDDO) is a recent example of a metaheuristic algorithm. The motive for inventing this method is children’s learning behavior and cognitive development, with the golden ratio being employed to optimize the aesthetic value of their artwork. Unfortunately, CDDO suffers from low performance in the exploration phase, and the local best solution stagnates. Harmony search (HS) is a highly competitive algorithm relative to other prevalent metaheuristic algorithms, as its exploration phase performance on unimodal benchmark functions is outstanding. Thus, to avoid these issues, we present CDDO–HS, a hybridization of both standards of CDDO and HS. The hybridized model proposed consists of two phases. Initially, the pattern size (PS) is relocated to the algorithm’s core and the initial pattern size is set to 80% of the total population size. Second, the standard harmony search (HS) is added to the pattern size (PS) for the exploration phase to enhance and update the solution after each iteration. Experiments are evaluated using two distinct standard benchmark functions, known as classical test functions, including 23 common functions and 10 CEC-C06 2019 functions. Additionally, the suggested CDDO–HS is compared to CDDO, the HS, and six others widely used algorithms. Using the Wilcoxon rank-sum test, the results indicate that CDDO–HS beats alternative algorithms.

23 September 2024 in Algorithms
Verified
Journal Article
Open access
PDF file
Hemin Sardar AbdullaHemin Sardar Abdulla
Hemin Sardar Abdulla
Azad Abdullah AmeenAzad Abdullah Ameen
Azad Abdullah Ameen
SSSarwar Saeed
Sarwar Saeed
IMIsmail Asaad Mohammed
Ismail Asaad Mohammed
Tarik RashidTarik Rashid
Tarik Rashid
The rapid advancement of intelligent technology has led to the development of optimization algorithms that leverage natural behaviors to address complex issues. Among these, the Rat Swarm Optimizer (RSO), inspired by rats’ social and behavioral characteristics, has demonstrated potential in various domains, although its convergence precision and exploration capabilities are limited. To address these shortcomings, this study introduces the Modified Rat Swarm Optimizer (MRSO), designed to enhance the balance between exploration and exploitation. The MRSO incorporates unique modifications to improve search efficiency and robustness, making it suitable for challenging engineering problems such as Welded Beam, Pressure Vessel, and Gear Train Design. Extensive testing with classical benchmark functions shows that the MRSO significantly improves performance, avoiding local optima and achieving higher accuracy in six out of nine multimodal functions and in all seven fixed-dimension multimodal functions. In the CEC 2019 benchmarks, the MRSO outperforms the standard RSO in six out of ten functions, demonstrating superior global search capabilities. When applied to engineering design problems, the MRSO consistently delivers better average results than the RSO, proving its effectiveness. Additionally, we compared our approach with eight recent and well-known algorithms using both classical and CEC-2019 benchmarks. The MRSO outperformed each of these algorithms, achieving superior results in six out of 23 classical benchmark functions and in four out of ten CEC-2019 benchmark functions. These results further demonstrate the MRSO’s significant contributions as a reliable and efficient tool for optimization tasks in engineering applications.
1

3 July 2025 in Kurdistan Journal of Applied Research
Verified
Journal Article
Open access
PDF file
SAShabaz Kawa Ali
Shabaz Kawa Ali
Azad Abdullah AmeenAzad Abdullah Ameen
Azad Abdullah Ameen
Nowadays, real-world optimization problems are becoming increasingly complex tasks, prompting the development of nature-inspired algorithms that mimic biological phenomena to improve search performance and solution quality. The Mud Ring Algorithm (MRA), inspired by the cooperative hunting behavior of bottlenose dolphins, has shown promise but remains sensitive to parameter settings, especially when balancing exploration and exploitation. To address these limitations, this paper proposes the Enhanced Mud Ring Algorithm (EMRA), which introduces a novel mechanism to more effectively manage the exploration-exploitation tradeoff. This modification allows the algorithm to escape local minima and explore the solution space more effectively. Numerical experiments on some standard benchmark functions as well as the difficult Congress on Evolutionary Computation 2019 benchmark suite show that EMRA outperforms the original MRA in terms of accuracy performance and computational cost, especially when dealing with high-dimension and multi-peak functions. In addition, EMRA was used in three complex engineering optimization problem designs (welded beam, pressure vessel, and tension spring), and the results were found to be more accurate and reliable than MRA. These results validate the strength and applicability of EMRA as a general optimization tool to tackle complex problems from many different disciplines, including real-world problems requiring the exhaustive exploration of multiple options. In summary, this study shows that EMRA is an effective extension of metaheuristic optimization that is applicable in real-world problems.

30 January 2023
Verified
Book Chapter
Open access
PDF file
Azad Abdullah AmeenAzad Abdullah Ameen
Azad Abdullah Ameen
Tarik RashidTarik Rashid
Tarik Rashid
SAShavan Askar
Shavan Askar
In 2021, a novel metaheuristic algorithm inspired by the child’s learning behavior and cognitive development employs the golden ratio. The golden ratio was first presented by the renowned scientist Fibonacci. The ratio of two consecutive numbers in the Fibonacci sequence is alike, and it is named the golden ratio, which is predominant in nature, architecture, design, and art. The Child Drawing Development Optimization Algorithm implements the golden ratio and mimics cognitive learning and the child’s drawing development stages starting from the scribbling stage to the advanced pattern-based stage. This aids children with developing, refining their intelligence, and cooperatively achieving shared goals. The Child Drawing Development Optimization Algorithm is developed for single objective optimization problems, and it is also compared to Particle Swarm Optimization, Differential Evolution, Whale Optimization Algorithm, Gravitational search algorithm, and Fast Evolutionary Programming, Child Drawing Development Optimization Algorithm demonstrated its ability to handle complex optimization problems. The main contribution of this paper is to present and explains the Child Drawing Development Optimization Algorithm and uses them as models in a case study to minimize a fitness function. The initial population has been successfully fully improved as a result, and the best solution has been obtained by the Child Drawing Development Optimization Algorithm.

12 May 2023 in arXiv
Verified
Preprint
Open access
PDF file
Azad Abdullah AmeenAzad Abdullah Ameen
Azad Abdullah Ameen
Tarik RashidTarik Rashid
Tarik Rashid
SAShavan Askar
Shavan Askar
Child drawing development optimization (CDDO) is a recent example of a metaheuristic algorithm. The motive for inventing this method is children's learning behavior and cognitive development, with the golden ratio employed to optimize their artwork's aesthetic value. Unfortunately, CDDO suffers from low performance in the exploration phase, and the local best solution stagnates. Harmony search (HS) is a highly competitive algorithm relative to other prevalent metaheuristic algorithms, as its exploration phase performance on unimodal benchmark functions is outstanding. Thus, to avoid these issues, we present CDDOHS, a hybridization of both standards of CDDO and HS. The hybridized model proposed consists of two phases. Initially, the pattern size (PS) is relocated to the algorithm's core and the initial pattern size is set to 80 % of the total population size. Second, the standard harmony search (HS) is added to the pattern size (PS) for the exploration phase to enhance and update the solution after each iteration. Experiments are evaluated using two distinct standard benchmark functions, known as classical test functions, including 23 common functions and 10 CEC-C06 2019 functions. Additionally, the suggested CDDOHS is compared to CDDO, HS, and six other widely used algorithms. Using the Wilcoxon ranksum test, the results indicate that CDDOHS beats alternative algorithms.

2 September 2026 in Preprints.org
Verified
Preprint
Open access
PDF file
Azad Abdullah AmeenAzad Abdullah Ameen
Azad Abdullah Ameen
Most population-based metaheuristics govern the exploration–exploitation balance with a monotonically decreasing parameter, locking the search into fine-tuning early with no principled way to recover diversity. This paper introduces Pray Algorithm Optimization (PAO), whose schedule is derived from an external physical model rather than a decay rule chosen by hand: the run is mapped to a solar day, and the instantaneous solar altitude places five operators at the canonical Islamic prayer times, producing a non-monotone profile that restores diversity at fixed, planned points. PAO is validated against 42 competing algorithms over 75 benchmark functions — the classical 23-function set and the CEC-2017, CEC-2019 and CEC-2022 suites — with 30 runs of 500 iterations, and on 22 constrained engineering design problems. It ranks first of 43 algorithms on CEC-2017 (mean rank 2.17), CEC-2019 (4.55), CEC-2022 (4.38) and the engineering suite (2.96), and second on the classical set, where widespread ties at the global optimum compress the ranking. Friedman tests reject rank equality on every collection (p < 10⁻²⁶), and Wilcoxon win rates reach 86–94 % on the modern suites. On the engineering problems, PAO recovers or improves the reference optimum on 18 of 22 designs, attains the best solution found by any algorithm on 20, and is statistically net-positive against all 42 competitors. Diversity analysis shows an adaptive balance, from 4 % exploration on unimodal landscapes to 52 % on deceptive ones, while an ablation indicates the schedule acts chiefly as a variance-reduction mechanism. PAO ranks 36–41 of 43 in speed, though its complexity stays in the same class as standard swarm methods. Source code is available from the corresponding author.