{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T08:13:08Z","timestamp":1775722388237,"version":"3.50.1"},"reference-count":20,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2015,4,1]],"date-time":"2015-04-01T00:00:00Z","timestamp":1427846400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/I009809\/1"],"award-info":[{"award-number":["EP\/I009809\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/I010297\/1"],"award-info":[{"award-number":["EP\/I010297\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Royal Society Wolfson Research Merit Award"},{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"crossref","award":["61329302"],"award-info":[{"award-number":["61329302"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"crossref","award":["61100163"],"award-info":[{"award-number":["61100163"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"crossref","award":["61221062"],"award-info":[{"award-number":["61221062"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Evol. Computat."],"published-print":{"date-parts":[[2015,4]]},"DOI":"10.1109\/tevc.2014.2318025","type":"journal-article","created":{"date-parts":[[2014,4,17]],"date-time":"2014-04-17T18:33:34Z","timestamp":1397759614000},"page":"295-305","source":"Crossref","is-referenced-by-count":39,"title":["On the Easiest and Hardest Fitness Functions"],"prefix":"10.1109","volume":"19","author":[{"given":"Jun","family":"He","sequence":"first","affiliation":[]},{"given":"Tianshi","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Xin","family":"Yao","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/4235.843491"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1162\/evco.2007.15.4.435"},{"key":"ref12","first-page":"143","article-title":"The genetic algorithms and the structure of the fitness landscape","author":"manderick","year":"1991","journal-title":"Proc 4th Int Conf Genetic Algorithms"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04448-3_18"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.1999.782006"},{"key":"ref15","first-page":"2004","article-title":"An analysis of evolutionary algorithms for finding approximation solutions to hard optimisation problems","author":"he","year":"0","journal-title":"Proc 2003 IEEE Congr Evol Comput"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(02)00381-8"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2008.2012167"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2009.12.014"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1023\/B:NACO.0000023417.31393.c7"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1162\/evco.1996.4.2.195"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/B978-1-55860-356-1.50016-9"},{"key":"ref6","first-page":"85","article-title":"GA-easy does not imply steepest-ascent optimizable","author":"wilson","year":"1991","journal-title":"Proc 4th Int Conf Genetic Algorithms"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/B978-1-55860-356-1.50010-8"},{"key":"ref8","first-page":"51","article-title":"Fitness variance of formulae and performance prediction","author":"radcliffe","year":"1995","journal-title":"Proc 3rd Workshop Foundations Genetic Algorithms"},{"key":"ref7","first-page":"184","article-title":"Fitness distance correlation as a measure of problem difficulty for genetic algorithms","author":"jones","year":"1995","journal-title":"Proc 6th Int Conf Genetic Algorithms"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2005.856205"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/4235.585893"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-08-050684-5.50005-7"},{"key":"ref20","first-page":"1248","article-title":"To understand one-dimensional continuous fitness landscapes by drift analysis","author":"he","year":"0","journal-title":"2004 Congr Evol Comput"}],"container-title":["IEEE Transactions on Evolutionary Computation"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/4235\/7070844\/06800034.pdf?arnumber=6800034","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:05:31Z","timestamp":1642003531000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/6800034\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,4]]},"references-count":20,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tevc.2014.2318025","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":[[2015,4]]}}}