{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,16]],"date-time":"2025-07-16T13:40:22Z","timestamp":1752673222779},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540406020"},{"type":"electronic","value":"9783540451051"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-45105-6_94","type":"book-chapter","created":{"date-parts":[[2007,8,27]],"date-time":"2007-08-27T16:49:42Z","timestamp":1188233382000},"page":"801-812","source":"Crossref","is-referenced-by-count":25,"title":["Are Multiple Runs of Genetic Algorithms Better than One?"],"prefix":"10.1007","author":[{"given":"Erick","family":"Cant\u00fa-Paz","sequence":"first","affiliation":[]},{"given":"David E.","family":"Goldberg","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,6,18]]},"reference":[{"key":"94_CR1","unstructured":"Tanese, R.: Distributed genetic algorithms. In Schaffer, J.D., ed.: Proceedings of the Third International Conference on Genetic Algorithms, Morgan Kaufmann (1989) 434\u2013439"},{"key":"94_CR2","unstructured":"Shonkwiler, R.: Parallel genetic algorithms. In Forrest, S., ed.: Proceedings of the Fifth International Conference on Genetic Algorithms, Morgan Kaufmann (1993) 199\u2013205"},{"key":"94_CR3","unstructured":"Cant\u00fa-Paz, E., Goldberg, D.E.: Modeling idealized bounding cases of parallel genetic algorithms. In Koza, J., et al., eds.: Proceedings of the Second Annual Genetic Programming Conference, Morgan Kaufmann (1997) 353\u2013361"},{"key":"94_CR4","unstructured":"Fuchs, M.: Large populations are not always the best choice in genetic programming. In Banzhaf, W., et al., eds.: Proceedings of the Genetic and Evolutionary Computation Conference, Morgan Kaufmann (1999) 1033\u20131038"},{"key":"94_CR5","doi-asserted-by":"crossref","unstructured":"Fern\u00e1ndez, F., Tomassini, M., Punch, W., S\u00e1nchez, J.M.: Experimental study of isolated multipopulation genetic programming. In Whitley, D., et al., eds.: Proceedings of the Genetic and Evolutionary Computation Conference, Morgan Kaufmann (2000) 536","DOI":"10.1109\/IECON.2000.972420"},{"key":"94_CR6","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"D. Wolpert","year":"1997","unstructured":"Wolpert, D., Macready, W.: No-free-lunch theorems for optimization. IEEE Transactions on Evolutionary Computation 1 (1997) 67\u201382","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"94_CR7","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1162\/evco.1999.7.3.231","volume":"7","author":"G. Harik","year":"1999","unstructured":"Harik, G., Cant\u00fa-Paz, E., Goldberg, D., Miller, B.L.: The gambler\u2019s ruin problem, genetic algorithms, and the sizing of populations. Evolutionary Computation 7 (1999) 231\u2013253","journal-title":"Evolutionary Computation"},{"key":"94_CR8","first-page":"130","volume-title":"Parallel Problem Solving fron Nature, PPSN III","author":"R. Nakano","year":"1994","unstructured":"Nakano, R., Davidor, Y., Yamada, T.: Optimal population size under constant computation cost. In Davidor, Y., Schwefel, H.P., M\u00e4nner, R., eds.: Parallel Problem Solving fron Nature, PPSN III, Berlin, Springer-Verlag (1994) 130\u2013138"},{"key":"94_CR9","unstructured":"Luke, S.: When short runs beat long runs. In Spector, L. et al., eds.: Proceedings of the Genetic and Evolutionary Computation Conference, Morgan Kaufmann (2001) 74\u201380"},{"key":"94_CR10","first-page":"51","volume":"6","author":"M. Mitchell","year":"1994","unstructured":"Mitchell, M., Holland, J.H., Forrest, S.: When will a genetic algorithm outperform hill climbing? In Advances in Neural Information Processing Systems 6 (1994) 51\u201358","journal-title":"Advances in Neural Information Processing Systems"},{"key":"94_CR11","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1162\/10636560151075130","volume":"9","author":"E. Baum","year":"2001","unstructured":"Baum, E., Boneh, D., Garrett, C.: Where genetic algorithms excel. Evolutionary Computation 9 (2001) 93\u2013124","journal-title":"Evolutionary Computation"},{"key":"94_CR12","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. Addison-Wesley, Reading, MA (1989)"},{"key":"94_CR13","first-page":"333","volume":"6","author":"D.E. Goldberg","year":"1992","unstructured":"Goldberg, D.E., Deb, K., Clark, J.H.: Genetic algorithms, noise, and the sizing of populations. Complex Systems 6 (1992) 333\u2013362","journal-title":"Complex Systems"},{"key":"94_CR14","volume-title":"An Introduction to probability theory and its applications","author":"W. Feller","year":"1966","unstructured":"Feller, W.: An Introduction to probability theory and its applications. 2nd edn. Volume 1. John Wiley and Sons, New York, NY (1966)","edition":"2nd edn."},{"key":"94_CR15","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1007\/3-540-45356-3_67","volume-title":"Parallel Problem Solving from Nature\u2014PPSN VI","author":"S. Dijk van","year":"2000","unstructured":"van Dijk, S., Thierens, D., de Berg, M.: Scalability and efficiency of genetic algorithms for geometrical applications. In Schoenauer, M., et al., eds.: Parallel Problem Solving from Nature\u2014PPSN VI, Berlin, Springer-Verlag (2000) 683\u2013692"},{"key":"94_CR16","volume-title":"A first course in order statistics","author":"B. Arnold","year":"1992","unstructured":"Arnold, B., Balakrishnan, N., Nagaraja, H.N.: A first course in order statistics. John Wiley and Sons, New York, NY (1992)"},{"key":"94_CR17","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1162\/evco.1993.1.1.25","volume":"1","author":"H. M\u00fchlenbein","year":"1993","unstructured":"M\u00fchlenbein, H., Schlierkamp-Voosen, D.: Predictive models for the breeder genetic algorithm: I. Continuous parameter optimization. Evolutionary Computation 1 (1993) 25\u201349","journal-title":"Evolutionary Computation"},{"key":"94_CR18","doi-asserted-by":"crossref","unstructured":"Deb, K., Goldberg, D.E.: Analyzing deception in trap functions. In Whitley, L.D., ed.: Foundations of Genetic Algorithms 2, Morgan Kaufmann (1993) 93\u2013108","DOI":"10.1016\/B978-0-08-094832-4.50012-X"},{"key":"94_CR19","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1162\/evco.1996.4.2.113","volume":"4","author":"B.L. Miller","year":"1996","unstructured":"Miller, B.L., Goldberg, D.E.: Genetic algorithms, selection schemes, and the varying effects of noise. Evolutionary Computation 4 (1996) 113\u2013131","journal-title":"Evolutionary Computation"},{"key":"94_CR20","volume-title":"Efficient and Accurate Parallel Genetic Algorithms","author":"E. Cant\u00fa-Paz","year":"2000","unstructured":"Cant\u00fa-Paz, E.: Efficient and Accurate Parallel Genetic Algorithms. Kluwer Academic Publishers, Boston, MA (2000)"}],"container-title":["Lecture Notes in Computer Science","Genetic and Evolutionary Computation \u2014 GECCO 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45105-6_94","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,23]],"date-time":"2019-02-23T03:24:13Z","timestamp":1550892253000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45105-6_94"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540406020","9783540451051"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-45105-6_94","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}