DC Field | Value | Language |
---|---|---|
dc.contributor.author | Milenković, Branislav | en_US |
dc.contributor.author | Krstić, Mladen | en_US |
dc.contributor.author | Jovanović, Đorđe | en_US |
dc.date.accessioned | 2022-02-11T09:23:10Z | - |
dc.date.available | 2022-02-11T09:23:10Z | - |
dc.date.issued | 2022 | - |
dc.identifier.issn | 2620-2832 | - |
dc.identifier.uri | http://researchrepository.mi.sanu.ac.rs/handle/123456789/4771 | - |
dc.description.abstract | In this paper, we present the ant colony optimization algorithm (ACO for short), which was used to solve gear box problem design. Biological fundamentals of ACO algorithm, as well as method explanation are presented. The pseudo code for this algorithm was written using Matlab R2018a software suite. At the end, the results obtained by ACO algorithm are compared to the results previously obtained by other algorithms. | en_US |
dc.publisher | University of Kragujevac, Faculty of Engineering | en_US |
dc.relation.ispartof | Proceedings on Engineering Sciences | en_US |
dc.subject | Optimization | Ant | Algorithm | Gear box | en_US |
dc.title | Аpplying Ant Colony Optimization Algorithm to Solve Gear Box Design | en_US |
dc.type | Article | en_US |
dc.identifier.doi | 10.24874/PES04.01.009 | - |
dc.identifier.scopus | 2-s2.0-85130319466 | - |
dc.contributor.affiliation | Mechanics | en_US |
dc.contributor.affiliation | Computer Science | en_US |
dc.contributor.affiliation | Mathematical Institute of the Serbian Academy of Sciences and Arts | - |
dc.relation.firstpage | 63 | - |
dc.relation.lastpage | 68 | - |
dc.relation.issue | 1 | - |
dc.relation.volume | 4 | - |
dc.description.rank | M54 | - |
item.grantfulltext | none | - |
item.cerifentitytype | Publications | - |
item.fulltext | No Fulltext | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.openairetype | Article | - |
crisitem.author.orcid | 0000-0003-4606-0095 | - |
crisitem.author.orcid | 0000-0003-1222-1292 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.