Fda -a scalable evolutionary algorithm for the optimization of additively decomposed functions

  • Authors:

  • Heinz Mühlenbein;Thilo Mahnig

  • Affiliations:

  • Theoretical Foundation GMD Lab. Real World Computing Partnership GMD FZ Informationstechnik 53754 St. Augustin, Germany muehlenbein@gmd.de;Theoretical Foundation GMD Lab. Real World Computing Partnership GMD FZ Informationstechnik 53754 St. Augustin, Germany mahnig@gmd.de

  • Venue:
  • Evolutionary Computation
  • Year:
  • 1999

Quantified Score

Hi-index 0.00

Visualization

Abstract

The Factorized Distribution Algorithm (FDA) is an evolutionary algorithm which combines mutation and recombination by using a distribution. The distribution is estimated from a set of selected points. In general, a discrete distribution defined for n binary variables has 2n parameters. Therefore it is too expensive to compute. For additively decomposed discrete functions (ADFs) there exist algorithms which factor the distribution into conditional and marginal distributions. This factorization is used by FDA. The scaling of FDA is investigated theoretically and numerically. The scaling depends on the ADF structure and the specific assignment of function values. Difficult functions on a chain or a tree structure are solved in about O(n√n) operations. More standard genetic algorithms are not able to optimize these functions. FDA is not restricted to exact factorizations. It also works for approximate factorizations as is shown for a circle and a grid structure. By using results from Bayes networks, FDA is extended to LFDA. LFDA computes an approximate factorization using only the data, not the ADF structure. The scaling of LFDA is compared to the scaling of FDA.