{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,15]],"date-time":"2025-08-15T00:50:48Z","timestamp":1755219048582,"version":"3.43.0"},"reference-count":23,"publisher":"IEEE","license":[{"start":{"date-parts":[[2018,7,1]],"date-time":"2018-07-01T00:00:00Z","timestamp":1530403200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2018,7,1]],"date-time":"2018-07-01T00:00:00Z","timestamp":1530403200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,7]]},"DOI":"10.1109\/indin.2018.8471966","type":"proceedings-article","created":{"date-parts":[[2018,10,8]],"date-time":"2018-10-08T22:00:15Z","timestamp":1539036015000},"page":"583-588","source":"Crossref","is-referenced-by-count":0,"title":["Electricity Readers Routing Based on Clustering and Communities Detection"],"prefix":"10.1109","author":[{"given":"Lucas Martinuzzo","family":"Batista","sequence":"first","affiliation":[{"name":"N&#x00FA;cleo de Infer&#x00EA;ncia e Algoritmos (NINFA), Universidade Federal do Espirito Santo (UFES), ES, Brazil"}]},{"given":"Diego","family":"Lucchil","sequence":"additional","affiliation":[{"name":"N&#x00FA;cleo de Infer&#x00EA;ncia e Algoritmos (NINFA), Universidade Federal do Espirito Santo (UFES), ES, Brazil"}]},{"given":"Fl\u00e1vio Miguel","family":"Varej\u00e3ol","sequence":"additional","affiliation":[{"name":"N&#x00FA;cleo de Infer&#x00EA;ncia e Algoritmos (NINFA), Universidade Federal do Espirito Santo (UFES), ES, Brazil"}]},{"given":"Alexandre","family":"Rodngues","sequence":"additional","affiliation":[{"name":"N&#x00FA;cleo de Infer&#x00EA;ncia e Algoritmos (NINFA), Universidade Federal do Espirito Santo (UFES), ES, Brazil"}]},{"given":"Filipe","family":"Lima","sequence":"additional","affiliation":[{"name":"EDP Brasil, Vit&#x00F3;ria, ES, Brazil"}]},{"given":"Thiago","family":"Oliveira-Santos","sequence":"additional","affiliation":[{"name":"N&#x00FA;cleo de Infer&#x00EA;ncia e Algoritmos (NINFA), Universidade Federal do Espirito Santo (UFES), ES, Brazil"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/BF01589353"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-28349-8_2"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.cviu.2007.07.005"},{"key":"ref13","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1016\/S0734-189X(85)90153-7","article-title":"Image segmentation techniques","volume":"29","author":"haralick","year":"1985","journal-title":"Computer Vision Graphics and Image Processing"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/72.238312"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2011.181"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2009.08.008"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2009.09.011"},{"journal-title":"Finding Groups in Data","year":"1990","author":"rousseeuw","key":"ref18"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/276304.276312"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718515"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-77778-8"},{"journal-title":"In Pursuit of the Traveling Salesman Mathematics at the Limits of Computation","year":"2011","author":"cook","key":"ref6"},{"journal-title":"The Traveling Salesman Computational Solutions for TSP Applications","year":"1994","author":"reinelt","key":"ref5"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1287\/opre.43.2.231"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0548(79)90005-4"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(92)90192-C"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.35.2.254"},{"key":"ref9","first-page":"1295","article-title":"Worst case and probabilistic analysis of the 2-opt algorithm for the tsp","author":"englert","year":"2007","journal-title":"Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms"},{"key":"ref20","first-page":"226","article-title":"A density-based algorithm for discovering clusters in large spatial databases with noise","volume":"96","author":"ester","year":"1996","journal-title":"KDD"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.2307\/2346439"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/MAHC.1985.10011"},{"key":"ref23","doi-asserted-by":"crossref","first-page":"7821","DOI":"10.1073\/pnas.122653799","article-title":"Community structure in social and biological networks","volume":"99","author":"girvan","year":"2002","journal-title":"Proceedings of the National Academy of Sciences"}],"event":{"name":"2018 IEEE 16th International Conference on Industrial Informatics (INDIN)","start":{"date-parts":[[2018,7,18]]},"location":"Porto, Portugal","end":{"date-parts":[[2018,7,20]]}},"container-title":["2018 IEEE 16th International Conference on Industrial Informatics (INDIN)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8453042\/8471919\/08471966.pdf?arnumber=8471966","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,6]],"date-time":"2025-08-06T17:56:26Z","timestamp":1754502986000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8471966\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1109\/indin.2018.8471966","relation":{},"subject":[],"published":{"date-parts":[[2018,7]]}}}