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.issued2007-10-01en
dc.identifier.issn0377-2217en
dc.description.abstractThis paper deals with the Uncapacitated Single Allocation p-Hub Median Problem (USApHMP). Two genetic algorithm (GA) approaches are proposed for solving this NP-hard problem. New encoding schemes are implemented with appropriate objective functions. Both approaches keep the feasibility of individuals by using specific representation and modified genetic operators. The numerical experiments were carried out on the standard ORLIB hub data set. Both methods proved to be robust and efficient in solving USApHMP with up to 200 nodes and 20 hubs. The second GA approach achieves all previously known optimal solutions and achieves the best-known solutions on large-scale instances.en
dc.publisherElsevier-
dc.relationSerbian Ministry of Science and Ecology, Grant no. 144007-
dc.relation.ispartofEuropean Journal of Operational Researchen
dc.subjectEvolutionary computations | Genetic algorithms | Location | p-Hub median problem | Single allocationen
dc.titleTwo genetic algorithms for solving the uncapacitated single allocation p-hub median problemen
dc.typeArticleen
dc.identifier.doi10.1016/j.ejor.2006.06.056en
dc.identifier.scopus2-s2.0-34147154835en
dc.contributor.affiliationMathematical Institute of the Serbian Academy of Sciences and Arts-
dc.relation.firstpage15en
dc.relation.lastpage28en
dc.relation.issue1en
dc.relation.volume182en
dc.description.rankM21-
item.fulltextNo Fulltext-
item.openairetypeArticle-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.cerifentitytypePublications-
item.grantfulltextnone-
Show simple item record

SCOPUSTM   
Citations

100
checked on Nov 28, 2022

Page view(s)

30
checked on Nov 28, 2022

Google ScholarTM

Check

Altmetric

Altmetric


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