DC FieldValueLanguage
dc.contributor.authorDavidović, Tatjanaen
dc.contributor.authorRamljak, Dušanen
dc.contributor.authorŠelmić, Milicaen
dc.contributor.authorTeodorović, Dušanen
dc.date.accessioned2020-04-03T08:16:03Z-
dc.date.available2020-04-03T08:16:03Z-
dc.date.issued2011-10-01en
dc.identifier.issn0305-0548en
dc.description.abstractBee colony optimization (BCO) is a relatively new meta-heuristic designed to deal with hard combinatorial optimization problems. It is biologically inspired method that explores collective intelligence applied by the honey bees during nectar collecting process. In this paper we apply BCO to the p-center problem in the case of symmetric distance matrix. On the contrary to the constructive variant of the BCO algorithm used in recent literature, we propose variant of BCO based on the improvement concept (BCOi). The BCOi has not been significantly used in the relevant BCO literature so far. In this paper it is proved that BCOi can be a very useful concept for solving difficult combinatorial problems. The numerical experiments performed on well-known benchmark problems show that the BCOi is competitive with other methods and it can generate high-quality solutions within negligible CPU times.en
dc.publisherElsevier-
dc.relationMatematički modeli i metode optimizacije sa primenama-
dc.relationUpravljanje saobraćajem i transportom primenom modela zasnovanih na metodama matematičkog programiranja i mekog računa-
dc.relation.ispartofComputers and Operations Researchen
dc.subjectBee colony optimization | Combinatorial optimization | Location analysis | Meta-heuristics | p-Center problemen
dc.titleBee colony optimization for the p-center problemen
dc.typeArticleen
dc.identifier.doi10.1016/j.cor.2010.12.002en
dc.identifier.scopus2-s2.0-79951550821en
dc.contributor.affiliationMathematical Institute of the Serbian Academy of Sciences and Arts-
dc.relation.grantno144007-
dc.relation.grantno144033-
dc.relation.firstpage1367en
dc.relation.lastpage1376en
dc.relation.issue10en
dc.relation.volume38en
dc.description.rankM21-
item.grantfulltextnone-
item.cerifentitytypePublications-
item.fulltextNo Fulltext-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.openairetypeArticle-
crisitem.author.orcid0000-0001-9561-5339-
Show simple item record

SCOPUSTM   
Citations

76
checked on Oct 2, 2022

Page view(s)

31
checked on Oct 3, 2022

Google ScholarTM

Check

Altmetric

Altmetric


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