{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,21]],"date-time":"2026-07-21T14:48:05Z","timestamp":1784645285650,"version":"3.55.0"},"reference-count":53,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2016,6,1]],"date-time":"2016-06-01T00:00:00Z","timestamp":1464739200000},"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":[[2016,6]]},"DOI":"10.1109\/tevc.2015.2477284","type":"journal-article","created":{"date-parts":[[2015,9,8]],"date-time":"2015-09-08T18:24:01Z","timestamp":1441736641000},"page":"434-446","source":"Crossref","is-referenced-by-count":23,"title":["The Permutation in a Haystack Problem and the Calculus of Search Landscapes"],"prefix":"10.1109","volume":"20","author":[{"given":"Vincent A.","family":"Cicirello","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1162\/EVCO_a_00006"},{"key":"ref38","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-05094-1","author":"eiben","year":"2003","journal-title":"Introduction to Evolutionary Computing"},{"key":"ref33","first-page":"832","article-title":"Permutation distance measures for memetic algorithms with population management","author":"sevaux","year":"2005","journal-title":"Proc MIC"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ICEC.1998.700089"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/321796.321811"},{"key":"ref30","first-page":"27","article-title":"The crossover landscape for the onemax problem","author":"h\u00f6hn","year":"1996","journal-title":"Proc 2nd Nordic Workshop Genetic Algorithm"},{"key":"ref37","first-page":"3481","article-title":"An exponential model for infinite rankings","volume":"11","author":"meil?","year":"2010","journal-title":"J Mach Learn Res"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/30.1-2.81"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ICEC.1995.487459"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ICEC.1997.592266"},{"key":"ref28","first-page":"74","article-title":"Simple genetic algorithms and the minimal, deceptive problem","author":"goldberg","year":"1987","journal-title":"Genetic Algorithms and Simulated Annealing"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/2387358.2387362"},{"key":"ref29","first-page":"184","article-title":"Fitness distance correlation as a measure of problem difficulty for genetic algorithms","author":"jones","year":"1995","journal-title":"Proc ICGA"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-23667-8_12"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.1030.0057"},{"key":"ref20","first-page":"245","article-title":"The royal road for genetic algorithms: Fitness landscapes and GA performance","author":"mitchell","year":"1992","journal-title":"Proc ECAL"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/2330163.2330260"},{"key":"ref21","article-title":"Fitness landscapes: Royal road functions","author":"mitchell","year":"1997","journal-title":"Handbook of Evolutionary Computation"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/1569901.1570009"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/1569901.1570211"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/2463372.2463471"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/4235.728208"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1017\/S0890060402165048"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2007.4424632"},{"key":"ref53","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139872003","author":"romik","year":"2015","journal-title":"The Surprising Mathematics of Longest Increasing Subsequence"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/ICCIS.2011.78"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/1143997.1144177"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2015.2433680"},{"key":"ref40","article-title":"On the design of an adaptive simulated annealing algorithm","author":"cicirello","year":"2007","journal-title":"Proc CP 1st Workshop Auton Search"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2013.2281502"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2005.11.022"},{"key":"ref14","first-page":"46","article-title":"Profiling the distance characteristics of mutation operators for permutation-based genetic algorithms","author":"cicirello","year":"2013","journal-title":"Proc 26th FLAIRS St"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-006-9001-3"},{"key":"ref16","first-page":"28","article-title":"On the effects of window-limits on the distance profiles of permutation neighborhood operators","author":"cicirello","year":"2014","journal-title":"Proc Int Conf Bioinspir Inf Commun Technol"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/267521.267531"},{"key":"ref18","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/3927.001.0001","author":"mitchell","year":"1998","journal-title":"An Introduction to Genetic Algorithms"},{"key":"ref19","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1093\/genetics\/16.2.97","article-title":"Evolution in Mendelian populations","volume":"16","author":"wright","year":"1931","journal-title":"Genetics"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2001576.2001814"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480102412856"},{"key":"ref6","first-page":"224","article-title":"A study of permutation crossover operators on the traveling salesman problem","author":"oliver","year":"1987","journal-title":"Proc ICGA"},{"key":"ref5","first-page":"109","article-title":"Efficient ranking from pairwise comparisons","author":"wauthier","year":"2013","journal-title":"Proc ICML"},{"key":"ref8","first-page":"235","article-title":"Modeling GA performance for control parameter optimization","author":"cicirello","year":"2000","journal-title":"Proc GECCO"},{"key":"ref7","first-page":"154","article-title":"Alleles, loci, and the traveling salesman problem","author":"goldberg","year":"1985","journal-title":"Proc ICGA"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/3477.604100"},{"key":"ref9","first-page":"162","article-title":"Applying adaptive algorithms to epistatic domains","author":"davis","year":"1985","journal-title":"Proc IJCAI"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-61723-X_988"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/DAC.1988.14775"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2000.870758"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2011.2166159"},{"key":"ref42","volume":"1","author":"knuth","year":"1997","journal-title":"The Art of Computer Programming Fundamental Algorithms"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1023\/A:1026597127504"},{"key":"ref44","article-title":"Learning evaluation functions for global optimization","author":"boyan","year":"1998"},{"key":"ref43","article-title":"Automatic layout of analog and digital mixed macro\/standard cell integrated circuits","author":"swartz","year":"1993"}],"container-title":["IEEE Transactions on Evolutionary Computation"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/4235\/7479595\/07244341.pdf?arnumber=7244341","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,13]],"date-time":"2023-08-13T21:53:23Z","timestamp":1691963603000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7244341\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6]]},"references-count":53,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tevc.2015.2477284","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":[[2016,6]]}}}