{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T03:11:15Z","timestamp":1768446675529,"version":"3.49.0"},"reference-count":68,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2014,6,1]],"date-time":"2014-06-01T00:00:00Z","timestamp":1401580800000},"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":[[2014,6]]},"DOI":"10.1109\/tevc.2013.2281502","type":"journal-article","created":{"date-parts":[[2013,9,11]],"date-time":"2013-09-11T19:27:32Z","timestamp":1378927652000},"page":"420-434","source":"Crossref","is-referenced-by-count":60,"title":["On the Landscape of Combinatorial Optimization Problems"],"prefix":"10.1109","volume":"18","author":[{"given":"Mohammad-H.","family":"Tayarani-N.","sequence":"first","affiliation":[]},{"given":"Adam","family":"Prugel-Bennett","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/2001576.2001649"},{"key":"ref38","author":"boese","year":"1995","journal-title":"Cost versus distance in the traveling salesman problem"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20364-0_10"},{"key":"ref32","article-title":"Local search heuristics: Fitness cloud versus fitness landscape","volume":"4010","author":"collard","year":"2007","journal-title":"CoRR"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/11861201_31"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2007.01.001"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/0375-9601(92)90557-3"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2010.5586481"},{"key":"ref35","article-title":"Communities of minima in local optima networks of combinatorial spaces","volume":"4445","author":"daolio","year":"2012","journal-title":"CoRR"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71605-1_22"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1145\/290179.290180"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1142\/9789814354363_0017"},{"key":"ref61","first-page":"32","article-title":"The asymmetric traveling salesman problem: Algorithms, instance generators, and tests","author":"cirasella","year":"0","journal-title":"Proc ALENEX'01"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/B978-1-55860-356-1.50016-9"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2005.846818"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/1830483.1830745"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2007.06.005"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1016\/j.aml.2011.09.053"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008874222544"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1007\/BF01165154"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1162\/EVCO_a_00098"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009823419804"},{"key":"ref2","author":"jones","year":"1995","journal-title":"Evolutionary algorithms fitness landscapes and search"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00202749"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1023\/A:1022626114466"},{"key":"ref22","first-page":"1","article-title":"Fitness landscape analysis for the continuous flow-shop scheduling problem","author":"czogalla","year":"0","journal-title":"Proceedings of 3rd Eurochip Workshop"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(97)00176-X"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/SYNASC.2008.69"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/4235.887234"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/1389095.1389208"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0103571"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-4137-7_15"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00164-5"},{"key":"ref59","author":"pr\u00fcgel-bennett","year":"0","journal-title":"On the chromatic number of finite random graphs journal ="},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1007\/BF02122551"},{"key":"ref57","first-page":"1357","article-title":"Constant time steepest descent local search with lookahead for nk-landscapes and MAX-k-SAT","author":"whitley","year":"0","journal-title":"Proc 14th GECCO'12"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2011.5949724"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-010-9155-x"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/ICAIS.2002.1048128"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-009-9249-2"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-009-9249-2"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1088\/0305-4470\/24\/20\/022"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-34413-8_20"},{"key":"ref11","first-page":"365","article-title":"The roles of mutation, inbreeding, crossbreeding, and selection in evolution","volume":"1","author":"wright","year":"0","journal-title":"Proc 6th Congr Genetics"},{"key":"ref12","volume":"9","author":"m\u00e9zard","year":"1987","journal-title":"Spin-Glass Theory and Beyond"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1002\/3527606734"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(87)90033-6"},{"key":"ref15","first-page":"331","article-title":"Where the really hard problems are","volume":"1","author":"cheeseman","year":"0","journal-title":"Proceedings of IJCAI-91 12th"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(92)90049-9"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(94)90212-7"},{"key":"ref18","first-page":"143","article-title":"The genetic algorithm and the structure of the fitness landscape","author":"manderick","year":"0","journal-title":"Proc 4th Int Conf Genet Algorithms"},{"key":"ref19","first-page":"219","article-title":"Genetic operators, the fitness landscape and the traveling salesman problem","author":"mathias","year":"0","journal-title":"Proc PPSN"},{"key":"ref4","first-page":"1","article-title":"Anatomy of the fitness landscape for graph-coloring problem","author":"tayarani","year":"2012","journal-title":"J Evol Comput"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2011.2163638"},{"key":"ref6","article-title":"Quadratic assignment problem: A landscape analysis","author":"tayarani","year":"0","journal-title":"IEEE Trans Syst Man Cybern B Cybern"},{"key":"ref5","first-page":"1","article-title":"Travelling salesman problem: A landscape analysis","volume":"10","author":"tayarani","year":"2012","journal-title":"J Evol Comput"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1088\/0305-4470\/21\/1\/030"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(94)90212-7"},{"key":"ref7","doi-asserted-by":"crossref","first-page":"4384","DOI":"10.1103\/PhysRevB.17.4384","article-title":"Infinite-ranged models of spin-glasses","volume":"17","author":"sherrington","year":"1978","journal-title":"Phys Rev B"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/BF01313839"},{"key":"ref46","first-page":"90","article-title":"Directed plateau search for MAX-k-SAT","author":"sutton","year":"0","journal-title":"Proc 3rd Annu Symp Combinatorial Search"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03751-1_3"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45365-2_18"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2009.2033579"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/ICSMC.2000.886461"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(00)00239-5"},{"key":"ref44","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.artint.2004.04.001","article-title":"Configuration landscape analysis and backbone guided local search: Part i. Satisfiability and maximum satisfiability","volume":"158","author":"weixiong","year":"2004","journal-title":"Artif Intell"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2008.915539"}],"container-title":["IEEE Transactions on Evolutionary Computation"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/4235\/6821278\/06595563.pdf?arnumber=6595563","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:18:26Z","timestamp":1642004306000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6595563\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6]]},"references-count":68,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tevc.2013.2281502","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":[[2014,6]]}}}