{"id":"https://openalex.org/W1978232925","doi":"https://doi.org/10.2298/csis110927038j","title":"Ant colony optimization algorithm with pheromone correction strategy for the minimum connected dominating set problem","display_name":"Ant colony optimization algorithm with pheromone correction strategy for the minimum connected dominating set problem","publication_year":2012,"publication_date":"2012-10-16","ids":{"openalex":"https://openalex.org/W1978232925","doi":"https://doi.org/10.2298/csis110927038j","mag":"1978232925"},"language":"en","primary_location":{"id":"doi:10.2298/csis110927038j","is_oa":true,"landing_page_url":"https://doi.org/10.2298/csis110927038j","pdf_url":"http://www.doiserbia.nb.rs/ft.aspx?id=1820-02141200038J","source":{"id":"https://openalex.org/S206939107","display_name":"Computer Science and Information Systems","issn_l":"1820-0214","issn":["1820-0214","2406-1018"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310321031","host_organization_name":"ComSIS Consortium","host_organization_lineage":["https://openalex.org/P4310321031"],"host_organization_lineage_names":["ComSIS Consortium"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computer Science and Information Systems","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"http://www.doiserbia.nb.rs/ft.aspx?id=1820-02141200038J","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5008685555","display_name":"Raka Jovanovi\u0107","orcid":"https://orcid.org/0000-0001-8167-1516"},"institutions":[{"id":"https://openalex.org/I58152225","display_name":"Texas A&M University at Qatar","ror":"https://ror.org/03vb4dm14","country_code":"QA","type":"education","lineage":["https://openalex.org/I58152225","https://openalex.org/I91045830"]},{"id":"https://openalex.org/I92528248","display_name":"Qatar Foundation","ror":"https://ror.org/01cawbq05","country_code":"QA","type":"funder","lineage":["https://openalex.org/I92528248"]}],"countries":["QA"],"is_corresponding":false,"raw_author_name":"Raka Jovanovic","raw_affiliation_strings":["Texas AM University at Qatar, Doha, Qatar","Qatar Environment & Energy Research Institute"],"raw_orcid":"https://orcid.org/0000-0001-8167-1516","affiliations":[{"raw_affiliation_string":"Texas AM University at Qatar, Doha, Qatar","institution_ids":["https://openalex.org/I58152225"]},{"raw_affiliation_string":"Qatar Environment & Energy Research Institute","institution_ids":["https://openalex.org/I92528248"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5067245090","display_name":"Milan Tuba","orcid":"https://orcid.org/0000-0003-3794-3056"},"institutions":[{"id":"https://openalex.org/I159365519","display_name":"Megatrend University","ror":"https://ror.org/02ffca462","country_code":"RS","type":"education","lineage":["https://openalex.org/I159365519"]}],"countries":["RS"],"is_corresponding":false,"raw_author_name":"Milan Tuba","raw_affiliation_strings":["Megatrend University Belgrade, Faculty of Computer Science, Belgrade"],"raw_orcid":"https://orcid.org/0000-0003-3794-3056","affiliations":[{"raw_affiliation_string":"Megatrend University Belgrade, Faculty of Computer Science, Belgrade","institution_ids":["https://openalex.org/I159365519"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":10.1657,"has_fulltext":true,"cited_by_count":106,"citation_normalized_percentile":{"value":0.98403178,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":"10","issue":"1","first_page":"133","last_page":"149"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","score":0.996999979019165,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.996999979019165,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10080","display_name":"Energy Efficient Wireless Sensor Networks","score":0.9955999851226807,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9952999949455261,"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/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.8043584823608398},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7912534475326538},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.6259585022926331},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5260919332504272},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5067773461341858},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.49571430683135986},{"id":"https://openalex.org/keywords/local-optimum","display_name":"Local optimum","score":0.4929916560649872},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.393662691116333},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.14045187830924988}],"concepts":[{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.8043584823608398},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7912534475326538},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6259585022926331},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5260919332504272},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5067773461341858},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.49571430683135986},{"id":"https://openalex.org/C141934464","wikidata":"https://www.wikidata.org/wiki/Q3305386","display_name":"Local optimum","level":2,"score":0.4929916560649872},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.393662691116333},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.14045187830924988},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.2298/csis110927038j","is_oa":true,"landing_page_url":"https://doi.org/10.2298/csis110927038j","pdf_url":"http://www.doiserbia.nb.rs/ft.aspx?id=1820-02141200038J","source":{"id":"https://openalex.org/S206939107","display_name":"Computer Science and Information Systems","issn_l":"1820-0214","issn":["1820-0214","2406-1018"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310321031","host_organization_name":"ComSIS Consortium","host_organization_lineage":["https://openalex.org/P4310321031"],"host_organization_lineage_names":["ComSIS Consortium"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computer Science and Information Systems","raw_type":"journal-article"},{"id":"pmh:oai:doiserbia:1820-02141200038J","is_oa":false,"landing_page_url":"http://doi.org/10.2298/CSIS110927038J","pdf_url":null,"source":{"id":"https://openalex.org/S4306400515","display_name":"Digital Object Identifier (DOI) Repository Serbia (National Library of Serbia)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210142455","host_organization_name":"National Library of Serbia","host_organization_lineage":["https://openalex.org/I4210142455"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":". (00) 38-38"}],"best_oa_location":{"id":"doi:10.2298/csis110927038j","is_oa":true,"landing_page_url":"https://doi.org/10.2298/csis110927038j","pdf_url":"http://www.doiserbia.nb.rs/ft.aspx?id=1820-02141200038J","source":{"id":"https://openalex.org/S206939107","display_name":"Computer Science and Information Systems","issn_l":"1820-0214","issn":["1820-0214","2406-1018"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310321031","host_organization_name":"ComSIS Consortium","host_organization_lineage":["https://openalex.org/P4310321031"],"host_organization_lineage_names":["ComSIS Consortium"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computer Science and Information Systems","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1527626225","display_name":null,"funder_award_id":"III-44006","funder_id":"https://openalex.org/F4320322729","funder_display_name":"Ministarstvo Prosvete, Nauke i Tehnolo\u0161kog Razvoja"}],"funders":[{"id":"https://openalex.org/F4320322729","display_name":"Ministarstvo Prosvete, Nauke i Tehnolo\u0161kog Razvoja","ror":"https://ror.org/01znas443"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1978232925.pdf","grobid_xml":"https://content.openalex.org/works/W1978232925.grobid-xml"},"referenced_works_count":33,"referenced_works":["https://openalex.org/W1499595654","https://openalex.org/W1503619557","https://openalex.org/W1507811735","https://openalex.org/W1565617730","https://openalex.org/W1751694405","https://openalex.org/W1801849579","https://openalex.org/W1982693868","https://openalex.org/W1987990114","https://openalex.org/W1988829186","https://openalex.org/W2000236941","https://openalex.org/W2007810111","https://openalex.org/W2011606328","https://openalex.org/W2024884029","https://openalex.org/W2026780428","https://openalex.org/W2030965968","https://openalex.org/W2037917527","https://openalex.org/W2067435011","https://openalex.org/W2072173547","https://openalex.org/W2109235974","https://openalex.org/W2109336245","https://openalex.org/W2117461507","https://openalex.org/W2131332586","https://openalex.org/W2134003300","https://openalex.org/W2139023178","https://openalex.org/W2149736824","https://openalex.org/W2157509667","https://openalex.org/W2167920923","https://openalex.org/W2249156935","https://openalex.org/W2314906888","https://openalex.org/W2462307955","https://openalex.org/W2610837804","https://openalex.org/W3141863997","https://openalex.org/W4392204353"],"related_works":["https://openalex.org/W4387497383","https://openalex.org/W3183948672","https://openalex.org/W3173606202","https://openalex.org/W3110381201","https://openalex.org/W2948807893","https://openalex.org/W2935909890","https://openalex.org/W2778153218","https://openalex.org/W2758277628","https://openalex.org/W1531601525","https://openalex.org/W3175696377"],"abstract_inverted_index":{"In":[0],"this":[1,89,96],"paper":[2],"an":[3],"ant":[4],"colony":[5],"optimization":[6],"(ACO)":[7],"algorithm":[8,47,54,88,111],"for":[9],"the":[10,32,82,86,107,130],"minimum":[11],"connected":[12],"dominating":[13],"set":[14],"problem":[15],"(MCDSP)":[16],"is":[17,99,127],"presented.":[18],"The":[19],"MCDSP":[20],"become":[21],"increasingly":[22],"important":[23],"in":[24,64],"recent":[25],"years":[26],"due":[27],"to":[28,31,81,101,129],"its":[29],"applicability":[30],"mobile":[33],"ad":[34],"hoc":[35],"networks":[36],"(MANETs)":[37],"and":[38,77,123],"sensor":[39],"grids.":[40],"We":[41,67,114],"have":[42,68,115],"implemented":[43],"a":[44,50,57,73],"one-step":[45],"ACO":[46,87,110],"based":[48],"on":[49,119],"known":[51],"simple":[52],"greedy":[53],"that":[55,70,125],"has":[56],"significant":[58],"drawback":[59],"of":[60,85],"being":[61],"easily":[62],"trapped":[63],"local":[65],"optima.":[66],"shown":[69,124],"by":[71],"adding":[72],"pheromone":[74],"correction":[75],"strategy":[76],"dedicating":[78],"special":[79],"attention":[80],"initial":[83],"condition":[84],"negative":[90],"effect":[91],"can":[92],"be":[93],"avoided.":[94],"Using":[95],"approach":[97],"it":[98,126],"possible":[100],"achieve":[102],"good":[103],"results":[104],"without":[105],"using":[106],"complex":[108],"two-step":[109],"previously":[112],"developed.":[113],"tested":[116],"our":[117],"method":[118],"standard":[120],"benchmark":[121],"data":[122],"competitive":[128],"existing":[131],"algorithms.":[132]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":7},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":11},{"year":2018,"cited_by_count":11},{"year":2017,"cited_by_count":11},{"year":2016,"cited_by_count":15},{"year":2015,"cited_by_count":8},{"year":2014,"cited_by_count":17},{"year":2013,"cited_by_count":3}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2016-06-24T00:00:00"}