New IDEAs and more ICE by learning and using unconditional permutation factorizations

Solving permutation optimization problems is an important and open research question. Using continuous iterated density estimation evolutionary algorithms (IDEAs) in combination with crossover from genetic algorithms (GAs) has recently [5] been shown to give promising results. In IDEAs, the probability distribution of the solutions is estimated based upon a selection of solutions. So far, only continuous probability theory has been applied to a continuous encoding of permutations. In this paper, we show how we can estimate and use unconditional factorization distributions in the space of permutations directly. We show that the resulting IDEAs process the permutation linkage information more effectively than previously used continuous IDEAs. As a result, deceptive permutation optimization problems of a bounded order can be solved more efficiently.

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

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

[3]  P. Bosman,et al.  Negative log-likelihood and statistical hypothesis testing as the basis of model selection in IDEAs , 2000 .

[4]  David E. Goldberg,et al.  Large-Scale Permutation Optimization with the Ordering Messy Genetic Algorithm , 2000, PPSN.

[5]  Marcus Gallagher,et al.  Real-valued Evolutionary Optimization using a Flexible Probability Density Estimator , 1999, GECCO.

[6]  D. Goldberg,et al.  BOA: the Bayesian optimization algorithm , 1999 .

[7]  Dirk Thierens,et al.  Linkage Information Processing In Distribution Estimation Algorithms , 1999, GECCO.

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

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

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

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

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

[13]  David E. Goldberg,et al.  Bayesian optimization algorithm, decision graphs, and Occam's razor , 2001 .

[14]  Kalyanmoy Deb,et al.  RapidAccurate Optimization of Difficult Problems Using Fast Messy Genetic Algorithms , 1993, ICGA.