A review on estimation of distribution algorithms in permutation-based combinatorial optimization problems

Estimation of distribution algorithms (EDAs) are a set of algorithms that belong to the field of Evolutionary Computation. Characterized by the use of probabilistic models to represent the solutions and the dependencies between the variables of the problem, these algorithms have been applied to a wide set of academic and real-world optimization problems, achieving competitive results in most scenarios. Nevertheless, there are some optimization problems, whose solutions can be naturally represented as permutations, for which EDAs have not been extensively developed. Although some work has been carried out in this direction, most of the approaches are adaptations of EDAs designed for problems based on integer or real domains, and only a few algorithms have been specifically designed to deal with permutation-based problems. In order to set the basis for a development of EDAs in permutation-based problems similar to that which occurred in other optimization fields (integer and real-value problems), in this paper we carry out a thorough review of state-of-the-art EDAs applied to permutation-based problems. Furthermore, we provide some ideas on probabilistic modeling over permutation spaces that could inspire the researchers of EDAs to design new approaches for these kinds of problems.

[1]  S. Tsutsui Using Edge Histogram Models to Solve Permutation Problems with Probabilistic Model-Building Genetic Algorithms , 2012 .

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

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

[4]  A. A. Zhigli︠a︡vskiĭ,et al.  Theory of Global Random Search , 1991 .

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

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

[7]  Janez Demsar,et al.  Statistical Comparisons of Classifiers over Multiple Data Sets , 2006, J. Mach. Learn. Res..

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

[9]  P ? ? ? ? ? ? ? % ? ? ? ? , 1991 .

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

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

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

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

[14]  David E. Goldberg,et al.  OMEGA - Ordering Messy GA: Solving Permutation Problems with the Fast Genetic Algorithm and Random Keys , 2000, GECCO.

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

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

[17]  Martin Pelikan,et al.  Scalable Optimization via Probabilistic Modeling: From Algorithms to Applications (Studies in Computational Intelligence) , 2006 .

[18]  Max Henrion,et al.  Propagating uncertainty in bayesian networks by probabilistic logic sampling , 1986, UAI.

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

[20]  BayesiannetworksPedro,et al.  Combinatorial optimization by learning and simulation of , 2000 .

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

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

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

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

[25]  Shih-Hsin Chen,et al.  Bi-variate artificial chromosomes with genetic algorithm for single machine scheduling problems with sequence-dependent setup times , 2011, 2011 IEEE Congress of Evolutionary Computation (CEC).

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

[27]  Paul A. Viola,et al.  MIMIC: Finding Optima by Estimating Probability Densities , 1996, NIPS.

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

[29]  David E. Goldberg,et al.  Hierarchical Problem Solving and the Bayesian Optimization Algorithm , 2000, GECCO.

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

[31]  Shigeyoshi Tsutsui Effect of using partial solutions in edge histogram sampling algorithms with different local searches , 2009, 2009 IEEE International Conference on Systems, Man and Cybernetics.

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

[33]  Zizhuo Wang,et al.  Parimutuel Betting on Permutations , 2008, WINE.

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

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

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

[37]  C. N. Liu,et al.  Approximating discrete probability distributions with dependence trees , 1968, IEEE Trans. Inf. Theory.

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

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

[40]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

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

[42]  Alexander Mendiburu,et al.  Parallel implementation of EDAs based on probabilistic graphical models , 2005, IEEE Transactions on Evolutionary Computation.

[43]  Dirk Thierens,et al.  Expanding from Discrete to Continuous Estimation of Distribution Algorithms: The IDEA , 2000, PPSN.

[44]  Martin Pelikan,et al.  Scalable Optimization via Probabilistic Modeling , 2006, Studies in Computational Intelligence.

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

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

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

[48]  Pedro Larrañaga,et al.  Optimization in Continuous Domains by Learning and Simulation of Gaussian Networks , 2000 .

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

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

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

[52]  Liang Gao,et al.  A hybrid particle swarm optimization with estimation of distribution algorithm for solving permutation flowshop scheduling problem , 2011, Expert Syst. Appl..

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

[54]  Shigeyoshi Tsutsui,et al.  A Comparative Study of Sampling Methods in Node Histogram Models with Probabilistic Model-Building Genetic Algorithms , 2006, 2006 IEEE International Conference on Systems, Man and Cybernetics.

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

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

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

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

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

[60]  Yi Mao,et al.  Non-parametric Modeling of Partially Ranked Data , 2007, NIPS.

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