{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,12]],"date-time":"2025-04-12T05:09:09Z","timestamp":1744434549938},"reference-count":19,"publisher":"Elsevier","license":[{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1016\/b978-1-55860-356-1.50009-1","type":"book-chapter","created":{"date-parts":[[2014,6,30]],"date-time":"2014-06-30T04:25:25Z","timestamp":1404102325000},"page":"91-102","source":"Crossref","is-referenced-by-count":4,"title":["Order Statistics for Convergence Velocity Analysis of Simplified Evolutionary Algorithms"],"prefix":"10.1016","author":[{"given":"Thomas","family":"B\u00e4ck","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/B978-1-55860-356-1.50009-1_bib1","series-title":"A First Course in Order Statistics","author":"Arnold","year":"1992"},{"key":"10.1016\/B978-1-55860-356-1.50009-1_bib2","unstructured":"Th. B\u00e4ck. The interaction of mutation rate, selection, and self-adaptation within a genetic algorithm. In M\u00e4nner and Manderick [11], pages 85\u201394."},{"key":"10.1016\/B978-1-55860-356-1.50009-1_bib3","unstructured":"Th. B\u00e4ck. Optimal mutation rates in genetic search. In Forrest [9], pages 2\u20139."},{"key":"10.1016\/B978-1-55860-356-1.50009-1_bib4","unstructured":"Th. B\u00e4ck, G. Rudolph, and H.-P. Schwefel. Evolutionary programming and evolution strategies: Similarities and differences. In D. B. Fogel and W. Atmar, editors, Proceedings of the 2nd Annual Conference on Evolutionary Programming, pages 11\u201322. Evolutionary Programming Society, San Diego, CA, 1993."},{"issue":"1","key":"10.1016\/B978-1-55860-356-1.50009-1_bib5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1162\/evco.1993.1.1.1","article-title":"An overview of evolutionary algorithms for parameter optimization","volume":"1","author":"B\u00e4ck","year":"1993","journal-title":"Evolutionary Computation"},{"issue":"2","key":"10.1016\/B978-1-55860-356-1.50009-1_bib6","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1162\/evco.1993.1.2.165","article-title":"Towards a theory of evolution strategies: Some asymptotical results from the (1+, \u03bb)-theory","volume":"1","author":"Beyer","year":"1993","journal-title":"Evolutionary Computation"},{"key":"10.1016\/B978-1-55860-356-1.50009-1_bib7","series-title":"Order Statistics","author":"David","year":"1981"},{"key":"10.1016\/B978-1-55860-356-1.50009-1_bib8","series-title":"An Introduction to Probability Theory and Its Applications","author":"Feller","year":"1971"},{"key":"10.1016\/B978-1-55860-356-1.50009-1_bib9","unstructured":"S. Forrest, editor. Proceedings of the 5th International Conference on Genetic Algorithms. Morgan Kaufmann Publishers, San Mateo, CA, 1993."},{"issue":"1, 2","key":"10.1016\/B978-1-55860-356-1.50009-1_bib10","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1093\/biomet\/48.1-2.151","article-title":"Expected values of normal order statistics","volume":"48","author":"Harter","year":"1961","journal-title":"Biometrika"},{"key":"10.1016\/B978-1-55860-356-1.50009-1_bib11","series-title":"Parallel Problem Solving from Nature 2","year":"1992"},{"key":"10.1016\/B978-1-55860-356-1.50009-1_bib12","unstructured":"H. M\u00fchlenbein. How genetic algorithms really work: I. mutation and hillclimbing. In M\u00e4nner and Manderick [11], pages 15\u201325."},{"issue":"1","key":"10.1016\/B978-1-55860-356-1.50009-1_bib13","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1162\/evco.1993.1.1.25","article-title":"Predictive models for the breeder genetic algorithm","volume":"1","author":"M\u00fchlenbein","year":"1993","journal-title":"Evolutionary Computation"},{"key":"10.1016\/B978-1-55860-356-1.50009-1_bib14","first-page":"334","article-title":"Selection differentials","volume":"volume 8","author":"Nagaraja","year":"1988"},{"key":"10.1016\/B978-1-55860-356-1.50009-1_bib15","series-title":"Evolutionsstrategie: Optimierung technischer Systeme nach Prinzipien der biologischen Evolution","author":"Rechenberg","year":"1973"},{"key":"10.1016\/B978-1-55860-356-1.50009-1_bib16","series-title":"Synergetics - From Microscopic to Macroscopic Order","first-page":"122","article-title":"The evolution strategy - a mathematical model of Darwinian evolution","author":"Rechenberg","year":"1984"},{"key":"10.1016\/B978-1-55860-356-1.50009-1_bib17","unstructured":"A. Scheel. Beitrag zur Theorie der Evolutionsstrategie. Dissertation, Technische Universit\u00e4t Berlin, 1985."},{"key":"10.1016\/B978-1-55860-356-1.50009-1_bib18","series-title":"Numerical Optimization of Computer Models.","author":"Schwefel","year":"1981"},{"key":"10.1016\/B978-1-55860-356-1.50009-1_bib19","unstructured":"M. Yanagiya. A simple mutation-dependent genetic algorithm. In Forrest [9], page 659."}],"container-title":["Foundations of Genetic Algorithms"],"original-title":[],"link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:B9781558603561500091?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:B9781558603561500091?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,10,2]],"date-time":"2018-10-02T11:53:15Z","timestamp":1538481195000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/B9781558603561500091"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1016\/b978-1-55860-356-1.50009-1","relation":{},"ISSN":["1081-6593"],"issn-type":[{"value":"1081-6593","type":"print"}],"subject":[],"published":{"date-parts":[[1995]]}}}