Please use this identifier to cite or link to this item: https://research.matf.bg.ac.rs/handle/123456789/668
DC FieldValueLanguage
dc.contributor.authorFilipović, Vladimiren_US
dc.date.accessioned2022-08-14T09:49:35Z-
dc.date.available2022-08-14T09:49:35Z-
dc.date.issued2003-01-01-
dc.identifier.issn13359150en
dc.identifier.urihttps://research.matf.bg.ac.rs/handle/123456789/668-
dc.description.abstractTournament 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.en
dc.relation.ispartofComputing and Informaticsen
dc.subjectGenetic algorithmsen
dc.subjectNP-hard problemsen
dc.subjectSPLPen
dc.subjectTheoretical estimationsen
dc.subjectTournament selectionen
dc.titleFine-grained tournament selection operator in genetic algorithmsen_US
dc.typeArticleen_US
dc.identifier.scopus2-s2.0-0346335659-
dc.identifier.urlhttps://api.elsevier.com/content/abstract/scopus_id/0346335659-
dc.contributor.affiliationInformatics and Computer Scienceen_US
dc.relation.firstpage143en
dc.relation.lastpage161en
dc.relation.volume22en
dc.relation.issue2en
item.fulltextNo Fulltext-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.cerifentitytypePublications-
item.grantfulltextnone-
item.openairetypeArticle-
crisitem.author.deptInformatics and Computer Science-
crisitem.author.orcid0000-0002-5943-8037-
Appears in Collections:Research outputs
Show simple item record

SCOPUSTM   
Citations

59
checked on Dec 18, 2024

Page view(s)

22
checked on Dec 24, 2024

Google ScholarTM

Check


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