The Plackett-Luce ranking model on permutation-based optimization problems

Estimation of distribution algorithms are known as powerful evolutionary algorithms that have been widely used for diverse types of problems. However, they have not been extensively developed for permutation-based problems. Recently, some progress has been made in this area by introducing probability models on rankings to optimize permutation domain problems. In particular, the Mallows model and the Generalized Mallows model demonstrated their effectiveness when used with estimation of distribution algorithms. Motivated by these advances, in this paper we introduce a Thurstone order statistics model, called Plackett-Luce, to the framework of estimation of distribution algorithms. In order to prove the potential of the proposed algorithm, we consider two different permutation problems: the linear ordering problem and the flowshop scheduling problem. In addition, the results are compared with those obtained by the Mallows and the Generalized Mallows proposals. Conducted experiments demonstrate that the Plackett-Luce model is the best performing model for solving the linear ordering problem. However, according to the experimental results, the Generalized Mallows model turns out to be very robust obtaining very competitive results for both problems, especially for the permutation flowshop scheduling problem.

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

[2]  Hisashi Handa EDA-RL: estimation of distribution algorithms for reinforcement learning problems , 2009, GECCO '09.

[3]  John Guiver,et al.  Bayesian inference for Plackett-Luce ranking models , 2009, ICML '09.

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

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

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

[7]  Maria E. Orlowska,et al.  Finding the Optimal Path in 3D Spaces Using EDAs - The Wireless Sensor Networks Scenario , 2007, ICANNGA.

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

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

[10]  Alexander Mendiburu,et al.  Parallel EDAs to create multivariate calibration models for quantitative chemical applications , 2006, J. Parallel Distributed Comput..

[11]  David E. Goldberg,et al.  Node Histogram vs . Edge Histogram : A Comparison of PMBGAs in Permutation Domains , 2006 .

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

[13]  Martin Pelikan,et al.  Dependency trees, permutations, and quadratic assignment problem , 2007, GECCO '07.

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

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

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

[17]  T. Stützle,et al.  The Linear Ordering Problem: Instances, Search Space Analysis and Algorithms , 2004 .

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

[19]  R. Plackett The Analysis of Permutations , 1975 .

[20]  Qingfu Zhang,et al.  Combination of Guided Local Search and Estimation of Distribution Algorithm for Quadratic Assignment Problems , 2006 .

[21]  R. A. Bradley,et al.  Rank Analysis of Incomplete Block Designs: I. The Method of Paired Comparisons , 1952 .

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

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

[24]  A. K. Ziver,et al.  Estimation of distribution algorithms for nuclear reactor fuel management optimisation , 2006 .

[25]  Shingo Mabu,et al.  A Novel Graph-Based Estimation of the Distribution Algorithm and its Extension Using Reinforcement Learning , 2014, IEEE Transactions on Evolutionary Computation.

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

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

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

[29]  José Antonio Lozano,et al.  Scatter Search in software testing, comparison and collaboration with Estimation of Distribution Algorithms , 2006, Eur. J. Oper. Res..

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

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

[32]  Martin Pelikan,et al.  An application of a multivariate estimation of distribution algorithm to cancer chemotherapy , 2008, GECCO '08.

[33]  D. Hunter MM algorithms for generalized Bradley-Terry models , 2003 .

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

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

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

[37]  Quan-Ke Pan,et al.  An estimation of distribution algorithm for lot-streaming flow shop problems with setup times , 2012 .

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

[39]  Bassem Jarboui,et al.  An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems , 2009, Comput. Oper. Res..

[40]  Xiaoping Li,et al.  Estimation of distribution algorithm for permutation flow shops with total flowtime minimization , 2011, Comput. Ind. Eng..

[41]  R. Duncan Luce,et al.  Individual Choice Behavior , 1959 .

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

[43]  Mitsunori Miki,et al.  SOLVING FLOW SHOP SCHEDULING PROBLEMS WITH PROBABILISTIC MODEL-BUILDING GENETIC ALGORITHMS USING EDGE HISTOGRAMS , 2002 .

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