Improving evolutionary algorithms by a new smoothing technique

3Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, a novel smoothing technique, which can be integrated into different optimization methods to improve their performance, is presented. At first, a new smoothing technique using a properly truncated Fourier series as the smoothing function is proposed. This smoothing function can eliminate many local minima and preserve the global minima. Thus it make the search of optimal solution more easier and faster. At second, this technique is integrated into a simple genetic algorithm to improve and demonstrate the efficiency of this technique. The simulation results also indicate the new smoothing technique can improve the simple genetic algorithm greatly. © Springer-Verlag Berlin Heidelberg 2004.

Cite

CITATION STYLE

APA

Wang, Y. (2004). Improving evolutionary algorithms by a new smoothing technique. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3177, 746–751. https://doi.org/10.1007/978-3-540-28651-6_111

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free