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.
Liquid-crystalline organic semiconductors exhibit unique properties that make them highly interesting for organic optoelectronic applications. Their optical and electrical anisotropies and the possibility to control the alignment of the liquid-crystalline semiconductor allow not only to optimize charge carrier transport, but to tune the optical property of organic thin-film devices as well. In this study, the molecular orientation in a liquid-crystalline semiconductor film is tuned by a novel blading process as well as by different annealing protocols. The altered alignment is verified by cross-polarized optical microscopy and spectroscopic ellipsometry. It is shown that a change in alignment of the
Credit risk assessment has become an important topic in financial risk administration. Fuzzy clustering analysis has been applied in credit scoring. Gustafson-Kessel (GK) algorithm has been utilised to cluster creditworthy customers as against non-creditworthy ones. A good clustering analysis implemented by good Initial Centres of clusters should be selected. To overcome this problem of Gustafson-Kessel (GK) algorithm, we proposed a modified version of Kohonen Network (KN) algorithm to select the initial centres. Utilising similar degree between points to get similarity density, and then by means of maximum density points selecting; the modified Kohonen Network method generate clustering initial centres to get more reasonable clustering res
... Show MoreBrainstorming is considered as one of the manners that develop learners' mental abilities. Besides, it can help learners get a lot of ideas and thoughts. And by following applied steps to answer the problem concerned, the researcher carried out this practical study aimed at:Developing the ideas of design of third year students/Institute of Fine Arts/Evening Studies- Baghdad/First Rusafa by employing Brainstorming mechanism to develop the ideas of design of institute students in designing the technical advertisement and to achieve the authenticity of the goal of the research, Department of Plastic Arts/Institute of Fine Arts/Evening Studies/Baghdad-First Rusafa was chosen as a case study for the research. It embraced (20) students who rep
... Show MoreThis paper presents a new transform method to solve partial differential equations, for finding suitable accurate solutions in a wider domain. It can be used to solve the problems without resorting to the frequency domain. The new transform is combined with the homotopy perturbation method in order to solve three dimensional second order partial differential equations with initial condition, and the convergence of the solution to the exact form is proved. The implementation of the suggested method demonstrates the usefulness in finding exact solutions. The practical implications show the effectiveness of approach and it is easily implemented in finding exact solutions.
Finally, all algori
... Show MoreIn the present paper, by making use of the new generalized operator, some results of third order differential subordination and differential superordination consequence for analytic functions are obtained. Also, some sandwich-type theorems are presented.
in this paper the collocation method will be solve ordinary differential equations of retarted arguments also some examples are presented in order to illustrate this approach
Algorithms using the second order of B -splines [B (x)] and the third order of B -splines [B,3(x)] are derived to solve 1' , 2nd and 3rd linear Fredholm integro-differential equations (F1DEs). These new procedures have all the useful properties of B -spline function and can be used comparatively greater computational ease and efficiency.The results of these algorithms are compared with the cubic spline function.Two numerical examples are given for conciliated the results of this method.
Elzaki Transform Adomian decomposition technique (ETADM), which an elegant combine, has been employed in this work to solve non-linear Riccati matrix differential equations. Solutions are presented to demonstrate the relevance of the current approach. With the use of figures, the results of the proposed strategy are displayed and evaluated. It is demonstrated that the suggested approach is effective, dependable, and simple to apply to a range of related scientific and technical problems.
The aim of this paper is to propose a reliable iterative method for resolving many types of Volterra - Fredholm Integro - Differential Equations of the second kind with initial conditions. The series solutions of the problems under consideration are obtained by means of the iterative method. Four various problems are resolved with high accuracy to make evident the enforcement of the iterative method on such type of integro differential equations. Results were compared with the exact solution which exhibits that this technique was compatible with the right solutions, simple, effective and easy for solving such problems. To evaluate the results in an iterative process the MATLAB is used as a math program for the calculations.