Most heuristic search method's performances are dependent on parameter choices. These parameter settings govern how new candidate solutions are generated and then applied by the algorithm. They essentially play a key role in determining the quality of the solution obtained and the efficiency of the search. Their fine-tuning techniques are still an on-going research area. Differential Evolution (DE) algorithm is a very powerful optimization method and has become popular in many fields. Based on the prolonged research work on DE, it is now arguably one of the most outstanding stochastic optimization algorithms for real-parameter optimization. One reason for its popularity is its widely appreciated property of having only a small number of parameters to tune. This paper presents a detailed review of DE parameter tuning with a table compromised a recommended guidelines for these parameters, along with a full description of the basic DE algorithm and its corresponding operators, overlooked by previous studies. It is aimed at practitioners to help them achieve better results when adopting DE as an optimization method for their problems with less time and effort. Moreover, an experimental study has been conducted over fifteen test problems and the results obtained prove the reliability of the setting values.
The first successful implementation of Artificial Neural Networks (ANNs) was published a little over a decade ago. It is time to review the progress that has been made in this research area. This paper provides taxonomy for classifying Field Programmable Gate Arrays (FPGAs) implementation of ANNs. Different implementation techniques and design issues are discussed, such as obtaining a suitable activation function and numerical truncation technique trade-off, the improvement of the learning algorithm to reduce the cost of neuron and in result the total cost and the total speed of the complete ANN. Finally, the implementation of a complete very fast circuit for the pattern of English Digit Numbers NN has four layers of 70 nodes (neurons) o
... Show MoreThe first successful implementation of Artificial Neural Networks (ANNs) was published a little over a decade ago. It is time to review the progress that has been made in this research area. This paper provides taxonomy for classifying Field Programmable Gate Arrays (FPGAs) implementation of ANNs. Different implementation techniques and design issues are discussed, such as obtaining a suitable activation function and numerical truncation technique trade-off, the improvement of the learning algorithm to reduce the cost of neuron and in result the total cost and the total speed of the complete ANN. Finally, the implementation of a complete very fast circuit for the pattern of English Digit Numbers NN has four layers of 70 nodes (neurons) o
... Show MoreA new human-based heuristic optimization method, named the Snooker-Based Optimization Algorithm (SBOA), is introduced in this study. The inspiration for this method is drawn from the traits of sales elites—those qualities every salesperson aspires to possess. Typically, salespersons strive to enhance their skills through autonomous learning or by seeking guidance from others. Furthermore, they engage in regular communication with customers to gain approval for their products or services. Building upon this concept, SBOA aims to find the optimal solution within a given search space, traversing all positions to obtain all possible values. To assesses the feasibility and effectiveness of SBOA in comparison to other algorithms, we conducte
... Show MoreThe data communication has been growing in present day. Therefore, the data encryption became very essential in secured data transmission and storage and protecting data contents from intruder and unauthorized persons. In this paper, a fast technique for text encryption depending on genetic algorithm is presented. The encryption approach is achieved by the genetic operators Crossover and mutation. The encryption proposal technique based on dividing the plain text characters into pairs, and applying the crossover operation between them, followed by the mutation operation to get the encrypted text. The experimental results show that the proposal provides an important improvement in encryption rate with comparatively high-speed Process
... Show MoreThis study emphasizes the infinite-boundary integro-differential equation. To examine the approximate solution of the problem, two modified optimization algorithms are proposed based on generalized Laguerre functions. In the first technique, the proposed method is applied to the original problem by approximating the solution using the truncated generalized Laguerre polynomial of the unknown function, optimizing coefficients through error minimization, and transforming the integro-differential equation into an algebraic equation. In contrast, the second approach incorporates a penalty term into the objective function to effectively enforce boundary and integral constraints. This technique reduces the original problem to a mathematical optimi
... Show MoreThe accurate 3-D coordinate's measurements of the global positioning systems are essential in many fields and applications. The GPS has numerous applications such as: Frequency Counters, Geographic Information Systems, Intelligent Vehicle Highway Systems, Car Navigation Systems, Emergency Systems, Aviations, Astronomical Pointing Control, and Atmospheric Sounding using GPS signals, tracking of wild animals, GPS Aid for the Blind, Recorded Position Information, Airborne Gravimetry and other uses. In this paper, the RTK DGPS mode has been used to create precise 3-D coordinates values for four rover stations in Baghdad university camp. The HiPer-II Receiver of global positioning system was used to navigate the coordinate value. The results wil
... Show MoreThe purpose of this research is to implement the orthogonal polynomials associated with operational matrices to get the approximate solutions for solving two-dimensional elliptic partial differential equations (E-PDEs) with mixed boundary conditions. The orthogonal polynomials are based on the Standard polynomial (
In this paper,the homtopy perturbation method (HPM) was applied to obtain the approximate solutions of the fractional order integro-differential equations . The fractional order derivatives and fractional order integral are described in the Caputo and Riemann-Liouville sense respectively. We can easily obtain the solution from convergent the infinite series of HPM . A theorem for convergence and error estimates of the HPM for solving fractional order integro-differential equations was given. Moreover, numerical results show that our theoretical analysis are accurate and the HPM can be considered as a powerful method for solving fractional order integro-diffrential equations.
... Show More