{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T21:35:58Z","timestamp":1771018558323,"version":"3.50.1"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2015,9,21]],"date-time":"2015-09-21T00:00:00Z","timestamp":1442793600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Sci. China Inf. Sci."],"published-print":{"date-parts":[[2015,11]]},"DOI":"10.1007\/s11432-015-5382-y","type":"journal-article","created":{"date-parts":[[2015,9,22]],"date-time":"2015-09-22T12:44:44Z","timestamp":1442925884000},"page":"1-17","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Variable solution structure can be helpful in evolutionary optimization","\u6f14\u5316\u4f18\u5316\u4e2d\u53ef\u53d8\u89e3\u7ed3\u6784\u7684\u6548\u7528\u5206\u6790"],"prefix":"10.1007","volume":"58","author":[{"given":"Chao","family":"Qian","sequence":"first","affiliation":[]},{"given":"Yang","family":"Yu","sequence":"additional","affiliation":[]},{"given":"Zhi-Hua","family":"Zhou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,9,21]]},"reference":[{"key":"5382_CR1","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195099713.001.0001","volume-title":"Evolutionary Algorithms in Theory and Practice: Evolution Strategies, Evolutionary Programming, Genetic Algorithms","author":"T B\u00e4ck","year":"1996","unstructured":"B\u00e4ck T. Evolutionary Algorithms in Theory and Practice: Evolution Strategies, Evolutionary Programming, Genetic Algorithms. Oxford: Oxford University Press, 1996"},{"key":"5382_CR2","volume-title":"Genetic Algorithms in Search, Optimization, and Machine Learning","author":"D E Goldberg","year":"1989","unstructured":"Goldberg D E. Genetic Algorithms in Search, Optimization, and Machine Learning. Boston: Addison-Wesley, 1989"},{"key":"5382_CR3","first-page":"87","volume":"4","author":"J R Koza","year":"1994","unstructured":"Koza J R. Genetic programming as a means for programming computers by natural selection. Stat Comput, 1994, 4: 87\u2013112","journal-title":"Stat Comput"},{"key":"5382_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-32444-5_2","volume-title":"Representations for Genetic and Evolutionary Algorithms","author":"F Rothlauf","year":"2006","unstructured":"Rothlauf F. Representations for Genetic and Evolutionary Algorithms. Berlin: Springer, 2006"},{"key":"5382_CR5","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1109\/TEVC.2006.871252","volume":"10","author":"N X Hoai","year":"2006","unstructured":"Hoai N X, McKay R I, Essam D. Representation and structural difficulty in genetic programming. IEEE Trans Evol Comput, 2006, 10: 157\u2013166","journal-title":"IEEE Trans Evol Comput"},{"key":"5382_CR6","volume-title":"A Field Guide to Genetic Programming","author":"R Poli","year":"2008","unstructured":"Poli R, Langdon W B, McPhee N F. A Field Guide to Genetic Programming. Barking: Lulu Enterprises, 2008"},{"key":"5382_CR7","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/s10710-010-9112-3","volume":"11","author":"J R Koza","year":"2010","unstructured":"Koza J R. Human-competitive results produced by genetic programming. Genet Program Evol Mach, 2010, 11: 251\u2013284","journal-title":"Genet Program Evol Mach"},{"key":"5382_CR8","doi-asserted-by":"crossref","unstructured":"Khan S, Baig A R, Ali A, et al. Unordered rule discovery using Ant Colony Optimization. Sci China Inf Sci, 2014, 57: 092116","DOI":"10.1007\/s11432-014-5133-5"},{"key":"5382_CR9","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/s11704-014-3008-y","volume":"8","author":"W Guo","year":"2014","unstructured":"Guo W, Liu G, Chen G, et al. A hybrid multi-objective PSO algorithm with local search strategy for VLSI partitioning. Front Comput Sci, 2014, 8: 203\u2013216","journal-title":"Front Comput Sci"},{"key":"5382_CR10","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/s10710-010-9110-5","volume":"11","author":"R Poli","year":"2010","unstructured":"Poli R, Vanneschi L, Langdon W B, et al. Theoretical results in genetic programming: the next ten years? Genet Program Evol Mach, 2010, 11: 285\u2013320","journal-title":"Genet Program Evol Mach"},{"key":"5382_CR11","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1145\/1967654.1967661","volume-title":"Proceedings of International Workshop on Foundations of Genetic Algorithms","author":"G Durrett","year":"2011","unstructured":"Durrett G, Neumann F, O\u2019Reilly U M. Computational complexity analysis of simple genetic programming on two problems modeling isolated program semantics. In: Proceedings of International Workshop on Foundations of Genetic Algorithms, Schwarzenberg, 2011. 69\u201380"},{"key":"5382_CR12","first-page":"125","volume-title":"Proceedings of IEEE Congress on Evolutionary Computation","author":"M Wagner","year":"2014","unstructured":"Wagner M, Neumann F. Single- and multi-objective genetic programming: new runtime results for sorting. In: Proceedings of IEEE Congress on Evolutionary Computation, Beijing, 2014. 125\u2013132"},{"key":"5382_CR13","first-page":"1333","volume-title":"Proceedings of ACM Conference on Genetic and Evolutionary Computation","author":"T K\u00f6tzing","year":"2012","unstructured":"K\u00f6tzing T, Sutton A M, Neumann F, et al. The Max problem revisited: the importance of mutation in genetic programming. In: Proceedings of ACM Conference on Genetic and Evolutionary Computation, Philadelphia, 2012. 1333\u20131340"},{"key":"5382_CR14","first-page":"161","volume-title":"Proceedings of International Workshop on Foundations of Genetic Algorithms","author":"A Nguyen","year":"2013","unstructured":"Nguyen A, Urli T, Wagner M. Single- and multi-objective genetic programming: new bounds for weighted order and majority. In: Proceedings of International Workshop on Foundations of Genetic Algorithms, Adelaide, 2013. 161\u2013172"},{"key":"5382_CR15","first-page":"2091","volume-title":"Proceedings of ACM Conference on Genetic and Evolutionary Computation","author":"T K\u00f6tzing","year":"2011","unstructured":"K\u00f6tzing T, Neumann F, Sp\u00f6hel R. PAC learning and genetic programming. In: Proceedings of ACM Conference on Genetic and Evolutionary Computation, Dublin, 2011. 2091\u20132096"},{"key":"5382_CR16","first-page":"799","volume-title":"Proceedings of ACM Conference on Genetic and Evolutionary Computation","author":"F Neumann","year":"2012","unstructured":"Neumann F. Computational complexity analysis of multi-objective genetic programming. In: Proceedings of ACM Conference on Genetic and Evolutionary Computation, Philadelphia, 2012. 799\u2013806"},{"key":"5382_CR17","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/978-3-642-32937-1_14","volume-title":"Proceedings of International Conference on Parallel Problem Solving from Nature","author":"M Wagner","year":"2012","unstructured":"Wagner M, Neumann F. Parsimony pressure versus multi-objective optimization for variable length representations. In: Proceedings of International Conference on Parallel Problem Solving from Nature, Taormina, 2012. 133\u2013142"},{"key":"5382_CR18","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/S0004-3702(01)00058-3","volume":"127","author":"J He","year":"2001","unstructured":"He J, Yao X. Drift analysis and average time complexity of evolutionary algorithms. Artif Intell, 2001, 127: 57\u201385","journal-title":"Artif Intell"},{"key":"5382_CR19","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/S0304-3975(01)00182-7","volume":"276","author":"S Droste","year":"2002","unstructured":"Droste S, Jansen T, Wegener I. On the analysis of the (1+1) evolutionary algorithm. Theor Comput Sci, 2002, 276: 51\u201381","journal-title":"Theor Comput Sci"},{"key":"5382_CR20","doi-asserted-by":"crossref","DOI":"10.1142\/7438","volume-title":"Theory of Randomized Search Heuristics: Foundations and Recent Developments","author":"A Auger","year":"2011","unstructured":"Auger A, Doerr B. Theory of Randomized Search Heuristics: Foundations and Recent Developments. Singapore: World Scientific, 2011"},{"key":"5382_CR21","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-16544-3","volume-title":"Bioinspired Computation in Combinatorial Optimization: Algorithms and Their Computational Complexity","author":"F Neumann","year":"2010","unstructured":"Neumann F, Witt C. Bioinspired Computation in Combinatorial Optimization: Algorithms and Their Computational Complexity. Berlin: Springer-Verlag, 2010"},{"key":"5382_CR22","first-page":"415","volume-title":"Proceedings of Annual Symposium on Theoretical Aspects of Computer Science","author":"O Giel","year":"2003","unstructured":"Giel O, Wegener I. Evolutionary algorithms and the maximum matching problem. In: Proceedings of Annual Symposium on Theoretical Aspects of Computer Science, Berlin, 2003. 415\u2013426"},{"key":"5382_CR23","first-page":"539","volume-title":"Proceedings of ACM Conference on Genetic and Evolutionary Computation","author":"O Giel","year":"2006","unstructured":"Giel O, Wegener I. Maximum cardinality matchings on trees by randomized local search. In: Proceedings of ACM Conference on Genetic and Evolutionary Computation, Seattle, 2006. 539\u2013546"},{"key":"5382_CR24","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1016\/j.tcs.2006.11.002","volume":"378","author":"F Neumann","year":"2007","unstructured":"Neumann F, Wegener I. Randomized local search, evolutionary algorithms, and the minimum spanning tree problem. Theor Comput Sci, 2007, 378: 32\u201340","journal-title":"Theor Comput Sci"},{"key":"5382_CR25","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1007\/s00453-012-9622-x","volume":"64","author":"B Doerr","year":"2012","unstructured":"Doerr B, Johannsen D, Winzen C. Multiplicative drift analysis. Algorithmica, 2012, 64: 673\u2013697","journal-title":"Algorithmica"},{"key":"5382_CR26","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1109\/TEVC.2006.871251","volume":"10","author":"G R Raidl","year":"2006","unstructured":"Raidl G R, Koller G, Julstrom B A. Biased mutation operators for subgraph-selection problems. IEEE Trans Evol Comput, 2006, 10: 145\u2013156","journal-title":"IEEE Trans Evol Comput"},{"key":"5382_CR27","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/s11047-006-9004-x","volume":"5","author":"F Neumann","year":"2006","unstructured":"Neumann F, Wegener I. Minimum spanning trees made easier via multi-objective optimization. Nat Comput, 2006, 5: 305\u2013319","journal-title":"Nat Comput"},{"key":"5382_CR28","doi-asserted-by":"crossref","first-page":"1809","DOI":"10.1016\/j.artint.2008.07.001","volume":"172","author":"Y Yu","year":"2008","unstructured":"Yu Y, Zhou Z-H. A new approach to estimating the expected first hitting time of evolutionary algorithms. Artif Intell, 2008, 172: 1809\u20131832","journal-title":"Artif Intell"},{"key":"5382_CR29","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1109\/TEVC.2004.823470","volume":"8","author":"M Laumanns","year":"2004","unstructured":"Laumanns M, Thiele L, Zitzler E. Running time analysis of multiobjective evolutionary algorithms on pseudo-Boolean functions. IEEE Trans Evol Comput, 2004, 8: 170\u2013182","journal-title":"IEEE Trans Evol Comput"},{"key":"5382_CR30","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/j.artint.2013.09.002","volume":"204","author":"C Qian","year":"2013","unstructured":"Qian C, Yu Y, Zhou Z-H. An analysis on recombination in multi-objective evolutionary optimization. Artif Intell, 2013, 204: 99\u2013119","journal-title":"Artif Intell"},{"key":"5382_CR31","volume-title":"Evolutionary algorithms and the maximum matching problem","author":"O Giel","year":"2002","unstructured":"Giel O, Wegener I. Evolutionary algorithms and the maximum matching problem. University of Dortmund Technical Report CI 142\/02. 2002"}],"container-title":["Science China Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-015-5382-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11432-015-5382-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-015-5382-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,22]],"date-time":"2022-05-22T03:40:48Z","timestamp":1653190848000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11432-015-5382-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9,21]]},"references-count":31,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2015,11]]}},"alternative-id":["5382"],"URL":"https:\/\/doi.org\/10.1007\/s11432-015-5382-y","relation":{},"ISSN":["1674-733X","1869-1919"],"issn-type":[{"value":"1674-733X","type":"print"},{"value":"1869-1919","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,9,21]]}}}