DC FieldValueLanguage
dc.contributor.authorFilipović, Vladimir-
dc.contributor.authorKratica, Jozef-
dc.contributor.authorTošić, Dušan-
dc.contributor.authorLjubić, Ivana-
dc.date.accessioned2020-07-01T14:34:07Z-
dc.date.available2020-07-01T14:34:07Z-
dc.date.issued2000-
dc.identifier.isbn951-22-5205-8-
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/3500-
dc.description.abstractThe simple plant location problem is considered and a genetic algorithm is proposed to solve this problem. Genetic algorithm that solves simple plant location problem uses an improvement of tournament selection, called fine grained tournament selection, as selection operator. New operator is generalization of classical tournament selection, that keeps all good features of classical tournament selection. By using the developed algorithm it is possible to solve SPLP with more than 1000 facility sites and customers. Computational results are presented and compared to rank-based and classical tournament selection.-
dc.publisherIEEE-
dc.titleFine grained tournament selection for the simple plant location problem-
dc.typeConference Paper-
dc.relation.conference5th Online World Conference on Soft Computing Methods in Industrial Applications-
dc.identifier.urlhttps://vladofilipovic.github.io/Science/Papers/A6.2-4.pdf-
dc.contributor.affiliationMathematical Institute of the Serbian Academy of Sciences and Arts-
dc.relation.firstpage152-
dc.relation.lastpage158-
dc.description.rankM30-
item.cerifentitytypePublications-
item.grantfulltextnone-
item.openairetypeConference Paper-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.fulltextNo Fulltext-
crisitem.author.orcid0000-0002-9752-0971-
Show simple item record

Page view(s)

55
checked on May 9, 2024

Google ScholarTM

Check

Altmetric


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