Abstract
In this paper, we explore the theory and expand upon the practice of fitness landscape analysis for optimization problems over the space of permutations. Many of the computational and analytical tools for fitness landscape analysis, such as fitness distance correlation, require identifying a distance metric for measuring the similarity of different solutions to the problem. We begin with a survey of the available distance metrics for permutations, and then use principal component analysis to classify these metrics. The result of this analysis aligns with existing classifications of permutation problem types produced through less formal means, including the A-permutation, R-permutation, and P-permutation types, which classifies problems by whether absolute position of permutation elements, relative positions of elements, or general precedence of pairs of elements, is the dominant influence over solution fitness. Additionally, the formal analysis identifies subtypes within these problem categories. We see that the classification can assist in identifying appropriate metrics based on optimization problem feature for use in fitness landscape analysis. Using optimization problems of each class, we also demonstrate how the classification scheme can subsequently inform the choice of mutation operator within an evolutionary algorithm. From this, we present a classification of a variety of mutation operators as a counterpart to that of the metrics. Our implementations of the permutation metrics, permutation mutation operators, and associated evolutionary algorithm, are available in a pair of open source Java libraries. All of the code necessary to recreate our analysis and experimental results are also available as open source.
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs11036-022-02060-z/MediaObjects/11036_2022_2060_Fig1_HTML.png)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs11036-022-02060-z/MediaObjects/11036_2022_2060_Fig2_HTML.png)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs11036-022-02060-z/MediaObjects/11036_2022_2060_Fig3_HTML.png)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs11036-022-02060-z/MediaObjects/11036_2022_2060_Fig4_HTML.png)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs11036-022-02060-z/MediaObjects/11036_2022_2060_Fig5_HTML.png)
Similar content being viewed by others
Data Availability
Raw and processed data produced by the experiments is available: https://github.com/cicirello/MONE2022-experiments.
Code Availability
Code available at: https://github.com/cicirello/MONE2022-experiments.
References
Ackley DH (1985) A connectionist algorithm for genetic search. In: ICGA. pp 121–135
Baker J (1987) Reducing bias and inefficiency in the selection algorithm. In: ICGA. pp 14–21
Campos V, Laguna M, Marti R (2005) Context-independent scatter and tabu search for permutation problems. INFORMS J Comput 17(1):111–122
Caprara A (1997) Sorting by reversals is difficult. In: Proc Int Conf Comput Mol Biol. pp 75–83
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–35 https://doi.org/10.4108/icst.bict.2014.257872
Cicirello VA (2016) The permutation in a haystack problem and the calculus of search landscapes. IEEE Trans Evol Comput 20(3):434–446. https://doi.org/10.1109/TEVC.2015.2477284
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
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–97 https://doi.org/10.1007/978-3-030-24202-2_7
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
Cicirello VA (2022) Cycle mutation: Evolving permutations via cycle induction. Appl Sci 12(11):5506. https://doi.org/10.3390/app12115506
Cicirello VA, Cernera R (2013) Profiling the distance characteristics of mutation operators for permutation-based genetic algorithms. In: FLAIRS-26. AAAI Press, pp 46–51
Fagin R, Kumar R, Sivakumar D (2003) Comparing top k lists. SIAM J Discrete Math 17(1):134–160
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–179
Hunt JW, Szymanski TG (1977) A fast algorithm for computing longest common subsequences. CACM 20(5):350–353
Jones T, Forrest S (1995) Fitness distance correlation as a measure of problem difficulty for genetic algorithms. In: ICGA. pp 184–192
Kendall MG (1938) A new measure of rank correlation. Biometrika 30(1/2):81–93
Lee C (1958) Some properties of nonbinary error-correcting codes. IRE Trans Inf Theory 4(2):77–82
Levenshtein VI (1966) Binary codes capable of correcting deletions, insertions and reversals. Soviet Phys Doklady 10(8):707–710
Lin S (1965) Computer solutions of the traveling salesman problem. Bell Syst Tech 44(10):2245–2269
Meilă M, Bao L (2010) An exponential model for infinite rankings. JMLR 11:3481–3518
Mitchell M (1998) An introduction to genetic algorithms. MIT Press, Cambridge
Reidys CM, Stadler PF (2002) Combinatorial landscapes. SIAM Rev 44(1):3–54
Ronald S (1995) Finding multiple solutions with an evolutionary algorithm. In: CEC. pp 641–646
Ronald S (1997) Distance functions for order-based encodings. In: CEC. pp 49–54
Ronald S (1998) More distance functions for order-based encodings. In: CEC. pp 558–563
Schiavinotto T, Stützle T (2007) A review of metrics on permutations for search landscape analysis. Comput Oper Res 34(10):3143–3153
Sevaux M, Sörensen K (2005) Permutation distance measures for memetic algorithms with population management. In: MIC. pp 832–838
Sörensen K (2007) Distance measures based on the edit distance for permutation-type representations. J Heuristics 13(1):35–47
Tayarani-N MH, Prugel-Bennett A (2014) On the landscape of combinatorial optimization problems. IEEE Trans Evol Comput 18(3):420–434
Wagner RA, Fischer MJ (1974) The string-to-string correction problem. JACM 21(1):168–173
Funding
Not applicable.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Ethical Approval
Not applicable.
Conflict of Interest / Competing Interests
The author declares that he has no conflict of interest.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Cicirello, V.A. On Fitness Landscape Analysis of Permutation Problems: From Distance Metrics to Mutation Operator Selection. Mobile Netw Appl 28, 507–517 (2023). https://doi.org/10.1007/s11036-022-02060-z
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11036-022-02060-z
Keywords
- Fitness landscape analysis
- Permutation distance
- Combinatorial optimization
- Fitness distance correlation
- Evolutionary algorithms
- Permutation mutation operators