Preferred Language
Articles
/
joe-1950
An Improved Adaptive Spiral Dynamic Algorithm for Global Optimization
...Show More Authors

This paper proposes a new strategy to enhance the performance and accuracy of the Spiral dynamic algorithm (SDA) for use in solving real-world problems by hybridizing the SDA with the Bacterial Foraging optimization algorithm (BFA). The dynamic step size of SDA makes it a useful exploitation approach. However, it has limited exploration throughout the diversification phase, which results in getting trapped at local optima. The optimal initialization position for the SDA algorithm has been determined with the help of the chemotactic strategy of the BFA optimization algorithm, which has been utilized to improve the exploration approach of the SDA. The proposed Hybrid Adaptive Spiral Dynamic Bacterial Foraging (HASDBF) algorithm is designed so that the chemotaxis phase of bacteria represents the exploration part of the search operation. In contrast, the SDA represents the exploitation part.

Additionally, to improve search operation efficiency, the spiral model's radius and angular displacement are adaptively set according to a linear correlation concerning the fitness value. An additional phase, the elimination and dispersal phase, is obtained from BFA and added to the end of the SDA. This phase aims to improve the algorithm's final solution's accuracy by enhancing the algorithm's search strategy and performance. Simulation tests are run on unimodal and multimodal standard benchmark functions to verify the proposed algorithm. The proposed algorithm significantly outperforms SDA and Adaptive SDA (ASDA) algorithms regarding fitness value and accuracy.

 

Crossref
View Publication Preview PDF
Quick Preview PDF
Publication Date
Thu Jun 01 2023
Journal Name
Chemical Physics Impact
An efficient Ag decorated CeO2 synergetic catalyst for improved catalytic reduction of lethal 4-nitrophenol
...Show More Authors

Catalytic reduction is considered an effective approach for the reduction of toxic organic pollutants from the environment, but finding an active catalyst is still a big challenge. Herein, Ag decorated CeO2 catalyst was synthesized through polyol reduction method and applied for catalytic reduction (conversion) of 4-nitrophenol (4-NP) to 4-aminophenol (4-AP). The Ag decorated CeO2 catalyst displayed an outstanding reduction activity with 99% conversion of 4-NP in 5 min with a 0.61 min−1 reaction rate (k). A number of structural characterization techniques were executed to investigate the influence of Ag on CeO2 and its effect on the catalytic conversion of 4-NP. The outstanding catalytic performances of the Ag-CeO2 catalyst can be assigne

... Show More
View Publication
Scopus (15)
Crossref (17)
Scopus Clarivate Crossref
Publication Date
Fri Nov 01 2019
Journal Name
Civil Engineering Journal
Time-Cost-Quality Trade-off Model for Optimal Pile Type Selection Using Discrete Particle Swarm Optimization Algorithm
...Show More Authors

The cost of pile foundations is part of the super structure cost, and it became necessary to reduce this cost by studying the pile types then decision-making in the selection of the optimal pile type in terms of cost and time of production and quality .So The main objective of this study is to solve the time–cost–quality trade-off (TCQT) problem by finding an optimal pile type with the target of "minimizing" cost and time while "maximizing" quality. There are many types In the world of piles but  in this paper, the researcher proposed five pile types, one of them is not a traditional, and   developed a model for the problem and then employed particle swarm optimization (PSO) algorithm, as one of evolutionary algorithms with t

... Show More
Scopus (9)
Crossref (9)
Scopus Clarivate Crossref
Publication Date
Sun Apr 01 2018
Journal Name
2018 9th International Conference On Information And Communication Systems (icics)
An intersection-based segment aware algorithm for geographic routing in VANETs
...Show More Authors

In networking communication systems like vehicular ad hoc networks, the high vehicular mobility leads to rapid shifts in vehicle densities, incoherence in inter-vehicle communications, and challenges for routing algorithms. It is necessary that the routing algorithm avoids transmitting the pockets via segments where the network density is low and the scale of network disconnections is high as this could lead to packet loss, interruptions and increased communication overhead in route recovery. Hence, attention needs to be paid to both segment status and traffic. The aim of this paper is to present an intersection-based segment aware algorithm for geographic routing in vehicular ad hoc networks. This algorithm makes available the best route f

