{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T23:56:44Z","timestamp":1769903804679,"version":"3.49.0"},"reference-count":69,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2012,4,1]],"date-time":"2012-04-01T00:00:00Z","timestamp":1333238400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Evol. Computat."],"published-print":{"date-parts":[[2012,4]]},"DOI":"10.1109\/tevc.2011.2132726","type":"journal-article","created":{"date-parts":[[2012,1,11]],"date-time":"2012-01-11T21:46:43Z","timestamp":1326318403000},"page":"279-300","source":"Crossref","is-referenced-by-count":18,"title":["The Effects of Constant and Bit-Wise Neutrality on Problem Hardness, Fitness Distance Correlation and Phenotypic Mutation Rates"],"prefix":"10.1109","volume":"16","author":[{"given":"Riccardo","family":"Poli","sequence":"first","affiliation":[]},{"given":"Edgar","family":"Galvan-Lopez","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","first-page":"1788","article-title":"Difficulty of unimodal and multimodal landscapes in genetic programming","volume":"lncs 2724","author":"vanneschi","year":"2003","journal-title":"Proc GECCO"},{"key":"ref38","first-page":"284","article-title":"Pros and cons of fitness distance correlation in genetic programming","author":"vanneschi","year":"2003","journal-title":"Proc GECCO"},{"key":"ref33","first-page":"650","article-title":"Fitness distance correlation as statistical measure of genetic algorithms difficulty, revisited","author":"collard","year":"1998","journal-title":"Proc Eur Conf Artif Intell"},{"key":"ref32","first-page":"184","article-title":"Fitness distance correlation as a measure of problem difficulty for genetic algorithms","author":"jones","year":"1995","journal-title":"Proc 7th Int Conf Genetic Algorithms"},{"key":"ref31","author":"jones","year":"1995","journal-title":"Evolutionary algorithms fitness landscapes and search"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/s12530-011-9030-5"},{"key":"ref37","first-page":"724","article-title":"Fitness distance correlation and problem difficulty for genetic programming","author":"clergue","year":"2002","journal-title":"Proc GECCO"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/1143997.1144091"},{"key":"ref35","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/3-540-46004-7_7","article-title":"Exploiting fitness distance correlation of set covering problems","author":"finger","year":"2002","journal-title":"Proc Applicat Evol Comput EvoWorkshops"},{"key":"ref34","first-page":"1218","article-title":"Genetic heuristic for search space exploration","author":"clergue","year":"1999","journal-title":"Proc Int Joint Conf Artif Intell"},{"key":"ref60","first-page":"521","article-title":"Local search strategies for satisfiability testing","author":"selman","year":"1995","journal-title":"Proc 10th Natl Conf AAAI"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1109\/4235.585893"},{"key":"ref61","author":"feller","year":"1968","journal-title":"An Introduction to Probability Theory and Its Applications"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2010.5586095"},{"key":"ref28","first-page":"372","article-title":"Developing redudant binary representations for genetic search","author":"fonseca","year":"2005","journal-title":"Proc IEEE CEC"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1145\/1830483.1830646"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1162\/106365603322519288"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1007\/s10710-011-9136-3"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1145\/1276958.1277209"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7091-6384-9_57"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71605-1_22"},{"key":"ref68","first-page":"392","article-title":"A tractable Walsh analysis of SAT and its implications for genetic algorithms","author":"rana","year":"1998","journal-title":"Proc Nat Conf Artif Intell"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1007\/s11047-008-9106-8"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511623486"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1038\/217624a0"},{"key":"ref20","first-page":"169","article-title":"On the evolution of phenotypic exploration distributions","author":"toussaint","year":"2003","journal-title":"Proc Found Genet Algorithms 7"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2000.870337"},{"key":"ref21","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/6229.001.0001","author":"vose","year":"1999","journal-title":"The Simple Genetic Algorithm Foundations and Theory"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2001.934363"},{"key":"ref23","first-page":"162","article-title":"Neutral search spaces for artificial evolution: A lesson from life","author":"shipman","year":"2000","journal-title":"Proc 7th Int Conf Artif Life"},{"key":"ref26","first-page":"88","article-title":"On the utility of redundant encodings in mutation-based evolutionary search","author":"knowles","year":"2002","journal-title":"Proc 7th PPSN"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1002\/cplx.10021"},{"key":"ref50","first-page":"37","article-title":"Massive multimodality, deception, and genetic algorithms","author":"goldberg","year":"1992","journal-title":"Proc 2nd Int Conf PPSN"},{"key":"ref51","first-page":"49","article-title":"Ordering genetic algorithms and deception","author":"kargupta","year":"1992","journal-title":"Proc 2nd Int Conf PPSN"},{"key":"ref59","first-page":"459","article-title":"Hard and easy distributions for SAT problems","author":"mitchell","year":"1992","journal-title":"Proc Nat Conf Artif Intell"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-79305-2_4"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1162\/106365602317301763"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1023\/A:1006350622830"},{"key":"ref55","first-page":"337","article-title":"Noise strategies for improving local search","volume":"1","author":"selman","year":"1994","journal-title":"Proceedings of the 12th AAAI"},{"key":"ref54","first-page":"459","article-title":"A new method for solving hard satisfiability problems","author":"selman","year":"1992","journal-title":"Proc Nat Conf Artif Intell"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1145\/800157.805047"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1145\/368273.368557"},{"key":"ref10","first-page":"778","article-title":"Some steps toward understanding how neutrality affects evolutionary search","volume":"4193","author":"galvn-lpez","year":"2006","journal-title":"Proc PPSN IX"},{"key":"ref11","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1007\/978-3-540-73482-6_9","author":"poli","year":"2007","journal-title":"Foundations of Genetic Algorithms IX"},{"key":"ref40","first-page":"455","article-title":"Fitness distance correlation in structural mutation genetic programming","volume":"lncs 2610","author":"vanneschi","year":"2003","journal-title":"Proc 6th EuroGP"},{"key":"ref12","author":"galvn-lpez","year":"2009","journal-title":"An Analysis of the Effects of Neutrality on Problem Hardness for Evolutionary Algorithms"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.96.17.9716"},{"key":"ref14","doi-asserted-by":"crossref","first-page":"1772","DOI":"10.1016\/j.febslet.2005.01.063","article-title":"Robustness, evolvability and neutrality","volume":"579","author":"wagner","year":"2005","journal-title":"FEBS Lett"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/BF02462007"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1098\/rspb.1994.0040"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2002.1004440"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/4235.771166"},{"key":"ref19","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04378-3","author":"beyer","year":"2001","journal-title":"The Theory of Evolution Strategies"},{"key":"ref4","first-page":"1135","article-title":"An empirical study of the efficiency of learning Boolean functions using a Cartesian genetic approach","volume":"2","author":"miller","year":"1999","journal-title":"Proc GECCO"},{"key":"ref3","first-page":"13","article-title":"Finding needles in haystacks is not hard with neutrality","volume":"lncs 2278","author":"yu","year":"2002","journal-title":"Proc 5th Eur Conf EuroGP"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1068009.1068282"},{"key":"ref5","first-page":"121","article-title":"Cartesian genetic programming","volume":"lncs 1802","author":"miller","year":"2000","journal-title":"Proc 3rd EuroGP"},{"key":"ref8","author":"poli","year":"2008","journal-title":"A Field Guide to Genetic Programming"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04726-2"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1007\/BF01530779"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1143997.1144180"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1145\/1143997.1144191"},{"key":"ref45","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/BFb0056851","article-title":"Fitness distance correlation and ridge functions","author":"quick","year":"1998","journal-title":"Proc 5th Int Conf Parallel Problem Solving from Nature"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/ICEC.1998.699326"},{"key":"ref47","first-page":"338","article-title":"Using problem generators to explore the effects of epistasis","author":"de jong","year":"1997","journal-title":"Proc 7th ICGA"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1162\/1063656054088549"},{"key":"ref41","author":"vanneschi","year":"2004","journal-title":"Theory and Practice for Efficient Genetic Programming"},{"key":"ref44","first-page":"57","article-title":"Fitness distance correlation analysis: An instructive counterexample","author":"altenberg","year":"1997","journal-title":"Proc 7th Int Conf Genetic Algorithms"},{"key":"ref43","first-page":"312","article-title":"The effects of constant neutrality on performance and problem hardness in GP","volume":"lncs 4971","author":"galvn-lpez","year":"2008","journal-title":"Proc 11th EuroGP"}],"container-title":["IEEE Transactions on Evolutionary Computation"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4235\/6176231\/06129403.pdf?arnumber=6129403","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,13]],"date-time":"2023-06-13T13:38:39Z","timestamp":1686663519000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6129403\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,4]]},"references-count":69,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tevc.2011.2132726","relation":{},"ISSN":["1089-778X","1089-778X","1941-0026"],"issn-type":[{"value":"1089-778X","type":"print"},{"value":"1089-778X","type":"print"},{"value":"1941-0026","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,4]]}}}