Please use this identifier to cite or link to this item: https://research.matf.bg.ac.rs/handle/123456789/668
Title: Fine-grained tournament selection operator in genetic algorithms
Authors: Filipović, Vladimir 
Affiliations: Informatics and Computer Science 
Keywords: Genetic algorithms;NP-hard problems;SPLP;Theoretical estimations;Tournament selection
Issue Date: 1-Jan-2003
Journal: Computing and Informatics
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.
URI: https://research.matf.bg.ac.rs/handle/123456789/668
ISSN: 13359150
Appears in Collections:Research outputs

Show full item record

SCOPUSTM   
Citations

59
checked on Dec 18, 2024

Page view(s)

22
checked on Dec 23, 2024

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.