Optimization and Engineering

, Volume 12, Issue 3, pp 303–331 | Cite as

Planned tournament selection

  • Douglas McCorkle
  • Daniel Ashlock
  • Steven Corns
  • Kenneth Mark Bryden
Article

Abstract

Tournament selection is a versatile method of selection and replacement used in evolutionary computation. Normally tournaments are chosen uniformly at random. This study demonstrates the effectiveness of planning tournaments in advance to control information flow within a population being evolved for optimization. Tests are performed on a variety of evolutionary test problems, finding that different planned tournament schemes yield significant differences in performance. The correct type of planned tournament is found to be problem dependent. In addition to a linear-function scheme for planning tournaments, this study also introduces a technique called multi-deme planned tournaments selection which permits simpler cases of a problem to be automatically used to reduce the time required to solve more complex cases.

Keywords

Theory of evolutionary computation Spatially structured algorithms Optimization Test problems 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ackley DL, Littman ML (1993) A case for distributed Lamarckian evolution. In: Langton C, Taylor C, Farmer JD, Ramussen S (eds) Artificial life III: Santa Fe institute studies in the sciences of complexity, vol 10. Addison-Wesley, Redwood City Google Scholar
  2. Ashlock D (1997) GP-Automata for dividing the dollar. In: Proceedings of the 1997 congress on evolutionary computation. Kaufmann, San Francisco, pp 18–26 Google Scholar
  3. Ashlock D (2006) Evolutionary computation for opimization and modeling. Springer, New York Google Scholar
  4. Ashlock D, Joenks M (1998) ISAc lists, a different representation for program induction. In: Genetic programming 98, proceedings of the third annual genetic programming conference. Kaufmann, San Francisco, pp 3–10 Google Scholar
  5. Ashlock D, Lathrop JI (1998) A fully characterized test suite for genetic programming. In: Evolutionary programming VII. Springer, New York, pp 537–546 CrossRefGoogle Scholar
  6. Ashlock D, Lathrop J (2004). Program induction: building a wall. In: Proceedings of the 2004 congress on evolutionary computation. IEEE Press, New York, pp 1844–1850 Google Scholar
  7. Ashlock D, Sherk A (2005) Non-local adaptation of artificial predators and prey. In: Proceedings of the 2005 congress on evolutionary computation, vol 1, pp 98–105. IEEE Press, New York Google Scholar
  8. Ashlock A, Walker J, Smucker M (1999) Graph based genetic algorithms. In: Proceedings of the 1999 congress on evolutionary computation. Kaufmann, San Francisco, pp 1362–1368 Google Scholar
  9. Ashlock D, Bryden KM, Corns S, Schonfeld J (2006) An updated taxonomy of evolutionary computation problems using graph-based evolutionary algorithms. In: Proceedings of the 2006 congress on evolutionary computation, Piscataway, NJ. IEEE Press, New York, pp 403–410 Google Scholar
  10. Back T (1994). Selection pressure in evolutionary algorithms: a characterization of selection mechanisms. In: Proceedings of the first IEEE conference on evolutionary computation, Piscataway, NJ. IEEE Press, New York, pp 57–62 CrossRefGoogle Scholar
  11. Banzhaf W, Nordin P, Keller RE, Francone FD (1998) Genetic programming: an introduction. Kaufmann, San Francisco MATHGoogle Scholar
  12. Blickle T, Thiele L (1995) A mathematical analysis of tournament selection. In: Proceedings of the sixth international conference on genetic algorithms, Piscataway, NJ. IEEE Press, New York, pp 57–62 Google Scholar
  13. Blickle T, Thiele L (1997) A mathematical analysis of tournament selection. Evol Comput 4(4):361–394 CrossRefGoogle Scholar
  14. Bryden KM, Ashlock DA, Corns S, Willson SJ (2006) Graph based evolutionary algorithms. IEEE Trans Evol Comput 10:550–567 CrossRefGoogle Scholar
  15. Davidor Y, Yamada T, Nakano R (1993) The ecological framework. ii. Improving ga performance at virtually zero cost. In: Proceedings of the fifth international conference on genetic algorithms. Kaufmann, San Mateo, pp 171–176 Google Scholar
  16. Fogel LJ, Owens AJ, Walsh MJ (1965) Intelligent decision making through a simulation of evolution. Behav Sci 11(4):253–272 CrossRefGoogle Scholar
  17. Goldberg DE (1989). Genetic algorithms in search, optimization, and machine learning. Addison-Wesley, Reading MATHGoogle Scholar
  18. Ho S, Shu L, Chen J (2004) Intelligent evolutionary algorithms for large parameter optimization problems. IEEE Trans Evol Comput 8(6):522–541 CrossRefGoogle Scholar
  19. Jong KAD (1975) An analysis of the behavior of a class of genetic adaptive systems. PhD thesis, University of Michigan Google Scholar
  20. Kauffman SA (1993) The origins of order. Oxford University Press, New York Google Scholar
  21. Kinnear K (1994) Advances in genetic programming. MIT Press, Cambridge Google Scholar
  22. Koza JR (1992) Genetic programming. MIT Press, Cambridge MATHGoogle Scholar
  23. Motoki T (2002) Calculating the expected loss of diversity of selection schemes. Evol Comput 10(4):397–422 CrossRefGoogle Scholar
  24. Mühlenbein H (1991) Darwin’s continent cycle theory and its simulation by the prisoner’s dilemma. Complex Syst 5:459–478 MATHGoogle Scholar
  25. Poli R, Langdon WB (2005a) Backward chaining evolutionary algorithms. In: Proceeding of 2005 conference on genetic and evolutionary computation. ACM, New York, pp 1777–1778 CrossRefGoogle Scholar
  26. Poli R, Langdon WB (2005b) Tournament selection, iterated coupon-collection problem, and backward-chaining evolutionary algorithms. In: Proceedings of FOGA 8. ACM, New York, pp 132–155 Google Scholar
  27. Rana DWS, Heckendorn R (1997) Island model genetic algorithms and linearly separable problems. In: Corne D, Shapiro J (eds) Proceedings of AISB workshop on evolutionary computation. Springer, New York, pp 109–125 Google Scholar
  28. Sastry K, Goldberg D (2001) Modeling tournament selection with replacement using apparent added noise. In: Proceedings of ANNIE 2001. ASME Press, pp 129–134 Google Scholar
  29. Sokolov A, Whitley D (2005) Unbiased tournament selection. In: Proceeding of 2005 conference on genetic and evolutionary computation. ACM Press, New York, pp 1131–1138 CrossRefGoogle Scholar
  30. Teller A (1994) The evolution of mental models. In: Kinnear K (ed) Advances in genetic programming. MIT Press, Cambridge. Chap 9 Google Scholar
  31. Toffolo A, Benini E (2004) Genetic diversity as an objective in multi-objective evolutionary algorithms. Evol Comput 11(2):151–167 CrossRefGoogle Scholar
  32. West DB (1996) Introduction to graph theory. Prentice Hall, Upper Saddle River MATHGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2011

Authors and Affiliations

  • Douglas McCorkle
    • 1
  • Daniel Ashlock
    • 2
  • Steven Corns
    • 3
  • Kenneth Mark Bryden
    • 1
  1. 1.Department of Mechanical EngineeringIowa State UniversityAmesUSA
  2. 2.Department of Mathematics and StatisticsUniversity of GuelphGuelphCanada
  3. 3.Department of Engineering Management and Systems EngineeringMissouri University of Science and TechnologyRollaUSA

Personalised recommendations