{"id":"https://openalex.org/W2051796986","doi":"https://doi.org/10.1145/2463372.2463567","title":"Runtime analysis of ant colony optimization on dynamic shortest path problems","display_name":"Runtime analysis of ant colony optimization on dynamic shortest path problems","publication_year":2013,"publication_date":"2013-07-06","ids":{"openalex":"https://openalex.org/W2051796986","doi":"https://doi.org/10.1145/2463372.2463567","mag":"2051796986"},"language":"en","primary_location":{"id":"doi:10.1145/2463372.2463567","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2463372.2463567","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 15th annual conference on Genetic and evolutionary computation","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/A5060822830","display_name":"Andrei Lissovoi","orcid":null},"institutions":[{"id":"https://openalex.org/I96673099","display_name":"Technical University of Denmark","ror":"https://ror.org/04qtj9h94","country_code":"DK","type":"education","lineage":["https://openalex.org/I96673099"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Andrei Lissovoi","raw_affiliation_strings":["Technical University of Denmark, Kgs. Lyngby, Denmark","Technical University of Denmark, Kgs, Lyngby, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technical University of Denmark, Kgs. Lyngby, Denmark","institution_ids":["https://openalex.org/I96673099"]},{"raw_affiliation_string":"Technical University of Denmark, Kgs, Lyngby, Denmark","institution_ids":["https://openalex.org/I96673099"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5038689623","display_name":"Carsten Witt","orcid":"https://orcid.org/0000-0002-6105-7700"},"institutions":[{"id":"https://openalex.org/I96673099","display_name":"Technical University of Denmark","ror":"https://ror.org/04qtj9h94","country_code":"DK","type":"education","lineage":["https://openalex.org/I96673099"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Carsten Witt","raw_affiliation_strings":["Technical University of Denmark, Kgs. Lyngby, Denmark","Technical University of Denmark, Kgs, Lyngby, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technical University of Denmark, Kgs. Lyngby, Denmark","institution_ids":["https://openalex.org/I96673099"]},{"raw_affiliation_string":"Technical University of Denmark, Kgs, Lyngby, Denmark","institution_ids":["https://openalex.org/I96673099"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I96673099"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1605","last_page":"1612"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9988999962806702,"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.9988999962806702,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.994700014591217,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9914000034332275,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.7821487188339233},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.7128949165344238},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6023432612419128},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5880082845687866},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5117923617362976},{"id":"https://openalex.org/keywords/ant-colony","display_name":"Ant colony","score":0.48324164748191833},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.47580036520957947},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.45536085963249207},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.4230085015296936},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4222068190574646},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3681458830833435},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2994198203086853},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2187616229057312},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.09442025423049927}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7821487188339233},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.7128949165344238},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6023432612419128},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5880082845687866},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5117923617362976},{"id":"https://openalex.org/C60891933","wikidata":"https://www.wikidata.org/wiki/Q796575","display_name":"Ant colony","level":3,"score":0.48324164748191833},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.47580036520957947},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.45536085963249207},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.4230085015296936},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4222068190574646},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3681458830833435},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2994198203086853},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2187616229057312},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.09442025423049927},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2463372.2463567","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2463372.2463567","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 15th annual conference on Genetic and evolutionary computation","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":19,"referenced_works":["https://openalex.org/W1528814484","https://openalex.org/W1547579803","https://openalex.org/W1605768620","https://openalex.org/W1683332710","https://openalex.org/W1801849579","https://openalex.org/W1979409761","https://openalex.org/W1979634879","https://openalex.org/W1985115934","https://openalex.org/W1992220653","https://openalex.org/W2005317641","https://openalex.org/W2016166067","https://openalex.org/W2043191653","https://openalex.org/W2050441104","https://openalex.org/W2093094460","https://openalex.org/W2100137329","https://openalex.org/W2137130066","https://openalex.org/W2143945515","https://openalex.org/W2144643443","https://openalex.org/W2167576594"],"related_works":["https://openalex.org/W4245157707","https://openalex.org/W2208777194","https://openalex.org/W2908391583","https://openalex.org/W2406404685","https://openalex.org/W2369428395","https://openalex.org/W2198982833","https://openalex.org/W2767202586","https://openalex.org/W1997193297","https://openalex.org/W2353880500","https://openalex.org/W2126736140"],"abstract_inverted_index":{"A":[0],"simple":[1],"ACO":[2],"algorithm":[3],"called":[4],"\u03bb-MMAS":[5],"for":[6,25],"dynamic":[7,90],"variants":[8],"of":[9,29,57,66,89],"the":[10,26,69,95],"single-destination":[11],"shortest":[12],"paths":[13],"problem":[14],"is":[15,32,52],"studied":[16,33],"by":[17,62],"rigorous":[18],"runtime":[19],"analyses.":[20],"Building":[21],"upon":[22],"previous":[23],"results":[24],"special":[27],"case":[28],"1-MMAS,":[30],"it":[31],"to":[34,98],"what":[35],"extent":[36],"an":[37,48],"enlarged":[38],"colony":[39],"using":[40],"$\\lambda$":[41],"ants":[42],"per":[43],"vertex":[44],"helps":[45],"in":[46],"tracking":[47],"oscillating":[49],"optimum.":[50],"It":[51],"shown":[53],"that":[54,76],"easy":[55],"cases":[56],"oscillations":[58,75],"can":[59],"be":[60,81],"tracked":[61,82],"a":[63],"constant":[64],"number":[65],"ants.":[67],"However,":[68],"paper":[70],"also":[71],"identifies":[72],"more":[73],"involved":[74],"with":[77,83],"overwhelming":[78],"probability":[79],"cannot":[80],"any":[84],"polynomial-size":[85],"colony.":[86],"Finally,":[87],"parameters":[88],"shortest-path":[91],"problems":[92],"which":[93],"make":[94],"optimum":[96],"difficult":[97],"track":[99],"are":[100],"discussed.":[101],"Experiments":[102],"illustrate":[103],"theoretical":[104],"findings":[105],"and":[106],"conjectures.":[107]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}