Permutation Optimization by Iterated Estimation of Random Keys Marginal Product Factorizations

In IDEAs, the probability distribution of a selection of solutions is estimated each generation. From this probability distribution, new solutions are drawn. Through the probability distribution, various relations between problem variables can be exploited to achieve efficient optimization. For permutation optimization, only real valued probability distributions have been applied to a real valued encoding of permutations. In this paper, we present two approaches to estimating marginal product factorized probability distributions in the space of permutations directly. The estimated probability distribution is used to identify crossover positions in a real valued encoding of permutations. The resulting evolutionary algorithm (EA) is capable of more efficient scalable optimization of deceptive permutation problems of a bounded order of difficulty than when real valued probability distributions are used.

[1]  Heinz Mühlenbein,et al.  FDA -A Scalable Evolutionary Algorithm for the Optimization of Additively Decomposed Functions , 1999, Evolutionary Computation.

[2]  D. Goldberg,et al.  Escaping hierarchical traps with competent genetic algorithms , 2001 .

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

[4]  Byoung-Tak Zhang,et al.  Bayesian evolutionary algorithms for continuous function optimization , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

[5]  Dirk Thierens,et al.  Random Keys on ICE: Marginal Product Factorized Probability Distributions in Permutation Optimization , 2002 .

[6]  Dirk Thierens,et al.  Advancing continuous IDEAs with mixture distributions and factorization selection metrics , 2001 .

[7]  Dirk Thierens,et al.  Mixing in Genetic Algorithms , 1993, ICGA.

[8]  R. Santana,et al.  The mixture of trees Factorized Distribution Algorithm , 2001 .

[9]  Heinz Mühlenbein,et al.  A Factorized Distribution Algorithm Using Single Connected Bayesian Networks , 2000, PPSN.

[10]  Nir Friedman,et al.  Learning Bayesian Networks with Local Structure , 1996, UAI.

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

[12]  Kalyanmoy Deb,et al.  Ordering Genetic Algorithms and Deception , 1992, PPSN.

[13]  E. Cantu-Paz,et al.  The Gambler's Ruin Problem, Genetic Algorithms, and the Sizing of Populations , 1997, Evolutionary Computation.

[14]  D. Goldberg,et al.  Linkage learning through probabilistic expression , 2000 .

[15]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

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