{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,17]],"date-time":"2025-11-17T02:49:26Z","timestamp":1763347766890},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2011,6,1]],"date-time":"2011-06-01T00:00:00Z","timestamp":1306886400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Memetic Comp."],"published-print":{"date-parts":[[2011,7]]},"DOI":"10.1007\/s12293-011-0057-8","type":"journal-article","created":{"date-parts":[[2011,5,31]],"date-time":"2011-05-31T11:02:26Z","timestamp":1306839746000},"page":"111-127","source":"Crossref","is-referenced-by-count":11,"title":["Genetic algorithm with automatic termination and search space rotation"],"prefix":"10.1007","volume":"3","author":[{"given":"Bun Theang","family":"Ong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masao","family":"Fukushima","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,6,1]]},"reference":[{"key":"57_CR1","volume-title":"Handbook of evolutionary computation","year":"1997","unstructured":"Back, T, Fogel, DB, Michalewicz, Z (eds) (1997) Handbook of evolutionary computation. IOP Publishing Ltd., Bristol"},{"key":"57_CR2","unstructured":"Baker JE (1985) Adaptive selection methods for genetic algorithms. In: Proceedings of the 1st international conference on genetic algorithms. L. Erlbaum Associates Inc., Hillsdale, pp 101\u2013111"},{"key":"57_CR3","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1023\/A:1015059928466","volume":"1","author":"HG Beyer","year":"2002","unstructured":"Beyer HG, Schwefel HP (2002) Evolution strategies\u2014a comprehensive introduction. Nat Comput 1: 3\u201352","journal-title":"Nat Comput"},{"issue":"6","key":"57_CR4","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 (2009) 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(6): 617\u2013644","journal-title":"J Heuristics"},{"key":"57_CR5","unstructured":"Giggs MS, Maier HR, Dandy GC, Nixon JB (2006) Minimum number of generations required for convergence of genetic algorithms. In: Proceedings of 2006 IEEE congress on evolutionary computation, Vancouver, BC, Canada, pp 2580\u20132587"},{"key":"57_CR6","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1016\/0305-0548(86)90048-1","volume":"13","author":"F Glover","year":"1986","unstructured":"Glover F (1986) Future paths for integer programming and links to artificial intelligence. Comput Oper Res 13: 533\u2013549","journal-title":"Comput Oper Res"},{"key":"57_CR7","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/3-540-32494-1_4","volume-title":"Towards a new evolutionary computation. Advances on estimation of distribution algorithms","author":"N Hansen","year":"2006","unstructured":"Hansen N (2006) The CMA evolution strategy: a comparing review. In: Lozano J, Larranaga P, Inza I, Bengoetxea E (eds) Towards a new evolutionary computation. Advances on estimation of distribution algorithms. Springer, New York, pp 75\u2013102"},{"key":"57_CR8","doi-asserted-by":"crossref","unstructured":"Hansen N, Kern S (2004) Evaluating the CMA evolution strategy on multimodal test functions. In: Proceedings of eighth international conference on parallel problem solving from nature PPSN VIII, pp 82\u2013291","DOI":"10.1007\/978-3-540-30217-9_29"},{"key":"57_CR9","doi-asserted-by":"crossref","unstructured":"Hansen N, Ostermeier A (1996) Adapting arbitrary normal mutation distributions in evolution strategies: the covariance matrix adaptation. In: Proceedings of the 1996 IEEE international conference on evolutionary computation. Morgan Kaufmann, pp 312\u2013317","DOI":"10.1109\/ICEC.1996.542381"},{"issue":"1","key":"57_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1162\/106365603321828970","volume":"11","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 11(1): 1\u201318","journal-title":"Evol Comput"},{"key":"57_CR11","unstructured":"Hansen N, Auger A, Kern S (2005) Performance evaluation of an advanced local search evolutionary algorithm. In: Proceedings of the IEEE congress on evolutionary computation. IEEE Press, pp 1777\u20131784"},{"key":"57_CR12","unstructured":"Hansen N, Auger A, Kern S (2005) A restart CMA evolution strategy with increasing population size. In: Proceedings of the IEEE congress on evolutionary computation. IEEE Press, pp 1769\u20131776"},{"key":"57_CR13","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1080\/921622054","volume":"18","author":"AR Hedar","year":"2003","unstructured":"Hedar AR, Fukushima M (2003) Minimizing multimodal functions by simplex coding genetic algorithm. Optim Methods Softw 18: 265\u2013282","journal-title":"Optim Methods Softw"},{"key":"57_CR14","unstructured":"Hedar AR, Fukushima M (2006) Directed evolutionary programming: towards an improved performance of evolutionary programming. In: Proceedings of congress on evolutionary computation. IEEE World Congress on Computational Intelligence, Vancouver, Canada, pp 1521\u20131528"},{"key":"57_CR15","unstructured":"Hedar AR, Ong BT, Fukushima M (2007) Genetic algorithms with automatic accelerated termination. Technical report, Department of Applied Mathematics and Physics, Kyoto University"},{"key":"57_CR16","volume-title":"Adaptation in natural and artificial systems","author":"JH Holland","year":"1975","unstructured":"Holland JH (1975) Adaptation in natural and artificial systems. The University of Michigan Press, Michigan"},{"key":"57_CR17","unstructured":"Jain BJ, Pohlheim H, Wegener J (2001) On termination criteria of evolutionary algorithms. In: Proceedings of the genetic and evolutionary computation conference. Morgan Kaufmann, p 768"},{"key":"57_CR18","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s12293-010-0040-9","volume":"2","author":"W Jakob","year":"2010","unstructured":"Jakob W (2010) A general cost-benefit-based adaptation framework for multimeme algorithms. Memetic Comput 2: 201\u2013218","journal-title":"Memetic Comput"},{"issue":"1","key":"57_CR19","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1137\/S1052623497315203","volume":"10","author":"CT Kelley","year":"1999","unstructured":"Kelley CT (1999) Detection and remediation of stagnation in the Nelder-Mead algorithm using a sufficient decrease condition. SIAM J Optim 10(1): 43\u201355","journal-title":"SIAM J Optim"},{"key":"57_CR20","doi-asserted-by":"crossref","DOI":"10.1007\/b138935","volume-title":"Computational intelligence: principles, techniques and applications","author":"A Konar","year":"2005","unstructured":"Konar A (2005) Computational intelligence: principles, techniques and applications. Springer, Berlin"},{"key":"57_CR21","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/s12293-009-0026-7","volume":"2","author":"W Koo","year":"2010","unstructured":"Koo W, Goh C, Tan K (2010) A predictive gradient strategy for multiobjective evolutionary algorithms in a fast changing environment. Memetic Comput 2: 87\u2013110","journal-title":"Memetic Comput"},{"issue":"1","key":"57_CR22","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1109\/TEVC.2005.860765","volume":"10","author":"VK Koumousis","year":"2006","unstructured":"Koumousis VK, Katsaras CP (2006) A saw-tooth genetic algorithm combining the effects of variable popultion size and reinitialization to enhance performance. IEEE Trans Evol Comput 10(1): 19\u201328","journal-title":"IEEE Trans Evol Comput"},{"key":"57_CR23","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/s12293-010-0032-9","volume":"2","author":"O Kramer","year":"2010","unstructured":"Kramer O (2010) Iterated local search with Powell\u2019s method: a memetic algorithm for continuous global optimization. Memetic Comput 2: 69\u201383","journal-title":"Memetic Comput"},{"key":"57_CR24","doi-asserted-by":"crossref","unstructured":"Kwok NM, Ha QP, Liu DK, Fang G, Tan KC (2007) Efficient particle swarm optimization: a termination condition based on the decision-making approach. In: Proceedings of the IEEE congress on evolutionary computation, Singapore, pp 25\u201328","DOI":"10.1109\/CEC.2007.4424905"},{"issue":"5","key":"57_CR25","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1109\/TEVC.2006.886448","volume":"11","author":"WB Langdon","year":"2007","unstructured":"Langdon WB, Poli R (2007) Evolving problems to learn about particle swarm optimizers and other search algorithms. IEEE Trans Evol Comput 11(5): 561\u2013578","journal-title":"IEEE Trans Evol Comput"},{"key":"57_CR26","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/s12293-009-0016-9","volume":"1","author":"M Le","year":"2009","unstructured":"Le M, Ong YS, Jin Y, Sendhoff B (2009) Lamarckian memetic algorithms: local optimum and connectivity structure analysis. Memetic Comput 1: 175\u2013190","journal-title":"Memetic Comput"},{"key":"57_CR27","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TEVC.2003.816583","volume":"8","author":"C Lee","year":"2004","unstructured":"Lee C, Yao X (2004) Evolutionary programming using the mutations based on the L\u00e9vy probability distribution. IEEE Trans Evol Comput 8: 1\u201313","journal-title":"IEEE Trans Evol Comput"},{"key":"57_CR28","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1109\/4235.910464","volume":"5","author":"YW Leung","year":"2001","unstructured":"Leung YW, Wang Y (2001) An orthogonal genetic algorithm with quantization for numerical optimization. IEEE Trans Evol Comput 5: 41\u201353","journal-title":"IEEE Trans Evol Comput"},{"key":"57_CR29","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-69432-8","volume-title":"Parameter setting in evolutionary algorithms","author":"FG Lobo","year":"2007","unstructured":"Lobo FG, Lima CF, Michalewicz Z (2007) Parameter setting in evolutionary algorithms. Springer, Berlin"},{"key":"57_CR30","unstructured":"Lozano M, Herrera F, Molina D (2005) Adaptive local search parameters for real-coded memetic algorithms. In: Proceedings of the 2005 IEEE congress on evolutionary computation, pp 888\u2013895"},{"key":"57_CR31","doi-asserted-by":"crossref","unstructured":"Lunacek M, Whitley D (2006) The dispersion metric and the CMA evolution strategy. In: GECCO \u201906: Proceedings of the 8th annual conference on genetic and evolutionary computation. ACM, New York, pp 477\u2013484","DOI":"10.1145\/1143997.1144085"},{"issue":"2","key":"57_CR32","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1002\/stvr.294","volume":"14","author":"P McMinn","year":"2004","unstructured":"McMinn P (2004) Search-based software test data generation: a survey. Softw Test Verif Reliab 14(2): 105\u2013156","journal-title":"Softw Test Verif Reliab"},{"key":"57_CR33","volume-title":"Applied statistics and probability for engineers","author":"D Montgomery","year":"2003","unstructured":"Montgomery D, Runger G (2003) Applied statistics and probability for engineers. Wiley, New York"},{"key":"57_CR34","volume-title":"New ideas in optimization","author":"P Moscato","year":"1999","unstructured":"Moscato P (1999) Memetic algorithms: an introduction. In: Corne D, Dorigo M, Glover F, Dasgupta D, Moscato P, Poli R, Price KV (eds) New ideas in optimization. McGraw-Hill Ltd., Maidenhead"},{"key":"57_CR35","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1093\/comjnl\/7.4.308","volume":"7","author":"J Nelder","year":"1965","unstructured":"Nelder J, Mead R (1965) A simplex method for function minimization. Comput J 7: 308\u2013313","journal-title":"Comput J"},{"issue":"1","key":"57_CR36","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 Evol Comput 12(1): 107\u2013125","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"57_CR37","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1109\/TEVC.2003.819944","volume":"8","author":"YS Ong","year":"2004","unstructured":"Ong YS, Keane A (2004) Meta-Lamarckian learning in memetic algorithms. IEEE Trans Evol Comput 8(2): 99\u2013110","journal-title":"IEEE Trans Evol Comput"},{"issue":"1","key":"57_CR38","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1109\/TSMCB.2005.856143","volume":"36","author":"YS Ong","year":"2006","unstructured":"Ong YS, Lim MH, Zhu N, Wong K (2006) Classification of adaptive memetic algorithms: a comparative study. IEEE Trans Syst Man Cybern B 36(1): 141\u2013152","journal-title":"IEEE Trans Syst Man Cybern B"},{"key":"57_CR39","unstructured":"O\u2019Sullivan M, V\u00f6ssner S, Wegener J (1998) Testing temporal correctness of real-time systems. In: EuroSTAR\u201998: Proceedings of the sixth international conference on software testing analysis and review, Munich, Germany"},{"key":"57_CR40","unstructured":"Rechenberg I (1965) Cybernetic solution path of an experimental problem. Technical report, Royal Air Force Establishment"},{"key":"57_CR41","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1007\/978-3-540-28645-5_41","volume":"3171","author":"M Safe","year":"2004","unstructured":"Safe M, Carballido J, Ponzoni I, Brignole N (2004) On stopping criteria for genetic algorithms. Lect Notes Comput Sci 3171: 405\u2013413","journal-title":"Lect Notes Comput Sci"},{"key":"57_CR42","unstructured":"Schwefel HP (1974) Adaptive mechanismen in der biologischen evolution und ihr einfluss auf die evolutionsgeschwindigkeit (abschlussbericht zum dfg-vorhaben re 215\/2). Tech. rep., Technical University of Berlin, Berlin"},{"issue":"4","key":"57_CR43","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(4): 341\u2013359","journal-title":"J Glob Optim"},{"key":"57_CR44","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. Technical report. Nanyang Technol. University, Singapore"},{"key":"57_CR45","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/s12293-009-0013-z","volume":"1","author":"CK Ting","year":"2009","unstructured":"Ting CK, Ko CF, Huang CH (2009) Selecting survivors in genetic algorithm using tabu search strategies. Memetic Comput 1: 191\u2013203","journal-title":"Memetic Comput"},{"issue":"2","key":"57_CR46","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1109\/TEVC.2004.826895","volume":"8","author":"JT Tsai","year":"2004","unstructured":"Tsai JT, Liu TK, Chou JH (2004) Hybrid Taguchi-genetic algorithm for global numerical optimization. IEEE Trans Evol Comput 8(2): 365\u2013377","journal-title":"IEEE Trans Evol Comput"},{"key":"57_CR47","unstructured":"Tsutsui S, Yamamura M, Higuchi T (1999) Multi-parent recombination with simplex crossover in real-coded genetic algorithms. In: GECCO \u201999: Proceedings of the genetic and evolutionary computation conference, pp 657\u2013664"},{"issue":"5","key":"57_CR48","doi-asserted-by":"crossref","first-page":"456","DOI":"10.1109\/TEVC.2004.831258","volume":"8","author":"Z Tu","year":"2004","unstructured":"Tu Z, Lu Y (2004) A robust stochastic genetic algorithm (STGA) for global numerical optimization. IEEE Trans Evol Comput 8(5): 456\u2013470","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"57_CR49","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1109\/4235.771163","volume":"3","author":"X Yao","year":"1999","unstructured":"Yao X, Liu Y, Lin G (1999) Evolutionary programming made faster. IEEE Trans Evol Comput 3(2): 82\u2013102","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"57_CR50","doi-asserted-by":"crossref","first-page":"454","DOI":"10.1109\/TEVC.2008.2003008","volume":"13","author":"SY Yuen","year":"2009","unstructured":"Yuen SY, Chow CK (2009) A genetic algorithm that adaptively mutates and never revisits. IEEE Trans Evol Comput 13(2): 454\u2013472","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"57_CR51","doi-asserted-by":"crossref","first-page":"1128","DOI":"10.1109\/TSMCB.2003.821456","volume":"34","author":"W Zhong","year":"2004","unstructured":"Zhong W, Liu J, Xue M, Jiao L (2004) A multiagent genetic algorithm for global numerical optimization. IEEE Trans Syst Man Cybern B 34(2): 1128\u20131141","journal-title":"IEEE Trans Syst Man Cybern B"},{"issue":"1","key":"57_CR52","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1109\/TSMCC.2005.855506","volume":"37","author":"Z Zhou","year":"2007","unstructured":"Zhou Z, Ong YS, Nair P, Keane A, Lum K (2007) Combining global and local surrogate models to accelerate evolutionary optimization. IEEE Trans Syst Man Cybern B 37(1): 66\u201376","journal-title":"IEEE Trans Syst Man Cybern B"}],"container-title":["Memetic Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-011-0057-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12293-011-0057-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-011-0057-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,11]],"date-time":"2019-06-11T09:28:37Z","timestamp":1560245317000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12293-011-0057-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,1]]},"references-count":52,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,7]]}},"alternative-id":["57"],"URL":"https:\/\/doi.org\/10.1007\/s12293-011-0057-8","relation":{},"ISSN":["1865-9284","1865-9292"],"issn-type":[{"value":"1865-9284","type":"print"},{"value":"1865-9292","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,6,1]]}}}