{"id":"https://openalex.org/W1972734768","doi":"https://doi.org/10.1109/sis.2014.7011805","title":"A distributed and decentralized approach for ant colony optimization with fuzzy parameter adaptation in traveling salesman problem","display_name":"A distributed and decentralized approach for ant colony optimization with fuzzy parameter adaptation in traveling salesman problem","publication_year":2014,"publication_date":"2014-12-01","ids":{"openalex":"https://openalex.org/W1972734768","doi":"https://doi.org/10.1109/sis.2014.7011805","mag":"1972734768"},"language":"en","primary_location":{"id":"doi:10.1109/sis.2014.7011805","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sis.2014.7011805","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE Symposium on Swarm Intelligence","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/A5091258064","display_name":"Jake Collings","orcid":null},"institutions":[{"id":"https://openalex.org/I24571045","display_name":"University of North Dakota","ror":"https://ror.org/04a5szx83","country_code":"US","type":"education","lineage":["https://openalex.org/I24571045"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Jake Collings","raw_affiliation_strings":["Department of Computer Science, University of North Dakota, Grand Forks, ND, U.S.A","Department of Computer Science, University of North Dakota, Grand Forks, ND 58202-9015, U.S.A"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of North Dakota, Grand Forks, ND, U.S.A","institution_ids":["https://openalex.org/I24571045"]},{"raw_affiliation_string":"Department of Computer Science, University of North Dakota, Grand Forks, ND 58202-9015, U.S.A","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100462730","display_name":"Eun\u2010jin Kim","orcid":"https://orcid.org/0000-0001-5607-6635"},"institutions":[{"id":"https://openalex.org/I24571045","display_name":"University of North Dakota","ror":"https://ror.org/04a5szx83","country_code":"US","type":"education","lineage":["https://openalex.org/I24571045"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Eunjin Kim","raw_affiliation_strings":["Department of Computer Science, University of North Dakota, Grand Forks, ND, U.S.A","Department of Computer Science, University of North Dakota, Grand Forks, ND 58202-9015, U.S.A"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of North Dakota, Grand Forks, ND, U.S.A","institution_ids":["https://openalex.org/I24571045"]},{"raw_affiliation_string":"Department of Computer Science, University of North Dakota, Grand Forks, ND 58202-9015, U.S.A","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5091258064"],"corresponding_institution_ids":["https://openalex.org/I24571045"],"apc_list":null,"apc_paid":null,"fwci":0.818,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.79525011,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"9"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9995999932289124,"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.9995999932289124,"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.994700014591217,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9919000267982483,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.8912614583969116},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.821406900882721},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6539429426193237},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6220740079879761},{"id":"https://openalex.org/keywords/swarm-intelligence","display_name":"Swarm intelligence","score":0.5693565011024475},{"id":"https://openalex.org/keywords/fuzzy-logic","display_name":"Fuzzy logic","score":0.5685000419616699},{"id":"https://openalex.org/keywords/adaptation","display_name":"Adaptation (eye)","score":0.5549882054328918},{"id":"https://openalex.org/keywords/ant-colony","display_name":"Ant colony","score":0.5197924375534058},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.42107656598091125},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.41477662324905396},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.37468835711479187},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20842334628105164},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.19462734460830688},{"id":"https://openalex.org/keywords/particle-swarm-optimization","display_name":"Particle swarm optimization","score":0.17414280772209167}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8912614583969116},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.821406900882721},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6539429426193237},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6220740079879761},{"id":"https://openalex.org/C119487961","wikidata":"https://www.wikidata.org/wiki/Q863960","display_name":"Swarm intelligence","level":3,"score":0.5693565011024475},{"id":"https://openalex.org/C58166","wikidata":"https://www.wikidata.org/wiki/Q224821","display_name":"Fuzzy logic","level":2,"score":0.5685000419616699},{"id":"https://openalex.org/C139807058","wikidata":"https://www.wikidata.org/wiki/Q352374","display_name":"Adaptation (eye)","level":2,"score":0.5549882054328918},{"id":"https://openalex.org/C60891933","wikidata":"https://www.wikidata.org/wiki/Q796575","display_name":"Ant colony","level":3,"score":0.5197924375534058},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.42107656598091125},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.41477662324905396},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.37468835711479187},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20842334628105164},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.19462734460830688},{"id":"https://openalex.org/C85617194","wikidata":"https://www.wikidata.org/wiki/Q2072794","display_name":"Particle swarm optimization","level":2,"score":0.17414280772209167},{"id":"https://openalex.org/C120665830","wikidata":"https://www.wikidata.org/wiki/Q14620","display_name":"Optics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/sis.2014.7011805","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sis.2014.7011805","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE Symposium on Swarm Intelligence","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":9,"referenced_works":["https://openalex.org/W1504935863","https://openalex.org/W1515415125","https://openalex.org/W1566652554","https://openalex.org/W2063769328","https://openalex.org/W2077126753","https://openalex.org/W2085856772","https://openalex.org/W2113293477","https://openalex.org/W2164987379","https://openalex.org/W2233279483"],"related_works":["https://openalex.org/W4385871958","https://openalex.org/W1611875833","https://openalex.org/W1997193297","https://openalex.org/W2388217074","https://openalex.org/W2394153495","https://openalex.org/W2363465025","https://openalex.org/W2462483068","https://openalex.org/W2352212117","https://openalex.org/W2300135944","https://openalex.org/W192709900"],"abstract_inverted_index":{"Ant":[0],"Colony":[1],"Optimization":[2],"(ACO)":[3],"is":[4,39,69,89,107,122],"a":[5,23,42,55,102],"swarm":[6],"intelligence":[7],"technique":[8],"often":[9],"applied":[10],"to":[11,14,46,115],"find":[12],"solutions":[13],"hard":[15],"optimization":[16],"problems.":[17],"In":[18,35],"this":[19],"paper,":[20],"we":[21],"present":[22],"new":[24],"decentralized":[25],"peer-to-peer":[26],"approach":[27,38,80],"for":[28,81,124],"implementing":[29],"ACO":[30,53],"on":[31],"distributed":[32],"memory":[33],"clusters.":[34],"addition,":[36],"the":[37,52,59,64,79,82,110],"augmented":[40],"with":[41,91,96,109,117,129],"fuzzy":[43],"logic":[44],"controller":[45],"reactively":[47],"adapt":[48],"several":[49,92],"parameters":[50],"of":[51,57,78,99,127],"as":[54],"method":[56],"offsetting":[58],"increased":[60],"exploitation":[61],"resulting":[62],"from":[63],"way":[65],"in":[66,101],"which":[67],"information":[68],"shared":[70],"between":[71],"computing":[72],"processes.":[73],"We":[74],"build":[75],"an":[76,130],"implementation":[77,88],"Travelling":[83],"Salesman":[84],"Problem":[85],"(TSP).":[86],"The":[87,104],"tested":[90],"TSP":[93],"problem":[94],"instances":[95],"different":[97,125],"numbers":[98,126],"processes":[100,128],"cluster.":[103],"adaptive":[105],"version":[106,112],"compared":[108],"non-adaptive":[111],"and":[113,120],"shown":[114],"agree":[116],"our":[118],"expectations":[119],"performance":[121],"evaluated":[123],"improvement":[131],"shown.":[132]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-01-13T01:12:25.745995","created_date":"2025-10-10T00:00:00"}