{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T12:32:00Z","timestamp":1780317120602,"version":"3.54.1"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,12,1]],"date-time":"2021-12-01T00:00:00Z","timestamp":1638316800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,12,2]],"date-time":"2021-12-02T00:00:00Z","timestamp":1638403200000},"content-version":"vor","delay-in-days":1,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Braz Comput Soc"],"published-print":{"date-parts":[[2021,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>There is a wide variety of computational methods used for solving optimization problems. Among these, there are various strategies that are derived from the concept of ant colony optimization (ACO). However, the great majority of these methods are limited-range-search algorithms, that is, they find the optimal solution, as long as the domain provided contains this solution. This becomes a limitation, due to the fact that it does not allow these algorithms to be applied successfully to real-world problems, as in the real world, it is not always possible to determine with certainty the correct domain. The article proposes the use of a broad-range search algorithm, that is, that seeks the optimal solution, with success most of the time, even if the initial domain provided does not contain this solution, as the initial domain provided will be adjusted until it finds a domain that contains the solution. This algorithm called ARACO, derived from RACO, makes for the obtaining of better results possible, through strategies that accelerate the parameters responsible for adjusting the supplied domain at opportune moments and, in case there is a stagnation of the algorithm, expansion of the domain around the best solution found to prevent the algorithm becoming trapped in a local minimum. Through these strategies, ARACO obtains better results than its predecessors, in relation to the number of function evaluations necessary to find the optimal solution, in addition to its 100% success rate in practically all the tested functions, thus demonstrating itself as being a high performance and reliable algorithm. The algorithm has been tested on some classic benchmark functions and also on the benchmark functions of the IEEE Congress of Evolutionary Computation Benchmark Test Functions (CEC 2019 100-Digit Challenge).<\/jats:p>","DOI":"10.1186\/s13173-021-00116-8","type":"journal-article","created":{"date-parts":[[2021,12,2]],"date-time":"2021-12-02T06:53:56Z","timestamp":1638428036000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["An accelerated and robust algorithm for ant colony optimization in continuous functions"],"prefix":"10.1186","volume":"27","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9186-4581","authenticated-orcid":false,"given":"Jairo G.","family":"de Freitas","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Keiji","family":"Yamanaka","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,12,2]]},"reference":[{"key":"116_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-0-387-71107-2_1","volume-title":"Practical Optimization","author":"A Antoniou","year":"2007","unstructured":"Antoniou A, Lu WS (2007) The optimization problem. In: Antoniou A, Lu WS (eds) Practical Optimization. Springer, Boston, pp 1\u201326. https:\/\/doi.org\/10.1007\/978-0-387-71107-2_1"},{"key":"116_CR2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511808241","volume-title":"How to think about algorithms","author":"J Edmonds","year":"2008","unstructured":"Edmonds J (2008) How to think about algorithms. Cambridge University Press, New York. https:\/\/doi.org\/10.1017\/CBO9780511808241"},{"key":"116_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-12-405163-8.00002-8","volume-title":"Swarm Intelligence and Bio-inspired Compuation","author":"MP Saka","year":"2013","unstructured":"Saka MP, Dogan E, Aydogdu I (2013) Analysis of swarm intelligence-based algorithms for constrained optimization. In: Yang XS, Cui Z, Xiao R, Gandomi AH, Karamanoglu M (eds) Swarm Intelligence and Bio-inspired Compuation. Elsevier, Oxford. https:\/\/doi.org\/10.1016\/B978-0-12-405163-8.00002-8"},{"issue":"4","key":"116_CR4","first-page":"36","volume":"3","author":"SP Kaur","year":"2013","unstructured":"Kaur SP (2013) Variables in research. Indian J Res Rep Med Sci 3(4):36\u201338","journal-title":"Indian J Res Rep Med Sci"},{"issue":"5","key":"116_CR5","doi-asserted-by":"publisher","first-page":"94","DOI":"10.3390\/a12050094","volume":"12","author":"Z Wu","year":"2019","unstructured":"Wu Z, Xue R (2019) A cyclical non-linear inertia-weighted teaching-learning-based optimization algorithm. Algorithms 12(5):94. https:\/\/doi.org\/10.3390\/a12050094","journal-title":"Algorithms"},{"issue":"3","key":"116_CR6","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1590\/S0103-17592009000300002","volume":"20","author":"ABS Serapi\u00e3o","year":"2009","unstructured":"Serapi\u00e3o ABS (2009) Fundamentos de otimiza\u00e7\u00e3o por intelig\u00eancia de enxames: uma vis\u00e3o geral. Sba Controle Automa\u00e7\u00e3o 20(3):271\u2013304. https:\/\/doi.org\/10.1590\/S0103-17592009000300002","journal-title":"Sba Controle Automa\u00e7\u00e3o"},{"key":"116_CR7","unstructured":"Goldberg DE (1989) Generic Algorithm in search, optimization and machine learning. Addison-Wesley, Reading, Boston"},{"issue":"4","key":"116_CR8","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1023\/A:1008202821328","volume":"11","author":"R Storn","year":"1997","unstructured":"Storn R, Price K (1997) Differential evolution \u2013 a simple and efficient heuristic for global optimization over continuous spaces. J Glob Optimization 11(4):341\u2013359. https:\/\/doi.org\/10.1023\/A:1008202821328","journal-title":"J Glob Optimization"},{"key":"116_CR9","volume-title":"Genetic programming: on the programming of computers by means of natural selection","author":"JR Koza","year":"1992","unstructured":"Koza JR (1992) Genetic programming: on the programming of computers by means of natural selection. MIT Press, Cambridge"},{"key":"116_CR10","volume-title":"Positive feedback as a search strategy. Technical Report 91-016, Politecnico di Milano","author":"M Dorigo","year":"1991","unstructured":"Dorigo M, Maniezzo V, Colorni A (1991) Positive feedback as a search strategy. Technical Report 91-016, Politecnico di Milano"},{"issue":"1","key":"116_CR11","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/3477.484436","volume":"26","author":"M Dorigo","year":"1996","unstructured":"Dorigo M, Maniezzo V, Colorni A (1996) Ant system: optimization by a colony of cooperating agents. IEEE Trans Syst Man Cybern Part B (Cybernetics) 26(1):29\u201341. https:\/\/doi.org\/10.1109\/3477.484436","journal-title":"IEEE Trans Syst Man Cybern Part B (Cybernetics)"},{"issue":"1","key":"116_CR12","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M Dorigo","year":"1997","unstructured":"Dorigo M, Gambardella LM (1997) Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans Evol Comput 1(1):53\u201366. https:\/\/doi.org\/10.1109\/4235.585892","journal-title":"IEEE Trans Evol Comput"},{"key":"116_CR13","unstructured":"Karaboga D (2005) An idea based on honey bee swarm for numerical optimization. Technical Report \u2013 TR06, Erciyes University, Engineering Faculty Computer Engineering Department Kayseri, Turkey"},{"key":"116_CR14","doi-asserted-by":"publisher","first-page":"1942","DOI":"10.1109\/ICNN.1995.488968","volume-title":"Proceedings of ICNN\u201995 \u2013 International Conference on Neural Networks 4, Perth, WA","author":"J Kennedy","year":"1995","unstructured":"Kennedy J, Eberhart R (1995) Particle swarm optimization. In: Proceedings of ICNN\u201995 \u2013 International Conference on Neural Networks 4, Perth, WA, pp 1942\u20131948. https:\/\/doi.org\/10.1109\/ICNN.1995.488968"},{"key":"116_CR15","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/j.jda.2011.06.002","volume":"10","author":"D Sudholt","year":"2012","unstructured":"Sudholt D, Thyssen C (2012) Running time analysis of ant colony optimization for shortest path problems. J Discrete Algorithms 10:165\u2013180. https:\/\/doi.org\/10.1016\/j.jda.2011.06.002","journal-title":"J Discrete Algorithms"},{"key":"116_CR16","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/j.neucom.2011.09.040","volume":"98","author":"QL Ding","year":"2012","unstructured":"Ding QL, Hu XP, Sun LJ, Wang YZ (2012) An improved ant colony optimization and its application to vehicle routing problem with time windows. Neurocomputing 98:101\u2013107. https:\/\/doi.org\/10.1016\/j.neucom.2011.09.040","journal-title":"Neurocomputing"},{"issue":"3","key":"116_CR17","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1023\/B:JMMA.0000038614.39977.6f","volume":"3","author":"C Blum","year":"2004","unstructured":"Blum C, Sampels M (2004) An ant colony optimization algorithm for shop scheduling problems. J Math Model Algorithms 3(3):285\u2013304. https:\/\/doi.org\/10.1023\/B:JMMA.0000038614.39977.6f","journal-title":"J Math Model Algorithms"},{"key":"116_CR18","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-319-91086-4_10","volume":"272","author":"M Dorigo","year":"2019","unstructured":"Dorigo M, Stutzle T (2019) Ant colony optimization: overview and recent advances, Handbook of Metaheuristics. Int Ser Oper Res Manage Sci 272:311\u2013351. https:\/\/doi.org\/10.1007\/978-3-319-91086-4_10","journal-title":"Int Ser Oper Res Manage Sci"},{"issue":"3","key":"116_CR19","doi-asserted-by":"publisher","first-page":"1155","DOI":"10.1016\/j.ejor.2006.06.046","volume":"185","author":"K Socha","year":"2008","unstructured":"Socha K, Dorigo M (2008) Ant colony optimization for continuous domains. Eur J Oper Res 185(3):1155\u20131173. https:\/\/doi.org\/10.1016\/j.ejor.2006.06.046","journal-title":"Eur J Oper Res"},{"key":"116_CR20","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/3-540-60469-3_22","volume-title":"Selected Papers from AISB Workshop on Evolutionary Computing","author":"G Bilchev","year":"2006","unstructured":"Bilchev G, Parmee I (2006) The ant colony metaphor for searching continuous design Spaces. In: Selected Papers from AISB Workshop on Evolutionary Computing. Springer-Verlag, Berlin, Heidelberg, pp 25\u201339. https:\/\/doi.org\/10.1007\/3-540-60469-3_22"},{"key":"116_CR21","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1007\/11839088_53","volume-title":"Proceedings of the 5th International Conference on Ant Colony Optimization and Swarm Intelligence - ANTS 2006","author":"H Huang","year":"2006","unstructured":"Huang H, Hao Z (2006) ACO for continuous optimization based on discrete encoding. In: Proceedings of the 5th International Conference on Ant Colony Optimization and Swarm Intelligence - ANTS 2006. Springer, Berlin, Heidelberg, pp 504\u2013505. https:\/\/doi.org\/10.1007\/11839088_53"},{"issue":"5","key":"116_CR22","doi-asserted-by":"publisher","first-page":"841","DOI":"10.1016\/j.future.2003.07.015","volume":"20","author":"J Dr\u00e9o","year":"2004","unstructured":"Dr\u00e9o J, Siarry P (2004) Continuous interacting ant colony algorithm based on dense heterarchy. Future Generation Comput Syst 20(5):841\u2013856. https:\/\/doi.org\/10.1016\/j.future.2003.07.015","journal-title":"Future Generation Comput Syst"},{"issue":"8","key":"116_CR23","doi-asserted-by":"publisher","first-page":"937","DOI":"10.1016\/S0167-739X(00)00047-9","volume":"16","author":"N Monmarch\u00e9","year":"2000","unstructured":"Monmarch\u00e9 N, Venturini G, Slimane M (2000) On how Pachycondyla apicalis ants suggest a new search algorithm. Future Generation Comput Syst 16(8):937\u2013946. https:\/\/doi.org\/10.1016\/S0167-739X(00)00047-9","journal-title":"Future Generation Comput Syst"},{"key":"116_CR24","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/j.eswa.2017.03.036","volume":"81","author":"Z Chen","year":"2017","unstructured":"Chen Z, Zhou Z, Luo J (2017) A robust ant colony optimization for continuous functions. Expert Syst Appl Int J 81:309\u2013320. https:\/\/doi.org\/10.1016\/j.eswa.2017.03.036","journal-title":"Expert Syst Appl Int J"},{"key":"116_CR25","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/978-3-642-15461-4_5","volume-title":"Proceedings of the 7th International Conference on Ant Colony Optimization and Swarm Intelligence - ANTS 2010","author":"G Leguizam\u00f3n","year":"2010","unstructured":"Leguizam\u00f3n G, Coello CAC (2010) An alternative ACOR algorithm for continuous optimization problems. In: Proceedings of the 7th International Conference on Ant Colony Optimization and Swarm Intelligence - ANTS 2010. Springer-Verlag, Berlin, Heidelberg, pp 48\u201359. https:\/\/doi.org\/10.1007\/978-3-642-15461-4_5"},{"key":"116_CR26","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1145\/2001576-2001594","volume-title":"Proceedings of the genetic and evolutionary computation conference \u2013 GECCO\u201911","author":"TJ Liao","year":"2011","unstructured":"Liao TJ, Montes da Oca MA, Aydin D, Stutlze T, Dorigo M (2011) An incremental ant colony algorithm with local search for continuous optimization. In: Proceedings of the genetic and evolutionary computation conference \u2013 GECCO\u201911. Association for Computing Machinery, New York, pp 125\u2013132. https:\/\/doi.org\/10.1145\/2001576-2001594"},{"issue":"3","key":"116_CR27","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1016\/j.ejor.2013.10.024","volume":"234","author":"TJ Liao","year":"2014","unstructured":"Liao TJ, Stutzle T, Montes da Oca MA, Dorigo M (2014) A unified ant colony optimization algorithm for continuous optimization. Eur J Oper Res 234(3):597\u2013609. https:\/\/doi.org\/10.1016\/j.ejor.2013.10.024","journal-title":"Eur J Oper Res"},{"issue":"2","key":"116_CR28","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1109\/TEVC.2016.2591064","volume":"21","author":"Q Yang","year":"2017","unstructured":"Yang Q, Chen W, Yu Z, Gu T, Li Y, Zhang H, Zhang J (2017) Adaptive Multimodal Continuous Ant Colony Optimization. IEEE Trans Evol Comput 21(2):191\u2013205. https:\/\/doi.org\/10.1109\/TEVC.2016.2591064","journal-title":"IEEE Trans Evol Comput"},{"key":"116_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2014\/428539","volume":"2014","author":"L Liu","year":"2014","unstructured":"Liu L, Dai Y (2014) Gao J (2014) Ant colony optimization algorithm for continuous domains based on position distribution model of ant colony foraging. Sci World J 2014:1\u20139. https:\/\/doi.org\/10.1155\/2014\/428539","journal-title":"Sci World J"},{"issue":"1","key":"116_CR30","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1023\/B:NACO.0000023416.59689.4e","volume":"3","author":"S Kern","year":"2004","unstructured":"Kern S, Muller SD, Hansen N, Buche D, Ocenasek J, Koumoutsakos P (2004) Learning probability distributions in continuous evolutionary algorithms \u2013 A comparative review. Nat Comput 3(1):77\u2013112. https:\/\/doi.org\/10.1023\/B:NACO.0000023416.59689.4e","journal-title":"Nat Comput"},{"key":"116_CR31","unstructured":"Price KV, Awad NH, Ali MZ, Suganthan PN (2018) The 100-digit challenge: Problem definitions and evaluation criteria for the 100-digit challenge special session and competition on single objective numerical optimization. Technical Report, Nanyang Technological University, Singapore"},{"key":"116_CR32","doi-asserted-by":"publisher","first-page":"43473","DOI":"10.1109\/ACCESS.2019.2907012","volume":"7","author":"JM Abdullah","year":"2019","unstructured":"Abdullah JM, Ahmed T (2019) Fitness dependent optimizer: inspired by the bee swarming reproductive process. IEEE Access 7:43473\u201343486. https:\/\/doi.org\/10.1109\/ACCESS.2019.2907012","journal-title":"IEEE Access"},{"issue":"4","key":"116_CR33","doi-asserted-by":"publisher","first-page":"1053","DOI":"10.1007\/s00521-015-1920-1","volume":"27","author":"S Mirjalili","year":"2015","unstructured":"Mirjalili S (2015) Dragonfly algorithm: a new meta-heuristic optimization technique for solving single-objective discrete and multi-objective problems. Neural Comput Appl 27(4):1053\u20131073. https:\/\/doi.org\/10.1007\/s00521-015-1920-1","journal-title":"Neural Comput Appl"},{"key":"116_CR34","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.advengsoft.2016.01.008","volume":"95","author":"S Mirjalili","year":"2016","unstructured":"Mirjalili S, Lewis A (2016) The whale optimization algorithm. Adv Eng Softw 95:51\u201367. https:\/\/doi.org\/10.1016\/j.advengsoft.2016.01.008","journal-title":"Adv Eng Softw"},{"key":"116_CR35","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/j.advengsoft.2017.07.002","volume":"114","author":"S Mirjalili","year":"2017","unstructured":"Mirjalili S, Gandomi AH, Mirjalili SZ, Saremi S, Faris H, Mirjalili SM (2017) Salp swarm algorithm: a bio-inspired optimizer for engineering design problems. Adv Eng Soft 114:163\u2013191. https:\/\/doi.org\/10.1016\/j.advengsoft.2017.07.002","journal-title":"Adv Eng Soft"}],"container-title":["Journal of the Brazilian Computer Society"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13173-021-00116-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s13173-021-00116-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13173-021-00116-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,13]],"date-time":"2024-08-13T10:46:14Z","timestamp":1723545974000},"score":1,"resource":{"primary":{"URL":"https:\/\/journal-bcs.springeropen.com\/articles\/10.1186\/s13173-021-00116-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12]]},"references-count":35,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["116"],"URL":"https:\/\/doi.org\/10.1186\/s13173-021-00116-8","relation":{},"ISSN":["0104-6500","1678-4804"],"issn-type":[{"value":"0104-6500","type":"print"},{"value":"1678-4804","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,12]]},"assertion":[{"value":"12 February 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 August 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 December 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"16"}}