{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T03:04:31Z","timestamp":1769828671145,"version":"3.49.0"},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2010,9,18]],"date-time":"2010-09-18T00:00:00Z","timestamp":1284768000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2011,11]]},"DOI":"10.1007\/s00500-010-0647-2","type":"journal-article","created":{"date-parts":[[2010,9,17]],"date-time":"2010-09-17T07:05:41Z","timestamp":1284707141000},"page":"2201-2220","source":"Crossref","is-referenced-by-count":87,"title":["Memetic algorithms based on local search chains for large scale continuous optimisation problems: MA-SSW-Chains"],"prefix":"10.1007","volume":"15","author":[{"given":"Daniel","family":"Molina","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manuel","family":"Lozano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ana M.","family":"S\u00e1nchez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francisco","family":"Herrera","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,9,18]]},"reference":[{"key":"647_CR1","doi-asserted-by":"crossref","unstructured":"Auger A, Hansen N (2005a) Performance evaluation of an advanced local search evolutionary algorithm. In: 2005 IEEE congress on evolutionary computation, pp 1777\u20131784","DOI":"10.1109\/CEC.2005.1554903"},{"key":"647_CR2","doi-asserted-by":"crossref","unstructured":"Auger A, Hansen N (2005b) A restart CMA evolution strategy with increasing population size. In: 2005 IEEE congress on evolutionary computation, pp 1769\u20131776","DOI":"10.1109\/CEC.2005.1554902"},{"key":"647_CR3","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1109\/TEVC.2004.826069","volume":"3","author":"F Bergh van den","year":"2004","unstructured":"van den Bergh F, Engelbrencht AP (2004) A cooperative approach to particle swarm optimization. IEEE Trans Evol Comput 3:225\u2013239","journal-title":"IEEE Trans Evol Comput"},{"issue":"1","key":"647_CR4","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1109\/TSMCB.2006.883271","volume":"37","author":"A Caponio","year":"2007","unstructured":"Caponio A, Cascella GL, Neri F, Salvatore N, Sumner M (2007) A fast adaptive memetic algorithm for off-line and on-line control design of PMSM drivers. IEEE Trans Syst Man Cybern B 37(1):28\u201341 (Special Issue on Memetic Algorithms)","journal-title":"IEEE Trans Syst Man Cybern B"},{"key":"647_CR5","volume-title":"Handbook of genetic algorithms","author":"L Davis","year":"1991","unstructured":"Davis L (1991) Handbook of genetic algorithms. Van Nostrand Reinhold, New York"},{"key":"647_CR6","unstructured":"Eshelman L (1991) The CHC adaptive search algorithm. How to have safe search when engaging in nontraditional genetic recombination. In: Foundations of genetic algorithms, pp 265\u2013283"},{"key":"647_CR7","doi-asserted-by":"crossref","unstructured":"Eshelman L, Caruana A, Schaffer JD (1993) Real-coded genetic algorithms and interval-schemata. In: Foundation of genetic algorithms, vol 2, pp 187\u2013202","DOI":"10.1016\/B978-0-08-094832-4.50018-0"},{"key":"647_CR8","unstructured":"Eshelman LJ, Schaffer JD (1993) Real-coded genetic algorithms in genetic algorithms by preventing incest. Foundation of genetic algorithms, vol 2, pp 187\u2013202"},{"key":"647_CR9","doi-asserted-by":"crossref","unstructured":"Fernandes C, Rosa A (2001) A study of non-random matching and varying population size in genetic algorithm using a royal road function. In: Proceedings of the 2001 congress on evolutionary computation, pp 60\u201366","DOI":"10.1109\/CEC.2001.934371"},{"key":"647_CR10","first-page":"2677","volume":"9","author":"S Garc\u00eda","year":"2008","unstructured":"Garc\u00eda S, Herrera F (2008) An extension on statistical comparisons of classifiers over multiple data sets for all pairwise comparisons. J Mach Learn Res 9:2677\u20132694","journal-title":"J Mach Learn Res"},{"issue":"10","key":"647_CR11","doi-asserted-by":"crossref","first-page":"959","DOI":"10.1007\/s00500-008-0392-y","volume":"13","author":"S Garc\u00eda","year":"2009","unstructured":"Garc\u00eda S, Fern\u00e1ndez A, Luengo J, Herrera F (2009a) A study of statistical techniques and performance measures for genetics-based machine learning: accuracy and interpretability. Soft Comput 13(10):959\u2013977","journal-title":"Soft Comput"},{"key":"647_CR12","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1007\/s10732-008-9080-4","volume":"15","author":"S Garc\u00eda","year":"2009","unstructured":"Garc\u00eda S, Molina D, Lozano M, Herrera F (2009b) A study on the use of non-parametric tests for analyzing the evolutionary algorithms\u2019 behaviour: a case study on the CEC\u20192005 special session on real parameter optimization. J Heuristics 15:617\u2013644","journal-title":"J Heuristics"},{"issue":"2","key":"647_CR13","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/s10898-008-9320-z","volume":"44","author":"M Gol-Alikhani","year":"2009","unstructured":"Gol-Alikhani M, Javadian N, Tavakkoli-Moghaddam R (2009) A novel hybrid approach combining electromagnetism-like method with Solis and Wets local search for continuous optimization problems. J Glob Optim 44(2):227\u2013234","journal-title":"J Glob Optim"},{"key":"647_CR14","unstructured":"Goldberg DE, Voessner S (1999) Optimizing global-local search hybrids. In: Banzhaf W et\u00a0al (ed) Proceedings of the genetic and evolutionary computation conference (GECCO 1999). Morgan Kaufmann, San Mateo, California, pp 220\u201328"},{"key":"647_CR15","unstructured":"Hansen N (2005) Compilation of results on the CEC benchmark function set. In: 2005 IEEE congress on evolutionary computation"},{"key":"647_CR16","doi-asserted-by":"crossref","unstructured":"Hansen N (2009) Benchmarking a BI-population CMA-ES on the BBOB-2009 function testbed. In: GECCO\u201909: proceedings of the 11th annual conference companion on genetic and evolutionary computation conference, pp 2389\u20132396","DOI":"10.1145\/1570256.1570333"},{"key":"647_CR17","unstructured":"Hansen N (2010) The CMA evolutionary strategy: a tutorial technical report. The French National Institute of Research in Computer Science and Control INRIA. http:\/\/www.lri.fr\/\u223chansen\/cmatutorial.pdf"},{"key":"647_CR18","doi-asserted-by":"crossref","unstructured":"Hansen N, Kern S (2004) Evaluating the CMA evolution strategy on multimodal test functions. In: Yao X et al (ed) Proceedings of the parallel problem solving for nature\u2014PPSN VIII, LNCS 3242. Springer, Berlin, pp 282\u2013291","DOI":"10.1007\/978-3-540-30217-9_29"},{"key":"647_CR20","doi-asserted-by":"crossref","unstructured":"Hansen N, Ostermeier A (1996) Adapting arbitrary normal mutation distributions in evolution strategies: the covariance matrix adaptation. In: Proceeding of the IEEE international conference on evolutionary computation (ICEC\u201996), pp 312\u2013317","DOI":"10.1109\/ICEC.1996.542381"},{"issue":"11","key":"647_CR21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1162\/106365603321828970","volume":"1","author":"N Hansen","year":"2003","unstructured":"Hansen N, M\u00fcller SD, Koumoutsakos P (2003) Reducing the time complexity of the derandomized evolution strategy with covariance matrix adaptation (CMA-ES). Evol Comput 1(11):1\u201318","journal-title":"Evol Comput"},{"key":"647_CR22","unstructured":"Hart WE (1994) Adaptive global optimization with local search. PhD thesis, University of California, San Diego, CA"},{"issue":"3","key":"647_CR23","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1023\/A:1026531008287","volume":"13","author":"F Herrera","year":"2000","unstructured":"Herrera F, Lozano M (2000) Two-loop real-coded genetic algorithms with adaptive control of mutation step sizes. Appl Intell 13(3):187\u2013204","journal-title":"Appl Intell"},{"issue":"4","key":"647_CR24","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1023\/A:1006504901164","volume":"12","author":"F Herrera","year":"1998","unstructured":"Herrera F, Lozano M, Verdegay JL (1998) Tackling real-coded genetic algorithms: operators and tools for the behavioral analysis. Artif Intell Rev 12(4):265\u2013319","journal-title":"Artif Intell Rev"},{"key":"647_CR25","doi-asserted-by":"crossref","unstructured":"Hongfeng X, Guanzheng T (2009) High-dimension simplex genetic algorithm and its application to optimize hyper-high dimension functions. WRI global congress on intelligent systems, vol 2, pp 39\u201343","DOI":"10.1109\/GCIS.2009.125"},{"key":"647_CR26","doi-asserted-by":"crossref","unstructured":"Kennedy J, Eberhart RC (1995) Particle swarm optimization. In: IEE international conference on neural networks, pp 1942\u20131948","DOI":"10.1109\/ICNN.1995.488968"},{"issue":"2","key":"647_CR27","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1162\/106365601750190415","volume":"9","author":"H Kita","year":"2001","unstructured":"Kita H (2001) A comparison study of self-adaptation in evolutionary strategies and real-coded genetic algorithms. Evol Comput J 9(2):223\u2013241","journal-title":"Evol Comput J"},{"key":"647_CR28","unstructured":"Krasnogor N, Smith JE (2001) Emergence of profitable search strategies based on a simple inheritance mechanism. In: Proceedings of the 2001 international conference on genetic and evolutionary computation. Morgan Kaufmann, San Mateo, California, pp 432\u2013439"},{"issue":"5","key":"647_CR29","doi-asserted-by":"crossref","first-page":"474","DOI":"10.1109\/TEVC.2005.850260","volume":"9","author":"N Krasnogor","year":"2005","unstructured":"Krasnogor N, Smith JE (2005) A tutorial for competent memetic algorithms: model, taxonomy, and design issue. IEEE Trans Evol Comput 9(5):474\u2013488","journal-title":"IEEE Trans Evol Comput"},{"key":"647_CR30","unstructured":"Land Shannon MW (1998) Evolutionary algorithms with local search for combinational optimization. PhD thesis, University of California, San Diego, CA"},{"issue":"2","key":"647_CR31","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1162\/1063656041774983","volume":"12","author":"M Lozano","year":"2004","unstructured":"Lozano M, Herrera F, Krasnogor N, Molina D (2004) Real-coded memetic algorithms with crossover hill-climbing. Evol Comput 12(2):273\u2013302","journal-title":"Evol Comput"},{"key":"647_CR32","unstructured":"Merz P (2000) Memetic algorithms for combinational optimization problems: Fitness landscapes and effective search strategies. PhD thesis, Gesamthochschule Siegen, University of Siegen, Germany"},{"key":"647_CR33","doi-asserted-by":"crossref","unstructured":"Molina D, Lozano M, Herrera F (2009) Memetic algorithm with local search chaining for large scale continuous optimization problems. In: Proceedings of the 2009 IEEE congress on evolutionary computation, pp 830\u2013837","DOI":"10.1109\/CEC.2009.4983031"},{"issue":"1","key":"647_CR34","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1162\/evco.2010.18.1.18102","volume":"18","author":"D Molina","year":"2010","unstructured":"Molina D, Lozano M, Garc\u00eda-Mart\u00ednez C, Herrera F (2010) Memetic algorithms for continuous optimization based on local search chains. Evol Comput 18(1):27\u201363","journal-title":"Evol Comput"},{"key":"647_CR35","unstructured":"Moscato PA (1989) On evolution, search, optimization, genetic algorithms and martial arts: toward memetic algorithms. Tech. rep., Technical report Caltech concurrent computation program report 826. Caltech, Pasadena, California"},{"key":"647_CR36","first-page":"219","volume-title":"Memetic algorithms: a short introduction","author":"PA Moscato","year":"1999","unstructured":"Moscato PA (1999) Memetic algorithms: a short introduction. McGraw-Hill, London, pp 219\u2013234"},{"issue":"4","key":"647_CR37","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1093\/comjnl\/7.4.308","volume":"7","author":"JA Nelder","year":"1965","unstructured":"Nelder JA, Mead R (1965) A simplex method for functions minimizations. Comput J 7(4):308\u2013313","journal-title":"Comput J"},{"issue":"3","key":"647_CR38","doi-asserted-by":"crossref","first-page":"604","DOI":"10.1109\/TEVC.2008.2009460","volume":"13","author":"QH Nguyen","year":"2009","unstructured":"Nguyen QH, Ong YS, Lim MH (2009) A probabilistic memetic framework. IEEE Trans Evol Comput 13(3):604\u2013623","journal-title":"IEEE Trans Evol Comput"},{"issue":"1","key":"647_CR39","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1109\/TEVC.2007.895272","volume":"12","author":"N Noman","year":"2008","unstructured":"Noman N, Iba H (2008) Accelerating differential evolution using an adaptive local search. IEEE Trans Evoly Comput 12(1):107\u2013125","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"647_CR40","first-page":"99","volume":"4","author":"OY Soon","year":"2004","unstructured":"Soon OY, Keane AJ (2004) Meta-lamarckian learning in memetic algorithms. IEEE Trans Evolu Comput 4(2):99\u2013110","journal-title":"IEEE Trans Evol Comput"},{"key":"647_CR41","unstructured":"Price KV, Storn RM, Lampinen JA (2005) Differential evolution: a practical approach to global optimization. Springer, Berlin"},{"issue":"2","key":"647_CR42","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1109\/3477.485836","volume":"26","author":"JM Renders","year":"1996","unstructured":"Renders JM, Flasse SP (1996) Hybrid methods using genetic algorithms for global optimization. IEEE Trans Syst Man Cybern 26(2):246\u2013258","journal-title":"IEEE Trans Syst Man Cybern"},{"key":"647_CR43","volume-title":"Numerical optimization of computer models","author":"HP Schwefel","year":"1981","unstructured":"Schwefel HP (1981) Numerical optimization of computer models. Wiley, New York"},{"key":"647_CR44","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1287\/moor.6.1.19","volume":"6","author":"FJ Solis","year":"1981","unstructured":"Solis FJ, Wets RJ (1981) Minimization by random search techniques. Math Oper Res 6:19\u201330","journal-title":"Math Oper Res"},{"key":"647_CR45","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1023\/A:1008202821328","volume":"11","author":"R Storn","year":"1997","unstructured":"Storn R, Price K (1997) Differential evolution\u2014a simple and efficient heuristic for global optimization over continuous spaces. J Glob Optim 11:341\u2013359","journal-title":"J Glob Optim"},{"key":"647_CR46","unstructured":"Suganthan PN, Hansen N, Liang JJ, Deb K, Chen YP, Auger A, Tiwari S (2005) Problem definitions and evaluation criteria for the CEC 2005 special session on real parameter optimization. Tech. rep., Nanyang Technical University. http:\/\/www.ntu.edu.sg\/home\/epnsugan\/index_files\/CEC-05\/Tech-Report-May-30-05"},{"key":"647_CR47","unstructured":"Syswerda G (1989) Uniform crossover in genetic algorithms. In: Schaffer JD (ed) Proceedings of the third international conference on genetic algorithms. Morgan Kaufmann, San Mateo, pp 2\u20139"},{"key":"647_CR48","unstructured":"Tang K (2008) Summary of results on CEC\u201908 competition on large scale global optimization. Tech. rep., Nature Inspired Computation and Application Lab (NICAL). http:\/\/nical.ustc.edu.cn\/papers\/CEC2008_SUMMARY.pdf"},{"key":"647_CR49","unstructured":"Tang K, Yao X, Suganthan PN, MacNish C, Chen YP, Chen CM, Yang Z (2007) Benchmark functions for the CEC\u20192008 special session and competition on large scale global optimization. Tech. rep., Nature Inspired Computation and Application Laboratory, USTC, China. http:\/\/nical.ustc.edu.cn\/cec08ss.php"},{"key":"647_CR50","unstructured":"Tseng LY, Chen C (2007) Multiple trajectory search for multiobjective optimization. In: 2007 IEEE congress on evolutionary computation, pp 3609\u20133616"},{"key":"647_CR51","unstructured":"Tseng LY, Chen C (2008) Multiple trajectory search for large scale global optimization. In: 2008 IEEE congress on evolutionary computation, pp 3057\u20133064"},{"key":"647_CR52","volume-title":"Biostatistical analysis","author":"JH Zar","year":"1999","unstructured":"Zar JH (1999) Biostatistical analysis. Prentice Hall, Englewood, NJ"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-010-0647-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-010-0647-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-010-0647-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T21:59:10Z","timestamp":1740520750000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-010-0647-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,9,18]]},"references-count":51,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2011,11]]}},"alternative-id":["647"],"URL":"https:\/\/doi.org\/10.1007\/s00500-010-0647-2","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,9,18]]}}}