Abstract
Continuous optimization is one of the areas with more activity in the field of heuristic optimization. Many algorithms have been proposed and compared on several benchmarks of functions, with different performance depending on the problems. For this reason, the combination of different search strategies seems desirable to obtain the best performance of each of these approaches. This contribution explores the use of a hybrid memetic algorithm based on the multiple offspring framework. The proposed algorithm combines the explorative/exploitative strength of two heuristic search methods that separately obtain very competitive results. This algorithm has been tested with the benchmark problems and conditions defined for the special issue of the Soft Computing Journal on Scalability of Evolutionary Algorithms and other Metaheuristics for Large Scale Continuous Optimization Problems. The proposed algorithm obtained the best results compared with both its composing algorithms and a set of reference algorithms that were proposed for the special issue.
Similar content being viewed by others
References
Caponio A, Cascella G, Neri F, Salvatore N, Sumner M (2007) A fast adaptive memetic algorithm for on-line and off-line control design of PMSM drives. IEEE Trans Syst Man Cybern Part B 37:28–41
Caponio A, Neri F, Cascella G, Salvatore N (2008) Application of memetic differential evolution frameworks to PMSM drive design. In: Proceedings of the 2008 IEEE congress on evolutionary computation, CEC 2008 (IEEE World Congress on Computational Intelligence), pp 2113–2120
Caponio A, Neri F, Tirronen V (2009) Super-fit control adaptation in memetic differential evolution frameworks. Soft Comput Fusion Found Methodol Appl 13(8):811–831
Caruana R, Schaffer J (1988) Representation and hidden bias: Gray vs. binary coding for genetic algorithms. In: Proceedings of the 5th international conference on machine learning, ICML 1998, pp 153–161
Gao Y, Wang Y-J (2007) A memetic differential evolutionary algorithm for high dimensional functions’ optimization. In: Proceedings of the third international conference on natural computation (ICNC 2007), pp 188–192
García S, Molina D, Lozano M, Herrera F (2009) A study on the use of non-parametric tests for analyzing the evolutionary algorithms behaviour: a case study on the CEC2005 special session on real parameter optimization. J Heurisics 15(6):617–644
Grefenstette J (1986) Optimization of control parameters for genetic algorithms. IEEE Trans Syst Man Cybern 16(1):122–128
LaTorre A (2009) A framework for hybrid dynamic evolutionary algorithms: multiple offspring sampling (mos). Ph.D. thesis, Universidad Politécnica de Madrid (November 2009)
LaTorre A, Peña J, Muelas S, Freitas A (2010) Learning hybridization strategies in evolutionary algorithms. Intell Data Anal 14(3)
Lin G, Kang L, Chen Y, McKay B, Sarker R (2007) A self-adaptive mutations with multi-parent crossover evolutionary algorithm for solving function optimization problems. In: Kang L, Zeng YLS (eds) Advances in computation and intelligence: proceedings of the 2nd international symposium, ISICA 2007. Lectures notes in computer science, vol 4683/2007, pp 157–168
Mladenovic N, Hansen P (1997) Variable neighborhood search. Comput Oper Res 24(11):1097–1100
Muelas S, LaTorre A, Peña J (2009) A memetic differential evolution algorithm for continuous optimization. In: Proceedings of the 9th international conference on intelligent systems design and applications, ISDA 2009, pp 1080–1084
Ong Y-S, Keane A (2004) Meta-lamarckian learning in memetic algorithms. IEEE Trans Evol Computat 8(2):99–110
Qin A, Suganthan P (2005) Self-adaptive differential evolution algorithm for numerical optimization. In: Proceedings of the IEEE congress on evolutionary computation, CEC 2005, pp 1785–1791
Rönkkönen J, Kukkonen S, Price K (2005) Real-parameter optimization with differential evolution. In: Proceedings of the IEEE congress on evolutionary computation, CEC 2005, pp 506–513
Schnier T, Yao X (2000) Using multiple representations in evolutionary algorithms. In: Proceedings of the 2nd IEEE congress on evolutionary computation, CEC 2000, vol 1, pp 479–486
Suganthan P, Hansen N, Liang J, Deb K, Chen Y, Auger A, Tiwari S (2005) Problem definitions and evaluation criteria for the cec 2005 special session on real-parameter optimization. Tech. Rep. 2005005, 1School of EEE. Nanyang Technological University and Kanpur Genetic Algorithms Laboratory (KanGAL)
Talbi E-G (2002) A taxonomy of hybrid metaheuristics. J Heuristics 8(5):541–564
Tang K, Yao X, Suganthan P, MacNish C, Chen Y, Chen C, Yang Z (2007) Benchmark functions for the cec 2008 special session and competition on large scale global optimization. Tech. rep., Nature Inspired Computation and Applications Laboratory, USTC
Thierens D (2005) An adaptive pursuit strategy for allocating operator probabilities. In: Proceedings of the 7th genetic and evolutionary computation conference, GECCO 2005, pp 1539–1546
Tirronen V, Neri F, Karkkainen T, Majava K, Rossi T (2007) A memetic differential evolution in filter design for defect detection in paper production. In: Proceedings of EvoWorkshops 2007, pp 330–339
Tirronen V, Neri F, Kärkkäinen T, Majava K, Rossi T (2008) An enhanced memetic differential evolution in filter design for defect detection in paper production. Evol Comput 16(4):529–555
Tseng L, Chen C (2008) Multiple trajectory search for large scale global optimization. In: Proceedings of the 10th IEEE congress on evolutionary computation, CEC 2008 (IEEE World Congress on Computational Intelligence). IEEE Press, pp 3052–3059
Whitacre J, Pham T, Sarker R (2006) Credit assignment in adaptive evolutionary algorithms. In: Proceedings of the 8th genetic and evolutionary computation conference, GECCO 2006, Seattle, pp 1353–1360
Wolpert D, Macready W (1997) No free lunch theorems for optimization. IEEE Trans Evol Comput 1(1):67–82
Acknowledgments
This work was supported by the Madrid Regional Education Ministry and the European Social Fund, financed by the Spanish Ministry of Science TIN2007-67148 and supported by the Cajal Blue Brain Project. The authors thankfully acknowledge the computer resources, technical expertise and assistance provided by the Centro de Supercomputación y Visualización de Madrid (CeSViMa) and the Spanish Supercomputing Network.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
LaTorre, A., Muelas, S. & Peña, JM. A MOS-based dynamic memetic differential evolution algorithm for continuous optimization: a scalability test. Soft Comput 15, 2187–2199 (2011). https://doi.org/10.1007/s00500-010-0646-3
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00500-010-0646-3