{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,28]],"date-time":"2025-08-28T00:06:30Z","timestamp":1756339590016,"version":"3.44.0"},"reference-count":55,"publisher":"IEEE","license":[{"start":{"date-parts":[[2011,6,1]],"date-time":"2011-06-01T00:00:00Z","timestamp":1306886400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2011,6,1]],"date-time":"2011-06-01T00:00:00Z","timestamp":1306886400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,6]]},"DOI":"10.1109\/cec.2011.5949688","type":"proceedings-article","created":{"date-parts":[[2011,7,20]],"date-time":"2011-07-20T16:51:24Z","timestamp":1311180684000},"page":"707-714","source":"Crossref","is-referenced-by-count":0,"title":["On robustness of permutations sequencing operators: Solving satisfiability of random 3 \u2014 CNFs by simple crossover"],"prefix":"10.1109","author":[{"given":"Marco","family":"Carpentieri","sequence":"first","affiliation":[{"name":"Dipartimento di Matematica ed Informatica, Universitá della Basilicata, Via dell'Ateneo Lucano 10, Potenza, Italy"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-1361-8_4"},{"key":"ref38","article-title":"Convergence Theory and Applications of the factorized Distribution Algorithm, JCIT","volume":"7","author":"m\u00fchlenbein","year":"1999","journal-title":"Journal of Computing and Information Technology"},{"key":"ref33","article-title":"Memetic Algorithms for the Traveling Salesman Problem","volume":"11","author":"merz","year":"1997","journal-title":"Complex Systems"},{"journal-title":"A Concentration-of-Measure Inequality for Contracting Markov Chains","year":"1996","author":"marton","key":"ref32"},{"journal-title":"Genetic Programming","year":"1992","author":"koza","key":"ref31"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/0167-8191(88)90098-1"},{"key":"ref36","first-page":"219","author":"moscato","year":"1999","journal-title":"Memetic Algorithms A Short Introduction New Ideas in Optimizations"},{"journal-title":"Introduction to the Theory of Statistics","year":"1974","author":"mood","key":"ref35"},{"key":"ref34","first-page":"459","article-title":"Hard and Easy Distributions of SAT Problems","author":"mitchell","year":"0","journal-title":"Proceedings of the National Conference on Artificial Intelligence"},{"journal-title":"Introduction to Automata Theory Languages and Computation","year":"1979","author":"hopcroft","key":"ref28"},{"key":"ref27","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/1090.001.0001","author":"holland","year":"1992","journal-title":"Adaptation in Natural and Artificial Systems"},{"journal-title":"Europ Symp Algorithms","article-title":"The probabilistic analysis of a greedy satisfiability algorithm","year":"0","key":"ref29"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1038\/35079590"},{"journal-title":"The Asymptotic Order of the k-SAT threshold manuscript","year":"2002","author":"achlioptas","key":"ref1"},{"journal-title":"Computer and Intractability A Guide of the Theory of the NP-Completeness","year":"1979","author":"garey","key":"ref20"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/227683.227684"},{"journal-title":"Approximation Algorithms 18 415\/6 854 Advanced Algorithms","year":"1994","author":"goemans","key":"ref21"},{"journal-title":"Genetic Algorithms in Search Optimization and Machine Learning","year":"1989","author":"goldberg","key":"ref24"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1023\/A:1022692631328"},{"key":"ref26","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/3729.001.0001","author":"holland","year":"1989","journal-title":"Induction Processes of Inference Learning and Discovery"},{"key":"ref25","first-page":"1","author":"h\u00e5stad","year":"0","journal-title":"Some Optimal Inapproximability Results Proceedings of the Twenty-Ninth ACM Symposium on the Theory of Computation"},{"journal-title":"The Simple Genetic Algorithm Foundations and Theory","year":"1999","author":"vose","key":"ref50"},{"journal-title":"On the Critical Exponents of Random k-Sat arXiv math0051356v2[Math PR]","year":"2002","author":"whilson","key":"ref51"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2003.820663"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/4235.585893"},{"key":"ref53","first-page":"133","article-title":"Scheduling Problems and Traveling Salesman: the Genetic Edge Recombination Operator","author":"whitley","year":"0","journal-title":"Proceedings of the Third International Conference on Genetic Algorithms"},{"key":"ref52","first-page":"191","article-title":"Modeling Hybrid genetic Algorithms","author":"whitley","year":"1995","journal-title":"Genetic Algorithms in Engineering and Computer Science"},{"key":"ref10","article-title":"Comparison of Permutations Sequencing Genetic Operators","author":"carpentieri","year":"2011","journal-title":"IEEE Congress on Evolutionary Computation New Orleans USA"},{"key":"ref11","first-page":"620","article-title":"Mick Gets Some (the Odd Are on His Side","author":"chvatal","year":"0","journal-title":"Proc 33rd Symp Foundations of Computer Science"},{"key":"ref40","first-page":"521","article-title":"The Bivariate Marginal Distribution Genetic Algorithm","author":"pelikan","year":"1999","journal-title":"Advances in Soft Computing – Engineering Design and Manufacturing"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/800157.805047"},{"journal-title":"Introduction to Algorithms","year":"1990","author":"cormen","key":"ref13"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-08-050684-5.50005-7"},{"key":"ref15","first-page":"162","article-title":"Applying Adaptive Algorithms to Epistatic Domains","author":"davis","year":"0","journal-title":"Proceedings of the International Joint Conference on Artificial Intelligence"},{"key":"ref16","first-page":"126","article-title":"Typical Random 3-SAT Formulae and the Satisfability Threshold","author":"dubois","year":"0","journal-title":"Proc of the Elevnth Annual ACM–SIAM Symposium on Discrete Algorithms"},{"key":"ref17","first-page":"373","article-title":"Hybrid Genetic Algorithms for Combinatorial optimization, RAIRO Recherque Operationelle – Operations Research","volume":"30","author":"fleurent","year":"1996"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1090\/S0894-0347-99-00305-7"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(88)90037-5"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(79)90045-X"},{"key":"ref3","doi-asserted-by":"crossref","DOI":"10.1515\/9780691207278","author":"andersson","year":"1994","journal-title":"Sexual Selection Princeton University"},{"key":"ref6","first-page":"3","article-title":"Evolution Strategies: a Comprehensive Introduction","volume":"1","author":"beyer","year":"2002","journal-title":"Journal of Neural Computing"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-97062-7"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/FOCI.2007.372178"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/103418.103442"},{"journal-title":"Finding Hamiltonian Cycles Algorithms Graphs and Performance","year":"1998","author":"vandegriend","key":"ref49"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1162\/evco.2009.17.2.167"},{"key":"ref46","first-page":"69","article-title":"A Comparison of Genetic Sequencing Operators","author":"starkweather","year":"0","journal-title":"Proceedings of the Fourth International Conference on Genetic Algorithms"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1038\/35079578"},{"journal-title":"Evolutionary Divide and Conquer a Novel Approach to the TSP","year":"1995","author":"valenzuela","key":"ref48"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1145\/1066157.1066303"},{"journal-title":"Formal Memetic Algorithms Evolutionary Computing AISB Workshop","year":"0","author":"radcliffe","key":"ref42"},{"key":"ref41","first-page":"1376","article-title":"On Two Problems from the Theory of Graphs, Soviet","volume":"11","author":"perepelica","year":"1970","journal-title":"Math Doklady"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579348"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0255(97)00017-0"}],"event":{"name":"2011 IEEE Congress on Evolutionary Computation (CEC)","start":{"date-parts":[[2011,6,5]]},"location":"New Orleans, LA, USA","end":{"date-parts":[[2011,6,8]]}},"container-title":["2011 IEEE Congress of Evolutionary Computation (CEC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5936494\/5949581\/05949688.pdf?arnumber=5949688","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,27]],"date-time":"2025-08-27T18:25:19Z","timestamp":1756319119000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/5949688\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6]]},"references-count":55,"URL":"https:\/\/doi.org\/10.1109\/cec.2011.5949688","relation":{},"subject":[],"published":{"date-parts":[[2011,6]]}}}