{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T06:49:18Z","timestamp":1743058158620,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642291234"},{"type":"electronic","value":"9783642291241"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29124-1_20","type":"book-chapter","created":{"date-parts":[[2012,3,23]],"date-time":"2012-03-23T17:24:42Z","timestamp":1332523482000},"page":"230-242","source":"Crossref","is-referenced-by-count":1,"title":["Recurrent Genetic Algorithms: Sustaining Evolvability"],"prefix":"10.1007","author":[{"given":"Adnan","family":"Fakeih","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ahmed","family":"Kattan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","unstructured":"Altenberg, L.: The evolution of evolvability in genetic programming. In: Kinnear Jr., K.E. (ed.) Advances in Genetic Programming, ch.3, pp. 47\u201374. MIT Press (1994)"},{"key":"20_CR2","doi-asserted-by":"publisher","first-page":"1899","DOI":"10.1145\/1569901.1570225","volume-title":"Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation, GECCO 2009","author":"J.K. Bassett","year":"2009","unstructured":"Bassett, J.K., Coletti, M., De Jong, K.A.: The relationship between evolvability and bloat. In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation, GECCO 2009, pp. 1899\u20131900. ACM, New York (2009)"},{"key":"20_CR3","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/BF02679443","volume":"30","author":"M. Frances","year":"1997","unstructured":"Frances, M., Litman, A.: On covering problems of codes. Theory of Computing Systems\u00a030, 113\u2013119 (1997), doi:10.1007\/BF02679443","journal-title":"Theory of Computing Systems"},{"key":"20_CR4","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, 1st edn. Addison-Wesley Longman Publishing Co., Inc., Boston (1989)","edition":"1"},{"key":"20_CR5","volume-title":"Neural Networks: A Comprehensive Foundation","author":"S. Haykin","year":"1999","unstructured":"Haykin, S.: Neural Networks: A Comprehensive Foundation, 2nd edn. Prentice Hall, Upper Saddle River (1999)","edition":"2"},{"key":"20_CR6","first-page":"1","volume":"1","author":"T. Hu","year":"2010","unstructured":"Hu, T., Banzhaf, W.: Evolvability and speed of evolutionary algorithms in light of recent developments in biology. J. Artif. Evol. App.\u00a02010, 1:1\u20131:28 (2010)","journal-title":"J. Artif. Evol. App."},{"key":"20_CR7","unstructured":"Jones, T., Forrest, S.: Fitness distance correlation as a measure of problem difficulty for genetic algorithms. In: Eshelman, L.J. (ed.) ICGA, pp. 184\u2013192. Morgan Kaufmann (1995)"},{"issue":"1","key":"20_CR8","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/S0022-5193(87)80029-2","volume":"128","author":"S. Kauffman","year":"1987","unstructured":"Kauffman, S., Levin, S.: Towards a general theory of adaptive walks on rugged landscapes. J. Theoret. Biol.\u00a0128(1), 11\u201345 (1987)","journal-title":"J. Theoret. Biol."},{"key":"20_CR9","unstructured":"Molga, M., Smutnick, C.: Test functions for optimization needs. Test functions for optimization needs (2005)"},{"key":"20_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"690","DOI":"10.1007\/978-3-540-24855-2_76","volume-title":"Genetic and Evolutionary Computation \u2013 GECCO 2004","author":"L. Vanneschi","year":"2004","unstructured":"Vanneschi, L., Clergue, M., Collard, P., Tomassini, M., V\u00e9rel, S.: Fitness Clouds and Problem Hardness in Genetic Programming. In: Deb, K., et al. (eds.) GECCO 2004, Part II. LNCS, vol.\u00a03103, pp. 690\u2013701. Springer, Heidelberg (2004)"},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"Wang, Y., Wineberg, M.: The estimation of evolvability genetic algorithm. In: The 2005 IEEE Congress on Evolutionary Computation, vol.\u00a03, pp. 2302\u20132309 (September 2005)","DOI":"10.1109\/CEC.2005.1554981"}],"container-title":["Lecture Notes in Computer Science","Evolutionary Computation in Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29124-1_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,23]],"date-time":"2025-03-23T21:43:44Z","timestamp":1742766224000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-29124-1_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642291234","9783642291241"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29124-1_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}