DC FieldValueLanguage
dc.contributor.authorKratica, Jozefen
dc.contributor.authorStanimirović, Zoricaen
dc.contributor.authorTošić, Dušanen
dc.contributor.authorFilipović, Vladimiren
dc.date.accessioned2020-04-26T19:14:56Z-
dc.date.available2020-04-26T19:14:56Z-
dc.date.issued2005-01-01en
dc.identifier.issn1335-9150en
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/507-
dc.description.abstractHub location problems are widely used for network designing. Many variations of these problems can be found in the literature. In this paper we deal with the uncapacitated multiple allocation hub location problem (UMAHLP). We propose a genetic algorithm (GA) for solving UMAHLP that uses binary encoding and genetic operators adapted to the problem. Overall performance of GA implementation is improved by caching technique, We present the results of our computational experience on standard ORLIB instances with up to 200 nodes. The results show that GA approach quickly reaches all optimal solutions that are known so far and also gives results on some large-scale instances that were unsolved before.en
dc.publisherSlovak Academy of Sciences-
dc.relation.ispartofComputing and Informaticsen
dc.subjectCombinatorial optimization | Discrete location and assignment | Evolutionary computation | Genetic algorithms | Hub location problem | Network designen
dc.titleGenetic algorithm for solving uncapacitated multiple allocation hub location problemen
dc.typeArticleen
dc.identifier.scopus2-s2.0-33644586026en
dc.contributor.affiliationMathematical Institute of the Serbian Academy of Sciences and Arts-
dc.relation.firstpage415en
dc.relation.lastpage426en
dc.relation.issue4en
dc.relation.volume24en
dc.description.rankM23-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.openairetypeArticle-
item.cerifentitytypePublications-
item.grantfulltextnone-
item.fulltextNo Fulltext-
crisitem.author.orcid0000-0002-9752-0971-
Show simple item record

SCOPUSTM   
Citations

13
checked on Jan 30, 2023

Page view(s)

27
checked on Jan 30, 2023

Google ScholarTM

Check


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