{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,1]],"date-time":"2025-04-01T04:26:09Z","timestamp":1743481569203,"version":"3.37.3"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,11,8]],"date-time":"2022-11-08T00:00:00Z","timestamp":1667865600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,11,8]],"date-time":"2022-11-08T00:00:00Z","timestamp":1667865600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mobile Netw Appl"],"published-print":{"date-parts":[[2023,4]]},"DOI":"10.1007\/s11036-022-02060-z","type":"journal-article","created":{"date-parts":[[2022,11,8]],"date-time":"2022-11-08T07:42:39Z","timestamp":1667893359000},"page":"507-517","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["On Fitness Landscape Analysis of Permutation Problems: From Distance Metrics to Mutation Operator Selection"],"prefix":"10.1007","volume":"28","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":[[2022,11,8]]},"reference":[{"key":"2060_CR1","unstructured":"Ackley DH (1985) A connectionist algorithm for genetic search. In: ICGA. pp 121\u2013135"},{"key":"2060_CR2","unstructured":"Baker J (1987) Reducing bias and inefficiency in the selection algorithm. In: ICGA. pp 14\u201321"},{"issue":"1","key":"2060_CR3","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, Marti R (2005) Context-independent scatter and tabu search for permutation problems. INFORMS J Comput 17(1):111\u2013122","journal-title":"INFORMS J Comput"},{"key":"2060_CR4","doi-asserted-by":"crossref","unstructured":"Caprara A (1997) Sorting by reversals is difficult. In: Proc Int Conf Comput Mol Biol. pp 75\u201383","DOI":"10.1145\/267521.267531"},{"key":"2060_CR5","doi-asserted-by":"publisher","unstructured":"Cicirello VA (2014) On the effects of window-limits on the distance profiles of permutation neighborhood operators. In: Proc int conf on bioinspired information and communications technologies. pp 28\u201335 https:\/\/doi.org\/10.4108\/icst.bict.2014.257872","DOI":"10.4108\/icst.bict.2014.257872"},{"issue":"3","key":"2060_CR6","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1109\/TEVC.2015.2477284","volume":"20","author":"VA Cicirello","year":"2016","unstructured":"Cicirello VA (2016) The permutation in a haystack problem and the calculus of search landscapes. IEEE Trans Evol Comput 20(3):434\u2013446. https:\/\/doi.org\/10.1109\/TEVC.2015.2477284","journal-title":"IEEE Trans Evol Comput"},{"key":"2060_CR7","doi-asserted-by":"publisher","unstructured":"Cicirello VA (2018) JavaPermutationTools: A java library of permutation distance metrics. J Open Source Softw 3(31):950. https:\/\/doi.org\/10.21105\/joss.00950","DOI":"10.21105\/joss.00950"},{"key":"2060_CR8","doi-asserted-by":"publisher","unstructured":"Cicirello VA (2019) Classification of permutation distance metrics for fitness landscape analysis. In: Proc 11th int conf on bio-inspired information and communication technologies. Springer Nature, New York, pp 81\u201397 https:\/\/doi.org\/10.1007\/978-3-030-24202-2_7","DOI":"10.1007\/978-3-030-24202-2_7"},{"issue":"52","key":"2060_CR9","doi-asserted-by":"publisher","first-page":"2448","DOI":"10.21105\/joss.02448","volume":"5","author":"VA Cicirello","year":"2020","unstructured":"Cicirello VA (2020) Chips-n-Salsa: A java library of customizable, hybridizable, iterative, parallel, stochastic, and self-adaptive local search algorithms. J Open Source Softw 5(52):2448. https:\/\/doi.org\/10.21105\/joss.02448","journal-title":"J Open Source Softw"},{"issue":"11","key":"2060_CR10","doi-asserted-by":"publisher","first-page":"5506","DOI":"10.3390\/app12115506","volume":"12","author":"VA Cicirello","year":"2022","unstructured":"Cicirello VA (2022) Cycle mutation: Evolving permutations via cycle induction. Appl Sci 12(11):5506. https:\/\/doi.org\/10.3390\/app12115506","journal-title":"Appl Sci"},{"key":"2060_CR11","unstructured":"Cicirello VA, Cernera R (2013) Profiling the distance characteristics of mutation operators for permutation-based genetic algorithms. In: FLAIRS-26. AAAI Press, pp 46\u201351"},{"issue":"1","key":"2060_CR12","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 (2003) Comparing top k lists. SIAM J Discrete Math 17(1):134\u2013160","journal-title":"SIAM J Discrete Math"},{"issue":"2","key":"2060_CR13","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 JA (2016) A tunable generator of instances of permutation-based combinatorial optimization problems. IEEE Trans Evol Comput 20(2):165\u2013179","journal-title":"IEEE Trans Evol Comput"},{"issue":"5","key":"2060_CR14","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1145\/359581.359603","volume":"20","author":"JW Hunt","year":"1977","unstructured":"Hunt JW, Szymanski TG (1977) A fast algorithm for computing longest common subsequences. CACM 20(5):350\u2013353","journal-title":"CACM"},{"key":"2060_CR15","unstructured":"Jones T, Forrest S (1995) Fitness distance correlation as a measure of problem difficulty for genetic algorithms. In: ICGA. pp 184\u2013192"},{"issue":"1\/2","key":"2060_CR16","doi-asserted-by":"publisher","first-page":"81","DOI":"10.2307\/2332226","volume":"30","author":"MG Kendall","year":"1938","unstructured":"Kendall MG (1938) A new measure of rank correlation. Biometrika 30(1\/2):81\u201393","journal-title":"Biometrika"},{"issue":"2","key":"2060_CR17","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1109\/TIT.1958.1057446","volume":"4","author":"C Lee","year":"1958","unstructured":"Lee C (1958) Some properties of nonbinary error-correcting codes. IRE Trans Inf Theory 4(2):77\u201382","journal-title":"IRE Trans Inf Theory"},{"issue":"8","key":"2060_CR18","first-page":"707","volume":"10","author":"VI Levenshtein","year":"1966","unstructured":"Levenshtein VI (1966) Binary codes capable of correcting deletions, insertions and reversals. Soviet Phys Doklady 10(8):707\u2013710","journal-title":"Soviet Phys Doklady"},{"issue":"10","key":"2060_CR19","doi-asserted-by":"publisher","first-page":"2245","DOI":"10.1002\/j.1538-7305.1965.tb04146.x","volume":"44","author":"S Lin","year":"1965","unstructured":"Lin S (1965) Computer solutions of the traveling salesman problem. Bell Syst Tech 44(10):2245\u20132269","journal-title":"Bell Syst Tech"},{"key":"2060_CR20","first-page":"3481","volume":"11","author":"M Meil\u0103","year":"2010","unstructured":"Meil\u0103 M, Bao L (2010) An exponential model for infinite rankings. JMLR 11:3481\u20133518","journal-title":"JMLR"},{"key":"2060_CR21","doi-asserted-by":"crossref","unstructured":"Mitchell M (1998) An introduction to genetic algorithms. MIT Press, Cambridge","DOI":"10.7551\/mitpress\/3927.001.0001"},{"key":"2060_CR22","doi-asserted-by":"crossref","unstructured":"Reidys CM, Stadler PF (2002) Combinatorial landscapes. SIAM Rev 44(1):3\u201354","DOI":"10.1137\/S0036144501395952"},{"key":"2060_CR23","doi-asserted-by":"crossref","unstructured":"Ronald S (1995) Finding multiple solutions with an evolutionary algorithm. In: CEC. pp 641\u2013646","DOI":"10.1109\/ICEC.1995.487459"},{"key":"2060_CR24","doi-asserted-by":"crossref","unstructured":"Ronald S (1997) Distance functions for order-based encodings. In: CEC. pp 49\u201354","DOI":"10.1109\/ICEC.1997.592266"},{"key":"2060_CR25","doi-asserted-by":"crossref","unstructured":"Ronald S (1998) More distance functions for order-based encodings. In: CEC. pp 558\u2013563","DOI":"10.1109\/ICEC.1998.700089"},{"issue":"10","key":"2060_CR26","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 (2007) A review of metrics on permutations for search landscape analysis. Comput Oper Res 34(10):3143\u20133153","journal-title":"Comput Oper Res"},{"key":"2060_CR27","unstructured":"Sevaux M, S\u00f6rensen K (2005) Permutation distance measures for memetic algorithms with population management. In: MIC. pp 832\u2013838"},{"issue":"1","key":"2060_CR28","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 (2007) Distance measures based on the edit distance for permutation-type representations. J Heuristics 13(1):35\u201347","journal-title":"J Heuristics"},{"issue":"3","key":"2060_CR29","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1109\/TEVC.2013.2281502","volume":"18","author":"MH Tayarani-N","year":"2014","unstructured":"Tayarani-N MH, Prugel-Bennett A (2014) On the landscape of combinatorial optimization problems. IEEE Trans Evol Comput 18(3):420\u2013434","journal-title":"IEEE Trans Evol Comput"},{"issue":"1","key":"2060_CR30","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1145\/321796.321811","volume":"21","author":"RA Wagner","year":"1974","unstructured":"Wagner RA, Fischer MJ (1974) The string-to-string correction problem. JACM 21(1):168\u2013173","journal-title":"JACM"}],"container-title":["Mobile Networks and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11036-022-02060-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11036-022-02060-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11036-022-02060-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,2]],"date-time":"2024-04-02T15:26:09Z","timestamp":1712071569000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11036-022-02060-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,8]]},"references-count":30,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,4]]}},"alternative-id":["2060"],"URL":"https:\/\/doi.org\/10.1007\/s11036-022-02060-z","relation":{},"ISSN":["1383-469X","1572-8153"],"issn-type":[{"type":"print","value":"1383-469X"},{"type":"electronic","value":"1572-8153"}],"subject":[],"published":{"date-parts":[[2022,11,8]]},"assertion":[{"value":"8 August 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 November 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical Approval"}},{"value":"The author declares that he has no conflict of interest.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest \/ Competing Interests"}}]}}