Introducing the Mallows Model on Estimation of Distribution Algorithms

Estimation of Distribution Algorithms are a set of algorithms that belong to the field of Evolutionary Computation. Characterized by the use of probabilistic models to learn the (in)dependencies between the variables of the optimization problem, these algorithms have been applied to a wide set of academic and real-world optimization problems, achieving competitive results in most scenarios. However, they have not been extensively developed for permutation-based problems. In this paper we introduce a new EDA approach specifically designed to deal with permutation-based problems. In this paper, our proposal estimates a probability distribution over permutations by means of a distance-based exponential model called the Mallows model. In order to analyze the performance of the Mallows model in EDAs, we carry out some experiments over the Permutation Flowshop Scheduling Problem (PFSP), and compare the results with those obtained by two state-of-the-art EDAs for permutation-based problems.

[1]  Shigeyoshi Tsutsui,et al.  Probabilistic Model-Building Genetic Algorithms in Permutation Representation Domain Using Edge Histogram , 2002, PPSN.

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

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

[4]  James C. Bean,et al.  Genetic Algorithms and Random Keys for Sequencing and Optimization , 1994, INFORMS J. Comput..

[5]  Isabelle Bloch,et al.  Inexact graph matching by means of estimation of distribution algorithms , 2002, Pattern Recognit..

[6]  Dirk Thierens,et al.  Permutation Optimization by Iterated Estimation of Random Keys Marginal Product Factorizations , 2002, PPSN.

[7]  David E. Goldberg,et al.  Genetic Algorithms, Clustering, and the Breaking of Symmetry , 2000, PPSN.

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

[9]  Jeff A. Bilmes,et al.  Consensus ranking under the exponential model , 2007, UAI.

[10]  Jatinder N. D. Gupta,et al.  Flowshop scheduling research after five decades , 2006, Eur. J. Oper. Res..

[11]  Jose A. Lozano,et al.  Estimation of Distribution Algorithms Applied to the Job Shop Scheduling Problem: Some Preliminary Research , 2002, Estimation of Distribution Algorithms.

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

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

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

[15]  Alexander Mendiburu,et al.  A preliminary study on EDAs for permutation problems based on marginal-based models , 2011, GECCO '11.

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

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

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

[19]  Yoram Singer,et al.  Learning to Order Things , 1997, NIPS.

[20]  Dirk Thierens,et al.  Crossing the road to efficient IDEAs for permutation problems , 2001 .

[21]  Pedro Larrañaga,et al.  Triangulation of Bayesian networks with recursive estimation of distribution algorithms , 2009, Int. J. Approx. Reason..