{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T18:00:56Z","timestamp":1772042456790,"version":"3.50.1"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2007,7,31]],"date-time":"2007-07-31T00:00:00Z","timestamp":1185840000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Genet Program Evolvable Mach"],"published-print":{"date-parts":[[2007,9]]},"DOI":"10.1007\/s10710-007-9030-1","type":"journal-article","created":{"date-parts":[[2007,7,30]],"date-time":"2007-07-30T16:39:39Z","timestamp":1185813579000},"page":"221-237","source":"Crossref","is-referenced-by-count":17,"title":["A note on the variance of rank-based selection strategies for genetic algorithms and genetic programming"],"prefix":"10.1007","volume":"8","author":[{"given":"Artem","family":"Sokolov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Darrell","family":"Whitley","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andre\u2019","family":"da Motta Salles Barreto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,7,31]]},"reference":[{"key":"9030_CR1","unstructured":"Anderson, C.W.: Learning and Problem Solving with Multilayer Connectionist Systems. PhD thesis, Computer and Information Science, University of Massachusetts (1986)"},{"key":"9030_CR2","unstructured":"Blickle, T., Thiele, L.: A comparison of selection schemes used in genetic algorithms. Technical Report 11, Swiss Federal Institute of Technology (ETH), Computer Engineering and Communication Networks Lab, Zurich, Switzerland, December (1995)"},{"issue":"4","key":"9030_CR3","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1162\/evco.1996.4.4.361","volume":"4","author":"T. Blickle","year":"1997","unstructured":"Blickle, T., Thiele, L.: A comparison of selection schemes used in evolutionary algorithms. Evolutionary Computation, 4(4), 361\u2013394, (1997)","journal-title":"Evol. Comput."},{"key":"9030_CR4","unstructured":"Fogel, D.B.: Evolving Artificial Intelligence. PhD thesis, University of California, San Diego, San Diego, CA (1992)"},{"key":"9030_CR5","doi-asserted-by":"crossref","unstructured":"Goldberg, D., Deb, K.: A comparative analysis of selection schemes used in genetic algorithms. In: G.J.E. Rawlins (ed.) Foundations of Genetic Algorithms, pp. 69\u201393. San Mateo, California (1991) Morgan Kaufmann","DOI":"10.1016\/B978-0-08-050684-5.50008-2"},{"key":"9030_CR6","doi-asserted-by":"crossref","unstructured":"Julstrom, B.A., Raidl, G.R. Weight-biased edge-crossover in evolutionary algorithms for two graph problems. In Proceedings of the 2001 ACM Symposium on Applied Computing, pp. 321\u2013326 (2001)","DOI":"10.1145\/372202.372353"},{"key":"9030_CR7","volume-title":"Genetic Programming: On the Programming of Computers by Means of Natural Selection","author":"J.R. Koza","year":"1992","unstructured":"Koza, J.R.: Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press Cambridge, MA (1992)"},{"key":"9030_CR8","volume-title":"Genetic programming II: automatic discovery of reusable programs","author":"John R. Koza","year":"1994","unstructured":"Koza John R.: Genetic programming II: automatic discovery of reusable programs. MIT Press, Cambridge, MA, USA (1994)"},{"issue":"4","key":"9030_CR9","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1162\/106365602760972776","volume":"10","author":"T. Motoki","year":"2002","unstructured":"Motoki, T.: Calculating the expected loss of diversity of selection schemes. Evol Comput 10(4), 397\u2013422 (2002)","journal-title":"Evol Comput"},{"key":"9030_CR10","doi-asserted-by":"crossref","unstructured":"Poli, R.: Tournament selection, iterated coupon-collection problem, and backward-chaining evolutionary algorithms. In Foundations of Genetic Algorithms, pp. 132\u2013155. Springer (2005)","DOI":"10.1007\/11513575_8"},{"key":"9030_CR11","volume-title":"The Traveling Salesman: Computational Solutions for TSP Applications","author":"G. Reinelt","year":"1994","unstructured":"Reinelt, G.: The Traveling Salesman: Computational Solutions for TSP Applications. Springer, Berlin (1994)"},{"key":"9030_CR12","volume-title":"Evolution and Optimum Seeking","author":"H.-P. Schwefel","year":"1995","unstructured":"Schwefel, H.-P.: Evolution and Optimum Seeking. Wiley, New York (1995)"},{"key":"9030_CR13","doi-asserted-by":"crossref","unstructured":"Sokolov, A., Whitley, D.: Unbiased tournament selection. In Proceedings of the 7th Genetic and Evolutionary Computation Conference, pp. 1131\u20131138 (2005)","DOI":"10.1145\/1068009.1068198"},{"key":"9030_CR14","unstructured":"Suh, J.Y., Van Gucht, D.: Distributed Genetic Algorithms. Technical report, Indiana University, Bloomington, Indiana (1987)"},{"key":"9030_CR15","unstructured":"Syswerda, G.: Uniform Crossover in Genetic Algorithms. In: Schaffer, J.D. (ed.) Proceedings of The Third International Conference on Genetic Algorithms. Morgan Kaufmann (1989)"},{"key":"9030_CR16","unstructured":"Whitley, D.: The genitor algorithm and selection pressure: Why rank-based allocation of reproductive trials is best. In: Proceedings of The Third International Conference on Genetic Algorithms, pp. 116\u2013121. San Mateo, California, ISA (1989) Morgan Kaufmann Publishers"},{"issue":"2\u20133","key":"9030_CR17","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1023\/A:1022674030396","volume":"13","author":"D. Whitley","year":"1993","unstructured":"Whitley, D., Dominic, S., Das, R., Anderson, C.W.: Genetic reinforcement learning for neurocontrol problems. Mach. Learn. 13(2\u20133),259\u2013284 (1993)","journal-title":"Mach. Learn."},{"key":"9030_CR18","unstructured":"Whitley, D., Kauth, J.: GENITOR: A Different Genetic Algorithm. In: Proceedings of the 1988 Rocky Mountain Conference on Artificial Intelligence (1988)"},{"key":"9030_CR19","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/0004-3702(95)00124-7","volume":"85","author":"D. Whitley","year":"1996","unstructured":"Whitley, D.., Rana, S., Dzubera, J., Mathias, K.E.: Evaluating evolutionary algorithms. Arti. Intelligence 85, 245\u2013276 (1996)","journal-title":"Arti. Intelligence"}],"container-title":["Genetic Programming and Evolvable Machines"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10710-007-9030-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10710-007-9030-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10710-007-9030-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T18:22:04Z","timestamp":1559240524000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10710-007-9030-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,7,31]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2007,9]]}},"alternative-id":["9030"],"URL":"https:\/\/doi.org\/10.1007\/s10710-007-9030-1","relation":{},"ISSN":["1389-2576","1573-7632"],"issn-type":[{"value":"1389-2576","type":"print"},{"value":"1573-7632","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,7,31]]}}}