DC Field | Value | Language |
---|---|---|
dc.contributor.author | Teodorović, Dušan | en |
dc.contributor.author | Šelmić, Milica | en |
dc.contributor.author | Davidović, Tatjana | en |
dc.date.accessioned | 2020-04-03T08:16:02Z | - |
dc.date.available | 2020-04-03T08:16:02Z | - |
dc.date.issued | 2015-01-01 | en |
dc.identifier.issn | 0354-0243 | en |
dc.identifier.uri | http://researchrepository.mi.sanu.ac.rs/handle/123456789/258 | - |
dc.description.abstract | Bee Colony Optimization (BCO) is a meta-heuristic method based on foraging habits of honeybees. This technique was motivated by the analogy found between the natural behavior of bees searching for food and the behavior of optimization algorithms searching for an optimum in combinatorial optimization problems. BCO has been successfully applied to various hard combinatorial optimization problems, mostly in transportation, location and scheduling fields. There are some applications in the continuous optimization field that have appeared recently. The main purpose of this paper is to introduce the scientific community more closely with BCO by summarizing its existing successful applications. | en |
dc.publisher | Faculty of Organizational Sciences, Belgrade | - |
dc.relation | Mathematical Modelas and Optimization Methods on Large-Scale Systems | - |
dc.relation | Graph theory and mathematical programming with applications in chemistry and computer science | - |
dc.relation | Computational Intelligence Techniques in Transportation and Communication Planning and Traffic Control | - |
dc.relation.ispartof | Yugoslav Journal of Operations Research | en |
dc.subject | Combinatorial optimization | Location | Meta-heuristic methods | Routing | Scheduling problems | Swarm intelligence | en |
dc.title | Bee colony optimization Part II: The application survey | en |
dc.type | Article | en |
dc.identifier.doi | 10.2298/YJOR131029020T | en |
dc.identifier.scopus | 2-s2.0-84939483130 | en |
dc.contributor.affiliation | Mathematical Institute of the Serbian Academy of Sciences and Arts | - |
dc.relation.firstpage | 185 | en |
dc.relation.lastpage | 219 | en |
dc.relation.issue | 2 | en |
dc.relation.volume | 25 | en |
dc.description.rank | M51 | - |
item.grantfulltext | none | - |
item.cerifentitytype | Publications | - |
item.fulltext | No Fulltext | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.openairetype | Article | - |
crisitem.project.funder | NIH | - |
crisitem.project.projectURL | http://www.mi.sanu.ac.rs/novi_sajt/research/projects/174010e.php | - |
crisitem.project.projectURL | http://www.mi.sanu.ac.rs/novi_sajt/research/projects/174033e.php | - |
crisitem.project.fundingProgram | Directorate for Engineering | - |
crisitem.project.fundingProgram | Directorate for Computer & Information Science & Engineering | - |
crisitem.project.fundingProgram | NATIONAL INSTITUTE OF GENERAL MEDICAL SCIENCES | - |
crisitem.project.openAire | info:eu-repo/grantAgreement/NSF/Directorate for Engineering/1740103 | - |
crisitem.project.openAire | info:eu-repo/grantAgreement/NSF/Directorate for Computer & Information Science & Engineering/1740333 | - |
crisitem.project.openAire | info:eu-repo/grantAgreement/NIH/NATIONAL INSTITUTE OF GENERAL MEDICAL SCIENCES/5R01GM036002-14 | - |
crisitem.author.orcid | 0000-0001-9561-5339 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.