{"id":"https://openalex.org/W1966048254","doi":"https://doi.org/10.1145/2001858.2002055","title":"Robot routing in sparse wireless sensor networks with continuous ant colony optimization","display_name":"Robot routing in sparse wireless sensor networks with continuous ant colony optimization","publication_year":2011,"publication_date":"2011-07-12","ids":{"openalex":"https://openalex.org/W1966048254","doi":"https://doi.org/10.1145/2001858.2002055","mag":"1966048254"},"language":"en","primary_location":{"id":"doi:10.1145/2001858.2002055","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2001858.2002055","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 13th annual conference companion on Genetic and evolutionary computation","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5080975003","display_name":"Giovanni Comarela","orcid":"https://orcid.org/0000-0001-7612-9650"},"institutions":[{"id":"https://openalex.org/I110200422","display_name":"Universidade Federal de Minas Gerais","ror":"https://ror.org/0176yjw32","country_code":"BR","type":"education","lineage":["https://openalex.org/I110200422"]}],"countries":["BR"],"is_corresponding":true,"raw_author_name":"Giovanni Comarela","raw_affiliation_strings":["Universidade Federal de Minas Gerais, Belo Horizonte, Brazil"],"affiliations":[{"raw_affiliation_string":"Universidade Federal de Minas Gerais, Belo Horizonte, Brazil","institution_ids":["https://openalex.org/I110200422"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5064168052","display_name":"K\u00eania C. Gon\u00e7alves","orcid":null},"institutions":[{"id":"https://openalex.org/I110200422","display_name":"Universidade Federal de Minas Gerais","ror":"https://ror.org/0176yjw32","country_code":"BR","type":"education","lineage":["https://openalex.org/I110200422"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"K\u00eania Gon\u00e7alves","raw_affiliation_strings":["Universidade Federal de Minas Gerais, Belo Horizonte, Brazil"],"affiliations":[{"raw_affiliation_string":"Universidade Federal de Minas Gerais, Belo Horizonte, Brazil","institution_ids":["https://openalex.org/I110200422"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5009911024","display_name":"Gisele L. Pappa","orcid":"https://orcid.org/0000-0002-0349-4494"},"institutions":[{"id":"https://openalex.org/I110200422","display_name":"Universidade Federal de Minas Gerais","ror":"https://ror.org/0176yjw32","country_code":"BR","type":"education","lineage":["https://openalex.org/I110200422"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Gisele Lobo Pappa","raw_affiliation_strings":["Universidade Federal de Minas Gerais, Belo Horizonte, Brazil"],"affiliations":[{"raw_affiliation_string":"Universidade Federal de Minas Gerais, Belo Horizonte, Brazil","institution_ids":["https://openalex.org/I110200422"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5084044470","display_name":"Jussara M. Almeida","orcid":"https://orcid.org/0000-0001-9142-2919"},"institutions":[{"id":"https://openalex.org/I110200422","display_name":"Universidade Federal de Minas Gerais","ror":"https://ror.org/0176yjw32","country_code":"BR","type":"education","lineage":["https://openalex.org/I110200422"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Jussara Almeida","raw_affiliation_strings":["Universidade Federal de Minas Gerais, Belo Horizonte, Brazil"],"affiliations":[{"raw_affiliation_string":"Universidade Federal de Minas Gerais, Belo Horizonte, Brazil","institution_ids":["https://openalex.org/I110200422"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5058840149","display_name":"Virg\u0131\u0301lio Almeida","orcid":"https://orcid.org/0000-0001-6452-0361"},"institutions":[{"id":"https://openalex.org/I110200422","display_name":"Universidade Federal de Minas Gerais","ror":"https://ror.org/0176yjw32","country_code":"BR","type":"education","lineage":["https://openalex.org/I110200422"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Virg\u00edlio Almeida","raw_affiliation_strings":["Universidade Federal de Minas Gerais, Belo Horizonte, Brazil"],"affiliations":[{"raw_affiliation_string":"Universidade Federal de Minas Gerais, Belo Horizonte, Brazil","institution_ids":["https://openalex.org/I110200422"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5080975003"],"corresponding_institution_ids":["https://openalex.org/I110200422"],"apc_list":null,"apc_paid":null,"fwci":2.5655,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.89934761,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"599","last_page":"606"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9959999918937683,"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.9959999918937683,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9916999936103821,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11133","display_name":"UAV Applications and Optimization","score":0.9911999702453613,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.7748783826828003},{"id":"https://openalex.org/keywords/wireless-sensor-network","display_name":"Wireless sensor network","score":0.7328000664710999},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6877666115760803},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.6093330383300781},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.5803801417350769},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.563839316368103},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.5287418365478516},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.47876206040382385},{"id":"https://openalex.org/keywords/real-time-computing","display_name":"Real-time computing","score":0.4037255048751831},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.35741421580314636},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.28454476594924927},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.19559124112129211}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.7748783826828003},{"id":"https://openalex.org/C24590314","wikidata":"https://www.wikidata.org/wiki/Q336038","display_name":"Wireless sensor network","level":2,"score":0.7328000664710999},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6877666115760803},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.6093330383300781},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.5803801417350769},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.563839316368103},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.5287418365478516},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.47876206040382385},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.4037255048751831},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.35741421580314636},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.28454476594924927},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.19559124112129211}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2001858.2002055","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2001858.2002055","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 13th annual conference companion on Genetic and evolutionary computation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6899999976158142,"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W70821729","https://openalex.org/W206440355","https://openalex.org/W1492170047","https://openalex.org/W1507145734","https://openalex.org/W1718162526","https://openalex.org/W2141791003","https://openalex.org/W2144242878","https://openalex.org/W2145128369","https://openalex.org/W2168990813","https://openalex.org/W2582743722","https://openalex.org/W2752885492","https://openalex.org/W3145128584","https://openalex.org/W3151200052","https://openalex.org/W4285719527","https://openalex.org/W7029321148","https://openalex.org/W7029391333"],"related_works":["https://openalex.org/W4385871958","https://openalex.org/W4245157707","https://openalex.org/W1997193297","https://openalex.org/W2208777194","https://openalex.org/W2908391583","https://openalex.org/W2369428395","https://openalex.org/W2406404685","https://openalex.org/W2981400081","https://openalex.org/W4297427155","https://openalex.org/W2975368677"],"abstract_inverted_index":{"Sparse":[0],"wireless":[1],"sensor":[2],"networks":[3],"are":[4,11,173],"characterized":[5],"by":[6,99],"the":[7,9,47,61,68,84,92,109,119,125,176],"distances":[8],"sensors":[10,24,48,93],"from":[12,22,52,75],"each":[13,112],"other.":[14],"In":[15,54,122],"this":[16,55,123],"type":[17],"of":[18,28,164],"network,":[19],"gathering":[20],"data":[21,51,73],"all":[23,76],"in":[25,36,157,185],"a":[26,32,39,64,100,116,131,141],"point":[27,117],"interest":[29],"might":[30],"be":[31,81,128],"difficult":[33],"task,":[34],"and":[35,49,71,151],"many":[37],"cases":[38],"mobile":[40],"robot":[41,62,110],"is":[42,105],"used":[43],"to":[44,59,159],"travel":[45],"along":[46],"collect":[50],"them.":[53],"case,":[56,124],"we":[57],"need":[58],"provide":[60],"with":[63,135,175,181],"route":[65],"that":[66,108,161,170],"minimizes":[67],"traveled":[69],"distance":[70],"allows":[72],"collection":[74],"sensors.":[77],"This":[78,138],"problem":[79,126],"can":[80,127],"modeled":[82,129],"as":[83,130],"classic":[85],"Traveling":[86],"Salesman":[87],"Problem":[88],"(TSP).":[89],"However,":[90],"when":[91,179],"have":[94],"an":[95],"influence":[96],"area":[97],"bounded":[98],"circle,":[101],"for":[102,155],"example,":[103],"it":[104],"not":[106],"necessary":[107],"touches":[111],"sensor,":[113],"but":[114],"only":[115],"inside":[118],"covered":[120],"area.":[121],"special":[132,162],"case":[133,163],"TSP":[134,156],"Neighborhoods":[136],"(TSPN).":[137],"work":[139],"presents":[140],"new":[142],"approach":[143],"based":[144],"on":[145],"continuous":[146],"Ant":[147],"Colony":[148],"Optimization":[149],"(ACO)":[150],"simple":[152],"combinatorial":[153],"technique":[154],"0order":[158],"solve":[160],"TSPN.":[165],"The":[166],"experiments":[167],"performed":[168],"indicate":[169],"significant":[171],"improvements":[172],"obtained":[174],"proposed":[177],"heuristic":[178],"compared":[180],"other":[182],"methods":[183],"found":[184],"literature.":[186]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}