... Show More
View Publication
Scopus (5)
Crossref (5)
Scopus Crossref
Publication Date
Tue Sep 23 2025
Journal Name
Journal Of Plant Protection Research
Smart sprayer for weed control using an object detection algorithm (yolov5)
...Show More Authors

Spraying pesticides is one of the most common procedures that is conducted to control pests. However, excessive use of these chemicals inversely affects the surrounding environments including the soil, plants, animals, and the operator itself. Therefore, researchers have been encouraged to...

View Publication
Scopus Clarivate Crossref
Publication Date
Sun Jan 01 2017
Journal Name
Dissertation/thesis
A Model To Evaluate the Online Training for Global Virtual Teams in Global Software Projects
...Show More Authors

Publication Date
Sat Sep 30 2017
Journal Name
Al-khwarizmi Engineering Journal
Robot Arm Path Planning Using Modified Particle Swarm Optimization based on D* algorithm
...Show More Authors

Abstract

Much attention has been paid for the use of robot arm in various applications. Therefore, the optimal path finding has a significant role to upgrade and guide the arm movement. The essential function of path planning is to create a path that satisfies the aims of motion including, averting obstacles collision, reducing time interval, decreasing the path traveling cost and satisfying the kinematics constraints. In this paper, the free Cartesian space map of 2-DOF arm is constructed to attain the joints variable at each point without collision. The D*algorithm and Euclidean distance are applied to obtain the exact and estimated distances to the goal respectively. The modified Particle Swarm Optimization al

... Show More
View Publication Preview PDF
Crossref (10)
Crossref
Publication Date
Tue Dec 26 2017
Journal Name
Al-khwarizmi Engineering Journal
Experimental Modeling and Optimization of Fatigue Life and Hardness of Carbon Steel CK35 under Dynamic Buckling
...Show More Authors

Abstract

 

The aim of this paper is to model and optimize the fatigue life and hardness of medium carbon steel CK35 subjected to dynamic buckling. Different ranges of shot peening time (STP) and critical points of slenderness ratio which is between the long and intermediate columns, as input factors, were used to obtain their influences on the fatigue life and hardness, as main responses. Experimental measurements of shot peening time and buckling were taken and analyzed using (DESIGN EXPERT 8) experimental design software which was used for modeling and optimization purposes. Mathematical models of responses were obtained and analyzed by ANOVA variance to verify the adequacy of the models. The resul

... Show More
View Publication Preview PDF
Publication Date
Sat Jul 08 2017
Journal Name
Neural Computing And Applications
A new algorithm of modified binary particle swarm optimization based on the Gustafson-Kessel for credit risk assessment
...Show More Authors

View Publication
Scopus (35)
Crossref (34)
Scopus Clarivate Crossref
Publication Date
Mon Jan 01 2007
Journal Name
Iraqi Journal Of Science
Adaptive methods for matching problem
...Show More Authors

In this paper, we deal with the problem of general matching of two images one of them has experienced geometrical transformations, to find the correspondence between two images. We develop the invariant moments for traditional techniques (moments of inertia) with new approach to enhance the performance for these methods. We test various projections directional moments, to extract the difference between Block Distance Moment (BDM) and evaluate their reliability. Three adaptive strategies are shown for projections directional moments, that are raster (vertical and horizontal) projection, Fan-Bean projection and new projection procedure that is the square projection method. Our paper started with the description of a new algorithm that is low

... Show More
Publication Date
Tue Feb 01 2022
Journal Name
Baghdad Science Journal
An Efficient Algorithm for Fuzzy Linear Fractional Programming Problems via Ranking Function
...Show More Authors

In many applications such as production, planning, the decision maker is important in optimizing an objective function that has fuzzy ratio two functions which can be handed using fuzzy fractional programming problem technique. A special class of optimization technique named fuzzy fractional programming problem is considered in this work when the coefficients of objective function are fuzzy. New ranking function is proposed and used to convert the data of the fuzzy fractional programming problem from fuzzy number to crisp number so that the shortcoming when treating the original fuzzy problem can be avoided. Here a novel ranking function approach of ordinary fuzzy numbers is adopted for ranking of triangular fuzzy numbers with simpler an

... Show More
View Publication Preview PDF
Scopus (13)
Crossref (6)
Scopus Clarivate Crossref