Skip to main content

Mathematical and Empirical Analysis of the Real World Tournament Selection

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4251))

Abstract

This paper provides a theoretical and empirical analysis of a recently proposed selection method, which is called ‘Real World Tournament Selection’ (RWTS). First of all, a characteristic of the selection probability of RWTS is analyzed. Secondly, the performance of RWTS is more widely tested at three benchmark problems – function optimization problems, the traveling salesman problem and the multdimensional knapsack problem. Finally, RWTS is compared with five well-known selection strategies. The experimental results show that it can achieve an encouraging performance, not only solution quality but also computation time.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bäck, T.: Selective pressure in evolutionary algorithms: A Characteriszation of selection mechanisms. In: Proc. of 1st IEEE Conf. on Evolutionary Computation, pp. 57–62 (1994)

    Google Scholar 

  2. Bäck, T.: Evolutionary Algorithms in Theory and Practice. Oxford University Press, Oxford (1996)

    MATH  Google Scholar 

  3. Blickle, T., Thiele, L.: A Mathematical Analysis of Tournament Selection. Genetic Algorithms, 9–16 (1995)

    Google Scholar 

  4. Julstrom, B.A.: It’s all the same to me: Revisiting rank-based probabilities and tournaments. In: Proc. of The Cong. on Evolutionary Computation, pp. 1501–1505 (1999)

    Google Scholar 

  5. Soak, S.M., Corne, D., Ahn, B.H.: A Powerful New Encoding for Tree-Based Combinatorial Optimisation Problems. In: Yao, X., Burke, E.K., Lozano, J.A., Smith, J., Merelo-Guervós, J.J., Bullinaria, J.A., Rowe, J.E., Tiňo, P., Kabán, A., Schwefel, H.-P. (eds.) PPSN 2004. LNCS, vol. 3242, pp. 430–439. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  6. Soak, S.M., Corne, D., Ahn, B.H.: A New Encoding for the Degree Constrained Minimum Spanning Tree Problem. In: Negoita, M.G., Howlett, R.J., Jain, L.C. (eds.) KES 2004. LNCS (LNAI), vol. 3213, pp. 952–958. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  7. http://people.brunel.ac.uk/mastjjb/jeb/info.html

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lee, S.W., Soak, S.M., Mahalik, N.P., Ahn, B.H., Jeon, M.G. (2006). Mathematical and Empirical Analysis of the Real World Tournament Selection. In: Gabrys, B., Howlett, R.J., Jain, L.C. (eds) Knowledge-Based Intelligent Information and Engineering Systems. KES 2006. Lecture Notes in Computer Science(), vol 4251. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11892960_16

Download citation

  • DOI: https://doi.org/10.1007/11892960_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-46535-5

  • Online ISBN: 978-3-540-46536-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics