{"id":"https://openalex.org/W2087260880","doi":"https://doi.org/10.1109/cec.2014.6900647","title":"The Coupled EigenAnt algorithm for shortest path problems","display_name":"The Coupled EigenAnt algorithm for shortest path problems","publication_year":2014,"publication_date":"2014-07-01","ids":{"openalex":"https://openalex.org/W2087260880","doi":"https://doi.org/10.1109/cec.2014.6900647","mag":"2087260880"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2014.6900647","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2014.6900647","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE Congress on Evolutionary Computation (CEC)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5047751087","display_name":"Eugenius Kaszkurewicz","orcid":"https://orcid.org/0000-0001-5471-9596"},"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":false,"raw_author_name":"Eugenius Kaszkurewicz","raw_affiliation_strings":["Indian Institute of Technology Delhi, New Delhi, Delhi, IN","Dept. of Electr. Eng., Indian Inst. of Technol., New Delhi, New Delhi, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Indian Institute of Technology Delhi, New Delhi, Delhi, IN","institution_ids":["https://openalex.org/I68891433"]},{"raw_affiliation_string":"Dept. of Electr. Eng., Indian Inst. of Technol., New Delhi, New Delhi, India","institution_ids":["https://openalex.org/I68891433"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5042509798","display_name":"Amit Bhaya","orcid":"https://orcid.org/0000-0002-3144-1242"},"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":false,"raw_author_name":"Amit Bhaya","raw_affiliation_strings":["Indian Institute of Technology Delhi, New Delhi, Delhi, IN","Dept. of Electr. Eng., Indian Inst. of Technol., New Delhi, New Delhi, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Indian Institute of Technology Delhi, New Delhi, Delhi, IN","institution_ids":["https://openalex.org/I68891433"]},{"raw_affiliation_string":"Dept. of Electr. Eng., Indian Inst. of Technol., New Delhi, New Delhi, India","institution_ids":["https://openalex.org/I68891433"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5002842122","display_name":"Jayadeva","orcid":null},"institutions":[{"id":"https://openalex.org/I64295750","display_name":"Indian Institute of Technology Indore","ror":"https://ror.org/01hhf7w52","country_code":"IN","type":"education","lineage":["https://openalex.org/I64295750"]},{"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":"Jayadeva","raw_affiliation_strings":["Indian Institute of Technology Delhi, New Delhi, Delhi, IN","Electr. Eng. Dept., Indian Inst. of Technol., New Delhi, New Delhi, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Indian Institute of Technology Delhi, New Delhi, Delhi, IN","institution_ids":["https://openalex.org/I68891433"]},{"raw_affiliation_string":"Electr. Eng. Dept., Indian Inst. of Technol., New Delhi, New Delhi, India","institution_ids":["https://openalex.org/I64295750"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5045339636","display_name":"Jo\u00e3o Marcos Meirelles da Silva","orcid":null},"institutions":[{"id":"https://openalex.org/I161127581","display_name":"Universidade Federal Fluminense","ror":"https://ror.org/02rjhbb08","country_code":"BR","type":"education","lineage":["https://openalex.org/I161127581"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Joao Marcos Meirelles da Silva","raw_affiliation_strings":["Department of Telecommunications Engineering of the Federal Fluminense University","Dept. of Telecommun. Eng., Fed. Fluminense Univ., Rio de Janeiro, Brazil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Telecommunications Engineering of the Federal Fluminense University","institution_ids":[]},{"raw_affiliation_string":"Dept. of Telecommun. Eng., Fed. Fluminense Univ., Rio de Janeiro, Brazil","institution_ids":["https://openalex.org/I161127581"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.2485,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.45602109,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1729","last_page":"1735"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9943000078201294,"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"}},"topics":[{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9943000078201294,"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"}},{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9879000186920166,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9495999813079834,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.7890065908432007},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.703245997428894},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.686066746711731},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.6773126721382141},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.651069164276123},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.6342986822128296},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6055801510810852},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.5941067934036255},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5746833682060242},{"id":"https://openalex.org/keywords/novelty","display_name":"Novelty","score":0.5710023641586304},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5687887072563171},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5184011459350586},{"id":"https://openalex.org/keywords/stability","display_name":"Stability (learning theory)","score":0.4650994539260864},{"id":"https://openalex.org/keywords/widest-path-problem","display_name":"Widest path problem","score":0.4356815814971924},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.4224078357219696},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.26450639963150024},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.23564738035202026},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.16945254802703857},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.12255027890205383},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.09112542867660522},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.07972237467765808}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7890065908432007},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.703245997428894},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.686066746711731},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.6773126721382141},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.651069164276123},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.6342986822128296},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6055801510810852},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.5941067934036255},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5746833682060242},{"id":"https://openalex.org/C2778738651","wikidata":"https://www.wikidata.org/wiki/Q16546687","display_name":"Novelty","level":2,"score":0.5710023641586304},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5687887072563171},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5184011459350586},{"id":"https://openalex.org/C112972136","wikidata":"https://www.wikidata.org/wiki/Q7595718","display_name":"Stability (learning theory)","level":2,"score":0.4650994539260864},{"id":"https://openalex.org/C83677490","wikidata":"https://www.wikidata.org/wiki/Q7998708","display_name":"Widest path problem","level":5,"score":0.4356815814971924},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.4224078357219696},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26450639963150024},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.23564738035202026},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.16945254802703857},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.12255027890205383},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.09112542867660522},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.07972237467765808},{"id":"https://openalex.org/C27206212","wikidata":"https://www.wikidata.org/wiki/Q34178","display_name":"Theology","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cec.2014.6900647","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2014.6900647","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE Congress on Evolutionary Computation (CEC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1573676079","https://openalex.org/W2004991186","https://openalex.org/W2013205100","https://openalex.org/W2033338535","https://openalex.org/W2047190285","https://openalex.org/W2124253297","https://openalex.org/W2158180962","https://openalex.org/W2962692103","https://openalex.org/W4292408555","https://openalex.org/W6651485379"],"related_works":["https://openalex.org/W2375775343","https://openalex.org/W2198982833","https://openalex.org/W2597144308","https://openalex.org/W2388654557","https://openalex.org/W4200172719","https://openalex.org/W2065474496","https://openalex.org/W2018146256","https://openalex.org/W2365712669","https://openalex.org/W2156431668","https://openalex.org/W2161960576"],"abstract_inverted_index":{"This":[0],"paper":[1],"introduces":[2,61],"an":[3],"ACO":[4],"model":[5,74],"and":[6,25,51,77],"associated":[7],"algorithm,":[8,37],"called":[9],"Coupled":[10],"EigenAnt,":[11],"for":[12],"the":[13,17,33,38,49,57,73,78,82,90,94],"problem":[14],"of":[15,19,63,72,81,93],"finding":[16],"shortest":[18],"N":[20],"paths":[21],"between":[22],"a":[23,26,67],"source":[24],"destination":[27],"node.":[28],"It":[29],"is":[30],"based":[31],"on":[32,47],"recently":[34],"introduced":[35],"EigenAnt":[36],"novelty":[39],"being":[40],"that":[41,59],"it":[42,60],"allows":[43],"probabilistic":[44],"path":[45,84],"choice":[46],"both":[48],"forward":[50],"return":[52],"journeys,":[53],"as":[54,56],"well":[55],"fact":[58],"decay":[62],"pheromone":[64],"deposition":[65],"following":[66],"geometric":[68],"progression.":[69],"Equilibrium":[70],"points":[71],"are":[75],"calculated":[76],"local":[79],"stability":[80],"two":[83],"synchronous":[85],"version":[86],"analyzed.":[87],"Simulations":[88],"illustrate":[89],"main":[91],"features":[92],"algorithm.":[95]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}