Extending distance-based ranking models in estimation of distribution algorithms

Recently, probability models on rankings have been proposed in the field of estimation of distribution algorithms in order to solve permutation-based combinatorial optimisation problems. Particularly, distance-based ranking models, such as Mallows and Generalized Mallows under the Kendall's-τ distance, have demonstrated their validity when solving this type of problems. Nevertheless, there are still many trends that deserve further study. In this paper, we extend the use of distance-based ranking models in the framework of EDAs by introducing new distance metrics such as Cayley and Ulam. In order to analyse the performance of the Mallows and Generalized Mallows EDAs under the Kendall, Cayley and Ulam distances, we run them on a benchmark of 120 instances from four well known permutation problems. The conducted experiments showed that there is not just one metric that performs the best in all the problems. However, the statistical test pointed out that Mallows-Ulam EDA is the most stable algorithm among the studied proposals.

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

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

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

[4]  Pedro Larrañaga,et al.  A Review on Estimation of Distribution Algorithms , 2002, Estimation of Distribution Algorithms.

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

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

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

[8]  Camelia-Mihaela Pintea,et al.  Solving the linear ordering problem using ant models , 2009, GECCO '09.

[9]  E. Lawler.  The Quadratic Assignment Problem , 1963 .

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

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

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

[13]  Ariel D. Procaccia,et al.  When do noisy votes reveal the truth? , 2013, EC '13.

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

[15]  Fred W. Glover,et al.  Construction Heuristics and Domination Analysis for the Asymmetric TSP , 1999, WAE.

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

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

[18]  Roberto Santana,et al.  On the Taxonomy of Optimization Problems Under Estimation of Distribution Algorithms , 2013, Evolutionary Computation.

[19]  Panos M. Pardalos,et al.  Quadratic Assignment Problem , 1997, Encyclopedia of Optimization.

[20]  Jung Woo Jung,et al.  Flowshop-scheduling problems with makespan criterion: a review , 2005 .

[21]  Marina Meila,et al.  Experiments with Kemeny ranking: What works when? , 2012, Math. Soc. Sci..

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

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

[24]  Alexander Mendiburu,et al.  Understanding Instance Complexity in the Linear Ordering Problem , 2013, IDEAL.

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

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

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

[28]  Pedro Larrañaga,et al.  Genetic Algorithms for the Travelling Salesman Problem: A Review of Representations and Operators , 1999, Artificial Intelligence Review.

[29]  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.

[30]  E. Hüllermeier,et al.  A Simple Instance-Based Approach to Multilabel Classification Using the Mallows Model , 2009 .

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

[32]  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).

[33]  José A. Gámez,et al.  Tackling the rank aggregation problem with evolutionary algorithms , 2013, Appl. Math. Comput..

[34]  M. Fligner,et al.  Distance Based Ranking Models , 1986 .

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

[36]  H. Mühlenbein,et al.  From Recombination of Genes to the Estimation of Distributions I. Binary Parameters , 1996, PPSN.

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

[38]  C. L. Mallows.  NON-NULL RANKING MODELS. I , 1957 .

[39]  Thomas Stützle,et al.  Iterated local search for the quadratic assignment problem , 2006, Eur. J. Oper. Res..

[40]  Mehmet Fatih Tasgetiren,et al.  A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem , 2007, Eur. J. Oper. Res..

[41]  Joseph S. Verducci,et al.  Probability models on rankings. , 1991 .

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

[43]  Jean-Marie Proth,et al.  A branch-and-bound algorithm for n-job two machine flow shop scheduling problems , 1995, Proceedings 1995 INRIA/IEEE Symposium on Emerging Technologies and Factory Automation. ETFA'95.

[44]  Leonidas J. Guibas,et al.  Fourier Theoretic Probabilistic Inference over Permutations , 2009, J. Mach. Learn. Res..

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