{"id":"https://openalex.org/W2087505135","doi":"https://doi.org/10.1109/icics.2011.6174275","title":"Debugging ants: How ants find the shortest route","display_name":"Debugging ants: How ants find the shortest route","publication_year":2011,"publication_date":"2011-12-01","ids":{"openalex":"https://openalex.org/W2087505135","doi":"https://doi.org/10.1109/icics.2011.6174275","mag":"2087505135"},"language":"en","primary_location":{"id":"doi:10.1109/icics.2011.6174275","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icics.2011.6174275","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 8th International Conference on Information, Communications & Signal Processing","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/A5103231131","display_name":"Sameena Shah","orcid":"https://orcid.org/0000-0002-8236-6465"},"institutions":[{"id":"https://openalex.org/I68891433","display_name":"Indian Institute of Technology Delhi","ror":"https://ror.org/049tgcd06","country_code":"IN","type":"education","lineage":["https://openalex.org/I68891433"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Sameena Shah","raw_affiliation_strings":["Department of Electrical Engineering, Indian Institute of Technology, New Delhi, India","Department of Electrical Engineering, Indian Institute of Technology, Hauz Khas, New Delhi-110016, India"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, Indian Institute of Technology, New Delhi, India","institution_ids":["https://openalex.org/I68891433"]},{"raw_affiliation_string":"Department of Electrical Engineering, Indian Institute of Technology, Hauz Khas, New Delhi-110016, India","institution_ids":["https://openalex.org/I68891433"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5072695020","display_name":"Rohit Kothari","orcid":"https://orcid.org/0000-0002-7678-6690"},"institutions":[{"id":"https://openalex.org/I4210103279","display_name":"IBM Research - India","ror":"https://ror.org/014wt7r80","country_code":"IN","type":"facility","lineage":["https://openalex.org/I1341412227","https://openalex.org/I4210103279","https://openalex.org/I4210114115"]},{"id":"https://openalex.org/I68891433","display_name":"Indian Institute of Technology Delhi","ror":"https://ror.org/049tgcd06","country_code":"IN","type":"education","lineage":["https://openalex.org/I68891433"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"R. Kothari","raw_affiliation_strings":["Department of Electrical Engineering, Indian Institute of Technology, New Delhi, India","IBM India Research Lab, 4 Block C, Institutional Area, Vasant Kunj, New Delhi - 110070, India"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, Indian Institute of Technology, New Delhi, India","institution_ids":["https://openalex.org/I68891433"]},{"raw_affiliation_string":"IBM India Research Lab, 4 Block C, Institutional Area, Vasant Kunj, New Delhi - 110070, India","institution_ids":["https://openalex.org/I4210103279"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110048911","display_name":"Suresh Chandra","orcid":null},"institutions":[{"id":"https://openalex.org/I68891433","display_name":"Indian Institute of Technology Delhi","ror":"https://ror.org/049tgcd06","country_code":"IN","type":"education","lineage":["https://openalex.org/I68891433"]},{"id":"https://openalex.org/I4210103279","display_name":"IBM Research - India","ror":"https://ror.org/014wt7r80","country_code":"IN","type":"facility","lineage":["https://openalex.org/I1341412227","https://openalex.org/I4210103279","https://openalex.org/I4210114115"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Suresh Chandra","raw_affiliation_strings":["IBM India Research Lab., New Delhi, India","Department of Mathematics Indian Institute of Technology Hauz Khas, New Delhi-110016, India"],"affiliations":[{"raw_affiliation_string":"IBM India Research Lab., New Delhi, India","institution_ids":["https://openalex.org/I4210103279"]},{"raw_affiliation_string":"Department of Mathematics Indian Institute of Technology Hauz Khas, New Delhi-110016, India","institution_ids":["https://openalex.org/I68891433"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5103231131"],"corresponding_institution_ids":["https://openalex.org/I68891433"],"apc_list":null,"apc_paid":null,"fwci":0.5299,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.70808791,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"34","issue":null,"first_page":"1","last_page":"5"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.9908999800682068,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.9908999800682068,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9854999780654907,"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/T10702","display_name":"Insect and Arachnid Ecology and Behavior","score":0.9825999736785889,"subfield":{"id":"https://openalex.org/subfields/1311","display_name":"Genetics"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6829040050506592},{"id":"https://openalex.org/keywords/competitor-analysis","display_name":"Competitor analysis","score":0.6212918758392334},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5319298505783081},{"id":"https://openalex.org/keywords/foraging","display_name":"Foraging","score":0.49965906143188477},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.48008018732070923},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.32651615142822266},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.233333021402359},{"id":"https://openalex.org/keywords/ecology","display_name":"Ecology","score":0.16691875457763672},{"id":"https://openalex.org/keywords/business","display_name":"Business","score":0.144668847322464},{"id":"https://openalex.org/keywords/marketing","display_name":"Marketing","score":0.11688175797462463},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.09549221396446228}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6829040050506592},{"id":"https://openalex.org/C127576917","wikidata":"https://www.wikidata.org/wiki/Q624630","display_name":"Competitor analysis","level":2,"score":0.6212918758392334},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5319298505783081},{"id":"https://openalex.org/C165287380","wikidata":"https://www.wikidata.org/wiki/Q2916569","display_name":"Foraging","level":2,"score":0.49965906143188477},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.48008018732070923},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.32651615142822266},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.233333021402359},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.16691875457763672},{"id":"https://openalex.org/C144133560","wikidata":"https://www.wikidata.org/wiki/Q4830453","display_name":"Business","level":0,"score":0.144668847322464},{"id":"https://openalex.org/C162853370","wikidata":"https://www.wikidata.org/wiki/Q39809","display_name":"Marketing","level":1,"score":0.11688175797462463},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.09549221396446228},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icics.2011.6174275","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icics.2011.6174275","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 8th International Conference on Information, Communications & Signal Processing","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":35,"referenced_works":["https://openalex.org/W159330993","https://openalex.org/W1511952638","https://openalex.org/W1530417869","https://openalex.org/W1573676079","https://openalex.org/W1601928236","https://openalex.org/W1602076081","https://openalex.org/W1801849579","https://openalex.org/W1838996458","https://openalex.org/W1915653146","https://openalex.org/W1993561093","https://openalex.org/W2011285554","https://openalex.org/W2013445295","https://openalex.org/W2017938154","https://openalex.org/W2020015078","https://openalex.org/W2022408591","https://openalex.org/W2039865013","https://openalex.org/W2044519845","https://openalex.org/W2047190285","https://openalex.org/W2058569171","https://openalex.org/W2074777539","https://openalex.org/W2089670420","https://openalex.org/W2107472392","https://openalex.org/W2107941094","https://openalex.org/W2118573797","https://openalex.org/W2124253297","https://openalex.org/W2126554879","https://openalex.org/W2130411910","https://openalex.org/W2140481494","https://openalex.org/W2154487696","https://openalex.org/W2154929945","https://openalex.org/W2401896677","https://openalex.org/W4292408555","https://openalex.org/W6606528368","https://openalex.org/W6630785013","https://openalex.org/W6635910384"],"related_works":["https://openalex.org/W4200081355","https://openalex.org/W3081944365","https://openalex.org/W2135179174","https://openalex.org/W1932300341","https://openalex.org/W2294784349","https://openalex.org/W2890381285","https://openalex.org/W1979659965","https://openalex.org/W2136432055","https://openalex.org/W301102721","https://openalex.org/W2048910501"],"abstract_inverted_index":{"Collective":[0],"foraging":[1],"in":[2,8,161,197,212,356,361],"ant":[3,262,314],"colonies":[4],"is":[5,20,67,130,282,339],"as":[6,28],"remarkable":[7],"that":[9,19,144,151,259,292,318],"ants":[10,47,69,107,140,284],"are":[11,36,138],"solving":[12],"a":[13,64,100,174,180,191,201,267,279,289,297,311],"distributed":[14],"control":[15,242],"and":[16,31,83,241],"optimization":[17,264],"task":[18],"still":[21,71],"not":[22,286],"fully":[23],"untravelled.":[24],"Ants":[25],"deposit":[26],"pheromone":[27,35,77,315],"they":[29],"travel,":[30],"paths":[32],"with":[33],"more":[34],"preferred":[37],"by":[38,99,303],"succeeding":[39],"ants.":[40],"Without":[41],"any":[42],"direct":[43],"communication":[44,362],"amongst":[45],"themselves,":[46],"quickly":[48],"abandon":[49],"other":[50],"trails":[51,143],"to":[52,76,85,108,110,146,199,243,321],"concentrate":[53],"on":[54,79,122],"the":[55,59,86,106,213,220,226,322,336,350,357],"shortest":[56,323],"one.":[57],"If":[58,173],"food":[60,136,337],"source":[61,338],"moves,":[62],"or":[63,116,177,188,194,204,341],"new":[65,87,192],"path":[66,102,125,281,291,324,342],"discovered,":[68],"can":[70,167,234],"overcome":[72],"initial":[73,114,182,270,327],"bias":[74,117,129,271],"due":[75],"deposited":[78],"an":[80,113,123,354],"earlier":[81,124],"path,":[82],"switch":[84,109,287],"path.":[88],"Nevertheless,":[89],"important":[90],"questions":[91,158],"remain.":[92],"How":[93,127,166],"much":[94,128,132,186],"should":[95,190,215],"be":[96,154,169,236,273],"advantage":[97,189],"offered":[98],"better":[101,280],"discovered":[103],"later":[104],"for":[105,219,260,296],"it":[111],"if":[112,150,278],"preference":[115],"has":[118,293],"already":[119],"built":[120],"up":[121],"?":[126,133,172,207,224,247],"too":[131],"When":[134],"multiple":[135,142],"sources":[137],"present,":[139],"form":[141],"seem":[145],"optimize":[147],"overall":[148],"throughput,":[149],"word":[152],"may":[153],"considered":[155],"apt.":[156],"These":[157],"have":[159,179],"importance":[160],"many":[162],"real":[163],"life":[164],"scenarios.":[165],"information":[168],"optimally":[170],"disseminated":[171],"competitors's":[175],"products":[176],"technologies":[178],"large":[181,202],"bias,":[183],"then":[184],"how":[185,233],"gain":[187,221],"product":[193],"technology":[195],"provide":[196],"order":[198],"cultivate":[200],"following":[203],"market":[205,214],"share":[206,211],"What":[208],"kind":[209],"of":[210,228,252,306,326,352,359],"you":[216,222],"probabilistically":[217],"expect":[218],"offer":[223],"In":[225],"presence":[227],"dynamically":[229],"changing":[230],"traffic":[231],"scenarios,":[232],"packets":[235],"routed":[237],"without":[238],"centralized":[239],"command":[240],"maximize":[244],"network":[245],"throughput":[246],"This":[248],"talk":[249],"summarizes":[250],"some":[251,304],"our":[253],"recent":[254],"work.":[255],"First,":[256],"we":[257,309,348],"showed":[258],"traditional":[261],"colony":[263],"models,":[265],"beyond":[266],"certain":[268],"threshold,":[269],"cannot":[272],"overcome.":[274],"That":[275],"is,":[276],"even":[277,334],"found,":[283],"will":[285],"from":[288],"longer":[290],"been":[294],"frequented":[295],"long":[298],"enough":[299],"time.":[300],"Next,":[301],"motivated":[302,313],"knowledge":[305],"biological":[307],"ants,":[308],"suggest":[310],"biologically":[312],"update":[316],"model":[317],"guarantees":[319],"convergence":[320],"regardless":[325],"bias.":[328],"The":[329],"algorithm":[330,355],"displays":[331],"this":[332],"behaviour":[333],"when":[335],"moved":[340],"lengths":[343],"change":[344],"during":[345],"foraging.":[346],"Finally,":[347],"examine":[349],"utility":[351],"such":[353],"context":[358],"routing":[360],"networks.":[363]},"counts_by_year":[{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}