Statistical properties analysis of real world tournament selection in genetic algorithms

Authors:
S. Lee;S. Soak;K. Kim;H. Park;M. Jeon
Affiliations:
School of Information and Mechatronics, Gwangju Institute of Science and Technology, Gwangju, South Korea 500-712;Information Examination Team, KIPO, Daejeon, South Korea;School of Information and Mechatronics, Gwangju Institute of Science and Technology, Gwangju, South Korea 500-712;College of Computing, Georgia Tech., Atlanta, USA 30332;School of Information and Mechatronics, Gwangju Institute of Science and Technology, Gwangju, South Korea 500-712
Venue:
Applied Intelligence
Year:
2008

Citing 0
Cited 8

Improving the accuracy of AIRS by incorporating real world tournament selection in resource competition phase

CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Genetic algorithms with elitism-based immigrants for dynamic shortest path problem in mobile ad hoc networks

CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Genetic algorithms with immigrants schemes for dynamic multicast problems in mobile ad hoc networks

Engineering Applications of Artificial Intelligence
Genetic algorithms with immigrants and memory schemes for dynamic shortest path routing problems in mobile ad hoc networks

IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
The improved adaptive link adjustment evolutionary algorithm for the multiple container packing problem

Applied Intelligence
A memetic algorithm for the quadratic multiple container packing problem

Applied Intelligence
Multi-population genetic algorithms with immigrants scheme for dynamic shortest path routing problems in mobile ad hoc networks

EvoApplicatons'10 Proceedings of the 2010 international conference on Applications of Evolutionary Computation - Volume Part I
Dynamic genetic algorithms for the dynamic load balanced clustering problem in mobile ad hoc networks

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

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.