{"id":"https://openalex.org/W4200136975","doi":"https://doi.org/10.1186/s13173-021-00116-8","title":"An accelerated and robust algorithm for ant colony optimization in continuous functions","display_name":"An accelerated and robust algorithm for ant colony optimization in continuous functions","publication_year":2021,"publication_date":"2021-12-01","ids":{"openalex":"https://openalex.org/W4200136975","doi":"https://doi.org/10.1186/s13173-021-00116-8"},"language":"en","primary_location":{"id":"doi:10.1186/s13173-021-00116-8","is_oa":true,"landing_page_url":"https://doi.org/10.1186/s13173-021-00116-8","pdf_url":"https://journal-bcs.springeropen.com/counter/pdf/10.1186/s13173-021-00116-8","source":{"id":"https://openalex.org/S69801987","display_name":"Journal of the Brazilian Computer Society","issn_l":"0104-6500","issn":["0104-6500","1678-4804"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the Brazilian Computer Society","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://journal-bcs.springeropen.com/counter/pdf/10.1186/s13173-021-00116-8","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5008416553","display_name":"Jairo Gerv\u00e1sio de Freitas","orcid":"https://orcid.org/0000-0001-9186-4581"},"institutions":[{"id":"https://openalex.org/I4210092444","display_name":"Instituto Federal de Educa\u00e7\u00e3o, Ci\u00eancia e Tecnologia do Tri\u00e2ngulo Mineiro","ror":"https://ror.org/00ge23k91","country_code":"BR","type":"education","lineage":["https://openalex.org/I1293487690","https://openalex.org/I2801200668","https://openalex.org/I4210092444"]},{"id":"https://openalex.org/I80850581","display_name":"Universidade Federal de Uberl\u00e2ndia","ror":"https://ror.org/04x3wvr31","country_code":"BR","type":"education","lineage":["https://openalex.org/I80850581"]}],"countries":["BR"],"is_corresponding":true,"raw_author_name":"Jairo G. de Freitas","raw_affiliation_strings":["Instituto Federal do Tringulo Mineiro (IFTM), Uberaba, MG, Brazil","Universidade Federal de Uberlndia (UFU), Uberlndia, MG, Brazil","Instituto Federal do Tri\u00e2ngulo Mineiro (IFTM), Uberaba, MG, Brazil"],"raw_orcid":"https://orcid.org/0000-0001-9186-4581","affiliations":[{"raw_affiliation_string":"Instituto Federal do Tringulo Mineiro (IFTM), Uberaba, MG, Brazil","institution_ids":["https://openalex.org/I4210092444"]},{"raw_affiliation_string":"Universidade Federal de Uberlndia (UFU), Uberlndia, MG, Brazil","institution_ids":["https://openalex.org/I80850581"]},{"raw_affiliation_string":"Instituto Federal do Tri\u00e2ngulo Mineiro (IFTM), Uberaba, MG, Brazil","institution_ids":["https://openalex.org/I4210092444"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100977088","display_name":"Keiji Yamanaka","orcid":null},"institutions":[{"id":"https://openalex.org/I80850581","display_name":"Universidade Federal de Uberl\u00e2ndia","ror":"https://ror.org/04x3wvr31","country_code":"BR","type":"education","lineage":["https://openalex.org/I80850581"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Keiji Yamanaka","raw_affiliation_strings":["Universidade Federal de Uberlndia (UFU), Uberlndia, MG, Brazil","Universidade Federal de Uberl\u00e2ndia (UFU), Uberl\u00e2ndia, MG, Brazil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universidade Federal de Uberlndia (UFU), Uberlndia, MG, Brazil","institution_ids":["https://openalex.org/I80850581"]},{"raw_affiliation_string":"Universidade Federal de Uberl\u00e2ndia (UFU), Uberl\u00e2ndia, MG, Brazil","institution_ids":["https://openalex.org/I80850581"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5008416553"],"corresponding_institution_ids":["https://openalex.org/I4210092444","https://openalex.org/I80850581"],"apc_list":null,"apc_paid":null,"fwci":0.1399,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.58473456,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"27","issue":"1","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.6924486756324768},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6355056762695312},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6298390626907349},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.6220477819442749},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6186605095863342},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.5637940764427185},{"id":"https://openalex.org/keywords/variety","display_name":"Variety (cybernetics)","score":0.5491542816162109},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.49512162804603577},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.25955212116241455},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.15588754415512085},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.052090466022491455}],"concepts":[{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.6924486756324768},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6355056762695312},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6298390626907349},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.6220477819442749},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6186605095863342},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.5637940764427185},{"id":"https://openalex.org/C136197465","wikidata":"https://www.wikidata.org/wiki/Q1729295","display_name":"Variety (cybernetics)","level":2,"score":0.5491542816162109},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.49512162804603577},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.25955212116241455},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.15588754415512085},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.052090466022491455},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1186/s13173-021-00116-8","is_oa":true,"landing_page_url":"https://doi.org/10.1186/s13173-021-00116-8","pdf_url":"https://journal-bcs.springeropen.com/counter/pdf/10.1186/s13173-021-00116-8","source":{"id":"https://openalex.org/S69801987","display_name":"Journal of the Brazilian Computer Society","issn_l":"0104-6500","issn":["0104-6500","1678-4804"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the Brazilian Computer Society","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1186/s13173-021-00116-8","is_oa":true,"landing_page_url":"https://doi.org/10.1186/s13173-021-00116-8","pdf_url":"https://journal-bcs.springeropen.com/counter/pdf/10.1186/s13173-021-00116-8","source":{"id":"https://openalex.org/S69801987","display_name":"Journal of the Brazilian Computer Society","issn_l":"0104-6500","issn":["0104-6500","1678-4804"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the Brazilian Computer Society","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4200136975.pdf","grobid_xml":"https://content.openalex.org/works/W4200136975.grobid-xml"},"referenced_works_count":29,"referenced_works":["https://openalex.org/W38241158","https://openalex.org/W114122396","https://openalex.org/W414544266","https://openalex.org/W1552088867","https://openalex.org/W1576818901","https://openalex.org/W1595159159","https://openalex.org/W1852107442","https://openalex.org/W1964373220","https://openalex.org/W1968150523","https://openalex.org/W1975009952","https://openalex.org/W2017542560","https://openalex.org/W2027964569","https://openalex.org/W2043181951","https://openalex.org/W2053871929","https://openalex.org/W2066191629","https://openalex.org/W2107941094","https://openalex.org/W2143945515","https://openalex.org/W2152195021","https://openalex.org/W2154929945","https://openalex.org/W2158311130","https://openalex.org/W2290883490","https://openalex.org/W2464527493","https://openalex.org/W2603809577","https://openalex.org/W2738900493","https://openalex.org/W2933860896","https://openalex.org/W2942526167","https://openalex.org/W4206498264","https://openalex.org/W4211130072","https://openalex.org/W4214531851"],"related_works":["https://openalex.org/W2032233321","https://openalex.org/W2182624400","https://openalex.org/W3121970507","https://openalex.org/W2365800168","https://openalex.org/W2110028391","https://openalex.org/W54497855","https://openalex.org/W2767428579","https://openalex.org/W217960748","https://openalex.org/W1992807692","https://openalex.org/W3125814499"],"abstract_inverted_index":{"Abstract":[0],"There":[1],"is":[2,85,181],"a":[3,59,102,141,182,203,248],"wide":[4],"variety":[5],"of":[6,26,35,101,116,158,184,188,221,270,274],"computational":[7],"methods":[8,37],"used":[9],"for":[10,155,169],"solving":[11],"optimization":[12,29],"problems.":[13],"Among":[14],"these,":[15],"there":[16,180],"are":[17,21,38],"various":[18],"strategies":[19,163],"that":[20,41,65,106,108,143,164],"derived":[22,151],"from":[23,152],"the":[24,32,45,51,63,81,93,99,110,117,121,131,145,156,166,171,185,189,192,198,219,227,240,267,271],"concept":[25],"ant":[27],"colony":[28],"(ACO).":[30],"However,":[31],"great":[33],"majority":[34],"these":[36,70,207],"limited-range-search":[39],"algorithms,":[40],"is,":[42,107],"they":[43],"find":[44,226],"optimal":[46,111,228],"solution,":[47,112,129,229],"as":[48,50,79,130,246],"long":[49],"domain":[52,123,133,142,173,190],"provided":[53,124,134],"contains":[54,144],"this":[55,128],"solution.":[56,146],"This":[57,147],"becomes":[58],"limitation,":[60],"due":[61],"to":[62,72,76,89,196,218,225,232],"fact":[64],"it":[66,84,139],"does":[67,125],"not":[68,86,126],"allow":[69],"algorithms":[71],"be":[73,136],"applied":[74],"successfully":[75],"real-world":[77],"problems,":[78],"in":[80,178,202,216,230,237],"real":[82],"world,":[83],"always":[87],"possible":[88],"determine":[90],"with":[91,113],"certainty":[92],"correct":[94],"domain.":[95],"The":[96,254],"article":[97],"proposes":[98],"use":[100],"broad-range":[103],"search":[104],"algorithm,":[105,186],"seeks":[109],"success":[114,235],"most":[115],"time,":[118],"even":[119],"if":[120],"initial":[122,132],"contain":[127],"will":[135],"adjusted":[137],"until":[138],"finds":[140],"algorithm":[148,199,255],"called":[149],"ARACO,":[150],"RACO,":[153],"makes":[154],"obtaining":[157],"better":[159,211],"results":[160,212],"possible,":[161],"through":[162],"accelerate":[165],"parameters":[167],"responsible":[168],"adjusting":[170],"supplied":[172],"at":[174],"opportune":[175],"moments":[176],"and,":[177],"case":[179],"stagnation":[183],"expansion":[187],"around":[191],"best":[193],"solution":[194],"found":[195],"prevent":[197],"becoming":[200],"trapped":[201],"local":[204],"minimum.":[205],"Through":[206],"strategies,":[208],"ARACO":[209],"obtains":[210],"than":[213],"its":[214,233],"predecessors,":[215],"relation":[217],"number":[220],"function":[222],"evaluations":[223],"necessary":[224],"addition":[231],"100%":[234],"rate":[236],"practically":[238],"all":[239],"tested":[241,258],"functions,":[242],"thus":[243],"demonstrating":[244],"itself":[245],"being":[247],"high":[249],"performance":[250],"and":[251,264],"reliable":[252],"algorithm.":[253],"has":[256],"been":[257],"on":[259,266],"some":[260],"classic":[261],"benchmark":[262,268],"functions":[263,269],"also":[265],"IEEE":[272],"Congress":[273],"Evolutionary":[275],"Computation":[276],"Benchmark":[277],"Test":[278],"Functions":[279],"(CEC":[280],"2019":[281],"100-Digit":[282],"Challenge).":[283]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}