A review of distances for the Mallows and Generalized Mallows estimation of distribution algorithms

The Mallows (MM) and the Generalized Mallows (GMM) probability models have demonstrated their validity in the framework of Estimation of distribution algorithms (EDAs) for solving permutation-based combinatorial optimisation problems. Recent works, however, have suggested that the performance of these algorithms strongly relies on the distance used under the model. The goal of this paper is to review three common distances for permutations, Kendall’s-$$\tau $$τ, Cayley and Ulam, and compare their performance under MM and GMM EDAs. Moreover, with the aim of predicting the most suitable distance for solving any given permutation problem, we focus our attention on the relation between these distances and the neighbourhood systems in the field of local search optimisation. In this sense, we demonstrate that the performance of the MM and GMM EDAs is strongly correlated with that of multistart local search algorithms when using related neighbourhoods. Furthermore, by means of fitness landscape analysis techniques, we show that the suitability of a distance to solve a problem is clearly characterised by the generation of high smoothness fitness landscapes.

[1]  S. García,et al.  An Extension on "Statistical Comparisons of Classifiers over Multiple Data Sets" for all Pairwise Comparisons , 2008 .

[2]  Thomas Stützle,et al.  The linear ordering problem: Instances, search space analysis and algorithms , 2004, J. Math. Model. Algorithms.

[3]  David E. Goldberg,et al.  A Survey of Optimization by Building and Using Probabilistic Models , 2002, Comput. Optim. Appl..

[4]  Rafael Martí.  Multi-Start Methods , 2003, Handbook of Metaheuristics.

[5]  S. Tsutsui,et al.  Solving capacitated vehicle routing problems using edge histogram based sampling algorithms , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

[6]  Gwilym M. Jenkins,et al.  Time series analysis, forecasting and control , 1972 .

[7]  Alexander Mendiburu,et al.  The linear ordering problem revisited , 2015, Eur. J. Oper. Res..

[8]  M. Fligner,et al.  Multistage Ranking Models , 1988 .

[9]  Pedro Larrañaga,et al.  Feature Subset Selection by Estimation of Distribution Algorithms , 2002, Estimation of Distribution Algorithms.

[10]  Pedro Larrañaga,et al.  Estimation of Distribution Algorithms , 2002, Genetic Algorithms and Evolutionary Computation.

[11]  J. A. Lozano,et al.  Towards a New Evolutionary Computation: Advances on Estimation of Distribution Algorithms (Studies in Fuzziness and Soft Computing) , 2006 .

[12]  Gerhard Reinelt,et al.  The Linear Ordering Problem: Exact and Heuristic Methods in Combinatorial Optimization , 2011 .

[13]  David E. Goldberg,et al.  Alleles, loci and the traveling salesman problem , 1985 .

[14]  Pedro Larrañaga,et al.  Combining variable neighborhood search and estimation of distribution algorithms in the protein side chain placement problem , 2007, J. Heuristics.

[15]  Gwilym M. Jenkins,et al.  Time series analysis, forecasting and control , 1971 .

[16]  Ekhine Irurozki,et al.  Sampling and learning the Mallows model under the Ulam distance , 2014 .

[17]  J. A. Lozano,et al.  Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation , 2001 .

[18]  Concha Bielza,et al.  Mateda-2.0: A MATLAB package for the implementation and analysis of estimation of distribution algorithms , 2010 .

[19]  Ekhine Irurozki,et al.  An R package for permutations, Mallows and Generalized Mallows models , 2014 .

[20]  Alexander Mendiburu,et al.  A Distance-Based Ranking Model Estimation of Distribution Algorithm for the Flowshop Scheduling Problem , 2014, IEEE Transactions on Evolutionary Computation.

[21]  Concha Bielza,et al.  Mateda-2.0: Estimation of Distribution Algorithms in MATLAB , 2010 .

[22]  David E. Goldberg,et al.  AllelesLociand the Traveling Salesman Problem , 1985, ICGA.

[23]  Julian Francis Miller,et al.  Information Characteristics and the Structure of Landscapes , 2000, Evolutionary Computation.

[24]  T. Koopmans,et al.  Assignment Problems and the Location of Economic Activities , 1957 .

[25]  A. J. Clewett,et al.  Introduction to sequencing and scheduling , 1974 .

[26]  Thomas Stützle,et al.  A review of metrics on permutations for search landscape analysis , 2007, Comput. Oper. Res..

[27]  Alexander Mendiburu,et al.  The Plackett-Luce ranking model on permutation-based optimization problems , 2013, 2013 IEEE Congress on Evolutionary Computation.

[28]  E. Weinberger,et al.  Correlated and uncorrelated fitness landscapes and how to tell the difference , 1990, Biological Cybernetics.

[29]  Pedro Larrañaga,et al.  Protein Folding in Simplified Models With Estimation of Distribution Algorithms , 2008, IEEE Transactions on Evolutionary Computation.

[30]  Pedro Larrañaga,et al.  Solving the Traveling Salesman Problem with EDAs , 2002, Estimation of Distribution Algorithms.

[31]  Alexander Mendiburu,et al.  Introducing the Mallows Model on Estimation of Distribution Algorithms , 2011, ICONIP.

[32]  Francisco Herrera,et al.  A study on the use of non-parametric tests for analyzing the evolutionary algorithms’ behaviour: a case study on the CEC’2005 Special Session on Real Parameter Optimization , 2009, J. Heuristics.

[33]  Marina Meila,et al.  Tractable Search for Learning Exponential Models of Rankings , 2009, AISTATS.

[34]  Qingfu Zhang,et al.  An evolutionary algorithm with guided mutation for the maximum clique problem , 2005, IEEE Transactions on Evolutionary Computation.

[35]  Éric D. Taillard,et al.  Benchmarks for basic scheduling problems , 1993 .

[36]  Alexander Mendiburu,et al.  A review on estimation of distribution algorithms in permutation-based combinatorial optimization problems , 2012, Progress in Artificial Intelligence.

[37]  P. Diaconis.  Group representations in probability and statistics , 1988 .

[38]  Pedro Larrañaga,et al.  Towards a New Evolutionary Computation - Advances in the Estimation of Distribution Algorithms , 2006, Towards a New Evolutionary Computation.

[39]  Gerhard Reinelt,et al.  The Linear Ordering Problem , 2011 .

[40]  Bernard Manderick,et al.  The Genetic Algorithm and the Structure of the Fitness Landscape , 1991, ICGA.

[41]  Alexander Mendiburu,et al.  Extending distance-based ranking models in estimation of distribution algorithms , 2014, 2014 IEEE Congress on Evolutionary Computation (CEC).

[42]  Qingfu Zhang,et al.  Estimation of Distribution Algorithm with 2-opt Local Search for the Quadratic Assignment Problem , 2006, Towards a New Evolutionary Computation.