{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T12:16:34Z","timestamp":1742386594928},"reference-count":42,"publisher":"Elsevier BV","issue":"10","license":[{"start":{"date-parts":[[2007,10,1]],"date-time":"2007-10-01T00:00:00Z","timestamp":1191196800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[2007,10]]},"DOI":"10.1016\/j.cor.2005.11.022","type":"journal-article","created":{"date-parts":[[2006,1,5]],"date-time":"2006-01-05T13:25:47Z","timestamp":1136467547000},"page":"3143-3153","source":"Crossref","is-referenced-by-count":131,"title":["A review of metrics on permutations for search landscape analysis"],"prefix":"10.1016","volume":"34","author":[{"given":"Tommaso","family":"Schiavinotto","sequence":"first","affiliation":[]},{"given":"Thomas","family":"St\u00fctzle","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.cor.2005.11.022_bib1","series-title":"Proceedings of the sixth international conference on genetic algorithms","first-page":"184","article-title":"Fitness distance correlation as a measure of problem difficulty for genetic algorithms","author":"Jones","year":"1995"},{"key":"10.1016\/j.cor.2005.11.022_bib2","series-title":"Properties of fitness functions and search landscapes","first-page":"175","article-title":"Theoretical aspects of evolutionary computing","author":"Kallel","year":"2001"},{"key":"10.1016\/j.cor.2005.11.022_bib3","series-title":"The Origins of order","author":"Kauffman","year":"1993"},{"key":"10.1016\/j.cor.2005.11.022_bib4","series-title":"New ideas in optimization","first-page":"244","article-title":"Fitness landscapes and memetic algorithm design","author":"Merz","year":"1999"},{"key":"10.1016\/j.cor.2005.11.022_bib5","series-title":"Foundations of genetic algorithms","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1016\/B978-0-08-050684-5.50023-9","article-title":"Evolution in time and space\u2014the parallel genetic algorithm","author":"M\u00fchlenbein","year":"1991"},{"key":"10.1016\/j.cor.2005.11.022_bib6","series-title":"Stochastic local search\u2014foundations and applications","author":"Hoos","year":"2004"},{"key":"10.1016\/j.cor.2005.11.022_bib7","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1023\/A:1018983524911","article-title":"Landscapes operators and heuristic search","volume":"86","author":"Reeves","year":"1999","journal-title":"Annals of Operations Research"},{"issue":"2","key":"10.1016\/j.cor.2005.11.022_bib8","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1137\/S0036144501395952","article-title":"Combinatorial landscapes","volume":"44","author":"Reidys","year":"2002","journal-title":"SIAM Review"},{"key":"10.1016\/j.cor.2005.11.022_bib9","doi-asserted-by":"crossref","unstructured":"Stadler PF. Towards a theory of landscapes. In: Lop\u00e9z-Pe\u00f1a R, Capovilla R, Garc\u00eda-Pelayo R, Waelbroeck H, Zertuche F. editors. Complex systems and binary networks. Lecture notes in physics, vol. 461, Berlin, Germany: Springer, 1995. p. 77\u2013163.","DOI":"10.1007\/BFb0103571"},{"key":"10.1016\/j.cor.2005.11.022_bib10","series-title":"Biological evolution and statistical physics","first-page":"187","article-title":"Fitness landscapes","author":"Stadler","year":"2002"},{"issue":"5","key":"10.1016\/j.cor.2005.11.022_bib11","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/BF00202749","article-title":"Correlated and uncorrelated fitness landscapes and how to tell the difference","volume":"63","author":"Weinberger","year":"1990","journal-title":"Biological Cybernetics"},{"issue":"4","key":"10.1016\/j.cor.2005.11.022_bib12","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1109\/4235.887234","article-title":"Fitness landscape analysis and memetic algorithms for the quadratic assignment problem","volume":"4","author":"Merz","year":"2000","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"8","key":"10.1016\/j.cor.2005.11.022_bib13","doi-asserted-by":"crossref","first-page":"889","DOI":"10.1016\/S0167-739X(00)00043-1","article-title":"MAX\u2013MIN Ant System","volume":"16","author":"St\u00fctzle","year":"2000","journal-title":"Future Generation Computer Systems"},{"issue":"2","key":"10.1016\/j.cor.2005.11.022_bib14","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1287\/ijoc.14.2.98.120","article-title":"Contrasting structured and random permutation flow-shop scheduling problems: search space topology and algorithm performance","volume":"14","author":"Watson","year":"2002","journal-title":"INFORMS Journal on Computing"},{"key":"10.1016\/j.cor.2005.11.022_bib15","first-page":"527","article-title":"Note on the theory of permutations","volume":"34","author":"Cayley","year":"1849","journal-title":"Philosophical Magazine"},{"key":"10.1016\/j.cor.2005.11.022_bib16","unstructured":"Christie DA, Genome rearrangement problems. Ph.D. thesis, University of Glasgow, 1998."},{"key":"10.1016\/j.cor.2005.11.022_bib17","unstructured":"Vergara J-PC. Sorting by bounded permutations, Ph.D. thesis, Virginia Tech, 1997."},{"key":"10.1016\/j.cor.2005.11.022_bib18","series-title":"Proceedings of the sixth congress on genetics","first-page":"365","article-title":"The roles of mutation, inbreeding, crossbreeding and selection in evolution","author":"Wright","year":"1932"},{"key":"10.1016\/j.cor.2005.11.022_bib19","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0304-3975(85)90047-7","article-title":"The complexity of finding minimum-length generator sequences","volume":"36","author":"Jerrum","year":"1985","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/j.cor.2005.11.022_bib20","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/S0004-3702(02)00363-6","article-title":"Problem difficulty for tabu search in job-shop scheduling","volume":"143","author":"Watson","year":"2003","journal-title":"Artificial Intelligence"},{"key":"10.1016\/j.cor.2005.11.022_bib21","unstructured":"Bachelet V. M\u00e9taheuristiques parall\u00e8les hybrides: application au probl\u00e8me d\u2019affectation quadratique. Ph.D. thesis, Universit\u00e9 des Sciences et Technologies de Lille, 1999."},{"key":"10.1016\/j.cor.2005.11.022_bib22","doi-asserted-by":"crossref","unstructured":"Beyer WA, Stein ML, Ulam SM. Metric in biology, an introduction. Preprint LA-4937, University of California, Los Alamos, 1972.","DOI":"10.2172\/4614869"},{"key":"10.1016\/j.cor.2005.11.022_bib23","first-page":"379","article-title":"Ulam's metric","volume":"vol. 9","author":"Critchlow","year":"1988"},{"key":"10.1016\/j.cor.2005.11.022_bib24","series-title":"Introduction to algorithms","author":"Cormen","year":"2001"},{"key":"10.1016\/j.cor.2005.11.022_bib25","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/0020-0190(77)90031-X","article-title":"Preserving order in a forest in less than logarithmic time and linear space","volume":"6","author":"van Emde Boas","year":"1977","journal-title":"Information Processing Letters"},{"issue":"1\u20132","key":"10.1016\/j.cor.2005.11.022_bib26","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/S0020-0190(00)00124-1","article-title":"Enumerating longest increasing subsequences and patience sorting","volume":"76","author":"Bespamyatnikh","year":"2000","journal-title":"Information Processing Letters"},{"issue":"7","key":"10.1016\/j.cor.2005.11.022_bib27","doi-asserted-by":"crossref","first-page":"1073","DOI":"10.1016\/0898-1221(89)90036-9","article-title":"An algorithm for the determination of a longest increasing subsequence in a sequence","volume":"17","author":"Orlowski","year":"1989","journal-title":"Computers & Mathematics with Applications"},{"issue":"4","key":"10.1016\/j.cor.2005.11.022_bib28","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1023\/B:JMMA.0000049379.14872.f5","article-title":"The analysis of evolutionary algorithms on sorting and shortest paths problems","volume":"3","author":"Scharnow","year":"2004","journal-title":"Journal of Mathematical Modelling and Algorithms"},{"key":"10.1016\/j.cor.2005.11.022_bib29","series-title":"Proceedings of the first annual international conference on computational molecular biology (RECOMB\u201997)","first-page":"75","article-title":"Sorting by reversals is difficult","author":"Caprara","year":"1997"},{"key":"10.1016\/j.cor.2005.11.022_bib30","first-page":"75","article-title":"Sorting circular permutations by reversal","volume":"vol. 2748","author":"Solomon","year":"2003"},{"key":"10.1016\/j.cor.2005.11.022_bib31","first-page":"200","article-title":"On some tighter inapproximability results (extended abstract)","volume":"vol. 1644","author":"Berman","year":"1999"},{"key":"10.1016\/j.cor.2005.11.022_bib32","unstructured":"Berman P, Hannenhalli S, Karpinski M. 1.375-approximation algorithm for sorting by reversals. In: 10th European symposium on algorithms (ESA). Lecture notes in computer science. Berlin, Germany: Springer, 2002, p. 200\u201310."},{"issue":"2","key":"10.1016\/j.cor.2005.11.022_bib33","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0167-6377(94)90065-5","article-title":"A new adaptive multi-start technique for combinatorial global optimization","volume":"16","author":"Boese","year":"1994","journal-title":"Operations Research Letters"},{"key":"10.1016\/j.cor.2005.11.022_bib34","unstructured":"Merz P. Memetic algorithms for combinatorial optimization problems: fitness landscapes and effective search strategies. Ph.D. thesis, Department of Electrical Engineering and Computer Science, University of Siegen, Germany, 2000."},{"issue":"3","key":"10.1016\/j.cor.2005.11.022_bib35","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1287\/ijoc.13.3.224.12631","article-title":"Sorting permutations by reversals through branch-and-price","volume":"13","author":"Caprara","year":"2001","journal-title":"INFORMS Journal on Computing"},{"key":"10.1016\/j.cor.2005.11.022_bib36","doi-asserted-by":"crossref","unstructured":"Berman P, Hannenhalli S. Fast sorting by reversal. In: Hirschberg DS, Myers EW, editors. Proceedings of the seventh annual symposium on combinatorial pattern matching. Lecture notes in computer science, vol. 1075, Berlin, Germany: Springer; 1996, pp. 168\u201385.","DOI":"10.1007\/3-540-61258-0_14"},{"key":"10.1016\/j.cor.2005.11.022_bib37","series-title":"RECOMB \u201997: Proceedings of the first annual international conference on computational molecular biology","first-page":"163","article-title":"Faster and simpler algorithm for sorting signed permutations by reversals","author":"Kaplan","year":"1997"},{"key":"10.1016\/j.cor.2005.11.022_bib38","unstructured":"Hartman T, Shamir R. A simpler 1.5-approximation algorithm for sorting by transpositions, In: Baeza-Yates RA, Ch\u00e1vez E, Crochemore M, editors. Proceedings of the 14th annual symposium on combinatorial pattern matching. Lecture notes in computer science, vol. 2676, Berlin, Germany: Springer; 2003. p: 156\u201369."},{"key":"10.1016\/j.cor.2005.11.022_bib39","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/S0166-218X(98)00072-9","article-title":"Sorting by bounded block-moves","volume":"88","author":"Heath","year":"1998","journal-title":"Discrete Applied Mathematics"},{"issue":"3","key":"10.1016\/j.cor.2005.11.022_bib40","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1007\/s004530010041","article-title":"Sorting by short block-moves","volume":"28","author":"Heath","year":"2000","journal-title":"Algorithmica"},{"key":"10.1016\/j.cor.2005.11.022_bib41","unstructured":"Or I. Traveling salesman-type problems and their relation to the logistics of regional blood banking. Ph.D. thesis, Department of Industrial Engineering and Management Science, Northwestern University, Evanston, IL, USA, 1976."},{"key":"10.1016\/j.cor.2005.11.022_bib42","unstructured":"Glover F. A template for scatter search and path relinking. In: Hao J, Lutton E, Ronald E, Shoenauer M, Snyers D, editors. Artificial evolution 1997. Lecture notes in computer science, vol. 1363, Berlin, Germany: Springer, 1997. p. 13\u201354."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054805003746?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054805003746?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,7,22]],"date-time":"2021-07-22T06:04:08Z","timestamp":1626933848000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054805003746"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,10]]},"references-count":42,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2007,10]]}},"alternative-id":["S0305054805003746"],"URL":"https:\/\/doi.org\/10.1016\/j.cor.2005.11.022","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2007,10]]}}}