{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T13:01:52Z","timestamp":1770296512166,"version":"3.49.0"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2009,9,29]],"date-time":"2009-09-29T00:00:00Z","timestamp":1254182400000},"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":[[2009,11]]},"DOI":"10.1007\/s12293-009-0016-9","type":"journal-article","created":{"date-parts":[[2009,9,28]],"date-time":"2009-09-28T11:18:12Z","timestamp":1254136692000},"page":"175-190","source":"Crossref","is-referenced-by-count":68,"title":["Lamarckian memetic algorithms: local optimum and connectivity structure analysis"],"prefix":"10.1007","volume":"1","author":[{"given":"Minh Nghia","family":"Le","sequence":"first","affiliation":[]},{"given":"Yew-Soon","family":"Ong","sequence":"additional","affiliation":[]},{"given":"Yaochu","family":"Jin","sequence":"additional","affiliation":[]},{"given":"Bernhard","family":"Sendhoff","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,9,29]]},"reference":[{"issue":"8-9","key":"16_CR1","first-page":"739","volume":"13","author":"YS Ong","year":"2008","unstructured":"Ong YS, Lim MH, Neri F, Ishibuchi H (2008) Special issue on emerging trends in soft computing: memetic algorithms. Soft Comput Fusion Found Methodol Appl 13(8-9): 739\u2013740","journal-title":"Soft Comput Fusion Found Methodol Appl"},{"issue":"1","key":"16_CR2","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1109\/TSMCB.2006.883274","volume":"37","author":"YS Ong","year":"2007","unstructured":"Ong YS, Krasnogor N, Ishibuchi H (2007) Special issue on memetic algorithms. IEEE Trans Syst Man Cybern Part B 37(1): 2\u20135","journal-title":"IEEE Trans Syst Man Cybern Part B"},{"key":"16_CR3","unstructured":"Neri F, Moscato P, Ishibuchi H (2009) Special session: memetic algorithms for hard to solve problems. IEEE World Congr Comput Intell"},{"key":"16_CR4","unstructured":"Ong YS, Neri F, Ishibuchi H, Lim MH (2007, 2008) Memetic algorithms: special session. IEEE World Congr Comput Intell"},{"issue":"1","key":"16_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s12293-009-0007-x","volume":"1","author":"MH Lim","year":"2009","unstructured":"Lim MH, Gustafson S, Krasnogor N, Ong YS (2009) Editorial to the first issue. Memetic Comput 1(1): 1\u20132","journal-title":"Memetic Comput"},{"key":"16_CR6","unstructured":"Moscato P (1989) On evolution, search, optimization, genetic algorithms and martial arts: towards memetic algorithms. Caltech Concurrent Computation Program, C3P Report 826"},{"issue":"3","key":"16_CR7","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/BF00247795","volume":"6","author":"BH Gwee","year":"1996","unstructured":"Gwee BH, Lim MH (1996) Polynominoes tiling by a genetic algorithm. Comput Optim Appl J 6(3): 273\u2013291","journal-title":"Comput Optim Appl J"},{"issue":"3","key":"16_CR8","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1023\/A:1008743718053","volume":"15","author":"MH Lim","year":"2000","unstructured":"Lim MH, Yu Y, Omatu S (2000) Efficient genetic algorithms using simple genes exchange local search policy for the quadratic assignment problem. Comput Optim Appl 15(3): 249\u2013268","journal-title":"Comput Optim Appl"},{"issue":"3","key":"16_CR9","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1109\/TEVC.2006.885162","volume":"11","author":"R Lewis","year":"2007","unstructured":"Lewis R, Paechter B (2007) Finding feasible timetables using group-based operators. IEEE Trans Evol Comput 11(3): 397\u2013413","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"16_CR10","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":"5","key":"16_CR11","doi-asserted-by":"crossref","first-page":"634","DOI":"10.2514\/2.764","volume":"37","author":"A Vicini","year":"1999","unstructured":"Vicini A, Quagliarella D (1999) Airfoil and wing design through hybrid optimization strategies. Am Inst Aeronaut Astronaut J 37(5): 634\u2013641","journal-title":"Am Inst Aeronaut Astronaut J"},{"key":"16_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03315-9","volume-title":"Genetic Algorithms\u2014Data Structures\u2014Evolution Programs","author":"Z Michalewicz","year":"1996","unstructured":"Michalewicz Z (1996) Genetic Algorithms\u2014Data Structures\u2014Evolution Programs. Springer, London"},{"key":"16_CR13","unstructured":"Houck C, Joines J, Kay M (1996) Utilizing Lamarckian evolution and the Baldwin effect in hybrid genetic algorithms. Tech Rep"},{"key":"16_CR14","unstructured":"Hart WE (1994) Adaptive global optimization with local search. Ph.D. dissertation, University of California, San Diego"},{"key":"16_CR15","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1109\/ICEC.1994.349948","volume":"1","author":"J Renders","year":"1994","unstructured":"Renders J, Bersini H (1994) Hybridizing genetic algorithms with hill-climbing methods for global optimization: two possible ways. IEEE World Congress Comput Intell 1: 312\u2013317","journal-title":"IEEE World Congress Comput Intell"},{"key":"16_CR16","volume-title":"Handbook of genetic algorithms","author":"L Davis","year":"1991","unstructured":"Davis L (1991) Handbook of genetic algorithms. Van Nostrand Reinhold Company, New York"},{"issue":"1","key":"16_CR17","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":"4","key":"16_CR18","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1109\/TEVC.2005.859464","volume":"10","author":"YS Ong","year":"2006","unstructured":"Ong YS, Nair PB, Lum K (2006) Max-min surrogate-assisted evolutionary algorithm for robust design. IEEE Trans Evol Comput 10(4): 392\u2013404","journal-title":"IEEE Trans Evol Comput"},{"issue":"5","key":"16_CR19","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 issues. IEEE Trans Evol Comput 9(5): 474\u2013488","journal-title":"IEEE Trans Evol Comput"},{"issue":"4","key":"16_CR20","doi-asserted-by":"crossref","first-page":"687","DOI":"10.2514\/2.1999","volume":"41","author":"YS Ong","year":"2003","unstructured":"Ong YS, Nair PB, Keane AJ (2003) Evolutionary optimization of computationally expensive problems via surrogate modeling. Am Inst Aeronaut Astronaut J 41(4): 687\u2013696","journal-title":"Am Inst Aeronaut Astronaut J"},{"issue":"2","key":"16_CR21","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1109\/TEVC.2003.810752","volume":"7","author":"H Ishibuchi","year":"2003","unstructured":"Ishibuchi H, Yoshida T, Murata T (2003) Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling. IEEE Trans Evol Comput 7(2): 204\u2013223","journal-title":"IEEE Trans Evol Comput"},{"key":"16_CR22","unstructured":"Krasnogor N (2002) Studies on the theory and design space of memetic algorithms. Ph.D. dissertation, Doctoral dissertation, University of the West of England, Bristol, England"},{"key":"16_CR23","doi-asserted-by":"crossref","unstructured":"Krasnogor N, Blackburne BP, Burke EK, Hirst JD (2002) Multimeme algorithms for protein structure prediction. In: Proceedings of the parallel problem solving from nature VII (Lecture notes in computer science), vol 2439\/2002, pp 769\u2013778","DOI":"10.1007\/3-540-45712-7_74"},{"issue":"2","key":"16_CR24","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/s12293-009-0011-1","volume":"1","author":"R Meuth","year":"2009","unstructured":"Meuth R, Lim MH, Ong YS, Wunsch DC II (2009) A proposition on memes and meta-memes in computing for higher-order learning. Memetic Comput 1(2): 85\u2013100","journal-title":"Memetic Comput"},{"issue":"1","key":"16_CR25","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 KW (2006) Classification of adaptive memetic algorithms: a comparative study. IEEE Trans Syst Man Cybern Part B 36(1): 141\u2013152","journal-title":"IEEE Trans Syst Man Cybern Part B"},{"issue":"1","key":"16_CR26","first-page":"495","volume":"1","author":"GE Hinton","year":"1987","unstructured":"Hinton GE, Nowlan SJ (1987) How learning can guide evolution. Complex Syst 1(1): 495\u2013502","journal-title":"Complex Syst"},{"issue":"5","key":"16_CR27","doi-asserted-by":"crossref","first-page":"1555","DOI":"10.1111\/j.1420-9101.2006.01125.x","volume":"19","author":"E Borenstein","year":"2006","unstructured":"Borenstein E, Meilijson I, Ruppin E (2006) The effect of phenotypic plasticity on evolution in multipeaked fitness landscapes. J Evol Biol 19(5): 1555\u20131570","journal-title":"J Evol Biol"},{"issue":"2","key":"16_CR28","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1162\/artl.2009.15.2.15204","volume":"15","author":"I Paenke","year":"2009","unstructured":"Paenke I, Kawecki T, Sendhoff B (2009) The influence of learning on evolution: a mathematical framework. Artif Life 15(2): 227\u2013245","journal-title":"Artif Life"},{"issue":"2","key":"16_CR29","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1177\/1059712309103566","volume":"17","author":"I Paenke","year":"2009","unstructured":"Paenke I, Jin Y, Branke J (2009) Balancing population and individual level adaptation in changing environments. Adapt Behav 17(2): 153\u2013174","journal-title":"Adapt Behav"},{"issue":"3","key":"16_CR30","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1162\/1063656041774956","volume":"12","author":"P Merz","year":"2004","unstructured":"Merz P (2004) Advanced fitness landscape analysis and the performance of memetic algorithms. Evol Comput 12(3): 303\u2013325","journal-title":"Evol Comput"},{"key":"16_CR31","unstructured":"Merz P (2000) Memetic algorithms for combinatorial optimization problems: fitness landscapes and effective search strategies. Ph.D. dissertation, University of Siegen, Germany"},{"key":"16_CR32","doi-asserted-by":"crossref","unstructured":"Whitley D, Gordon V, Mathias K (1994) Lamarckian evolution, the Baldwin effect and function optimization. In: Parallel problem solving from nature\u2013PPSN III: international conference on evolutionary computation, the third conference on parallel problem solving from nature, pp 6\u201315","DOI":"10.1007\/3-540-58484-6_245"},{"key":"16_CR33","doi-asserted-by":"crossref","unstructured":"Paenke I, Sendhoff B, Rowe J, Fernando C (2007) On the adaptive disadvantage of Lamarckianism in rapidly changing environments. In: European conference on artificial life (ECAL), 10\u201314 September 2007 (Lecture notes in computer science), vol 4648, pp 355\u2013364","DOI":"10.1007\/978-3-540-74913-4_36"},{"key":"16_CR34","doi-asserted-by":"crossref","unstructured":"Zhang JQ, Sanderson AC (2009) Adaptive differential evolution: a robust approach to multimodal problem optimization. Series on adaptation, Learning and Optimization, vol. 1","DOI":"10.1007\/978-3-642-01527-4_4"},{"key":"16_CR35","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198540625.001.0001","volume-title":"Epigenetic inheritance and evolution: the Lamarckian dimension","author":"E Jablonka","year":"1995","unstructured":"Jablonka E, Lamb MJ (1995) Epigenetic inheritance and evolution: the Lamarckian dimension. Oxford University Press, Oxford"},{"issue":"1","key":"16_CR36","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1111\/j.1469-1809.1996.tb01176.x","volume":"60","author":"MW Ho","year":"1996","unstructured":"Ho MW (1996) Why Lamarck won\u2019t go away. Ann Hum Genet 60(1): 81\u201384","journal-title":"Ann Hum Genet"},{"issue":"1","key":"16_CR37","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0303-2647(96)01657-7","volume":"41","author":"H-G Beyer","year":"1997","unstructured":"Beyer H-G (1997) An alternative explanation for the manner in which genetic algorithms operate. BioSystems 41(1): 1\u201315","journal-title":"BioSystems"},{"issue":"1","key":"16_CR38","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/S0304-3975(02)00137-8","volume":"287","author":"H-G Beyer","year":"2002","unstructured":"Beyer H-G, Schwefel H-P, Wegener I (2002) How to analyse evolutionary algorithms. Theor Comput Sci 287(1): 101\u2013130","journal-title":"Theor Comput Sci"},{"key":"16_CR39","volume-title":"Evolution and optimum seeking: the sixth generation","author":"H-P Schwefel","year":"1993","unstructured":"Schwefel H-P (1993) Evolution and optimum seeking: the sixth generation. Wiley, New York"},{"key":"16_CR40","first-page":"69","volume":"1","author":"D Goldberg","year":"1991","unstructured":"Goldberg D, Deb K (1991) A comparative analysis of selection schemes used in genetic algorithms. Found Genet\u00a0algorithm 1: 69\u201393","journal-title":"Found Genet\u00a0algorithm"},{"key":"16_CR41","doi-asserted-by":"crossref","unstructured":"Wojtusiak J, Michalski RS (2006) The LEM3 implementation of learnable evolution model and its testing on complex function optimization problems. In: GECCO \u201906: Proceedings of the 8th annual conference on genetic and evolutionary computation. ACM Press, USA, pp 1281\u20131288","DOI":"10.1145\/1143997.1144197"},{"key":"16_CR42","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1109\/4235.910464","volume":"5","author":"Y-W Leung","year":"2001","unstructured":"Leung Y-W, Wang Y (2001) An orthogonal genetic algorithm with quantization for global numerical optimization. IEEE Trans Evol Comput 5: 41\u201353","journal-title":"IEEE Trans Evol Comput"},{"key":"16_CR43","first-page":"467","volume":"26","author":"X Yao","year":"1997","unstructured":"Yao X, Liu Y (1997) Fast evolution strategies. Control Cybern 26: 467\u2013496","journal-title":"Control Cybern"},{"key":"16_CR44","doi-asserted-by":"crossref","unstructured":"Nguyen QH, Ong YS, Krasnogor N (2007) A study on the design issues of memetic algorithm. In: IEEE congress on evolutionary computation (CEC), 25\u201328 September 2007, pp 2390\u20132397","DOI":"10.1109\/CEC.2007.4424770"},{"issue":"3","key":"16_CR45","doi-asserted-by":"crossref","first-page":"604","DOI":"10.1109\/TSMCB.2008.915539","volume":"38","author":"J Tavares","year":"2008","unstructured":"Tavares J, Pereira FB, Costa E (2008) Multidimensional knapsack problem: a fitness landscape analysis. IEEE Trans Syst Man Cybern Part B Cybern 38(3): 604\u2013616","journal-title":"IEEE Trans Syst Man Cybern Part B Cybern"},{"key":"16_CR46","unstructured":"Jones T, Forrest S (1995) Fitness distance correlation as a measure of problem difficulty for genetic algorithms. In: Proceedings of the 6th international conference on genetic algorithms, pp 184\u2013192"},{"issue":"1","key":"16_CR47","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1162\/evco.2006.14.1.119","volume":"14","author":"Y-W Shang","year":"2006","unstructured":"Shang Y-W, Qiu Y-H (2006) A note on the extended Rosenbrock function. Evol Comput 14(1): 119\u2013126","journal-title":"Evol Comput"}],"container-title":["Memetic Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-009-0016-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12293-009-0016-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-009-0016-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,16]],"date-time":"2024-03-16T20:03:51Z","timestamp":1710619431000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12293-009-0016-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,9,29]]},"references-count":47,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2009,11]]}},"alternative-id":["16"],"URL":"https:\/\/doi.org\/10.1007\/s12293-009-0016-9","relation":{},"ISSN":["1865-9284","1865-9292"],"issn-type":[{"value":"1865-9284","type":"print"},{"value":"1865-9292","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,9,29]]}}}