Crossing the road to efficient IDEAs for permutation problems

In this paper, we introduce the ICE framework in which crossover from genetic algorithms (GAs) is incorporated in iterated density estimation evolutionary algorithms (IDEAs). We focus on permutation optimization problems and show how pure continuous IDEAs can be applied using the random keys representation. The problems that are hereby encountered, motivate the use of ICE As a result, permutation linkage information is effectively processed, resulting in efficient optimization of deceptive permutation problems of a bounded order. Experiments show that ICE outperforms pure continuous IDEAs. Furthermore, we show that ICE gives insight into how new IDEAs can be designed that efficiently work directly in the permutation search space.

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

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

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

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

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

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

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

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

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

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

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

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

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