Preferred Language
Articles
/
k4ZMM4YBIXToZYALiX5N
Fine-Tuning Meta-Heuristic Algorithm for Global Optimization
...Show More Authors

This paper proposes a novel meta-heuristic optimization algorithm called the fine-tuning meta-heuristic algorithm (FTMA) for solving global optimization problems. In this algorithm, the solutions are fine-tuned using the fundamental steps in meta-heuristic optimization, namely, exploration, exploitation, and randomization, in such a way that if one step improves the solution, then it is unnecessary to execute the remaining steps. The performance of the proposed FTMA has been compared with that of five other optimization algorithms over ten benchmark test functions. Nine of them are well-known and already exist in the literature, while the tenth one is proposed by the authors and introduced in this article. One test trial was shown to check the performance of each algorithm, and the other test for 30 trials to measure the statistical results of the performance of the proposed algorithm against the others. Results confirm that the proposed FTMA global optimization algorithm has a competing performance in comparison with its counterparts in terms of speed and evading the local minima.

Scopus Clarivate Crossref
View Publication Preview PDF
Quick Preview PDF
Publication Date
Mon Jan 01 2024
Journal Name
Bio Web Of Conferences
Dynamic TWGH: Client-Server Optimization for Scalable Combinatorial Test Suite Generation
...Show More Authors

To ensure that a software/hardware product is of sufficient quality and functionality, it is essential to conduct thorough testing and evaluations of the numerous individual software components that make up the application. Many different approaches exist for testing software, including combinatorial testing and covering arrays. Because of the difficulty of dealing with difficulties like a two-way combinatorial explosion, this brings up yet another problem: time. Using client-server architectures, this research introduces a parallel implementation of the TWGH algorithm. Many studies have been conducted to demonstrate the efficiency of this technique. The findings of this experiment were used to determine the increase in speed and co

... Show More
View Publication
Scopus (1)
Crossref (1)
Scopus Crossref
Publication Date
Fri Apr 01 2022
Journal Name
Baghdad Science Journal
Improved Firefly Algorithm with Variable Neighborhood Search for Data Clustering
...Show More Authors

Among the metaheuristic algorithms, population-based algorithms are an explorative search algorithm superior to the local search algorithm in terms of exploring the search space to find globally optimal solutions. However, the primary downside of such algorithms is their low exploitative capability, which prevents the expansion of the search space neighborhood for more optimal solutions. The firefly algorithm (FA) is a population-based algorithm that has been widely used in clustering problems. However, FA is limited in terms of its premature convergence when no neighborhood search strategies are employed to improve the quality of clustering solutions in the neighborhood region and exploring the global regions in the search space. On the

... Show More
View Publication Preview PDF
Scopus (14)
Crossref (4)
Scopus Clarivate Crossref
Publication Date
Sat May 01 2021
Journal Name
Journal Of Physics: Conference Series
A Parallel Adaptive Genetic Algorithm for Job Shop Scheduling Problem
...Show More Authors

Publication Date
Sun Dec 01 2013
Journal Name
2013 Ieee International Rf And Microwave Conference (rfm)
Differential Evolution algorithm for linear frequency modulation radar signal denoising
...Show More Authors

Signal denoising is directly related to sample estimation of received signals, either by estimating the equation parameters for the target reflections or the surrounding noise and clutter accompanying the data of interest. Radar signals recorded using analogue or digital devices are not immune to noise. Random or white noise with no coherency is mainly produced in the form of random electrons, and caused by heat, environment, and stray circuitry loses. These factors influence the output signal voltage, thus creating detectable noise. Differential Evolution (DE) is an effectual, competent, and robust optimisation method used to solve different problems in the engineering and scientific domains, such as in signal processing. This paper looks

... Show More
View Publication
Scopus Crossref
Publication Date
Fri Feb 08 2019
Journal Name
Journal Of The College Of Education For Women
Minimum Spanning Tree Algorithm for Skin Cancer Image Object Detection
...Show More Authors

This paper proposes a new method Object Detection in Skin Cancer Image, the minimum
spanning tree Detection descriptor (MST). This ObjectDetection descriptor builds on the
structure of the minimum spanning tree constructed on the targettraining set of Skin Cancer
Images only. The Skin Cancer Image Detection of test objects relies on their distances to the
closest edge of thattree. Our experimentsshow that the Minimum Spanning Tree (MST) performs
especially well in case of Fogginessimage problems and in highNoisespaces for Skin Cancer
Image.
The proposed method of Object Detection Skin Cancer Image wasimplemented and tested on
different Skin Cancer Images. We obtained very good results . The experiment showed that

... Show More
View Publication Preview PDF
Publication Date
Mon Jul 01 2019
Journal Name
2019 International Joint Conference On Neural Networks (ijcnn)
A Fast Feature Extraction Algorithm for Image and Video Processing
...Show More Authors

View Publication
Scopus (40)
Crossref (38)
Scopus Clarivate Crossref
Publication Date
Thu Jan 01 2015
Journal Name
Journal Of Al-mansoor College
An Improvement to Face Detection Algorithm for Non-Frontal Faces
...Show More Authors

Publication Date
Fri Apr 01 2011
Journal Name
Al-mustansiriyah Journal Of Science
A Genetic Algorithm Based Approach For Generating Unit Maintenance Scheduling
...Show More Authors

Publication Date
Fri Apr 01 2022
Journal Name
Baghdad Science Journal
An Evolutionary Algorithm for Solving Academic Courses Timetable Scheduling Problem
...Show More Authors

Scheduling Timetables for courses in the big departments in the universities is a very hard problem and is often be solved by many previous works although results are partially optimal. This work implements the principle of an evolutionary algorithm by using genetic theories to solve the timetabling problem to get a random and full optimal timetable with the ability to generate a multi-solution timetable for each stage in the collage. The major idea is to generate course timetables automatically while discovering the area of constraints to get an optimal and flexible schedule with no redundancy through the change of a viable course timetable. The main contribution in this work is indicated by increasing the flexibility of generating opti

... Show More
View Publication Preview PDF
Scopus (16)
Crossref (8)
Scopus Clarivate Crossref
Publication Date
Sun Aug 01 2021
Journal Name
Journal Of Engineering
Reuse of Glass waste as a partial replacement to fine aggregates in concrete
...Show More Authors

As human societies grow, the problem of waste management becomes one of the pressing issues that need to be addressed. Recycling and reuse of waste are effective waste management measures that prevent pollution and conserve natural resources. In this study, the possibility of using glass waste as an alternative was used as a partial weight substitute for fine aggregates with replacement ratios of 10, 20, 30, and 40% by the weight, and formed into test models (15 cm * 15 cm ) cube and (15 cm * 30 cm) cylinder, then matured and tested their strength compression and tensile strength at the age of 7 and 28 days and compared with a reference or conventional concrete with a mixing ratio (1: 1.5: 3) as well as testing its worka

... Show More
View Publication Preview PDF
Crossref (4)
Crossref