Autosoft Journal

Online Manuscript Access


An Improved Evolutionary Algorithm for Reducing the Number of Function Evaluations


Authors



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 EA2019s 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.


Keywords


Pages

Total Pages: 16
Pages: 177-192

DOI
10.1080/10798587.2015.1090163


Manuscript ViewPdf Subscription required to access this document

Obtain access this manuscript in one of the following ways


Already subscribed?

Need information on obtaining a subscription? Personal and institutional subscriptions are available.

Already an author? Have access via email address?


Published

Volume: 22
Issue: 2
Year: 2015

Cite this document


References

Alba, E., and B. Dorronsoro. "The Exploration/Exploitation Tradeoff in Dynamic Cellular Genetic Algorithms." IEEE Transactions on Evolutionary Computation 9.2 (2005): 126-142. Crossref. Web. https://doi.org/10.1109/TEVC.2005.843751

Ali, M. Montaz, Charoenchai Khompatraporn, and Zelda B. Zabinsky. "A Numerical Evaluation of Several Stochastic Algorithms on Selected Continuous Global Optimization Test Problems." Journal of Global Optimization 31.4 (2005): 635-672. Crossref. Web. https://doi.org/10.1007/s10898-004-9972-2

Brest, Janez, and Mirjam Sepesy Maučec. "Population Size Reduction for the Differential Evolution Algorithm." Applied Intelligence 29.3 (2007): 228-247. Crossref. Web. https://doi.org/10.1007/s10489-007-0091-x

Chafekar, D. et al. "Multiobjective GA Optimization Using Reduced Models." IEEE Transactions on Systems, Man and Cybernetics, Part C (Applications and Reviews) 35.2 (2005): 261-265. Crossref. Web. https://doi.org/10.1109/TSMCC.2004.841905

Chelouah, R., and P. Siarry. Journal of Heuristics 6.2 (2000): 191-213. Crossref. Web. https://doi.org/10.1023/A:1009626110229

Chen, DeBao, and ChunXia Zhao. "Particle Swarm Optimization with Adaptive Population Size and Its Application." Applied Soft Computing 9.1 (2009): 39-48. Crossref. Web. https://doi.org/10.1016/j.asoc.2008.03.001

Cuevas E. Mathematical Problems in Engineering

Črepineš M. ACM Computing Surveys

De Castro, L.N., and F.J. Von Zuben. "Learning and Optimization Using the Clonal Selection Principle." IEEE Transactions on Evolutionary Computation 6.3 (2002): 239-251. Crossref. Web. https://doi.org/10.1109/TEVC.2002.1011539

García, Salvador et al. "A Study on the Use of Non-Parametric Tests for Analyzing the Evolutionary Algorithms” Behaviour: a Case Study on the CEC”2005 Special Session on Real Parameter Optimization." Journal of Heuristics 15.6 (2008): 617-644. Crossref. Web. https://doi.org/10.1007/s10732-008-9080-4

Bernardino, Heder S., Helio J. C. Barbosa, and Leonardo G. Fonseca. "Surrogate-Assisted Clonal Selection Algorithms for Expensive Optimization Problems." Evolutionary Intelligence 4.2 (2011): 81-97. Crossref. Web. https://doi.org/10.1007/s12065-011-0056-1

"International Journal of Intelligent Systems." n. pag. Crossref. Web. https://doi.org/10.1002/(ISSN)1098-111X

Holland J. H. Adaptation in natural and artificial systems

Fan, Hui-Yuan, and Jouni Lampinen. Journal of Global Optimization 27.1 (2003): 105-129. Crossref. Web. https://doi.org/10.1023/A:1024653025686

Yaochu Jin, M. Olhofer, and B. Sendhoff. "A Framework for Evolutionary Optimization with Approximate Fitness Functions." IEEE Transactions on Evolutionary Computation 6.5 (2002): 481-494. Crossref. Web. https://doi.org/10.1109/TEVC.2002.800884

Jin, Y. "A Comprehensive Survey of Fitness Approximation in Evolutionary Computation." Soft Computing 9.1 (2003): 3-12. Crossref. Web. https://doi.org/10.1007/s00500-003-0328-5

Kang, Fei, Junjie Li, and Zhenyue Ma. "Rosenbrock Artificial Bee Colony Algorithm for Accurate Global Optimization of Numerical Functions." Information Sciences 181.16 (2011): 3508-3531. Crossref. Web. https://doi.org/10.1016/j.ins.2011.04.024

Kennedy, J., and R. Eberhart. "Particle Swarm Optimization." Proceedings of ICNN”95 - International Conference on Neural Networks n. pag. Crossref. Web. https://doi.org/10.1109/ICNN.1995.488968

