Abstract
Differential evolution (DE) algorithm is presented and applied to global optimization in this research. DE suggested initially for the solution to Chebychev polynomial fitting problem is similar to genetic algorithm (GA) including crossover, mutation and selection process. However, differential evolution algorithm is simpler than GA because it uses a vector concept in populating process. And DE turns out to be converged faster than GA, since it employs the difference information as pseudo-sensitivity. In this paper, a trial vector and its control parameters of DE are examined and unconstrained optimization problems of highly nonlinear multimodal functions are demonstrated. To illustrate the efficiency of DE, convergence rates and robustness of global optimization algorithms are compared with those of simple GA.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Transactions of the Korean Society of Mechanical Engineers A
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
