DC FieldValueLanguage
dc.contributor.authorMarić, Miroslaven
dc.contributor.authorTuba, Milanen
dc.contributor.authorKratica, Jozefen
dc.date.accessioned2020-04-26T19:14:55Z-
dc.date.available2020-04-26T19:14:55Z-
dc.date.issued2008-06-01en
dc.identifier.issn1109-2750en
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/502-
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.publisherWSEAS-
dc.relationSerbian Ministry of Science, project 144007-
dc.relation.ispartofWSEAS Transactions on Computersen
dc.subjectCovering models | Evolutionary computing | Genetic algorithms | Hierarchical location | Location problemen
dc.titleParameter adjustment for genetic algorithm for two-level Hierarchical Covering Location Problemen
dc.typeArticleen
dc.identifier.scopus2-s2.0-48749110652en
dc.relation.firstpage746en
dc.relation.lastpage755en
dc.relation.issue6en
dc.relation.volume7en
item.cerifentitytypePublications-
item.fulltextNo Fulltext-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.openairetypeArticle-
item.grantfulltextnone-
crisitem.author.orcid0000-0002-9752-0971-
Show simple item record

SCOPUSTM   
Citations

4
checked on Jul 22, 2024

Page view(s)

42
checked on May 9, 2024

Google ScholarTM

Check


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