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.
In this work, an analytical approximation solution is presented, as well as a comparison of the Variational Iteration Adomian Decomposition Method (VIADM) and the Modified Sumudu Transform Adomian Decomposition Method (M STADM), both of which are capable of solving nonlinear partial differential equations (NPDEs) such as nonhomogeneous Kertewege-de Vries (kdv) problems and the nonlinear Klein-Gordon. The results demonstrate the solution’s dependability and excellent accuracy.
A method for Approximated evaluation of linear functional differential equations is described. where a function approximation as a linear combination of a set of orthogonal basis functions which are chebyshev functions .The coefficients of the approximation are determined by (least square and Galerkin’s) methods. The property of chebyshev polynomials leads to good results , which are demonstrated with examples.
This paper aims to study the fractional differential systems arising in warm plasma, which exhibits traveling wave-type solutions. Time-fractional Korteweg-De Vries (KdV) and time-fractional Kawahara equations are used to analyze cold collision-free plasma, which exhibits magnet-acoustic waves and shock wave formation respectively. The decomposition method is used to solve the proposed equations. Also, the convergence and uniqueness of the obtained solution are discussed. To illuminate the effectiveness of the presented method, the solutions of these equations are obtained and compared with the exact solution. Furthermore, solutions are obtained for different values of time-fractional order and represented graphically.
In this paper Heun method has been used to find numerical solution for first order nonlinear functional differential equation. Moreover, this method has been modified in order to treat system of nonlinear functional differential equations .two numerical examples are given for conciliated the results of this method.
In this article, the solvability of some proposal types of the multi-fractional integro-partial differential system has been discussed in details by using the concept of abstract Cauchy problem and certain semigroup operators and some necessary and sufficient conditions.
There are many methods of searching large amount of data to find one particular piece of information. Such as find name of person in record of mobile. Certain methods of organizing data make the search process more efficient the objective of these methods is to find the element with least cost (least time). Binary search algorithm is faster than sequential and other commonly used search algorithms. This research develops binary search algorithm by using new structure called Triple, structure in this structure data are represented as triple. It consists of three locations (1-Top, 2-Left, and 3-Right) Binary search algorithm divide the search interval in half, this process makes the maximum number of comparisons (Average case com
... Show MoreThe study aimed to identify self –affirmation degree, tendency degree toward perfection, awareness degree of creativity among fine arts institutions students, and the significant correlation between self -affirmation and its tendency toward perfection, and the awareness of creativity among fine arts institutions students. To achieve these objectives, the author had constructed two scales: one to measure self –affirmation among the sample based on “Lang& Jakobowski theory” (Lang& Jakobowski, 1973) that consisted of (54) item divided into two parts: qualitative and situational. The other scale is to measure the tendency toward perfection depend on (flett & Hewitt, 1991) that composed of (46) item divided into two sectio
... Show More