{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T00:02:55Z","timestamp":1780617775327,"version":"3.54.1"},"reference-count":74,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2009,4,29]],"date-time":"2009-04-29T00:00:00Z","timestamp":1240963200000},"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,6]]},"DOI":"10.1007\/s12293-009-0011-1","type":"journal-article","created":{"date-parts":[[2009,4,28]],"date-time":"2009-04-28T08:09:26Z","timestamp":1240906166000},"page":"85-100","source":"Crossref","is-referenced-by-count":99,"title":["A proposition on memes and meta-memes in computing for higher-order learning"],"prefix":"10.1007","volume":"1","author":[{"given":"Ryan","family":"Meuth","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Meng-Hiot","family":"Lim","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yew-Soon","family":"Ong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"suffix":"II","given":"Donald C.","family":"Wunsch","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2009,4,29]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Abramson M, Wechsler H (2001) Competitive reinforcement learning for combinatorial problems. In: International joint conference on neural networks proceedings. IJCNN \u201901","DOI":"10.1109\/IJCNN.2001.938727"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Agarwal A, Lim M-H, Er M-J, Chew C-Y (2005) ACO for a new TSP in region coverage. IEEE\/RSJ Int Conf Intel Robot Syst","DOI":"10.1109\/IROS.2005.1545460"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Agarwal A, Lim M-H, Er MJ, Nguyen TN (2007) Rectilinear workspace partitioning for parallel coverage using multiple UAVs. Adv Robot 21(1)","DOI":"10.1163\/156855307779293698"},{"key":"11_CR4","unstructured":"Angeline PJ (1993) Evolutionary algorithms and emergent intelligence. Doctoral thesis, Ohio State University, Columbus"},{"issue":"1","key":"11_CR5","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1287\/ijoc.15.1.82.15157","volume":"15","author":"D Applegate","year":"2003","unstructured":"Applegate D, Cook W, Rohe A (2003) Chained Lin-Kernighan for large traveling salesman problems. INFORMS J Comput 15(1): 82\u201392","journal-title":"INFORMS J Comput"},{"issue":"4","key":"11_CR6","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1109\/TEVC.2006.882427","volume":"11","author":"DV Arnold","year":"2007","unstructured":"Arnold DV, Salomon R (2007) Evolutionary gradient search revisited. IEEE Trans Evol Comput 11(4): 480\u2013495","journal-title":"IEEE Trans Evol Comput"},{"issue":"6","key":"11_CR7","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1109\/4235.974843","volume":"5","author":"R Baraglia","year":"2001","unstructured":"Baraglia R, Hidalgo JI, Perego R (2001) A hybrid heuristic for the traveling salesman problem. IEEE Trans Evol Comput 5(6): 613\u2013622","journal-title":"IEEE Trans Evol Comput"},{"issue":"1","key":"11_CR8","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1523\/JNEUROSCI.02-01-00032.1982","volume":"2","author":"EL Beinenstock","year":"1982","unstructured":"Beinenstock EL, Cooper L, Munro P (1982) Theory for the development of neuron selectivity: orientation specifity and binocular interaction in the visual cortex. J Neurosci 2(1): 32\u201348","journal-title":"J Neurosci"},{"issue":"3","key":"11_CR9","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1023\/A:1011291030731","volume":"15","author":"E Burke","year":"2001","unstructured":"Burke E, Cowling P, Causmaecker PD, Berghe G (2001) A memetic approach to the nurse rostering problem. Appl Int 15(3): 199\u2013214","journal-title":"Appl Int"},{"issue":"1","key":"11_CR10","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 memetic algorithm for off-line and on-line control design of PMSM drives. IEEE Trans Syst Man Cybern Part B Spec Issue Memetic Algorithms 37(1): 28\u201341","journal-title":"IEEE Trans Syst Man Cybern Part B Spec Issue Memetic Algorithms"},{"key":"11_CR11","unstructured":"Dang J, Zhang Z (2005) A polynomial time evolutionary algorithm for the traveling salesman problem. Int Conf Neural Netw Brain"},{"key":"11_CR12","volume-title":"The selfish gene","author":"R Dawkins","year":"1989","unstructured":"Dawkins R (1989) The selfish gene. Oxford University Press, USA"},{"issue":"2","key":"11_CR13","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1109\/4235.918434","volume":"5","author":"O Francois","year":"2001","unstructured":"Francois O, Lavergne C (2001) Design of evolutionary algorithms-A statistical perspective. Evol Comput IEEE Trans on 5(2): 129\u2013148","journal-title":"Evol Comput IEEE Trans on"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Gaudiot J-L, Kang J-Y, Ro WW (2005) Techniques to improve performance beyond pipelining: superpipelining, superscalar, and VLIW. Adv Comput (63)","DOI":"10.1016\/S0065-2458(04)63001-4"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Gutin G, Karapetyan D (2009) A selection of useful theoretical tools for the design and analysis of optimization heuristics. Memetic Comput 1(1)","DOI":"10.1007\/s12293-008-0001-8"},{"key":"11_CR16","volume-title":"Adaptive global optimization with local search","author":"WE Hart","year":"1994","unstructured":"Hart WE (1994) Adaptive global optimization with local search. University of California, California"},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"Hasan SMK, Sarker R, Essam D, Cornforth D (2008) Memetic algorithms for solving job-shop scheduling problems. Memetic Comput J","DOI":"10.1007\/s12293-008-0004-5"},{"key":"11_CR18","volume-title":"Adaptation in natural and artificial systems","author":"JH Holland","year":"1975","unstructured":"Holland JH (1975) Adaptation in natural and artificial systems. University of Michigan Press, Ann Arbor"},{"issue":"2","key":"11_CR19","doi-asserted-by":"publisher","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"},{"issue":"1","key":"11_CR20","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1016\/j.neunet.2006.05.029","volume":"20","author":"C Johansson","year":"2007","unstructured":"Johansson C, Lansner A (2007) Towards cortex sized artificial neural systems. Neural Netw 20(1): 48\u201361","journal-title":"Neural Netw"},{"issue":"3","key":"11_CR21","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1109\/4235.930311","volume":"5","author":"SA Kazarlis","year":"2001","unstructured":"Kazarlis SA, Papadakis SE, Theocharis JB, Petridis V (2001) Microgenetic algorithms as generalized hill-climbing operators for GA optimization. Evol Comput IEEE Trans on 5(3): 204\u2013217","journal-title":"Evol Comput IEEE Trans on"},{"key":"11_CR22","unstructured":"Kendall G, Soubeiga E, Cowling P (2002) Choice function and random hyperheuristics. In: 4th Asia Pac Conf Simul Evol Learn, pp 667\u2013671"},{"key":"11_CR23","volume-title":"Case-based reasoning","author":"J Kolodner","year":"1993","unstructured":"Kolodner J (1993) Case-based reasoning. Morgan Kaufmann Publishers Inc., San Francisco"},{"key":"11_CR24","unstructured":"Koza JR (1989) Hierarchical genetic algorithms operating on populations of computer programs. In: International joint conference on artificial intelligence. Morgan Kaufman Publishers"},{"key":"11_CR25","doi-asserted-by":"crossref","unstructured":"Koza JR (1991) Evolution and co-evolution of computer programs to control independent-acting agents. In: From animals to animats: proceedings of the first international conference on simulation of adaptive behavior","DOI":"10.7551\/mitpress\/3115.003.0050"},{"key":"11_CR26","first-page":"201","volume-title":"The genetic programming paradigm: genetically breeding populations of computer programs to solve problems. Dynamic, genetic and chaotic programming","author":"JR Koza","year":"1992","unstructured":"Koza JR (1992) The genetic programming paradigm: genetically breeding populations of computer programs to solve problems. Dynamic, genetic and chaotic programming. Wiley, London, pp 201\u2013321"},{"key":"11_CR27","first-page":"297","volume-title":"Hierarchical automatic function definition in genetic programming. Foundations of genetic algorithms, vol 2","author":"JR Koza","year":"1992","unstructured":"Koza JR (1992) Hierarchical automatic function definition in genetic programming. Foundations of genetic algorithms, vol 2. Morgan Kaufmann, San Francisco, pp 297\u2013318"},{"key":"11_CR28","unstructured":"Krasnogor N (2002) Studies on the theory and design space of memetic algorithms. PhD, Faculty Comput Math Eng Bristol, UK, University West of England"},{"key":"11_CR29","doi-asserted-by":"crossref","unstructured":"Krasnogor N, Blackburne B, Hirst JD, Burke EK (2002) Multimeme algorithms for the structure prediction and structure comparison of proteins. In: Proc. parallel problem solving from nature. Lecture notes in computer science. Springer, Heidelberg","DOI":"10.1007\/3-540-45712-7_74"},{"issue":"1","key":"11_CR30","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1023\/B:NACO.0000023419.83147.67","volume":"3","author":"N Krasnogor","year":"2004","unstructured":"Krasnogor N, Gustafson S (2004) A study on the use of self-generation in memetic algorithms. Nat Comput 3(1): 53\u201376","journal-title":"Nat Comput"},{"issue":"5","key":"11_CR31","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1109\/TEVC.2005.850260","volume":"9","author":"N Krasnogor","year":"2005","unstructured":"Krasnogor N, Smith J (2005) A tutorial for competent memetic algorithms: model, taxonomy, and design issues. Evol Comput IEEE Trans 9(5): 474\u2013488","journal-title":"Evol Comput IEEE Trans"},{"issue":"4","key":"11_CR32","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1109\/4235.887233","volume":"4","author":"LI Kuncheva","year":"2000","unstructured":"Kuncheva LI, Jain LC (2000) Designing classifier fusion systems by genetic algorithms. Evol Comput IEEE Trans 4(4): 327\u2013336","journal-title":"Evol Comput IEEE Trans"},{"key":"11_CR33","volume-title":"Evolutionary algorithms with local search for combinatorial optimization","author":"MWS Land","year":"1998","unstructured":"Land MWS (1998) Evolutionary algorithms with local search for combinatorial optimization. University of California, California"},{"issue":"3","key":"11_CR34","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1109\/9.911416","volume":"46","author":"JT Lee","year":"2001","unstructured":"Lee JT, Lau E, Yu-Chi H (2001) The Witsenhausen counterexample: a hierarchical search approach for nonconvex optimization problems. Automat Control IEEE Trans 46(3): 382\u2013397","journal-title":"Automat Control IEEE Trans"},{"key":"11_CR35","volume-title":"Building large knowledge-based systems","author":"D Lenat","year":"1989","unstructured":"Lenat D, Guha RV (1989) Building large knowledge-based systems. Addison-Wesley, Reading"},{"key":"11_CR36","doi-asserted-by":"crossref","unstructured":"Lim M-H, Gustafson S, Krasnogor N, Ong Y-S (2009) Editorial to the first issue. Memetic Comput 1(1)","DOI":"10.1007\/s12293-009-0007-x"},{"issue":"2","key":"11_CR37","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S Lin","year":"1973","unstructured":"Lin S, Kernighan BW (1973) An effective heuristic algorithm for the traveling salesman problem. Oper Res 21(2): 498\u2013516","journal-title":"Oper Res"},{"issue":"3","key":"11_CR38","doi-asserted-by":"publisher","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":"11_CR39","unstructured":"Merz P, Freisleben B (1997) Genetic local search for the TSP: new results. IEEE Conf Evol Comput"},{"key":"11_CR40","doi-asserted-by":"crossref","unstructured":"Meuth RJ, Wunsch DC II (2008) Divide and conquer evolutionary Tsp solution for vehicle path planning. In: Congress on evolutionary computation (WCCI\u201908)","DOI":"10.1109\/CEC.2008.4630868"},{"issue":"2","key":"11_CR41","doi-asserted-by":"publisher","first-page":"925","DOI":"10.1109\/TSMCB.2003.818432","volume":"34","author":"M Milano","year":"2004","unstructured":"Milano M, Roli A (2004) MAGMA: a multiagent architecture for metaheuristics. Syst Man Cybern Part B IEEE Trans 34(2): 925\u2013941","journal-title":"Syst Man Cybern Part B IEEE Trans"},{"key":"11_CR42","volume-title":"The society of mind","author":"M Minsky","year":"1986","unstructured":"Minsky M (1986) The society of mind. Simon & Schuster Inc, New York"},{"key":"11_CR43","unstructured":"Moscato P (1989) On evolution, search, optimization, genetic algorithms and martial arts: towards memetic algorithms, caltech concurrent computation program, C3P Report, 826"},{"key":"11_CR44","doi-asserted-by":"crossref","unstructured":"Mulder S, Wunsch DC (2003) Million city traveling salesman problem solution by divide and conquer clustering with adaptive resonance neural networks. Neural Netw","DOI":"10.1016\/S0893-6080(03)00130-8"},{"issue":"2","key":"11_CR45","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1109\/TCBB.2007.070202","volume":"4","author":"F Neri","year":"2007","unstructured":"Neri F, Toivanen J, Cascella GL, Ong Y (2007) An adaptive multimeme algorithm for designing HIV multidrug therapies. IEEE ACM Trans Comput Biol Bioinform 4(2): 264","journal-title":"IEEE ACM Trans Comput Biol Bioinform"},{"key":"11_CR46","unstructured":"Nguyen HD, Yoshihara I, Yamamori K, Yasunaga M (2000) Modified edge recombination operators of genetic algorithms for the traveling salesman problem. In: 26th Annual conference of the IEEE industrial electronics society"},{"issue":"1","key":"11_CR47","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1109\/TSMCB.2006.880136","volume":"37","author":"HD Nguyen","year":"2007","unstructured":"Nguyen HD, Yoshihara I, Yamamori K, Yasunaga M (2007) Implementation of an effective hybrid GA for large scale traveling salesman problems. IEEE Trans Syst Man Cybern Part B 37(1): 92\u201399","journal-title":"IEEE Trans Syst Man Cybern Part B"},{"key":"11_CR48","doi-asserted-by":"crossref","unstructured":"Nguyen Q-H, Ong Y-S, Lim M-H (2008) Non-genetic transmission of memes by diffusion. In: 10th Annual conference on genetic and evolutionary computation (GECCO\u201908), Atlanta, GA","DOI":"10.1145\/1389095.1389285"},{"key":"11_CR49","unstructured":"Nguyen QH, Ong YS, Krasnogor N (2007) A study on the design issues of memetic algorithm IEEE congress on evolutionary computation singapore. IEEE 2390\u20132397"},{"key":"11_CR50","unstructured":"Norman MG, Moscato P (1989) A competitive and cooperative approach to comple combinatorial search, caltech concurrent computation program, C3P Report 790"},{"key":"11_CR51","unstructured":"O\u2019Neill M, Ryan C (1999) Automatic generation of high level functions using evolutionary algorithms. In: 1st International workshop on soft computing applied to software engineering. Limerick University Press, Limerick"},{"issue":"4","key":"11_CR52","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1109\/4235.942529","volume":"5","author":"M O\u2019Neill","year":"2001","unstructured":"O\u2019Neill M, Ryan C (2001) Grammatical evolution. IEEE Trans Evol Comput 5(4): 349\u2013358","journal-title":"IEEE Trans Evol Comput"},{"key":"11_CR53","doi-asserted-by":"crossref","unstructured":"Ong Y-S, Lim M-H, Zhu N, Wong K-W (2006) Classification of adaptive memetic algorithms: a comparative study. IEEE Trans Syst Man Cybern Part B 36(1)","DOI":"10.1109\/TSMCB.2005.856143"},{"issue":"2","key":"11_CR54","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1109\/TEVC.2003.819944","volume":"8","author":"YS Ong","year":"2004","unstructured":"Ong YS, Keane AJ (2004) Meta-Lamarckian learning in memetic algorithms. IEEE Trans Evol Comput 8(2): 99\u2013110","journal-title":"IEEE Trans Evol Comput"},{"issue":"4","key":"11_CR55","doi-asserted-by":"publisher","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. AIAA J 41(4): 687\u2013696","journal-title":"AIAA J"},{"issue":"4","key":"11_CR56","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1109\/TEVC.2005.859464","volume":"10","author":"YS Ong","year":"2006","unstructured":"Ong YS, Nair PB, Lum KY (2006) Max-Min surrogate-assisted evolutionary algorithm for robust aerodynamic design. IEEE Trans Evol Comput 10(4): 392\u2013404","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"11_CR57","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1023\/A:1011552313821","volume":"2","author":"R Poli","year":"2001","unstructured":"Poli R (2001) Exact schema theory for genetic programming and variable-length genetic algorithms with one-point crossover. Genet Program Evolvable Mach 2(2): 123\u2013163","journal-title":"Genet Program Evolvable Mach"},{"key":"11_CR58","volume-title":"Genetic programming exploratory power and the discovery of functions. Conference on Evolutionary Programming","author":"JP Rosca","year":"1995","unstructured":"Rosca JP (1995) Genetic programming exploratory power and the discovery of functions. Conference on Evolutionary Programming. MIT Press, Cambridge"},{"key":"11_CR59","volume-title":"Schemata: the building blocks of cognition. Theoretical issues in reading and comprehension","author":"DE Rumelhart","year":"1980","unstructured":"Rumelhart DE (1980) Schemata: the building blocks of cognition. Theoretical issues in reading and comprehension. B. B. R.J. Sprio & W.F. Brewer, Erlbaum"},{"key":"11_CR60","unstructured":"Shahaf D, Amir E (2007) Towards a theory of AI completeness. In: 8th Interational symposium on logic formalizations of commonsense reasoning"},{"key":"11_CR61","unstructured":"Smart W, Zhang M (2004) Applying online gradient descent search to genetic programming for object recognition. In: Second workshop on Australasian information security, data mining and web intelligence, and software internationalisation, Dunedin, New Zealand"},{"issue":"1","key":"11_CR62","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1109\/TSMCB.2006.883273","volume":"37","author":"JE Smith","year":"2007","unstructured":"Smith JE (2007) Coevolving memetic algorithms: a review and progress report. IEEE Trans Syst Man Cybern Part B 37(1): 6\u201317","journal-title":"IEEE Trans Syst Man Cybern Part B"},{"issue":"9","key":"11_CR63","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1007\/s00500-006-0139-6","volume":"11","author":"J Tang","year":"2007","unstructured":"Tang J, Lim MH, Ong YS (2007) Diversity-adaptive parallel memetic algorithm for solving large scale combinatorial optimization problems. Soft Comput 11(9): 873\u2013888","journal-title":"Soft Comput"},{"key":"11_CR64","unstructured":"Topchy A, Punsch WF (2001) Faster genetic programming based on local gradient search of numeric leaf values. Genet Evol Comput Conf"},{"key":"11_CR65","unstructured":"Tsai H-K, Yang J-M, Kao C-Y (2002) Solving traveling salesman problems by combining global and local search mechanisms. Conf Evol Comput"},{"issue":"4","key":"11_CR66","doi-asserted-by":"publisher","first-page":"1718","DOI":"10.1109\/TSMCB.2004.828283","volume":"34","author":"H-K Tsai","year":"2004","unstructured":"Tsai H-K, Yang J-M, Kao C-Y (2004) An evolutionary algorithm for large traveling salesman problems. IEEE Trans Syst Man Cybern Part B 34(4): 1718\u20131729","journal-title":"IEEE Trans Syst Man Cybern Part B"},{"key":"11_CR67","unstructured":"Ullah ASSMB, Sarker RA, Cornforth D, Lokan C (2007) An agent-based memetic algorithm (AMA) for solving constrained optimazation problems. In: IEEE congress on evolutionary computation, Singapore"},{"key":"11_CR68","doi-asserted-by":"crossref","unstructured":"Wang H, Wang D, Yang S (2009) A memetic algorithm with adaptive hill climbing strategy for dynamic optimization problems. Soft Comput","DOI":"10.1007\/s00500-008-0347-3"},{"key":"11_CR69","unstructured":"Wang L, Maciejewski AA, Seigel HJ, Roychowdhury VP (1998) A comparitive study of five parallel genetic algorithms using the traveling salesman problem. In: First merged international conference and symposium on parallel and distributed processing"},{"key":"11_CR70","unstructured":"Wills LM, Kolodner J (1994) Towards more creative case-based design systems. In: Proceedings of the twelfth annual national conference on artificial intelligence (AAAI-94):50\u201355"},{"issue":"1","key":"11_CR71","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"DH Woldpert","year":"1997","unstructured":"Woldpert DH, Macready WG (1997) No free lunch theorms for optimization. IEEE Trans Evol Comput 1(1): 67\u201382","journal-title":"IEEE Trans Evol Comput"},{"key":"11_CR72","unstructured":"Wunsch DC, Mulder S (2003) Using adaptive resonance theory and local optimization to divide and conquer large scale traveling salesman problems. Int Joint Conf Neural Netw"},{"issue":"9","key":"11_CR73","doi-asserted-by":"publisher","first-page":"1423","DOI":"10.1109\/5.784219","volume":"87","author":"Y Xin","year":"1999","unstructured":"Xin Y (1999) Evolving artificial neural networks. Proc IEEE 87(9): 1423\u20131447","journal-title":"Proc IEEE"},{"issue":"3","key":"11_CR74","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1109\/TNN.2005.845141","volume":"16","author":"R Xu","year":"2005","unstructured":"Xu R, Wunsch D II (2005) Survey of clustering algorithms. Neural Netw IEEE Trans 16(3): 645\u2013678","journal-title":"Neural Netw IEEE Trans"}],"container-title":["Memetic Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-009-0011-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12293-009-0011-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-009-0011-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-009-0011-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T00:18:28Z","timestamp":1710289108000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12293-009-0011-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,4,29]]},"references-count":74,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2009,6]]}},"alternative-id":["11"],"URL":"https:\/\/doi.org\/10.1007\/s12293-009-0011-1","relation":{},"ISSN":["1865-9284","1865-9292"],"issn-type":[{"value":"1865-9284","type":"print"},{"value":"1865-9292","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,4,29]]}}}