Preferred Language
Articles
/
jeasiq-1597
A Novel Invasive Weed Optimization Algorithm (IWO) by Whale Optimization Algorithm(WOA) to solve Large Scale Optimization Problems
...Show More Authors

Abstract  

  In this work, two algorithms of Metaheuristic algorithms were hybridized. The first is Invasive Weed Optimization algorithm (IWO) it is a numerical stochastic optimization algorithm and the second is Whale Optimization Algorithm (WOA) it is an algorithm based on the intelligence of swarms and community intelligence. Invasive Weed Optimization Algorithm (IWO) is an algorithm inspired by nature and specifically from the colonizing weeds behavior of weeds, first proposed in 2006 by Mehrabian and Lucas. Due to their strength and adaptability, weeds pose a serious threat to cultivated plants, making them a threat to the cultivation process. The behavior of these weeds has been simulated and used in Invasive Weed Optimization Algorithm (IWO), as for the Whale Optimization Algorithm (WOA) uses the intelligence of the swarms to reach the goal and achieve the best solution, which simulates the unique hunting behavior of humpback whales, which is called fishing by bubble trap hunting by creating distinctive bubbles along a circle or a path in the form of 9 has appeared for the first time in 2016 by Mirjalili and Lewis. In order to benefit from the intelligence of the flocks and to avoid falling into local solutions, the new hybridization between the IWO and WOA algorithm was proposed to launch the new hybrid algorithm (IWOWOA). The new hybrid algorithm (IWOWOA) was applied on 23 functions of large scale optimization problems, The proposed algorithm showed very high efficiency in solving these functions. The proposed algorithm was able to reach the optimal solutions by achieving the minimum value of most of these functions. This algorithm was compared with the basic algorithms IWO, WOA and two algorithms that follow the swarm system these algorithms are particle swarm optimization (PSO) and chicken swarm optimization (CSO) [7], they have been statistically tested by calculating the mean arithmetic μ and standard deviation σ for these functions.

Crossref
View Publication Preview PDF
Quick Preview PDF
Publication Date
Sat Jul 20 2024
Journal Name
Journal Of Interdisciplinary Mathematics
Elzaki transform decomposition approach to solve Riccati matrix differential equations
...Show More Authors

Elzaki Transform Adomian decomposition technique (ETADM), which an elegant combine, has been employed in this work to solve non-linear Riccati matrix differential equations. Solutions are presented to demonstrate the relevance of the current approach. With the use of figures, the results of the proposed strategy are displayed and evaluated. It is demonstrated that the suggested approach is effective, dependable, and simple to apply to a range of related scientific and technical problems.

Scopus (4)
Scopus
Publication Date
Sat Nov 01 2025
Journal Name
Iop Conference Series: Earth And Environmental Science
The effect of large-scale engineered roughness elements on the hydraulics of the Shatt al-Arab estuary: Methodology
...Show More Authors
Abstract<p>Erosion and deposition are natural phenomena in the river estuaries that could be presented as a dynamic process involving removing materials from one location and accumulating these materials at other locations. These two phenomena may cause changes in waterways and affect offshore structures. The Shatt Al-Arab River Estuary, Iraq was greatly affected by these two phenomena, and topography changes occurred. Velocity profiles and bed shear stress can be used as indicators to identify the erosion and deposition locations. Large-scale roughness elements proved to make beneficial changes in the hydraulic properties of open channels. They can create desirable effects to control erosion</p> ... Show More
View Publication
Scopus Crossref
Publication Date
Sat Jan 01 2011
Journal Name
Journal Of The College Of Basic Education
Solving Job-Shop Scheduling Problem Using Genetic Algorithm Approach
...Show More Authors

Publication Date
Wed May 06 2015
Journal Name
16th Conference In Natural Science And Mathematics
Efficient digital Image filtering method based on fuzzy algorithm
...Show More Authors

Recently, Image enhancement techniques can be represented as one of the most significant topics in the field of digital image processing. The basic problem in the enhancement method is how to remove noise or improve digital image details. In the current research a method for digital image de-noising and its detail sharpening/highlighted was proposed. The proposed approach uses fuzzy logic technique to process each pixel inside entire image, and then take the decision if it is noisy or need more processing for highlighting. This issue is performed by examining the degree of association with neighboring elements based on fuzzy algorithm. The proposed de-noising approach was evaluated by some standard images after corrupting them with impulse

... Show More
View Publication
Publication Date
Wed Mar 23 2011
Journal Name
Ibn Al- Haitham J. For Pure & Appl. Sci.
Image Compression Using Proposed Enhanced Run Length Encoding Algorithm
...Show More Authors

In this paper, we will present proposed enhance process of image compression by using RLE algorithm. This proposed yield to decrease the size of compressing image, but the original method used primarily for compressing a binary images [1].Which will yield increasing the size of an original image mostly when used for color images. The test of an enhanced algorithm is performed on sample consists of ten BMP 24-bit true color images, building an application by using visual basic 6.0 to show the size after and before compression process and computing the compression ratio for RLE and for the enhanced RLE algorithm.

Preview PDF
Publication Date
Mon Jan 02 2017
Journal Name
European Journal Of Scientific Research
Fast approach for arabic text encryption using genetic algorithm
...Show More Authors

As s widely use of exchanging private information in various communication applications, the issue to secure it became top urgent. In this research, a new approach to encrypt text message based on genetic algorithm operators has been proposed. The proposed approach follows a new algorithm of generating 8 bit chromosome to encrypt plain text after selecting randomly crossover point. The resulted child code is flipped by one bit using mutation operation. Two simulations are conducted to evaluate the performance of the proposed approach including execution time of encryption/decryption and throughput computations. Simulations results prove the robustness of the proposed approach to produce better performance for all evaluation metrics with res

... Show More
Publication Date
Tue Feb 05 2019
Journal Name
Journal Of Al-qadisiyah For Computer Science And Mathematics
Anemia Blood Cell localization Using Modified K- Means Algorithm
...Show More Authors

View Publication
Publication Date
Wed Sep 15 2021
Journal Name
2021 International Conference On Computing And Communications Applications And Technologies (i3cat)
Parallel Hybrid String Matching Algorithm Using CUDA API Function
...Show More Authors

View Publication
Scopus Crossref
Publication Date
Thu Dec 01 2022
Journal Name
International Journal Of Electrical And Computer Engineering
SENTIMENT RETRIEVAL OF HEALTH RECORDS USING NLP-BASED ALGORITHM
...Show More Authors

Scopus (1)
Scopus
Publication Date
Sun Oct 01 2017
Journal Name
International Journal Of Scientific & Engineering Research
Horizontal Fragmentation for Most Frequency Frequent Pattern Growth Algorithm
...Show More Authors

Abstract: Data mining is become very important at the present time, especially with the increase in the area of information it's became huge, so it was necessary to use data mining to contain them and using them, one of the data mining techniques are association rules here using the Pattern Growth method kind enhancer for the apriori. The pattern growth method depends on fp-tree structure, this paper presents modify of fp-tree algorithm called HFMFFP-Growth by divided dataset and for each part take most frequent item in fp-tree so final nodes for conditional tree less than the original fp-tree. And less memory space and time.

View Publication Preview PDF