{"id":"https://openalex.org/W2046397053","doi":"https://doi.org/10.1109/icnc.2012.6234645","title":"A MapReduce based Ant Colony Optimization approach to combinatorial optimization problems","display_name":"A MapReduce based Ant Colony Optimization approach to combinatorial optimization problems","publication_year":2012,"publication_date":"2012-05-01","ids":{"openalex":"https://openalex.org/W2046397053","doi":"https://doi.org/10.1109/icnc.2012.6234645","mag":"2046397053"},"language":"en","primary_location":{"id":"doi:10.1109/icnc.2012.6234645","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icnc.2012.6234645","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 8th International Conference on Natural 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/A5031087962","display_name":"Bihan Wu","orcid":"https://orcid.org/0009-0002-7518-8063"},"institutions":[{"id":"https://openalex.org/I76569877","display_name":"Southeast University","ror":"https://ror.org/04ct4d772","country_code":"CN","type":"education","lineage":["https://openalex.org/I76569877"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Bihan Wu","raw_affiliation_strings":["School of Computer Science and Engineering, South East University, Nanjing, China","School of Computer Science and Engineering, Southeast University, Nanjing 210096, China#TAB#"],"affiliations":[{"raw_affiliation_string":"School of Computer Science and Engineering, South East University, Nanjing, China","institution_ids":["https://openalex.org/I76569877"]},{"raw_affiliation_string":"School of Computer Science and Engineering, Southeast University, Nanjing 210096, China#TAB#","institution_ids":["https://openalex.org/I76569877"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5072969773","display_name":"Gang Wu","orcid":"https://orcid.org/0000-0002-9855-6300"},"institutions":[{"id":"https://openalex.org/I9224756","display_name":"Northeastern University","ror":"https://ror.org/03awzbc87","country_code":"CN","type":"education","lineage":["https://openalex.org/I9224756"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Gang Wu","raw_affiliation_strings":["College of Information Science and Engineering, Northeastern University, Shenyang, China","College of Information Science and Engineering,Northeastern University,Shenyang 110004,China"],"affiliations":[{"raw_affiliation_string":"College of Information Science and Engineering, Northeastern University, Shenyang, China","institution_ids":["https://openalex.org/I9224756"]},{"raw_affiliation_string":"College of Information Science and Engineering,Northeastern University,Shenyang 110004,China","institution_ids":["https://openalex.org/I9224756"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5045371394","display_name":"Mengdong Yang","orcid":null},"institutions":[{"id":"https://openalex.org/I76569877","display_name":"Southeast University","ror":"https://ror.org/04ct4d772","country_code":"CN","type":"education","lineage":["https://openalex.org/I76569877"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Mengdong Yang","raw_affiliation_strings":["School of Computer Science and Engineering, South East University, Nanjing, China","School of Computer Science and Engineering, Southeast University, Nanjing 210096, China#TAB#"],"affiliations":[{"raw_affiliation_string":"School of Computer Science and Engineering, South East University, Nanjing, China","institution_ids":["https://openalex.org/I76569877"]},{"raw_affiliation_string":"School of Computer Science and Engineering, Southeast University, Nanjing 210096, China#TAB#","institution_ids":["https://openalex.org/I76569877"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5031087962"],"corresponding_institution_ids":["https://openalex.org/I76569877"],"apc_list":null,"apc_paid":null,"fwci":4.7095,"has_fulltext":false,"cited_by_count":29,"citation_normalized_percentile":{"value":0.94790398,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"728","last_page":"732"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9991999864578247,"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.9991999864578247,"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/T10538","display_name":"Data Mining Algorithms and Applications","score":0.9950000047683716,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9915000200271606,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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.8647583723068237},{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.7376953363418579},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7370847463607788},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.7273855805397034},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.6575830578804016},{"id":"https://openalex.org/keywords/extremal-optimization","display_name":"Extremal optimization","score":0.6229240298271179},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6118404865264893},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.5413015484809875},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.5223168730735779},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.4625095725059509},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2540575861930847},{"id":"https://openalex.org/keywords/meta-optimization","display_name":"Meta-optimization","score":0.25147369503974915},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.14671754837036133}],"concepts":[{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.8647583723068237},{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.7376953363418579},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7370847463607788},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.7273855805397034},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6575830578804016},{"id":"https://openalex.org/C188919014","wikidata":"https://www.wikidata.org/wiki/Q5422296","display_name":"Extremal optimization","level":4,"score":0.6229240298271179},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6118404865264893},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.5413015484809875},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.5223168730735779},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.4625095725059509},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2540575861930847},{"id":"https://openalex.org/C4935549","wikidata":"https://www.wikidata.org/wiki/Q6822261","display_name":"Meta-optimization","level":3,"score":0.25147369503974915},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.14671754837036133}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icnc.2012.6234645","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icnc.2012.6234645","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 8th International Conference on Natural Computation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1534709123","https://openalex.org/W1544666369","https://openalex.org/W1801849579","https://openalex.org/W1825216778","https://openalex.org/W1978177608","https://openalex.org/W1992533670","https://openalex.org/W2036691792","https://openalex.org/W2107941094","https://openalex.org/W2145473492","https://openalex.org/W2148888221","https://openalex.org/W6631937254","https://openalex.org/W6638601623"],"related_works":["https://openalex.org/W2208777194","https://openalex.org/W1997193297","https://openalex.org/W2146364482","https://openalex.org/W1604040598","https://openalex.org/W2530777107","https://openalex.org/W2406404685","https://openalex.org/W4245157707","https://openalex.org/W2369428395","https://openalex.org/W3013791021","https://openalex.org/W3164942530"],"abstract_inverted_index":{"Ant":[0],"Colony":[1],"Optimization":[2],"(ACO)":[3],"is":[4,96],"a":[5,20,68,84,112],"kind":[6],"of":[7,15,87,136],"meta-heuristics":[8],"algorithm,":[9],"which":[10,91],"simulates":[11],"the":[12,33,38,53,64,74,126,131],"social":[13],"behavior":[14],"ants":[16,88],"and":[17,37,89,134],"could":[18],"be":[19,123],"good":[21],"alternative":[22],"to":[23,52,100],"existing":[24],"algorithms":[25,106,121],"for":[26],"NP":[27],"hard":[28],"combinatorial":[29],"optimization":[30,105],"problems,":[31],"like":[32],"0-1":[34],"knapsack":[35],"problem":[36],"Traveling":[39],"Salesman":[40],"Problem":[41],"(TSP).":[42],"Although":[43],"ACO":[44,115,120,137],"can":[45,122],"get":[46,79],"solutions":[47],"that":[48],"are":[49],"quite":[50],"near":[51],"optimal":[54,70,76],"solution,":[55],"it":[56,82],"still":[57],"has":[58],"its":[59],"own":[60],"problems.":[61],"Premature":[62],"bogs":[63],"system":[65],"down":[66],"in":[67],"locally":[69],"solution":[71],"rather":[72],"than":[73],"global":[75],"one.":[77],"To":[78],"better":[80],"solutions,":[81],"requires":[83],"larger":[85],"number":[86],"iterations":[90],"consume":[92],"more":[93],"time.":[94],"Parallelization":[95],"an":[97],"effective":[98],"way":[99],"solve":[101],"large-scale":[102],"ant":[103],"colony":[104],"over":[107],"large":[108],"dataset.":[109],"We":[110,117,129],"propose":[111],"MapReduce":[113,127],"based":[114],"approach.":[116],"show":[118],"how":[119],"modeled":[124],"into":[125],"framework.":[128],"describe":[130],"algorithm":[132],"design":[133],"implementation":[135],"on":[138],"Hadoop.":[139]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}