{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T01:23:34Z","timestamp":1783041814681,"version":"3.54.6"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2007,3,1]],"date-time":"2007-03-01T00:00:00Z","timestamp":1172707200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Artif Intell Rev"],"published-print":{"date-parts":[[2007,3]]},"DOI":"10.1007\/s10462-008-9093-2","type":"journal-article","created":{"date-parts":[[2008,10,23]],"date-time":"2008-10-23T12:06:31Z","timestamp":1224763591000},"page":"149-163","source":"Crossref","is-referenced-by-count":10,"title":["A Comparison of three evolutionary strategies for multiobjective genetic programming"],"prefix":"10.1007","volume":"27","author":[{"given":"Yang","family":"Zhang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Peter","family":"Rockett","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2008,10,24]]},"reference":[{"key":"9093_CR1","doi-asserted-by":"crossref","first-page":"1885","DOI":"10.1162\/089976699300016007","volume":"11","author":"E Alpaydin","year":"1999","unstructured":"Alpaydin E (1999) Combined 5 \u00d7 2 cv F-test for comparing supervised classification learning algorithms. Neural Comput 11: 1885\u20131892","journal-title":"Neural Comput"},{"key":"9093_CR2","doi-asserted-by":"crossref","unstructured":"Bleuler S, Brack M, Theile L, Zitzler E (2001) Multiobjective genetic programming: reducing bloat using SPEA2. In: Proceedings of congress on evolutionary computation. Seoul, Korea","DOI":"10.1109\/CEC.2001.934438"},{"key":"9093_CR3","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1109\/4235.661552","volume":"1","author":"K Chellapilla","year":"1997","unstructured":"Chellapilla K (1997) Evolving computer programs without subtree crossover. IEEE Trans Evol Comput 1: 209\u2013216","journal-title":"IEEE Trans Evol Comput"},{"key":"9093_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-5184-0","volume-title":"Evolutionary algorithms for solving multiobjective problems","author":"CAC Coello","year":"2002","unstructured":"Coello CAC, van Veldhuizen DA, Lamont GB (2002) Evolutionary algorithms for solving multiobjective problems. Kluwer, New York"},{"key":"9093_CR5","doi-asserted-by":"crossref","unstructured":"Daida JM, Li H, Tang R, Hilss AM (2003) What makes a problem GP-hard? Validating a hypothesis of structural causes. In: Lecture notes in computer science, vol 2724. Springer, Heidelberg, pp 1665\u20131677","DOI":"10.1007\/3-540-45110-2_60"},{"key":"9093_CR6","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2003","unstructured":"Deb K, Pratap A, Agarawal S, Meyarivan T (2003) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6: 182\u2013197","journal-title":"IEEE Trans Evol Comput"},{"key":"9093_CR7","doi-asserted-by":"crossref","first-page":"1895","DOI":"10.1162\/089976698300017197","volume":"10","author":"T Dietterich","year":"1998","unstructured":"Dietterich T (1998) Approximate statistical tests for comparing supervised classification learning algorithms. Neural Comput 10: 1895\u20131923","journal-title":"Neural Comput"},{"key":"9093_CR8","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1023\/A:1010070616149","volume":"2","author":"A Ek\u00e1rt","year":"2001","unstructured":"Ek\u00e1rt A, N\u00e9meth SZ (2001) Selection based on the Pareto nondomination criterion for controlling code growth in genetic programming. Genet Program Evolvable Mach 2: 61\u201373","journal-title":"Genet Program Evolvable Mach"},{"key":"9093_CR9","doi-asserted-by":"crossref","unstructured":"Ito T, Iba H, Sato S (1998) Non-destructive depth-dependent crossover for genetic programming. In: First European Workshop on Genetic Programming","DOI":"10.1007\/BFb0055929"},{"key":"9093_CR10","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1016\/S0377-2217(01)00104-7","volume":"137","author":"A Jaszkiewicz","year":"2002","unstructured":"Jaszkiewicz A (2002) Genetic local search for multi-objective combinatorial optimization. Eur J Oper Res 137: 50\u201371","journal-title":"Eur J Oper Res"},{"key":"9093_CR11","volume-title":"Genetic programming II: automatic discovery of reusable programs","author":"JR Koza","year":"1994","unstructured":"Koza JR (1994) Genetic programming II: automatic discovery of reusable programs. MIT, Cambridge"},{"key":"9093_CR12","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1162\/106365602760234117","volume":"10","author":"R Kumar","year":"2002","unstructured":"Kumar R, Rockett PI (2002) Improved sampling of the Pareto-front in multiobjective genetic optimizations by steady-state evolution: a Pareto converging genetic algorithm. Evol Comput 10: 283\u2013314","journal-title":"Evol Comput"},{"key":"9093_CR13","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1023\/A:1007608224229","volume":"40","author":"S Lim T","year":"2000","unstructured":"Lim T S, Loh W Y, Shih Y S (2000) A comparison of prediction accuracy, complexity, and training time of thirty-three old and new classification algorithms. Mach Learn 40: 203\u2013228","journal-title":"Mach Learn"},{"key":"9093_CR14","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1109\/TSMCA.2004.826299","volume":"34","author":"K Rodr\u00edguez-V\u00e1zquez","year":"2004","unstructured":"Rodr\u00edguez-V\u00e1zquez K, Fonseca CM, Fleming PJ (2004) Identifying the structure of non-linear dynamic systems using multiobjective genetic programming. IEEE Trans Syst, Man Cybernetics\u2014Part A: Syst Hum 34: 531\u2013547","journal-title":"IEEE Trans Syst, Man Cybernetics\u2014Part A: Syst Hum"},{"key":"9093_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-3264-1","volume-title":"The Nature of statistical learning theory","author":"VN Vapnik","year":"2000","unstructured":"Vapnik VN (2000) The Nature of statistical learning theory. Springer, New York"},{"key":"9093_CR16","unstructured":"Zhang Y (2006) Multiobjective genetic programming optimal search for feature extraction. PhD Thesis, University of Sheffield"},{"key":"9093_CR17","doi-asserted-by":"crossref","unstructured":"Zhang Y, Rockett PI (2005), Evolving optimal feature extraction using multi-objective genetic programming: a methodology and preliminary study on edge detection. In: GECCO 2005. Washington, DC","DOI":"10.1145\/1068009.1068143"},{"key":"9093_CR18","volume-title":"Multi-objective machine learning","author":"Y Zhang","year":"2006","unstructured":"Zhang Y, Rockett PI (2006) Feature extraction using multi-objective genetic programming. In: Jin Y (eds) (ed) Multi-objective machine learning.. Springer, Heidelberg"},{"key":"9093_CR19","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1109\/4235.797969","volume":"3","author":"E Zitzler","year":"1999","unstructured":"Zitzler E, Thiele L (1999) Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach. IEEE Trans Evol Comput 3: 257\u2013271","journal-title":"IEEE Trans Evol Comput"},{"key":"9093_CR20","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1162\/106365600568202","volume":"8","author":"E Zitzler","year":"2000","unstructured":"Zitzler E, Deb K, Thiele L (2000) Comparison of multiobjective evolutionary algorithms: empirical results. Evol Comput 8: 173\u2013195","journal-title":"Evol Comput"},{"key":"9093_CR21","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1109\/TEVC.2003.810758","volume":"7","author":"E Zitzler","year":"2003","unstructured":"Zitzler E, Thiele L, Laumanns M, Fonseca CM, da Fonseca VG (2003) Performance assessment of multiobjective optimizers: an analysis and review. IEEE Trans on Evol Comput 7: 117\u2013132","journal-title":"IEEE Trans on Evol Comput"}],"container-title":["Artificial Intelligence Review"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10462-008-9093-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10462-008-9093-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10462-008-9093-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T17:45:07Z","timestamp":1559151907000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10462-008-9093-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,3]]},"references-count":21,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2007,3]]}},"alternative-id":["9093"],"URL":"https:\/\/doi.org\/10.1007\/s10462-008-9093-2","relation":{},"ISSN":["0269-2821","1573-7462"],"issn-type":[{"value":"0269-2821","type":"print"},{"value":"1573-7462","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,3]]}}}