This article proposes a new strategy based on a hybrid method that combines the gravitational search algorithm (GSA) with the bat algorithm (BAT) to solve a single-objective optimization problem. It first runs GSA, followed by BAT as the second step. The proposed approach relies on a parameter between 0 and 1 to address the problem of falling into local research because the lack of a local search mechanism increases intensity search, whereas diversity remains high and easily falls into the local optimum. The improvement is equivalent to the speed of the original BAT. Access speed is increased for the best solution. All solutions in the population are updated before the end of the operation of the proposed algorithm. The diversification feature of BAT has solved the problem of weakness in diversity observed in the algorithm by applying the parameters used in BAT. Moreover, balance is achieved through the intensification properties of the algorithms.
HR Ghanim, GA Abdulhassan, International Journal of Early Childhood Special Education, 2022
Two- dimensional numerical simulations are carried out to study the elements of observing a Dirac point source and a Dirac binary system. The essential features of this simulation are demonstrated in terms of the point spread function and the modulation transfer function. Two mathematical equations have been extracted to present, firstly the relationship between the radius of optical telescope and the distance between the central frequency and cut-off frequency of the optical telescope, secondly the relationship between the radius of the optical telescope and the average frequency components of the modulation transfer function.
A cost-effective and efficient detector was created to conduct thorough turbidimetric measurements by reaction of Co (II) ion with calcium ferro cyanide to form bright green particulate, using the method of continuous flow injection analysis, the use of NAG-5SX1-1D-SSP Analyzer in determining cobalt (II) ion in a test for the validity of the new design. The NAG-5SX1-1D-SSP Analyzer is composed of five irradiation sources of white snow leds having the diameter of 10 mm with one solar cell of 55 mm length, 13.5 mm width. Using a selector switch to select the optimum voltage to be used which was 2.7 VDC. Under conditions of optimization, cobalt (II) ion was determined at 0.005–20 mmol. L–1(n = 23) while linearity dynamic range 0.005–7 mm
... Show MoreGaslift reactors are employed in several bioapplications due to their characteristics of cost-effectiveness and high efficiency. However, the nutrient and thermal gradient is one of the obstacles that stand in the way of its widespread use in biological applications. The diagnosis, analysis, and tracking of fluid paths in external draft tube gaslift bioreactor-type are the main topics of the current study. Several parameters were considered to assess the mixing efficiency such as downcomer-to-rizer diameter ratio (Ded/Dr), the position of the diffuser to the height of bioreactor ratio (Pd/Lr), and gas bubble size (Db). The multiple regression of liquid velocity indicates the optimal setting: Ded/Dr is (0.5), Pd/Lr is (0.02), and Db
... Show MoreAbstract
This study investigated the optimization of wear behavior of AISI 4340 steel based on the Taguchi method under various testing conditions. In this paper, a neural network and the Taguchi design method have been implemented for minimizing the wear rate in 4340 steel. A back-propagation neural network (BPNN) was developed to predict the wear rate. In the development of a predictive model, wear parameters like sliding speed, applying load and sliding distance were considered as the input model variables of the AISI 4340 steel. An analysis of variance (ANOVA) was used to determine the significant parameter affecting the wear rate. Finally, the Taguchi approach was applied to determine
... Show MoreThis 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 t
... Show MoreAmong a variety of approaches introduced in the literature to establish duality theory, Fenchel duality was of great importance in convex analysis and optimization. In this paper we establish some conditions to obtain classical strong Fenchel duality for evenly convex optimization problems defined in infinite dimensional spaces. The objective function of the primal problem is a family of (possible) infinite even convex functions. The strong duality conditions we present are based on the consideration of the epigraphs of the c-conjugate of the dual objective functions and the ε-c-subdifferential of the primal objective functions.
Researchers are increasingly using multimodal biometrics to strengthen the security of biometric applications. In this study, a strong multimodal human identification model was developed to address the growing problem of spoofing attacks in biometric security systems. Through the use of metaheuristic optimization methods, such as the Genetic Algorithm(GA), Ant Colony Optimization(ACO), and Particle Swarm Optimization (PSO) for feature selection, this unique model incorporates three biometric modalities: face, iris, and fingerprint. Image pre-processing, feature extraction, critical image feature selection, and multibiometric recognition are the four main steps in the workflow of the system. To determine its performance, the model wa
... Show MoreThe purpose of this paper is to solve the stochastic demand for the unbalanced transport problem using heuristic algorithms to obtain the optimum solution, by minimizing the costs of transporting the gasoline product for the Oil Products Distribution Company of the Iraqi Ministry of Oil. The most important conclusions that were reached are the results prove the possibility of solving the random transportation problem when the demand is uncertain by the stochastic programming model. The most obvious finding to emerge from this work is that the genetic algorithm was able to address the problems of unbalanced transport, And the possibility of applying the model approved by the oil products distribution company in the Iraqi Ministry of Oil to m
... Show More