{"id":"https://openalex.org/W2050441104","doi":"https://doi.org/10.1007/s00453-011-9606-2","title":"A Simple Ant Colony Optimizer for Stochastic Shortest Path Problems","display_name":"A Simple Ant Colony Optimizer for Stochastic Shortest Path Problems","publication_year":2011,"publication_date":"2011-12-29","ids":{"openalex":"https://openalex.org/W2050441104","doi":"https://doi.org/10.1007/s00453-011-9606-2","mag":"2050441104"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-011-9606-2","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-011-9606-2","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-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/A5018789989","display_name":"Dirk Sudholt","orcid":"https://orcid.org/0000-0001-6020-1646"},"institutions":[{"id":"https://openalex.org/I79619799","display_name":"University of Birmingham","ror":"https://ror.org/03angcq70","country_code":"GB","type":"education","lineage":["https://openalex.org/I79619799"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Dirk Sudholt","raw_affiliation_strings":["CERCIA, School of Computer Science, University of Birmingham, Birmingham, B15 2TT, UK"],"affiliations":[{"raw_affiliation_string":"CERCIA, School of Computer Science, University of Birmingham, Birmingham, B15 2TT, UK","institution_ids":["https://openalex.org/I79619799"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5019171842","display_name":"Christian Thyssen","orcid":null},"institutions":[{"id":"https://openalex.org/I200332995","display_name":"TU Dortmund University","ror":"https://ror.org/01k97gp34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200332995"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Christian Thyssen","raw_affiliation_strings":["Fakult\u00e4t f\u00fcr Informatik, LS 2, Technische Universit\u00e4t Dortmund, 44221, Dortmund, Germany"],"affiliations":[{"raw_affiliation_string":"Fakult\u00e4t f\u00fcr Informatik, LS 2, Technische Universit\u00e4t Dortmund, 44221, Dortmund, Germany","institution_ids":["https://openalex.org/I200332995"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5018789989"],"corresponding_institution_ids":["https://openalex.org/I79619799"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":3.522,"has_fulltext":false,"cited_by_count":65,"citation_normalized_percentile":{"value":0.92915787,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"64","issue":"4","first_page":"643","last_page":"672"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9965000152587891,"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.9965000152587891,"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.9954000115394592,"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/T12288","display_name":"Optimization and Search Problems","score":0.9944999814033508,"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.8070580959320068},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.7424880862236023},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.6942947506904602},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6317276358604431},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5769270062446594},{"id":"https://openalex.org/keywords/noise","display_name":"Noise (video)","score":0.5465958714485168},{"id":"https://openalex.org/keywords/ant-colony","display_name":"Ant colony","score":0.4927559196949005},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4431523084640503},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.44304898381233215},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3489551544189453},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3343954086303711},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3239283263683319},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2721889019012451},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.21853402256965637}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.8070580959320068},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.7424880862236023},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.6942947506904602},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6317276358604431},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5769270062446594},{"id":"https://openalex.org/C99498987","wikidata":"https://www.wikidata.org/wiki/Q2210247","display_name":"Noise (video)","level":3,"score":0.5465958714485168},{"id":"https://openalex.org/C60891933","wikidata":"https://www.wikidata.org/wiki/Q796575","display_name":"Ant colony","level":3,"score":0.4927559196949005},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4431523084640503},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.44304898381233215},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3489551544189453},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3343954086303711},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3239283263683319},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2721889019012451},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.21853402256965637},{"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/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","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/C115961682","wikidata":"https://www.wikidata.org/wiki/Q860623","display_name":"Image (mathematics)","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s00453-011-9606-2","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-011-9606-2","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.721.29","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.721.29","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://staffwww.dcs.shef.ac.uk/people/D.Sudholt/ant-stochastic.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/2","display_name":"Zero hunger","score":0.49000000953674316}],"awards":[{"id":"https://openalex.org/G588053201","display_name":null,"funder_award_id":"EP/D052785/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":55,"referenced_works":["https://openalex.org/W1503537352","https://openalex.org/W1507360423","https://openalex.org/W1573676079","https://openalex.org/W1604276976","https://openalex.org/W1635549461","https://openalex.org/W1683332710","https://openalex.org/W1884986037","https://openalex.org/W1915653146","https://openalex.org/W1963865903","https://openalex.org/W1979409761","https://openalex.org/W1979634879","https://openalex.org/W1981898306","https://openalex.org/W1989274820","https://openalex.org/W1992876208","https://openalex.org/W1993561093","https://openalex.org/W1996261487","https://openalex.org/W2006072452","https://openalex.org/W2011904305","https://openalex.org/W2018387423","https://openalex.org/W2039865013","https://openalex.org/W2041172083","https://openalex.org/W2053175541","https://openalex.org/W2058135791","https://openalex.org/W2063957068","https://openalex.org/W2070987589","https://openalex.org/W2081287319","https://openalex.org/W2083019227","https://openalex.org/W2085400727","https://openalex.org/W2088332410","https://openalex.org/W2093094460","https://openalex.org/W2095941092","https://openalex.org/W2111142076","https://openalex.org/W2112897495","https://openalex.org/W2114251562","https://openalex.org/W2118573797","https://openalex.org/W2131004531","https://openalex.org/W2143945515","https://openalex.org/W2144643443","https://openalex.org/W2152290683","https://openalex.org/W2154929945","https://openalex.org/W2159512835","https://openalex.org/W2165220807","https://openalex.org/W2293696308","https://openalex.org/W2294663333","https://openalex.org/W2502451450","https://openalex.org/W2752885492","https://openalex.org/W3004042307","https://openalex.org/W3021019285","https://openalex.org/W3021379378","https://openalex.org/W3145128584","https://openalex.org/W4210727445","https://openalex.org/W4234274482","https://openalex.org/W4242243468","https://openalex.org/W4292408555","https://openalex.org/W4316652496"],"related_works":["https://openalex.org/W2553274123","https://openalex.org/W2347951034","https://openalex.org/W4283826969","https://openalex.org/W2377010080","https://openalex.org/W2388326823","https://openalex.org/W2366876790","https://openalex.org/W2071981049","https://openalex.org/W4285338599","https://openalex.org/W2381829748","https://openalex.org/W2353880500"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":9},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":9},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}