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
Sun Dec 01 2019
Journal Name
Baghdad Science Journal
Studying the Crystal Structure, Topography, and Anti-bacterial of a Novel Titania (TiO2 NPs) Prepared by a Sol-gel Manner
...Show More Authors

In this research, titanium dioxide nanoparticles (TiO2 NPs) were prepared through the sol-gel process at an acidic medium (pH3).TiO2 nanoparticles were prepared from titanium trichloride (TiCl3) as a precursor with Ammonium hydroxide (NH4OH) with 1:3 ratio at 50 °C. The resulting gel was dried at 70 °C to obtain the Nanocrystalline powder. The powder from the drying process was treated thermally at temperatures 500 °C and 700 °C. The crystalline structure, surface morphology, and particle size were studied by using X-ray diffraction (XRD), Atomic Force Microscopy (AFM), and Scanning Electron Microscope (SEM). The results showed (anatase) phase of titanium dioxide with the average grain size

... Show More
View Publication Preview PDF
Scopus (6)
Crossref (3)
Scopus Clarivate Crossref
Publication Date
Fri Oct 20 2023
Journal Name
Ibn Al-haitham Journal For Pure And Applied Sciences
Novel Approximate Solutions for Nonlinear Initial and Boundary Value Problems
...Show More Authors

This paper investigates an effective computational method (ECM) based on the standard polynomials used to solve some nonlinear initial and boundary value problems appeared in engineering and applied sciences. Moreover, the effective computational methods in this paper were improved by suitable orthogonal base functions, especially the Chebyshev, Bernoulli, and Laguerre polynomials, to obtain novel approximate solutions for some nonlinear problems. These base functions enable the nonlinear problem to be effectively converted into a nonlinear algebraic system of equations, which are then solved using Mathematica®12. The improved effective computational methods (I-ECMs) have been implemented to solve three applications involving nonli

... Show More
View Publication
Crossref (1)
Crossref
Publication Date
Wed Sep 05 2007
Journal Name
Neural Network World
A canonical generic algorithm for likelihood estimator of first order moving average model parameter
...Show More Authors

The increasing availability of computing power in the past two decades has been use to develop new techniques for optimizing solution of estimation problem. Today's computational capacity and the widespread availability of computers have enabled development of new generation of intelligent computing techniques, such as our interest algorithm, this paper presents one of new class of stochastic search algorithm (known as Canonical Genetic' Algorithm ‘CGA’) for optimizing the maximum likelihood function strategy is composed of three main steps: recombination, mutation, and selection. The experimental design is based on simulating the CGA with different values of are compared with those of moment method. Based on MSE value obtained from bot

... Show More
Scopus (3)
Scopus
Publication Date
Sun Aug 31 2025
Journal Name
International Journal Of Intelligent Engineering And Systems
Enhanced Evolutionary Algorithm for Dynamic Community Detection Using a Vulnerable Node Reassignment-based Mutation
...Show More Authors

Recently, detecting dynamic patterns for growing communities in social networks have attracted significant attention. The objective of dynamic community detection is to analyze and identify clusters in complex networks that change over time. Different optimization algorithms, including both single-objective and multi-objective approaches, have been employed to address the challenge of dynamic community detection. Although current evolutionary algorithms for identifying community structure can traverse extensive areas of partition space, they often become stuck in local minima. In addition, limited studies have addressed this issue by integrating local search strategies with evolutionary algorithms for community identification. This paper in

... Show More
View Publication Preview PDF
Scopus (2)
Scopus Crossref
Publication Date
Wed Nov 16 2016
Journal Name
Eurasip Journal On Wireless Communications And Networking
Evaluation of efficient vehicular ad hoc networks based on a maximum distance routing algorithm
...Show More Authors

Traffic management at road intersections is a complex requirement that has been an important topic of research and discussion. Solutions have been primarily focused on using vehicular ad hoc networks (VANETs). Key issues in VANETs are high mobility, restriction of road setup, frequent topology variations, failed network links, and timely communication of data, which make the routing of packets to a particular destination problematic. To address these issues, a new dependable routing algorithm is proposed, which utilizes a wireless communication system between vehicles in urban vehicular networks. This routing is position-based, known as the maximum distance on-demand routing algorithm (MDORA). It aims to find an optimal route on a hop-by-ho

