{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T01:34:05Z","timestamp":1777685645422,"version":"3.51.4"},"reference-count":32,"publisher":"SAGE Publications","issue":"2","license":[{"start":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T00:00:00Z","timestamp":1556668800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["International Journal of Hybrid Intelligent Systems"],"published-print":{"date-parts":[[2019,5]]},"abstract":"<jats:p>This paper presents a method to assess the state of convergence of Ant Colony Optimization algorithms (ACO) using network science metrics. ACO is a computational intelligence technique inspired by the behavior of ants in nature, and it is commonly used to solve combinatorial optimization problems. In the ACO, artificial ants seek for solutions to the tackled problem, transversing the graph that represents the combinatorial problem. For each displacement, the ants deposit pheromone on the edges which they passed. The ants use the pheromone for indirect communication, and the amount of pheromone weighs the intensity of interaction between the ants. The graph of pheromones forms a network that evolves along the iterations. Network Science allows studying the structure and the dynamics of networks. This area of study provides metrics used to extract global information from networks in a particular moment. This paper aims to show that two network science metrics, the Clustering coefficient, and the Assortativity, can be adapted and used to assess the pheromone graph and extract information to identify the convergence state of the ACO. We analyze the convergence of the four variations of the ACO in the Traveling Salesman Problem (TSP). Based on the obtained results, we demonstrate that it is possible to evaluate the convergence of the ACO for the TSP based on the proposed metrics, especially the adapted clustering coefficient.<\/jats:p>","DOI":"10.3233\/his-190265","type":"journal-article","created":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T10:49:12Z","timestamp":1557830952000},"page":"111-127","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":0,"title":["Assessing optimization algorithms based on ant colony using adapted networks science metrics"],"prefix":"10.1177","volume":"15","author":[{"given":"Sergio F.","family":"Ribeiro","sequence":"first","affiliation":[{"name":"University of Pernambuco","place":["Brazil"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carmelo J.A.","family":"Bastos-Filho","sequence":"additional","affiliation":[{"name":"University of Pernambuco","place":["Brazil"]}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2019,5]]},"reference":[{"key":"e_1_3_1_2_2","doi-asserted-by":"publisher","DOI":"10.3233\/HIS-160234"},{"key":"e_1_3_1_3_2","unstructured":"DorigoM. Optimization learning and natural algorithms (in Italian) Ph.D. thesis Dipartimento di Elettronica Politecnico di Milano Mil\u00e3o Italy 1992."},{"key":"e_1_3_1_4_2","doi-asserted-by":"publisher","DOI":"10.1109\/3477.484436"},{"key":"e_1_3_1_5_2","doi-asserted-by":"publisher","DOI":"10.1109\/4235.585892"},{"key":"e_1_3_1_6_2","doi-asserted-by":"publisher","DOI":"10.1126\/science.286.5439.509"},{"key":"e_1_3_1_7_2","doi-asserted-by":"publisher","DOI":"10.1137\/S003614450342480"},{"key":"e_1_3_1_8_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36844-8_17"},{"key":"e_1_3_1_9_2","doi-asserted-by":"publisher","DOI":"10.1007\/s13278-015-0245-5"},{"key":"e_1_3_1_10_2","first-page":"27","article-title":"Assessing ant colony optimization using adapted networks science metrics","author":"Ribeiro S.F.","year":"2018","unstructured":"RibeiroS.F. and Bastos-FilhoC.J., Assessing ant colony optimization using adapted networks science metrics, Hybrid Intelligent Systems, MIR LABS, (2018), 27\u201333.","journal-title":"Hybrid Intelligent Systems"},{"key":"e_1_3_1_11_2","unstructured":"NewmanM. Networks: An Introduction OUP Oxford 2010."},{"key":"e_1_3_1_12_2","doi-asserted-by":"publisher","DOI":"10.1109\/MCI.2014.2326101"},{"key":"e_1_3_1_13_2","doi-asserted-by":"publisher","DOI":"10.18637\/jss.v023.i02"},{"key":"e_1_3_1_14_2","doi-asserted-by":"publisher","DOI":"10.3233\/HIS-180258"},{"key":"e_1_3_1_15_2","unstructured":"RamosV. FernandesC. and RosaA.C. Social cognitive maps swarm perception and distributed search on dynamic landscapes arXiv preprint nlin\/0502057."},{"key":"e_1_3_1_16_2","doi-asserted-by":"crossref","unstructured":"BonabeauE. DorigoM. and TheraulazG. Swarm Intelligence: From Natural to Artificial Systems Oxford University Press 1999.","DOI":"10.1093\/oso\/9780195131581.001.0001"},{"key":"e_1_3_1_17_2","unstructured":"EngelbrechtA.P. Computational Intelligence: An Introduction John Wiley and Sons 2007."},{"key":"e_1_3_1_18_2","doi-asserted-by":"publisher","DOI":"10.1109\/MCI.2006.329691"},{"key":"e_1_3_1_19_2","article-title":"Ant colony optimization: Overview and recent advances","author":"Dorigo M.","unstructured":"DorigoM. and St\u00fctzleT., Ant colony optimization: Overview and recent advances, in: Handbook of Metaheuristics.","journal-title":"Handbook of Metaheuristics"},{"key":"e_1_3_1_20_2","doi-asserted-by":"publisher","DOI":"10.3233\/HIS-140197"},{"key":"e_1_3_1_21_2","unstructured":"WatkinsC. Learning with delayed rewards Ph.D. thesis Psychology Department University of Cambridge England 1989."},{"key":"e_1_3_1_22_2","doi-asserted-by":"publisher","DOI":"10.1109\/MNET.2010.5634435"},{"key":"e_1_3_1_23_2","doi-asserted-by":"publisher","DOI":"10.1038\/35036627"},{"key":"e_1_3_1_24_2","doi-asserted-by":"publisher","DOI":"10.1103\/RevModPhys.74.47"},{"key":"e_1_3_1_25_2","unstructured":"NewmanM.E. Random graphs as models of networks arXiv preprint cond-mat\/0202208."},{"key":"e_1_3_1_26_2","doi-asserted-by":"publisher","DOI":"10.1093\/comnet\/cnv005"},{"key":"e_1_3_1_27_2","unstructured":"PiraveenanM. Topological analysis of complex networks using assortativity Doutorado School of Information technologies The University of Sydney 2010."},{"key":"e_1_3_1_28_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2014.05.229"},{"key":"e_1_3_1_29_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.89.208701"},{"key":"e_1_3_1_30_2","first-page":"1","article-title":"Towards a network-based approach to analyze particle swarm optimizers","author":"Oliveira M.","year":"2014","unstructured":"OliveiraM. Bastos-FilhoC.J. and MenezesR., Towards a network-based approach to analyze particle swarm optimizers, in: Swarm Intelligence (SIS), 2014 IEEE Symposium on, IEEE, 2014, pp. 1\u20138.","journal-title":"Swarm Intelligence (SIS), 2014 IEEE Symposium on"},{"key":"e_1_3_1_31_2","doi-asserted-by":"publisher","DOI":"10.1007\/s13278-015-0245-5"},{"key":"e_1_3_1_32_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-44427-7_7"},{"key":"e_1_3_1_33_2","doi-asserted-by":"publisher","DOI":"10.1017\/nws.2016.5"}],"container-title":["International Journal of Hybrid Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/HIS-190265","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.3233\/HIS-190265","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/HIS-190265","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T08:52:44Z","timestamp":1777452764000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/HIS-190265"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5]]},"references-count":32,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,5]]}},"alternative-id":["10.3233\/HIS-190265"],"URL":"https:\/\/doi.org\/10.3233\/his-190265","relation":{},"ISSN":["1448-5869","1875-8819"],"issn-type":[{"value":"1448-5869","type":"print"},{"value":"1875-8819","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,5]]}}}