An Improved Evolutionary Algorithm for Reducing the Number of Function Evaluations. Issue 2 (2nd April 2016)

• Record Type: Journal Article
• Authors: Cuevas, Erik; Santuario, Eduardo; Zaldivar, Daniel; Perez-Cisneros, Marco
• Is Part Of: Intelligent automation & soft computing. Volume 22:Issue 2(2016)
• Page Start: 177
• Page End: 192
• Publication Date: 2016-04-02
• Subjects: Evolutionary algorithms -- global optimization -- function evaluations; Artificial intelligence -- Periodicals; Intelligent control systems -- Periodicals; 003.5
• DOI: 10.1080/10798587.2015.1090163
• Languages: English
• ISSNs: 1079-8587

Abstract

Abstract: Many engineering applications can be approached as optimization problems whose solution commonly involves the execution of computational expensive objective functions. Recently, Evolutionary Algorithms (EAs) are gaining popularity for solving complex problems that are encountered in many disciplines, delivering a more robust and effective way to locate global optima in comparison to classical optimization methods. However, applying EA's to real-world problems demands a large number of function evaluations before delivering a satisfying result. Under such circumstances, several EAs have been adapted to reduce the number of function evaluations by using alternative models to substitute the original objective function. Despite such approaches employ a reduced number of function evaluations, the use of alternative models seriously affects their original EA search capacities and their solution accuracy. Recently, a new evolutionary method called the Adaptive Population with Reduced Evaluations (APRE) has been proposed to solve several image processing problems. APRE reduces the number of function evaluations through the use of two mechanisms: (1) The dynamic adaptation of the population and (2) the incorporation of a fitness calculation strategy, which decides when it is feasible to calculate or only estimate new generated individuals. As a result, the approach can substantially reduce the number of function evaluations, yet preserving the good search capabilities of an evolutionary approach. In this paper, the performance of APRE as a global optimization algorithm is presented. In order to illustrate the proficiency and robustness of APRE, it has been compared to other approaches that have been previously conceived to reduce the number of function evaluations. The comparison examines several standard benchmark functions, which are commonly considered within the EA field. Conducted simulations have confirmed that the proposed method achieves the best balance over its counterparts, in terms of the number of function evaluations and the solution accuracy.