... Show More
View Publication Preview PDF
Scopus (27)
Crossref (19)
Scopus Clarivate Crossref
Publication Date
Thu Jun 01 2023
Journal Name
Iaes International Journal Of Artificial Intelligence (ij-ai)
Innovations in t-way test creation based on a hybrid hill climbing-greedy algorithm
...Show More Authors

<p>In combinatorial testing development, the fabrication of covering arrays is the key challenge by the multiple aspects that influence it. A wide range of combinatorial problems can be solved using metaheuristic and greedy techniques. Combining the greedy technique utilizing a metaheuristic search technique like hill climbing (HC), can produce feasible results for combinatorial tests. Methods based on metaheuristics are used to deal with tuples that may be left after redundancy using greedy strategies; then the result utilization is assured to be near-optimal using a metaheuristic algorithm. As a result, the use of both greedy and HC algorithms in a single test generation system is a good candidate if constructed correctly. T

... Show More
View Publication
Scopus (6)
Crossref (5)
Scopus Crossref
Publication Date
Fri Jan 01 2021
Journal Name
Journal Of Engineering
A Proposed Adaptive Bitrate Scheme Based on Bandwidth Prediction Algorithm for Smoothly Video Streaming
...Show More Authors

A robust video-bitrate adaptive scheme at client-aspect plays a significant role in keeping a good quality of video streaming technology experience. Video quality affects the amount of time the video has turned off playing due to the unfilled buffer state. Therefore to maintain a video streaming continuously with smooth bandwidth fluctuation, a video buffer structure based on adapting the video bitrate is considered in this work. Initially, the video buffer structure is formulated as an optimal control-theoretic problem that combines both video bitrate and video buffer feedback signals. While protecting the video buffer occupancy from exceeding the limited operating level can provide continuous video str

... Show More
View Publication Preview PDF
Crossref (2)
Crossref
Publication Date
Sun Feb 25 2024
Journal Name
Baghdad Science Journal
Facial Emotion Images Recognition Based On Binarized Genetic Algorithm-Random Forest
...Show More Authors

Most recognition system of human facial emotions are assessed solely on accuracy, even if other performance criteria are also thought to be important in the evaluation process such as sensitivity, precision, F-measure, and G-mean. Moreover, the most common problem that must be resolved in face emotion recognition systems is the feature extraction methods, which is comparable to traditional manual feature extraction methods. This traditional method is not able to extract features efficiently. In other words, there are redundant amount of features which are considered not significant, which affect the classification performance. In this work, a new system to recognize human facial emotions from images is proposed. The HOG (Histograms of Or

... Show More
View Publication Preview PDF
Scopus (21)
Crossref (17)
Scopus Crossref
Publication Date
Fri May 17 2013
Journal Name
International Journal Of Computer Applications
Applied Minimized Matrix Size Algorithm on the Transformed Images by DCT and DWT used for Image Compression
...Show More Authors

View Publication
Crossref (1)
Crossref
Publication Date
Mon Nov 01 2021
Journal Name
Journal Of Engineering
Performance Evaluation of Pole Placement and Linear Quadratic Regulator Strategies Designed for Mass-Spring-Damper System Based on Simulated Annealing and Ant Colony Optimization
...Show More Authors

This paper investigates the performance evaluation of two state feedback controllers, Pole Placement (PP) and Linear Quadratic Regulator (LQR). The two controllers are designed for a Mass-Spring-Damper (MSD) system found in numerous applications to stabilize the MSD system performance and minimize the position tracking error of the system output. The state space model of the MSD system is first developed. Then, two meta-heuristic optimizations, Simulated Annealing (SA) optimization and Ant Colony (AC) optimization are utilized to optimize feedback gains matrix K of the PP and the weighting matrices Q and R of the LQR to make the MSD system reach stabilization and reduce the oscillation of the response. The Matlab softwar

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