Abstract

Tournament selection is one of the most popular selection operators in Genetic Algorithms. Recently, its popularity is increasing because this operator is well suited for Parallel Genetic Algorithms applications. In this paper, new selection operator is proposed. The new operator, which should be an improvement of the tournament selection, is named ``Fine-grained Tournament Selection'' (FGTS). It is shown that classical tournament selection is a special case of the FGTS and that new operator preserves its good features. Furthermore, theoretical estimations for the FGTS are made. Estimations for the FGTS are similar to those for the classical tournament selection. Finally, classical tournament selection, rank-based selection and FGTS are experimentally compared on a real world NP-hard problem and the obtained results are discussed.

Keywords

Cite this article

@article{cai-1207-2003-2,
  author  = {Vladimir Filipović},
  title   = {Fine-grained Tournament Selection Operator in Genetic Algorithms},
  journal = {Computing and Informatics},
  volume  = {22},
  number  = {2},
  pages   = {143--161},
  year    = {2003},
  issn    = {1335-9150},
  url     = {https://cai.type.sk/content/2003/2/fine-grained-tournament-selection-operator-in-genetic-algorithms/}
}
Download .bib