Abstract
This paper proposes a memetic computing algorithm by incorporating Eager Random Search (ERS) into differential evolution (DE) to enhance its search ability. ERS is a local search method that is eager to move to a position that is identified as better than the current one without considering other opportunities. Forsaking optimality of moves in ERS is advantageous to increase the randomness and diversity of search for avoiding premature convergence. Three concrete local search strategies within ERS are introduced and discussed, leading to variants of the proposed memetic DE algorithm. The results of evaluations on a set of benchmark problems have demonstrated that the integration of DE with Eager Random Search can improve the performance of pure DE algorithms while not incurring extra computing expenses.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Storn, R., Price, K.: Differential evolution - a simple and efficient heuristic for global optimization over continuous spaces. Journal of Global Optimization 11(4), 341–359 (1997)
Xiong, N., Molina, D., Leon, M., Herrera, F.: A walk into metaheuristics for engineering optimization: Principles, methods, and recent trends. International Journal of Computational Intelligence Systems 8(4), 606–636 (2015)
Krasnogor, N., Smith, J.: A tutorial for competent memetic algorithms: Model, taxonomy, and design issue. IEEE Transactions on Evolutionary Computation 9(5), 474–488 (2005)
Norman, N., Ibai, H.: Accelerating differential evolution using an adaptative local search. IEEE Transactions on Evolutionary Computation 12, 107–125 (2008)
Ali, M., Pant, M., Nagar, A.: Two local search strategies for differential evolution. In: Proc. 2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA), Changsha, China, pp. 1429–1435 (2010)
Dai, Z., Zhou, A.: A diferential ecolution with an orthogonal local search. In: Proc. 2013 IEEE Congress on Evolutionary Computation (CEC), Cancun, Mexico, pp. 2329–2336 (2013)
Leon, M., Xiong, N.: Using random local search helps in avoiding local optimum in diefferential evolution. In: Proc. Artificial Intelligence and Applications, AIA2014, Innsbruck, Austria, pp. 413–420 (2014)
Qin, A., Suganthan, P.: Self-adaptive differential evolution algorithm for numerical optimization. In: The 2005 IEEE Congress on Evolutionary Computation, vol. 2, pp. 1785–1791 (2005)
Leon, M., Xiong, N.: Greedy adaptation of control parameters in differential evolution for global optimization problems. In: IEEE Conference on Evolutionary Computation, CEC2015, Japan, pp. 385–392 (2015)
Leon, M., Xiong, N.: Investigation of mutation strategies in differential evolution for solving global optimization problems. In: Rutkowski, L., Korytkowski, M., Scherer, R., Tadeusiewicz, R., Zadeh, L.A., Zurada, J.M. (eds.) ICAISC 2014, Part I. LNCS, vol. 8467, pp. 372–383. Springer, Heidelberg (2014)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Leon, M., Xiong, N. (2015). Eager Random Search for Differential Evolution in Continuous Optimization. In: Pereira, F., Machado, P., Costa, E., Cardoso, A. (eds) Progress in Artificial Intelligence. EPIA 2015. Lecture Notes in Computer Science(), vol 9273. Springer, Cham. https://doi.org/10.1007/978-3-319-23485-4_29
Download citation
DOI: https://doi.org/10.1007/978-3-319-23485-4_29
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-23484-7
Online ISBN: 978-3-319-23485-4
eBook Packages: Computer ScienceComputer Science (R0)