Genetic algorithm with a new round-robin based tournament selection: Statistical properties analysis

Abstract

A round-robin tournament is a contest where each and every player plays with all the other players. In this study, we propose a round-robin based tournament selection operator for the genetic algorithms (GAs). At first, we divide the whole population into two equal and disjoint groups, then each individual of a group competes with all the individuals of other group. Statistical experimental results reveal that the devised selection operator has a relatively better selection pressure along with a minimal loss of population diversity. For the consisting of assigned probability distribution with sampling algorithms, we employ the Pearson’s chi-square and the empirical distribution function as goodness of fit tests for the analysis of statistical properties analysis. At the cost of a nominal increase of the complexity as compared to conventional selection approaches, it has improved the sampling accuracy. Finally, for the global performance, we considered the traveling salesman problem to measure the efficiency of the newly developed selection scheme with respect to other competing selection operators and observed an improved performance.