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. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
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 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4251 LNAI-I, pp. 130–137). Springer Verlag. https://doi.org/10.1007/11892960_16
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
