Advertisement

Parsimony Pressure versus Multi-objective Optimization for Variable Length Representations

  • Markus Wagner
  • Frank Neumann
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7491)

Abstract

We contribute to the theoretical understanding of variable length evolutionary algorithms. Such algorithms are very flexible but can encounter the bloat problem which means solutions grow during the optimization run without providing additional benefit. We explore two common mechanisms for dealing with this problem from a theoretical point of view and point out the differences of a parsimony and a multi-objective approach in a rigorous way. As an example to point out the differences, we consider different measures of sortedness for the classical sorting problem which has already been studied in the computational complexity analysis of evolutionary algorithms with fixed length representations.

Keywords

Evolutionary Algorithm Pareto Front Mutation Operator Correct Position Length Representation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Auger, A., Doerr, B. (eds.): Theory of Randomized Search Heuristics: Foundations and Recent Developments. World Scientific (2011)Google Scholar
  2. 2.
    Cathabard, S., Lehre, P.K., Yao, X.: Non-uniform mutation rates for problems with unknown solution lengths. In: FOGA, pp. 173–180. ACM, New York (2011)CrossRefGoogle Scholar
  3. 3.
    Durrett, G., Neumann, F., O’Reilly, U.-M.: Computational complexity analysis of simple genetic programing on two problems modeling isolated program semantics. In: FOGA, pp. 69–80. ACM (2011)Google Scholar
  4. 4.
    Friedrich, T., He, J., Hebbinghaus, N., Neumann, F., Witt, C.: Approximating covering problems by randomized search heuristics using multiobjective models. Evolutionary Computation 18(4), 617–633 (2010)CrossRefGoogle Scholar
  5. 5.
    Giel, O., Lehre, P.K.: On the effect of populations in evolutionary multiobjective optimisation. Evolutionary Computation 18(3), 335–356 (2010)CrossRefGoogle Scholar
  6. 6.
    Kötzing, T., Sutton, A., Neumann, F., O’Reilly, U.-M.: The Max problem revisited: the importance of mutation in genetic programming. In: GECCO (to appear, 2012)Google Scholar
  7. 7.
    Koza, J.R.: Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge (1992)zbMATHGoogle Scholar
  8. 8.
    Laumanns, M., Thiele, L., Zitzler, E.: Running time analysis of multiobjective evolutionary algorithms on pseudo-boolean functions. IEEE Trans. Evolutionary Computation 8(2), 170–182 (2004)CrossRefGoogle Scholar
  9. 9.
    Neumann, F.: Computational complexity analysis of multi-objective genetic programming. In: GECCO (to appear, 2012), http://arxiv.org/abs/1203.4881
  10. 10.
    Neumann, F., Wegener, I.: Minimum spanning trees made easier via multi-objective optimization. In: GECCO, pp. 763–770. ACM Press (2005)Google Scholar
  11. 11.
    Neumann, F., Witt, C.: Bioinspired Computation in Combinatorial Optimization – Algorithms and Their Computational Complexity. Springer (2010)Google Scholar
  12. 12.
    Scharnow, J., Tinnefeld, K., Wegener, I.: The analysis of evolutionary algorithms on sorting and shortest paths problems. Journal of Mathematical Modelling and Algorithms 3, 349–366 (2004)MathSciNetzbMATHCrossRefGoogle Scholar
  13. 13.
    Shukla, P.K., Deb, K.: On finding multiple Pareto-optimal solutions using classical and evolutionary generating methods. European Journal of Operational Research 181(3), 1630–1652 (2007)zbMATHCrossRefGoogle Scholar
  14. 14.
    Urli, T., Wagner, M., Neumann, F.: Experimental Supplements to the Computational Complexity Analysis of Genetic Programming for Problems Modelling Isolated Program Semantics. In: Coello Coello, C.A., et al. (eds.) PPSN 2012, Part I. LNCS, vol. 7491, pp. 102–112. Springer, Heidelberg (2012)Google Scholar
  15. 15.
    Wegener, I.: Methods for the analysis of evolutionary algorithms on pseudo-boolean functions. In: Evolutionary Optimization. International Series in Operations Research and Management Science, vol. 48, pp. 349–369. Springer, US (2003)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Markus Wagner
    • 1
  • Frank Neumann
    • 1
  1. 1.School of Computer ScienceUniversity of AdelaideAdelaideAustralia

Personalised recommendations