{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T11:24:20Z","timestamp":1773833060965,"version":"3.50.1"},"reference-count":36,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2010,8,1]],"date-time":"2010-08-01T00:00:00Z","timestamp":1280620800000},"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":[[2010,8]]},"DOI":"10.1109\/tevc.2009.2039139","type":"journal-article","created":{"date-parts":[[2010,3,30]],"date-time":"2010-03-30T18:43:42Z","timestamp":1269974622000},"page":"500-517","source":"Crossref","is-referenced-by-count":72,"title":["Benefits of a Population: Five Mechanisms That Advantage Population-Based Algorithms"],"prefix":"10.1109","volume":"14","author":[{"given":"Adam","family":"Pr\u00fcgel-Bennett","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1162\/106365601750190398"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/BF01315244"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/BF01313839"},{"key":"ref30","first-page":"465","article-title":"a genetic local search approach to the quadratic assignment problem","author":"merz","year":"1997","journal-title":"Proc 7th Int Conf Genetic Algorithms"},{"key":"ref36","first-page":"196","author":"press","year":"2007","journal-title":"Numerical Recipes in C The Art of Scientific Computation"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2007.06.005"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2003.819419"},{"key":"ref10","first-page":"14","article-title":"reducing bias and inefficiency in the selection algorithm","author":"baker","year":"1987","journal-title":"Proc 3rd Intl Conf on Genetic Algorithms"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/B978-155860734-7\/50097-4"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/4235.942531"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/1276958.1277224"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009823419804"},{"key":"ref15","first-page":"1173","article-title":"Backdoors to typical case complexity","author":"williams","year":"2003","journal-title":"Proc Int Joint Conf Artif Intell (IJCAI)"},{"key":"ref16","first-page":"1368","article-title":"backbones and backdoors in satisfiability","author":"kilby","year":"2005","journal-title":"Proc 20th Conf Natl Conf Artif Intell"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1023\/A:1027312403532"},{"key":"ref18","first-page":"222","article-title":"Forma analysis and random respectful recombination","author":"radcliffe","year":"1991","journal-title":"Proc 4th Int Conf Genet Algorithms"},{"key":"ref19","first-page":"101","author":"shapiro","year":"1997","journal-title":"Foundations of Genetic Algorithms 4"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/BF00226291"},{"key":"ref4","first-page":"51","author":"mitchell","year":"1994","journal-title":"Advances in neural information processing systems"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/BF02430368"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/4235.585893"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2003.818192"},{"key":"ref29","first-page":"890","article-title":"new genetic local search operators for the traveling salesman problem","author":"freisleben","year":"1996","journal-title":"Proc 4th Int Conf Parallel Problem Solving Nature"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/B978-155860734-7\/50087-1"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1109\/TEVC.2005.846818","article-title":"Large barrier trees for studying search","volume":"9","author":"hallam","year":"2005","journal-title":"IEEE Trans Evol Comput"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1063\/1.473299"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.05.011"},{"key":"ref9","first-page":"183","article-title":"Finite population effects for ranking and tournament selection","volume":"12","author":"prgel-bennett","year":"2000","journal-title":"Complex Syst"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2004.02.019"},{"key":"ref20","first-page":"437","article-title":"The dynamics of a genetic algorithm on a model hard optimization problem","volume":"11","author":"rogers","year":"2000","journal-title":"Complex Syst"},{"key":"ref22","first-page":"184","article-title":"On the analysis of evolutionary algorithms—A proof that crossover can really help","author":"jansen","year":"1999","journal-title":"Proc 7th Annu Eur Symp Algorithms (ESA 99)"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04448-3_9"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2009.2033579"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.03.038"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/0167-8191(88)90098-1"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2006.1688294"}],"container-title":["IEEE Transactions on Evolutionary Computation"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4235\/5532081\/05439829.pdf?arnumber=5439829","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,11]],"date-time":"2021-10-11T00:47:50Z","timestamp":1633913270000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5439829\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,8]]},"references-count":36,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tevc.2009.2039139","relation":{},"ISSN":["1941-0026","1089-778X"],"issn-type":[{"value":"1941-0026","type":"electronic"},{"value":"1089-778X","type":"print"}],"subject":[],"published":{"date-parts":[[2010,8]]}}}