Laguna, Manuel, and Rafael Martí. "Experimental Testing of Advanced Scatter Search Designs for Global Optimization of Multimodal Functions." Journal of Global Optimization 33.2 (2005): 235-255. Crossref. Web. https://doi.org/10.1007/s10898-004-1936-z

Lozano, Manuel et al. "Real-Coded Memetic Algorithms with Crossover Hill-Climbing." Evolutionary Computation 12.3 (2004): 273-302. Crossref. Web. https://doi.org/10.1162/1063656041774983

Moré, Jorge J., Burton S. Garbow, and Kenneth E. Hillstrom. "Testing Unconstrained Optimization Software." ACM Transactions on Mathematical Software 7.1 (1981): 17-41. Crossref. Web. https://doi.org/10.1145/355934.355936

Ong, Yew S., Prasanth B. Nair, and Andrew J. Keane. "Evolutionary Optimization of Computationally Expensive Problems via Surrogate Modeling." AIAA Journal 41.4 (2003): 687-696. Crossref. Web. https://doi.org/10.2514/2.1999

"About the Authors." Artificial Intelligence Review 24.1 (2005): 1-3. Crossref. Web. https://doi.org/10.1007/s10462-005-3854-y

Price K. Differential evolution: A practical approach to global optimization

Rahnamayan, S., H.R. Tizhoosh, and M.M.A. Salama. "Opposition-Based Differential Evolution." IEEE Transactions on Evolutionary Computation 12.1 (2008): 64-79. Crossref. Web. https://doi.org/10.1109/TEVC.2007.894200

Regis, Rommel G. "Particle Swarm with Radial Basis Function Surrogates for Expensive Black-Box Optimization." Journal of Computational Science 5.1 (2014): 12-23. Crossref. Web. https://doi.org/10.1016/j.jocs.2013.07.004

Schwefel H. P. Evolution and optimum seeking

Shan, Songqing, and G. Gary Wang. "Survey of Modeling and Optimization Strategies to Solve High-Dimensional Design Problems with Computationally-Expensive Black-Box Functions." Structural and Multidisciplinary Optimization 41.2 (2009): 219-241. Crossref. Web. https://doi.org/10.1007/s00158-009-0420-2

Shilane, David et al. "A General Framework for Statistical Performance Comparison of Evolutionary Computation Algorithms." Information Sciences 178.14 (2008): 2870-2879. Crossref. Web. https://doi.org/10.1016/j.ins.2008.03.007

Storn, R. & Price, K. (1995). Differential evolution-a simple and efficient adaptive scheme for global optimisation over continuous spaces (Tech. Rep. TR-95–012). Berkeley, Calif: ICSI.

Tan, K.C. et al. "Balancing Exploration and Exploitation with Adaptive Variation for Evolutionary Multi-Objective Optimization." European Journal of Operational Research 197.2 (2009): 701-713. Crossref. Web. https://doi.org/10.1016/j.ejor.2008.07.025

Tenne, Yoel. "A Computational Intelligence Algorithm for Expensive Engineering Optimization Problems." Engineering Applications of Artificial Intelligence 25.5 (2012): 1009-1021. Crossref. Web. https://doi.org/10.1016/j.engappai.2012.03.009

Whitley, Darrell et al. "Evaluating Evolutionary Algorithms." Artificial Intelligence 85.1-2 (1996): 245-276. Crossref. Web. https://doi.org/10.1016/0004-3702(95)00124-7

Wilcoxon, Frank. "Individual Comparisons by Ranking Methods." Biometrics Bulletin 1.6 (1945): 80. Crossref. Web. https://doi.org/10.2307/3001968

Zhu, Wu et al. "Adaptive Population Tuning Scheme for Differential Evolution." Information Sciences 223 (2013): 164-191. Crossref. Web. https://doi.org/10.1016/j.ins.2012.09.019

Xin Yao, Yong Liu, and Guangming Lin. "Evolutionary Programming Made Faster." IEEE Transactions on Evolutionary Computation 3.2 (1999): 82-102. Crossref. Web. https://doi.org/10.1109/4235.771163

JOURNAL INFORMATION


ISSN PRINT: 1079-8587
ISSN ONLINE: 2326-005X
DOI PREFIX: 10.31209
10.1080/10798587 with T&F
IMPACT FACTOR: 0.652 (2017/2018)
Journal: 1995-Present




CONTACT INFORMATION


TSI Press
18015 Bullis Hill
San Antonio, TX 78258 USA
PH: 210 479 1022
FAX: 210 479 1048
EMAIL: tsiepress@gmail.com
WEB: http://www.wacong.org/tsi/