{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:32:51Z","timestamp":1725489171325},"publisher-location":"Berlin, Heidelberg","reference-count":39,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540734796"},{"type":"electronic","value":"9783540734826"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73482-6_9","type":"book-chapter","created":{"date-parts":[[2007,8,14]],"date-time":"2007-08-14T13:41:51Z","timestamp":1187098911000},"page":"138-164","source":"Crossref","is-referenced-by-count":10,"title":["On the Effects of Bit-Wise Neutrality on Fitness Distance Correlation, Phenotypic Mutation Rates and Problem Hardness"],"prefix":"10.1007","author":[{"given":"Riccardo","family":"Poli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Edgar","family":"Galv\u00e1n-L\u00f3pez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","first-page":"57","volume-title":"Proceedings of the Seventh International Conference on Genetic Algorithms","author":"L. Altenberg","year":"1997","unstructured":"Altenberg, L.: Fitness distance correlation analysis: An instructive counterexample. In: Proceedings of the Seventh International Conference on Genetic Algorithms, San Francisco, CA, USA, 1997, pp. 57\u201364. Morgan Kaufmann Publishers Inc. San Francisco (1997)"},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/0-387-28111-8_14","volume-title":"Genetic Programming Theory and Practice III, volume\u00a09 of Genetic Programming","author":"W. Banzhaf","year":"2005","unstructured":"Banzhaf, W., Leier, A.: Evolution on Neutral Networks in Genetic Programming. In: Yu, T., Riolo, R.L., Worzel, B. (eds.) Genetic Programming Theory and Practice III, volume\u00a09 of Genetic Programming, May 12-14, 2005, ch. 9, pp. 207\u2013221. Springer, Ann Arbor (2005)"},{"key":"9_CR3","first-page":"18","volume-title":"Artificial Life VI: Proceedings of the Sixth International Conference on Artificial Life","author":"L. Barnett","year":"1998","unstructured":"Barnett, L.: Ruggedness and neutrality \u2013 the NKp family of fitness landscapes. In: Adami, C., Belew, R.K., Kitano, H., Taylor, C. (eds.) Artificial Life VI: Proceedings of the Sixth International Conference on Artificial Life, pp. 18\u201327. MIT Press, Cambridge, MA (1998)"},{"key":"9_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04378-3","volume-title":"The Theory of Evolution Strategies","author":"H. Beyer","year":"2001","unstructured":"Beyer, H.: The Theory of Evolution Strategies. Springer, Heidelberg (2001)"},{"key":"9_CR5","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1109\/CEC.2004.1330863","volume-title":"Proceedings of the 2004 IEEE Congress on Evolutionary Computation","author":"R. Chow","year":"2004","unstructured":"Chow, R.: Effects of Phenotypic Feedback and the Coupling of Genotypic and Phenotypic Spaces in Genetic Searchers. In: Proceedings of the 2004 IEEE Congress on Evolutionary Computation, Portland, Oregon, June 20-23, 2004, pp. 242\u2013249. IEEE Press, New York (2004)"},{"key":"9_CR6","first-page":"724","volume-title":"GECCO 2002","author":"M. Clergue","year":"2002","unstructured":"Clergue, M., Collard, P., Tomassini, M., Vanneschi, L.: Fitness distance correlation and problem difficulty for genetic programming. In: Langdon, W.B., Cant\u00fa-Paz, E., Mathias, K., Roy, R., Davis, D., Poli, R., Balakrishnan, K., Honavar, V., Rudolph, G., Wegener, J., Bull, L., Potter, M.A., Schultz, A.C., Miller, J.F., Burke, E., Jonoska, N. (eds.) GECCO 2002. Proceedings of the Genetic and Evolutionary Computation Conference, New York, July 9-13, 2002, pp. 724\u2013732. Morgan Kaufmann, San Francisco (2002)"},{"key":"9_CR7","doi-asserted-by":"publisher","first-page":"1613","DOI":"10.1145\/1068009.1068282","volume-title":"GECCO 2005","author":"M. Collins","year":"2005","unstructured":"Collins, M.: Finding needles in haystacks is harder with neutrality. In: B, H.-G., et al. (ed.) GECCO 2005. Proceedings of the 2005 conference on Genetic and evolutionary computation, Washington DC, USA, June 25-29, 2005, vol.\u00a02, pp. 1613\u20131618. ACM Press, New York (2005)"},{"key":"9_CR8","first-page":"338","volume-title":"Proceedings ICGA 1997: International Conference on Genetic Algorithms","author":"K. Jong De","year":"1997","unstructured":"De Jong, K., Potter, M.A., Spears, W.M.: Using Problem Generators to Explore the Effects of Epistasis. In: Back, T. (ed.) Proceedings ICGA 1997: International Conference on Genetic Algorithms, pp. 338\u2013345. Morgan Kaufmann, San Francisco (1997)"},{"key":"9_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/CEC.2001.934363","volume-title":"Proceedings of the 2001 Congress on Evolutionary Computation CEC 2001","author":"M. Ebner","year":"2001","unstructured":"Ebner, M., Langguth, P., Albert, J., Schakleton, M., Shipman, R.: On Neutral Networks and Evolvability. In: Proceedings of the 2001 Congress on Evolutionary Computation CEC 2001, Seoul, Korea, May 27-30, 2001, pp. 1\u20138. IEEE Press, New York (2001)"},{"issue":"2","key":"9_CR10","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1109\/4235.771166","volume":"3","author":"A.E. Eiben","year":"1999","unstructured":"Eiben, A.E., Hinterding, R., Michalewicz, Z.: Parameter control in evolutionary algorithms. IEEE Trans. Evolutionary Computation\u00a03(2), 124\u2013141 (1999)","journal-title":"IEEE Trans. Evolutionary Computation"},{"key":"9_CR11","volume-title":"An Introduction to Probability Theory and Its Applications","author":"W. Feller","year":"1968","unstructured":"Feller, W.: An Introduction to Probability Theory and Its Applications. Wiley, Chichester (1968)"},{"key":"9_CR12","first-page":"372","volume-title":"Proceedings of the 2005 IEEE Congress on Evolutionary Computation (CEC-2005)","author":"C. Fonseca","year":"2005","unstructured":"Fonseca, C., Correia, M.: Developing Redudant Binary Representations for Genetic Search. In: Proceedings of the 2005 IEEE Congress on Evolutionary Computation (CEC-2005), Edinburgh, September 2-4, 2005, pp. 372\u2013379. IEEE, New York (2005)"},{"key":"9_CR13","doi-asserted-by":"publisher","first-page":"1431","DOI":"10.1126\/science.280.5368.1451","volume":"280","author":"W. Fontana","year":"1998","unstructured":"Fontana, W., Schuster, P.: Continuity in evolution: On the nature of transitions. Science\u00a0280, 1431\u20131433 (1998)","journal-title":"Science"},{"key":"9_CR14","doi-asserted-by":"publisher","first-page":"1149","DOI":"10.1145\/1143997.1144180","volume-title":"GECCO 2006","author":"E. Galv\u00e1n-L\u00f3pez","year":"2006","unstructured":"Galv\u00e1n-L\u00f3pez, E., Poli, R.: An Empirical Investigation of How and Why Neutrality Affects Evolutionary Search. In: GECCO 2006. Proceedings of the 2006 conference on Genetic and evolutionary computation, Seattle, WA, USA, July 8-12, 2006, pp. 1149\u20131156. ACM Press, New York (2006)"},{"issue":"1","key":"9_CR15","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/BF01530779","volume":"5","author":"D.E. Goldberg","year":"1992","unstructured":"Goldberg, D.E.: Construction of high-order deceptive functions using low-order walsh coefficients. Ann. Math. Artif. Intell.\u00a05(1), 35\u201347 (1992)","journal-title":"Ann. Math. Artif. Intell."},{"key":"9_CR16","volume-title":"Parallel Problem Solving from Nature, 2","author":"D.E. Goldberg","year":"1992","unstructured":"Goldberg, D.E., Deb, K., Horn, J.: Massive multimodality, deception, and genetic algorithms. In: M\u00e4nner, R., Manderick, B. (eds.) Parallel Problem Solving from Nature, 2, Elsevier Science Publishers, B. V, Amsterdam (1992)"},{"key":"9_CR17","volume-title":"Parallel Problem Solving from Nature","author":"K.D.H. Kargupta","year":"1992","unstructured":"Kargupta, K.D.H., Goldberg, D.: Ordering genetic algorithms and deception. In: M\u00e4nner, R., Manderick, B. (eds.) Parallel Problem Solving from Nature, vol.\u00a02, Elsevier Science Publishers, B. V, Amsterdam (1992)"},{"key":"9_CR18","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/BF02338823","volume":"43","author":"M.A. Huynen","year":"1996","unstructured":"Huynen, M.A.: Exploring phenotype space through neutral evolution. Molecular Evolution\u00a043, 165\u2013169 (1996)","journal-title":"Molecular Evolution"},{"unstructured":"Jones, T.: Evolutionary Algorithms, Fitness Landscapes and Search. PhD thesis, University of New Mexico, Albuquerque (1995)","key":"9_CR19"},{"key":"9_CR20","first-page":"184","volume-title":"Proceedings of the 6th International Conference on Genetic Algorithms","author":"T. Jones","year":"1995","unstructured":"Jones, T., Forrest, S.: Fitness distance correlation as a measure of problem difficulty for genetic algorithms. In: Proceedings of the 6th International Conference on Genetic Algorithms, pp. 184\u2013192. Morgan Kaufmann Publishers Inc, San Francisco (1995)"},{"key":"9_CR21","first-page":"78","volume-title":"Proceedings IEEE International Conference on Evolutionary Computation","author":"J. Kennedy","year":"1998","unstructured":"Kennedy, J., Spears, W.M.: Matching Algorithms to Problems: An Experimental Test of the Particle Swarm and Some Genetic Algorithms to the Multimodal Problem Generator. In: Proceedings IEEE International Conference on Evolutionary Computation, Piscataway, pp. 78\u201383. IEEE Press, New York (1998)"},{"key":"9_CR22","doi-asserted-by":"publisher","first-page":"624","DOI":"10.1038\/217624a0","volume":"217","author":"M. Kimura","year":"1968","unstructured":"Kimura, M.: Evolutionary rate at the molecular level. Nature\u00a0217, 624\u2013626 (1968)","journal-title":"Nature"},{"key":"9_CR23","doi-asserted-by":"publisher","first-page":"1233","DOI":"10.1145\/1143997.1144191","volume-title":"GECCO 2006","author":"G. Lobo","year":"2006","unstructured":"Lobo, G., Lima, C.F.: On the Utility of the Multimodal Problem Generator for Assessing the Performance of Evolutionary algorithms. In: GECCO 2006. Proceedings of the 2006 conference on Genetic and evolutionary computation, Seattle, WA, USA, July 8-12, 2006, pp. 1233\u20131240. ACM Press, New York (2006)"},{"key":"9_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"778","DOI":"10.1007\/11844297_79","volume-title":"Parallel Problem Solving from Nature - PPSN IX","author":"E.G. L\u00f3pez","year":"2006","unstructured":"L\u00f3pez, E.G., Poli, R.: Some steps towards understanding how neutrality affects evolutionary search. In: Runarsson, T.P., Beyer, H.-G., Burke, E., Merelo-Guerv\u00f3s, J.J., Whitley, L.D., Yao, X. (eds.) Parallel Problem Solving from Nature - PPSN IX. LNCS, vol.\u00a04193, pp. 778\u2013787. Springer, Heidelberg (2006)"},{"key":"9_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/978-3-540-46239-2_9","volume-title":"Genetic Programming","author":"J.F. Miller","year":"2000","unstructured":"Miller, J.F., Thomson, P.: Cartesian genetic programming. In: Poli, R., Banzhaf, W., Langdon, W.B., Miller, J., Nordin, P., Fogarty, T.C. (eds.) EuroGP 2000. LNCS, vol.\u00a01802, pp. 121\u2013132. Springer, Heidelberg (2000)"},{"issue":"1","key":"9_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/4235.843491","volume":"4","author":"B. Naudts","year":"2000","unstructured":"Naudts, B., Kallel, L.: A comparison of predictive measures of problem difficulty in evolutionary algorithms. IEEE Transactions Evolutionary Computation\u00a04(1), 1\u201315 (2000)","journal-title":"IEEE Transactions Evolutionary Computation"},{"key":"9_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BFb0056851","volume-title":"Parallel Problem Solving from Nature - PPSN V","author":"R.J. Quick","year":"1998","unstructured":"Quick, R.J., Rayward-Smith, V.J., Smith, G.D.: Fitness distance correlation and ridge functions. In: Eiben, A.E., B\u00e4ck, T., Schoenauer, M., Schwefel, H.-P. (eds.) Parallel Problem Solving from Nature - PPSN V. LNCS, vol.\u00a01498, pp. 77\u201386. Springer, Heidelberg (1998)"},{"issue":"4","key":"9_CR28","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1162\/106365603322519288","volume":"11","author":"F. Rothlauf","year":"2003","unstructured":"Rothlauf, F., Goldberg, D.: Redundant representations in evolutionary algorithms. Evolutionary Computation\u00a011(4), 381\u2013415 (2003)","journal-title":"Evolutionary Computation"},{"key":"9_CR29","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1007\/3-540-44811-X_29","volume-title":"Advances in Artificial Life","author":"T. Smith","year":"2001","unstructured":"Smith, T., Husbands, P., O\u2019Shea, M.: Neutral networks and evolvability with complex genotype-phenotype mapping. In: Kelemen, J., Sos\u00edk, P. (eds.) ECAL 2001. LNCS (LNAI), vol.\u00a02159, pp. 272\u2013282. Springer, Heidelberg (2001)"},{"key":"9_CR30","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1109\/CEC.2001.934382","volume-title":"Congress on Evolutionary Computation: CEC 2001","author":"T. Smith","year":"2001","unstructured":"Smith, T., Husbands, P., O\u2019Shea, M.: Neutral networks in an evolutionary robotics search space. In: Congress on Evolutionary Computation: CEC 2001, pp. 136\u2013145. IEEE Press, New York (2001)"},{"issue":"2","key":"9_CR31","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1162\/1063656054088549","volume":"13","author":"M. Tomassini","year":"2005","unstructured":"Tomassini, M., Vanneschi, L., Collard, P., Clergue, M.: A study of fitness distance correlation as a difficulty measure in genetic programming. Evolutionary Computation\u00a013(2), 213\u2013239 (Summer 2005)","journal-title":"Evolutionary Computation"},{"key":"9_CR32","first-page":"169","volume-title":"Foundations of Genetic Algorithms 7 (FOGA 2003)","author":"M. Toussaint","year":"2003","unstructured":"Toussaint, M.: On the evolution of phenotypic exploration distributions. In: Cotta, C., De Jong, K., Poli, R., Rowe, J. (eds.) Foundations of Genetic Algorithms 7 (FOGA 2003), pp. 169\u2013182. Morgan Kaufmann, San Francisco (2003)"},{"doi-asserted-by":"crossref","unstructured":"Toussaint, M., Igel, C.: Neutrality: A necessity for self-adaptation. In: Proceedings of the IEEE Congress on Evolutionary Computation (CEC 2002), pp. 1354\u20131359 (2002)","key":"9_CR33","DOI":"10.1109\/CEC.2002.1004440"},{"key":"9_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/3-540-36599-0_43","volume-title":"Genetic Programming","author":"L. Vanneschi","year":"2003","unstructured":"Vanneschi, L., Tomassini, M., Collard, P., Clergue, M.: Fitness distance correlation in structural mutation genetic programming. In: Ryan, C., Soule, T., Keijzer, M., Tsang, E.P.K., Poli, R., Costa, E. (eds.) EuroGP 2003. LNCS, vol.\u00a02610, pp. 455\u2013464. Springer, Heidelberg (2003)"},{"key":"9_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/3-540-46406-9_25","volume-title":"Evolvable Systems: From Biology to Hardware","author":"V.K. Vassilev","year":"2000","unstructured":"Vassilev, V.K., Miller, J.F.: The advantages of landscape neutrality in digital circuit evolution. In: Miller, J.F., Thompson, A., Thompson, P., Fogarty, T.C. (eds.) ICES 2000. LNCS, vol.\u00a01801, pp. 252\u2013263. Springer, Heidelberg (2000)"},{"key":"9_CR36","first-page":"313","volume-title":"Foundations of Genetic Algorithms 6","author":"K. Weicker","year":"2000","unstructured":"Weicker, K., Weicker, N.: Burden and Benefits of Redundancy. In: Martin, W., Spears, W. (eds.) Foundations of Genetic Algorithms 6, pp. 313\u2013333. Morgan Kaufmann, San Francisco (2000)"},{"key":"9_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1007\/3-540-45355-5_16","volume-title":"Genetic Programming","author":"T. Yu","year":"2001","unstructured":"Yu, T., Miller, J.: Neutrality and the evolvability of boolean function landscape. In: Miller, J., Tomassini, M., Lanzi, P.L., Ryan, C., Tetamanzi, A.G.B., Langdon, W.B. (eds.) EuroGP 2001. LNCS, vol.\u00a02038, pp. 204\u2013211. Springer, Heidelberg (2001)"},{"key":"9_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/3-540-45984-7_2","volume-title":"Genetic Programming","author":"T. Yu","year":"2002","unstructured":"Yu, T., Miller, J.F.: Needles in haystacks are not hard to find with neutrality. In: Foster, J.A., Lutton, E., Miller, J., Ryan, C., Tettamanzi, A.G.B. (eds.) EuroGP 2002. LNCS, vol.\u00a02278, pp. 13\u201325. Springer, Heidelberg (2002)"},{"key":"9_CR39","first-page":"512","volume-title":"Late Breaking Papers at the Genetic and Evolutionary Computation Conference (GECCO-2002)","author":"T. Yu","year":"2002","unstructured":"Yu, T., Miller, J.F.: The role of neutral and adaptive mutation in an evolutionary search on the onemax problem. In: Cant\u00fa-Paz, E. (ed.) Late Breaking Papers at the Genetic and Evolutionary Computation Conference (GECCO-2002), New York, NY, July 2002, pp. 512\u2013519. AAAI, Stanford, California, USA (2002)"}],"container-title":["Lecture Notes in Computer Science","Foundations of Genetic Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73482-6_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:13:43Z","timestamp":1619518423000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73482-6_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540734796","9783540734826"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73482-6_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}