{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T07:02:52Z","timestamp":1758265372342,"version":"3.37.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030242015"},{"type":"electronic","value":"9783030242022"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-24202-2_7","type":"book-chapter","created":{"date-parts":[[2019,7,23]],"date-time":"2019-07-23T06:02:44Z","timestamp":1563861764000},"page":"81-97","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Classification of Permutation Distance Metrics for Fitness Landscape Analysis"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1072-8559","authenticated-orcid":false,"given":"Vincent A.","family":"Cicirello","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,7,24]]},"reference":[{"issue":"1","key":"7_CR1","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1287\/ijoc.1030.0057","volume":"17","author":"V Campos","year":"2005","unstructured":"Campos, V., Laguna, M., Mart\u00ed, R.: Context-independent Scatter and Tabu search for permutation problems. INFORMS Comput. 17(1), 111\u2013122 (2005)","journal-title":"INFORMS Comput."},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Caprara, A.: Sorting by reversals is difficult. In: Proceedings of the First International Conference on Computational Molecular Biology, pp. 75\u201383. ACM (1997)","DOI":"10.1145\/267521.267531"},{"key":"7_CR3","doi-asserted-by":"publisher","unstructured":"Cicirello, V.A.: On the effects of window-limits on the distance profiles of permutation neighborhood operators. In: Proceedings of the International Conference on Bioinspired Information and Communications Technologies, pp. 28\u201335, December 2014. https:\/\/doi.org\/10.4108\/icst.bict.2014.257872","DOI":"10.4108\/icst.bict.2014.257872"},{"issue":"3","key":"7_CR4","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1109\/TEVC.2015.2477284","volume":"20","author":"VA Cicirello","year":"2016","unstructured":"Cicirello, V.A.: The permutation in a haystack problem and the calculus of search landscapes. IEEE Trans. Evol. Comput. 20(3), 434\u2013446 (2016). https:\/\/doi.org\/10.1109\/TEVC.2015.2477284","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"31","key":"7_CR5","doi-asserted-by":"publisher","first-page":"950","DOI":"10.21105\/joss.00950","volume":"3","author":"VA Cicirello","year":"2018","unstructured":"Cicirello, V.A.: JavaPermutationTools: a Java library of permutation distance metrics. J. Open Source Softw. 3(31), 950 (2018). https:\/\/doi.org\/10.21105\/joss.00950","journal-title":"J. Open Source Softw."},{"key":"7_CR6","unstructured":"Cicirello, V.A., Cernera, R.: Profiling the distance characteristics of mutation operators for permutation-based genetic algorithms. In: Proceedings of the 26th International Conference of the Florida Artificial Intelligence Research Society, pp. 46\u201351. AAAI Press, May 2013"},{"issue":"1","key":"7_CR7","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1137\/S0895480102412856","volume":"17","author":"R Fagin","year":"2003","unstructured":"Fagin, R., Kumar, R., Sivakumar, D.: Comparing top k lists. SIAM J. Discret. Math. 17(1), 134\u2013160 (2003)","journal-title":"SIAM J. Discret. Math."},{"issue":"2","key":"7_CR8","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1109\/TEVC.2015.2433680","volume":"20","author":"L Hernando","year":"2016","unstructured":"Hernando, L., Mendiburu, A., Lozano, J.A.: A tunable generator of instances of permutation-based combinatorial optimization problems. IEEE Trans. Evol. Comput. 20(2), 165\u2013179 (2016)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"5","key":"7_CR9","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1145\/359581.359603","volume":"20","author":"JW Hunt","year":"1977","unstructured":"Hunt, J.W., Szymanski, T.G.: A fast algorithm for computing longest common subsequences. Commun. ACM 20(5), 350\u2013353 (1977)","journal-title":"Commun. ACM"},{"key":"7_CR10","unstructured":"Jones, T., Forrest, S.: Fitness distance correlation as a measure of problem difficulty for genetic algorithms. In: Proceedings of the 6th International Conference on Genetic Algorithms, pp. 184\u2013192. Morgan Kaufmann (1995)"},{"issue":"1\/2","key":"7_CR11","doi-asserted-by":"publisher","first-page":"81","DOI":"10.2307\/2332226","volume":"30","author":"MG Kendall","year":"1938","unstructured":"Kendall, M.G.: A new measure of rank correlation. Biometrika 30(1\/2), 81\u201393 (1938)","journal-title":"Biometrika"},{"issue":"2","key":"7_CR12","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1109\/TIT.1958.1057446","volume":"4","author":"C Lee","year":"1958","unstructured":"Lee, C.: Some properties of nonbinary error-correcting codes. IRE Trans. Inf. Theory 4(2), 77\u201382 (1958)","journal-title":"IRE Trans. Inf. Theory"},{"issue":"8","key":"7_CR13","first-page":"707","volume":"10","author":"VI Levenshtein","year":"1966","unstructured":"Levenshtein, V.I.: Binary codes capable of correcting deletions, insertions and reversals. Sov. Phys. Dokl. 10(8), 707\u2013710 (1966)","journal-title":"Sov. Phys. Dokl."},{"key":"7_CR14","first-page":"3481","volume":"11","author":"M Meil\u0103","year":"2010","unstructured":"Meil\u0103, M., Bao, L.: An exponential model for infinite rankings. J. Mach. Learn. Res. 11, 3481\u20133518 (2010)","journal-title":"J. Mach. Learn. Res."},{"key":"7_CR15","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/3927.001.0001","volume-title":"An Introduction to Genetic Algorithms","author":"M Mitchell","year":"1998","unstructured":"Mitchell, M.: An Introduction to Genetic Algorithms. MIT Press, Cambridge (1998)"},{"key":"7_CR16","unstructured":"Ronald, S.: Finding multiple solutions with an evolutionary algorithm. In: IEEE Congress on Evolutionary Computation, pp. 641\u2013646. IEEE Press (1995)"},{"key":"7_CR17","unstructured":"Ronald, S.: Distance functions for order-based encodings. In: Proceedings of the IEEE Congress on Evolutionary Computation, pp. 49\u201354. IEEE Press (1997)"},{"key":"7_CR18","unstructured":"Ronald, S.: More distance functions for order-based encodings. In: Proceedings of the IEEE Congress on Evolutionary Computation, pp. 558\u2013563. IEEE Press (1998)"},{"issue":"10","key":"7_CR19","doi-asserted-by":"publisher","first-page":"3143","DOI":"10.1016\/j.cor.2005.11.022","volume":"34","author":"T Schiavinotto","year":"2007","unstructured":"Schiavinotto, T., St\u00fctzle, T.: A review of metrics on permutations for search landscape analysis. Comput. Oper. Res. 34(10), 3143\u20133153 (2007)","journal-title":"Comput. Oper. Res."},{"key":"7_CR20","unstructured":"Sevaux, M., S\u00f6rensen, K.: Permutation distance measures for memetic algorithms with population management. In: Proceedings of the Metaheuristics International Conference (MIC 2005), pp. 832\u2013838, August 2005"},{"issue":"1","key":"7_CR21","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/s10732-006-9001-3","volume":"13","author":"K S\u00f6rensen","year":"2007","unstructured":"S\u00f6rensen, K.: Distance measures based on the edit distance for permutation-type representations. J. Heuristics 13(1), 35\u201347 (2007)","journal-title":"J. Heuristics"},{"issue":"3","key":"7_CR22","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1109\/TEVC.2013.2281502","volume":"18","author":"MH Tayarani-N","year":"2014","unstructured":"Tayarani-N, M.H., Prugel-Bennett, A.: On the landscape of combinatorial optimization problems. IEEE Trans. Evol. Comput. 18(3), 420\u2013434 (2014). https:\/\/doi.org\/10.1109\/TEVC.2013.2281502","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"1","key":"7_CR23","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1145\/321796.321811","volume":"21","author":"RA Wagner","year":"1974","unstructured":"Wagner, R.A., Fischer, M.J.: The string-to-string correction problem. J. ACM 21(1), 168\u2013173 (1974)","journal-title":"J. ACM"},{"issue":"2","key":"7_CR24","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1093\/genetics\/16.2.97","volume":"16","author":"S Wright","year":"1931","unstructured":"Wright, S.: Evolution in Mendelian populations. Genetics 16(2), 97\u2013159 (1931)","journal-title":"Genetics"}],"container-title":["Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","Bio-inspired Information and Communication Technologies"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-24202-2_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,24]],"date-time":"2022-09-24T10:57:50Z","timestamp":1664017070000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-24202-2_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030242015","9783030242022"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-24202-2_7","relation":{},"ISSN":["1867-8211","1867-822X"],"issn-type":[{"type":"print","value":"1867-8211"},{"type":"electronic","value":"1867-822X"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"24 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"BICT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Bio-inspired Information and Communication","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pittsburgh, PA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 March 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 March 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aicon12019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/bionetics.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}