{"id":"https://openalex.org/W1635549461","doi":"https://doi.org/10.1007/978-3-642-03751-1_6","title":"Running Time Analysis of ACO Systems for\u00a0Shortest\u00a0Path\u00a0Problems","display_name":"Running Time Analysis of ACO Systems for\u00a0Shortest\u00a0Path\u00a0Problems","publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W1635549461","doi":"https://doi.org/10.1007/978-3-642-03751-1_6","mag":"1635549461"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-03751-1_6","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-03751-1_6","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5022961286","display_name":"Christian Horoba","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 Horoba","raw_affiliation_strings":["LS 2, Fakult\u00e4t f\u00fcr Informatik, Technische Universit\u00e4t Dortmund, Dortmund, Germany","LS 2, Fakult\u00e4t f\u00fcr Informatik, Technische Universit\u00e4t Dortmund, Dortmund, Germany#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LS 2, Fakult\u00e4t f\u00fcr Informatik, Technische Universit\u00e4t Dortmund, Dortmund, Germany","institution_ids":["https://openalex.org/I200332995"]},{"raw_affiliation_string":"LS 2, Fakult\u00e4t f\u00fcr Informatik, Technische Universit\u00e4t Dortmund, Dortmund, Germany#TAB#","institution_ids":["https://openalex.org/I200332995"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5018789989","display_name":"Dirk Sudholt","orcid":"https://orcid.org/0000-0001-6020-1646"},"institutions":[{"id":"https://openalex.org/I1297971548","display_name":"International Computer Science Institute","ror":"https://ror.org/01ewh7m12","country_code":"US","type":"nonprofit","lineage":["https://openalex.org/I1297971548"]},{"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","US"],"is_corresponding":false,"raw_author_name":"Dirk Sudholt","raw_affiliation_strings":["International Computer Science Institute, Berkeley, USA","LS 2, Fakult\u00e4t f\u00fcr Informatik, Technische Universit\u00e4t Dortmund, Dortmund, Germany","LS 2, Fakult\u00e4t f\u00fcr Informatik, Technische Universit\u00e4t Dortmund, Dortmund, Germany and International Computer Science Institute, Berkeley, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"International Computer Science Institute, Berkeley, USA","institution_ids":["https://openalex.org/I1297971548"]},{"raw_affiliation_string":"LS 2, Fakult\u00e4t f\u00fcr Informatik, Technische Universit\u00e4t Dortmund, Dortmund, Germany","institution_ids":["https://openalex.org/I200332995"]},{"raw_affiliation_string":"LS 2, Fakult\u00e4t f\u00fcr Informatik, Technische Universit\u00e4t Dortmund, Dortmund, Germany and International Computer Science Institute, Berkeley, USA#TAB#","institution_ids":["https://openalex.org/I1297971548"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":6.0716,"has_fulltext":false,"cited_by_count":28,"citation_normalized_percentile":{"value":0.97181208,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"76","last_page":"91"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9991000294685364,"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.9991000294685364,"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.9887999892234802,"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/T10702","display_name":"Insect and Arachnid Ecology and Behavior","score":0.9648000001907349,"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/shortest-path-problem","display_name":"Shortest path problem","score":0.8374260663986206},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6598939895629883},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.6041414141654968},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.538427472114563},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5216513276100159},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.5141294598579407},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.4926157593727112},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.4750088155269623},{"id":"https://openalex.org/keywords/floyd\u2013warshall-algorithm","display_name":"Floyd\u2013Warshall algorithm","score":0.4604734480381012},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.41340363025665283},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.35398346185684204},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3128030300140381},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24478501081466675},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2280246913433075},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.1706182062625885}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.8374260663986206},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6598939895629883},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.6041414141654968},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.538427472114563},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5216513276100159},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.5141294598579407},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.4926157593727112},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.4750088155269623},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.4604734480381012},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.41340363025665283},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.35398346185684204},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3128030300140381},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24478501081466675},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2280246913433075},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.1706182062625885},{"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}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-642-03751-1_6","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-03751-1_6","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.183.5580","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.183.5580","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.icsi.berkeley.edu/%7Esudholt/ant-sp-SLS.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1543480758","https://openalex.org/W1573676079","https://openalex.org/W1664011265","https://openalex.org/W1667957304","https://openalex.org/W1683332710","https://openalex.org/W1801849579","https://openalex.org/W1915653146","https://openalex.org/W1967363967","https://openalex.org/W1981898306","https://openalex.org/W1993561093","https://openalex.org/W2011904305","https://openalex.org/W2020015078","https://openalex.org/W2039865013","https://openalex.org/W2052176278","https://openalex.org/W2057398816","https://openalex.org/W2070987589","https://openalex.org/W2081667417","https://openalex.org/W2093094460","https://openalex.org/W2154929945","https://openalex.org/W2159512835","https://openalex.org/W2614370452","https://openalex.org/W2899702797","https://openalex.org/W2946046356","https://openalex.org/W3145128584","https://openalex.org/W4234274482","https://openalex.org/W4285719527","https://openalex.org/W4299796063"],"related_works":["https://openalex.org/W2381419702","https://openalex.org/W2810620529","https://openalex.org/W4253588386","https://openalex.org/W2372677512","https://openalex.org/W2170980056","https://openalex.org/W2348177054","https://openalex.org/W1508906807","https://openalex.org/W2147862592","https://openalex.org/W2387829241","https://openalex.org/W2388977121"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":4}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}