{"id":"https://openalex.org/W2132482054","doi":"https://doi.org/10.1109/cdc.2007.4434982","title":"Convergence results for ant routing algorithms via stochastic approximation and optimization","display_name":"Convergence results for ant routing algorithms via stochastic approximation and optimization","publication_year":2007,"publication_date":"2007-01-01","ids":{"openalex":"https://openalex.org/W2132482054","doi":"https://doi.org/10.1109/cdc.2007.4434982","mag":"2132482054"},"language":"en","primary_location":{"id":"doi:10.1109/cdc.2007.4434982","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2007.4434982","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 46th IEEE Conference on Decision and Control","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/A5002094980","display_name":"Punyaslok Purkayastha","orcid":null},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Punyaslok Purkayastha","raw_affiliation_strings":["Institute for Systems Research and the Department of Electr. & Comp. Engin, University of Maryland College Park, College Park, MD, USA","University of Maryland, College Park"],"affiliations":[{"raw_affiliation_string":"Institute for Systems Research and the Department of Electr. & Comp. Engin, University of Maryland College Park, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]},{"raw_affiliation_string":"University of Maryland, College Park","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5044395526","display_name":"John S. Baras","orcid":"https://orcid.org/0000-0002-4955-8561"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"John S. Baras","raw_affiliation_strings":["Institute for Systems Research and the Department of Electr. & Comp. Engin, University of Maryland College Park, College Park, MD, USA","University of Maryland, College Park"],"affiliations":[{"raw_affiliation_string":"Institute for Systems Research and the Department of Electr. & Comp. Engin, University of Maryland College Park, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]},{"raw_affiliation_string":"University of Maryland, College Park","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5002094980"],"corresponding_institution_ids":["https://openalex.org/I66946132"],"apc_list":null,"apc_paid":null,"fwci":2.6928,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.90996412,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"9","issue":null,"first_page":"340","last_page":"345"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9990000128746033,"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.9990000128746033,"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/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.9980000257492065,"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/T10064","display_name":"Complex Network Analysis Techniques","score":0.9933000206947327,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6699055433273315},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6009124517440796},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5375463962554932},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4811905026435852},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.47880133986473083},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.4509080648422241},{"id":"https://openalex.org/keywords/swarm-behaviour","display_name":"Swarm behaviour","score":0.42760375142097473},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23241117596626282},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.18822968006134033}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6699055433273315},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6009124517440796},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5375463962554932},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4811905026435852},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47880133986473083},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.4509080648422241},{"id":"https://openalex.org/C181335050","wikidata":"https://www.wikidata.org/wiki/Q14915018","display_name":"Swarm behaviour","level":2,"score":0.42760375142097473},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23241117596626282},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.18822968006134033},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/cdc.2007.4434982","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2007.4434982","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 46th IEEE Conference on Decision and Control","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.611.5499","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.611.5499","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://drum.lib.umd.edu/bitstream/1903/7132/3/isr-report-purkayastha-baras.pdf","raw_type":"text"},{"id":"pmh:oai:drum.lib.umd.edu:1903/7132","is_oa":false,"landing_page_url":"http://hdl.handle.net/1903/7132","pdf_url":null,"source":{"id":"https://openalex.org/S4306402644","display_name":"Digital Repository at the University of Maryland (University of Maryland College Park)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66946132","host_organization_name":"University of Maryland, College Park","host_organization_lineage":["https://openalex.org/I66946132"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Technical Report"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W297411159","https://openalex.org/W1568229137","https://openalex.org/W1664011265","https://openalex.org/W2070602556","https://openalex.org/W2081667417","https://openalex.org/W2089670420","https://openalex.org/W2126554879","https://openalex.org/W2132482054","https://openalex.org/W2160739098","https://openalex.org/W2167339049","https://openalex.org/W4292408555","https://openalex.org/W6610601895","https://openalex.org/W6683832403"],"related_works":["https://openalex.org/W4288714711","https://openalex.org/W3200708550","https://openalex.org/W2736680465","https://openalex.org/W2771637876","https://openalex.org/W4294093918","https://openalex.org/W4240853094","https://openalex.org/W2810496283","https://openalex.org/W2170656329","https://openalex.org/W3131977017","https://openalex.org/W3205823858"],"abstract_inverted_index":{"Ant":[0],"algorithms\"":[1,84],"have":[2,69,90],"been":[3,91],"proposed":[4,92],"to":[5,64],"solve":[6,47],"a":[7,19,34,148],"variety":[8],"of":[9,21,25,36,61,73,78,82,138,154,158,167,204],"problems":[10],"arising":[11],"in":[12,57,98,171,180],"optimization":[13,207],"and":[14,45,123,130,177,201],"distributed":[15],"control.":[16],"They":[17],"form":[18],"subset":[20],"the":[22,53,76,136,139,155,159,164,168,173,181,189,193,199,211],"larger":[23],"class":[24],"\"swarm":[26],"intelligence\"":[27],"algorithms.":[28],"The":[29,59,109],"central":[30],"idea":[31,55],"is":[32,111,120],"that":[33,51,89,119,135,188,192],"'swarm'":[35],"relatively":[37],"simple":[38,43],"agents":[39],"can":[40,143],"interact":[41],"through":[42],"mechanisms":[44],"collectively":[46,65],"complex":[48,67],"problems.":[49],"Instances":[50],"exemplify":[52],"above":[54],"abound":[56],"nature.":[58],"abilities":[60],"ant":[62],"colonies":[63],"accomplish":[66],"tasks":[68],"served":[70],"as":[71],"sources":[72],"inspiration":[74],"for":[75,93,105],"design":[77],"\"ant":[79,83,86],"algorithms\".":[80],"Examples":[81],"are":[85,197,214],"routing\"":[87],"algorithms":[88,129],"communication":[94],"networks.":[95,108],"We":[96,185],"analyze":[97],"this":[99],"paper":[100],"an":[101,112,205],"ant-based":[102],"routing":[103,117,169,175],"algorithm":[104,110],"packet-switched":[106],"wireline":[107],"attractive":[113],"multiple":[114],"path":[115],"probabilistic":[116],"scheme,":[118],"fully":[121],"adaptive":[122,128],"distributed.":[124],"Using":[125],"methods":[126],"from":[127],"stochastic":[131],"approximation,":[132],"we":[133],"show":[134,187],"evolution":[137],"link":[140],"delay":[141],"estimates":[142],"be":[144],"closely":[145],"tracked":[146],"by":[147],"deterministic":[149],"ODE":[150,160],"system.":[151],"A":[152],"study":[153],"equilibrium":[156,165,174,194],"points":[157],"then":[161],"gives":[162],"us":[163],"behavior":[166],"algorithm,":[170],"particular,":[172],"probabilities,":[176],"mean":[178],"delays":[179],"links":[182],"under":[183],"equilibrium.":[184],"also":[186],"fixed-point":[190],"equations":[191],"probabilities":[195],"satisfy":[196],"actually":[198],"necessary":[200],"sufficient":[202],"conditions":[203],"appropriate":[206],"problem.":[208],"Simulations":[209],"supporting":[210],"analytical":[212],"results":[213],"provided.":[215]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}