Please use this identifier to cite or link to this item: https://research.matf.bg.ac.rs/handle/123456789/581
DC FieldValueLanguage
dc.contributor.authorMarić, Miroslaven_US
dc.contributor.authorTuba, Milanen_US
dc.contributor.authorKratica, Jozefen_US
dc.date.accessioned2022-08-13T14:52:04Z-
dc.date.available2022-08-13T14:52:04Z-
dc.date.issued2008-06-01-
dc.identifier.issn11092750en
dc.identifier.urihttps://research.matf.bg.ac.rs/handle/123456789/581-
dc.description.abstractIn this paper the two-level Hierarchical Covering Location Problem - HCLP is considered. A new genetic algorithm for that problem is developed, including specific binary encoding with the new crossover and mutation operators that keep the feasibility of individuals. Modification that resolves the problem of frozen bits in genetic code is proposed and tested. Version of fine-grained tournament [5] was used as well as the caching GA technique [12] in order to improve computational performance. Genetic algorithm was tested and its parameters were adjusted on number of test examples and it performed well and proved robust in all cases. Results were verified by CPLEX.en
dc.relation.ispartofWSEAS Transactions on Computersen
dc.subjectCovering modelsen
dc.subjectEvolutionary computingen
dc.subjectGenetic algorithmsen
dc.subjectHierarchical locationen
dc.subjectLocation problemen
dc.titleParameter adjustment for genetic algorithm for two-level Hierarchical Covering Location Problemen_US
dc.typeArticleen_US
dc.identifier.scopus2-s2.0-48749110652-
dc.identifier.urlhttps://api.elsevier.com/content/abstract/scopus_id/48749110652-
dc.contributor.affiliationInformatics and Computer Scienceen_US
dc.relation.firstpage746en
dc.relation.lastpage755en
dc.relation.volume7en
dc.relation.issue6en
item.fulltextNo Fulltext-
item.openairetypeArticle-
item.grantfulltextnone-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.cerifentitytypePublications-
crisitem.author.deptInformatics and Computer Science-
crisitem.author.orcid0000-0001-7446-0577-
Appears in Collections:Research outputs
Show simple item record

SCOPUSTM   
Citations

4
checked on Nov 8, 2024

Page view(s)

5
checked on Nov 15, 2024

Google ScholarTM

Check


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