Skip to main content

Advertisement

SpringerLink
Log in

Statistical properties analysis of real world tournament selection in genetic algorithms

  • Published:
Applied Intelligence Aims and scope Submit manuscript

Abstract

Genetic algorithms (GAs) are probabilistic optimization methods based on the biological principle of natural evolution. One of the important operators in GAs is the selection strategy for obtaining better solutions. Specifically, finding a balance between the selection pressure and diversity is a critical issue in designing an efficient selection strategy. To this extent, the recently proposed real world tournament selection (RWTS) method has showed good performance in various benchmark problems. In this paper, we focus on analyzing characteristics of RWTS from the viewpoint of both the selection probabilities and stochastic sampling properties in order to provide a rational explanation for why RWTS provides improved performance. Statistical experimental results show that RWTS has a higher selection pressure with a relatively small loss of diversity and higher sampling accuracy than conventional tournament selection. The performance tests in a traveling salesman problem further confirm that the comparatively higher pressure and sampling accuracy, which are inherent in RWTS, can enhance the performance in the selection strategy.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Holland JH (1975) Adaptation in natural and artificial system. University of Michigan Press, Ann Arbor

    Google Scholar 

  2. Baker JE (1985) Adaptive selection methods for genetic algorithms. In: Proceedings of the 1st international conference on genetic algorithms and their applications, pp 101–111

  3. Michalewicz Z (1992) Genetic algorithms + data structures = evolution programs. Springer, Berlin

    MATH  Google Scholar 

  4. Goldberg DE, Klösener KH (1991) A comparative analysis of selection schemes used in genetic algorithms. In: Rawlins G (ed) Foundation of genetic algorithms. Kaufmann, San Mateo, pp 69–93

    Google Scholar 

  5. Soak S, Corne D, Ahn B (2004) A powerful new encoding for tree-based combinatorial optimisation problems. In: Lecture notes in computer science, vol 3242, pp 430–439

  6. Soak S, Corne D, Ahn B (2004) A new encoding for the degree constrained minimum spanning tree problem. In: Lecture notes in computer science, vol 3213, pp 952–958

  7. Soak S, Corne D, Ahn B (2006) The edge-window-decoder representation for tree-based problem. IEEE Trans Evol Comput 10(2):124–144

    Article  Google Scholar 

  8. Lee S, Soak S, Mahalik NP, Ahn B, Jeon M (2006) Mathematical and empirical analysis of the real world tournament selection. In: Lecture notes in artificial intelligence, vol 4215, pp 130–137

  9. Julstrom BA (1999) It’s all the same to me: Revisiting rank-based probabilities and tournaments. In: Proceedings of the congress on evolutionary computation, pp 1501–1505

  10. Bäck T (1996) Evolutionary algorithms in theory and practice. Oxford University Press, Oxford

    MATH  Google Scholar 

  11. Baker JE (1987) Reducting bias and inefficiency in the selection algorithm. In: Grefenstette JJ (ed). Proceedings of the second international conference on genetic algorithms. Kaufmann, San Mateo, pp 14–21

    Google Scholar 

  12. Beasley D, Bull DR, Martine RR (1993) An overview of genetic algorithms, part 1: fundamentals. University computing, the bulletin of the IUCC, vol 15, no 2, p 58

  13. Rogers A, Bennett AP (1999) Genetic drift in genetic algorithm selection schemes. IEEE Trans Evol Comput 3(4):298–303

    Article  Google Scholar 

  14. Schell T, Wegenkittl S (2001) Looking beyond selection probabilities: adaptation of the χ 2 measure for the performance analysis selection methods in GAs. Evol Comput 9(2):243–256

    Article  Google Scholar 

  15. Blickle T, Thiele L (1995) A comparison of selection schemes used in genetic algorithms. Technical Report 11, Swiss Federal Institute of Technology, Zürich, Switzerland

  16. Blickle T, Thiele L (1995) A mathematical analysis of tournament selection. In: Proceedings of the 6th international conference on genetic algorithms, pp 9–16

  17. Bäck T (1994) Selective pressure in evolutionary algorithms: a characterization of selection mechanisms. In: Proceedings of 1st IEEE conference on evolutionary computation, pp 56–62

  18. Papoulis A, Pillai SU (2002) Probability, random variables and stochastic processes, 4th edn. McGraw–Hill, New York, p 361

    Google Scholar 

  19. http://www.iwr.uni-heidelberg.de/groups/comopt/software/TSPLIB95/index.html

  20. Bean JC (1994) Genetics and random keys for sequencing and optimization. ORSA J Comput 6:154–160

    MATH  Google Scholar 

  21. Sywerda G (1989) Uniform crossover in genetic algorithms. In: Proceedings of the third international conference on genetic algorithms, George Mason University, USA, pp 2–9

Download references

Author information

Authors and Affiliations

  1. School of Information and Mechatronics, Gwangju Institute of Science and Technology, 1 Oryong-dong, Buk-gu, Gwangju, 500-712, South Korea

    S. Lee, K. Kim & M. Jeon

  2. Information Examination Team, KIPO, Gov. Complex Daejeon Bldg. 4, 920 Dunsandong, Seo-gu, Daejeon, South Korea

    S. Soak

  3. College of Computing, Georgia Tech., Atlanta, GA, 30332, USA

    H. Park

Authors
  1. S. Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. Soak
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. K. Kim
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. H. Park
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. M. Jeon
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to M. Jeon.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lee, S., Soak, S., Kim, K. et al. Statistical properties analysis of real world tournament selection in genetic algorithms. Appl Intell 28, 195–205 (2008). https://doi.org/10.1007/s10489-007-0062-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10489-007-0062-2

Keywords

Search

Navigation