{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,18]],"date-time":"2026-02-18T23:32:24Z","timestamp":1771457544146,"version":"3.50.1"},"reference-count":45,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2020,2,1]],"date-time":"2020-02-01T00:00:00Z","timestamp":1580515200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,2,1]],"date-time":"2020-02-01T00:00:00Z","timestamp":1580515200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,2,1]],"date-time":"2020-02-01T00:00:00Z","timestamp":1580515200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"European Unions Horizon 2020","award":["739551"],"award-info":[{"award-number":["739551"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61673331; 61673355"],"award-info":[{"award-number":["61673331; 61673355"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Comput. Intell. Mag."],"published-print":{"date-parts":[[2020,2]]},"DOI":"10.1109\/mci.2019.2954644","type":"journal-article","created":{"date-parts":[[2020,1,14]],"date-time":"2020-01-14T20:10:11Z","timestamp":1579032611000},"page":"52-63","source":"Crossref","is-referenced-by-count":50,"title":["Ant Colony Optimization Algorithms for Dynamic Optimization: A Case Study of the Dynamic Travelling Salesperson Problem [Research Frontier]"],"prefix":"10.1109","volume":"15","author":[{"given":"Michalis","family":"Mavrovouniotis","sequence":"first","affiliation":[]},{"given":"Shengxiang","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Mien","family":"Van","sequence":"additional","affiliation":[]},{"given":"Changhe","family":"Li","sequence":"additional","affiliation":[]},{"given":"Marios","family":"Polycarpou","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2014.6900481"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-35533-2_1"},{"key":"ref33","doi-asserted-by":"crossref","first-page":"606","DOI":"10.1007\/978-3-642-37192-9_61","article-title":"Adapting the pheromone evaporation rate in dynamic routing problems","volume":"7835","author":"mavrovouniotis","year":"2013","journal-title":"Applications of Evolutionary Computing Ser LNCS"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-010-0680-1"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-37213-1_19"},{"key":"ref30","first-page":"618","article-title":"Ant colony optimisation applied to a dynamically changing problem","volume":"2358","author":"angus","year":"2002","journal-title":"LNCS Developments in Applied Artificial Intelligence"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20525-5_33"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15871-1_38"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/CIDUE.2014.7007861"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/CIDUE.2014.7007866"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-015-1924-x"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.3.4.376"},{"key":"ref11","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1007\/3-540-45724-0_8","article-title":"Ant systems for a dynamic TSP","volume":"2463","author":"eyckelhof","year":"2002","journal-title":"Ant Algorithms LNCS"},{"key":"ref12","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/3-540-45724-0_10","article-title":"Applying population based ACO to dynamic optimization problems","volume":"2463","author":"guntsch","year":"2002","journal-title":"Ant Algorithms LNCS"},{"key":"ref13","first-page":"860","article-title":"An ant colony optimization approach to dynamic TSP","author":"guntsch","year":"0","journal-title":"Proc 3rd Annu Conf Genet Evol Comput"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2013.05.022"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1080\/03052150500340504"},{"key":"ref16","first-page":"213","article-title":"Pheromone modification strategies for ant algorithms applied to dynamic TSP","volume":"2037","author":"guntsch","year":"2001","journal-title":"Applications of Evolutionary Computing Ser LNCS"},{"key":"ref17","first-page":"259","article-title":"Ant colony optimization for dynamic traveling salesman problems","author":"silva","year":"0","journal-title":"Workshop Proceedings ARCS"},{"key":"ref18","first-page":"1286","article-title":"Benchmarking algorithms for dynamic travelling salesman problems","author":"kang","year":"0","journal-title":"Proc 2004 IEEE Congr Evolutionary Computation"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-10383-9_14"},{"key":"ref28","first-page":"309","article-title":"MAX–MIN ant system and local search for the traveling salesman problem","author":"st\u00fctzle","year":"0","journal-title":"Proc 1997 IEEE Int Conf Evolutionary Computation"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/MCI.2006.329691"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2016.2556742"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/BF00462870"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/978-3-642-30665-5_9","article-title":"Ant colony based algorithms for dynamic optimization problems","author":"leguizam\u00f3n","year":"2013","journal-title":"Metaheuristics for Dynamic Optimization"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-739X(00)00043-1"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2005.846356"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1613\/jair.530"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2016.12.005"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/3477.484436"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-005-4922-6"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/4235.585892"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/2576768.2598247"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1162\/evco.2008.16.3.385"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/MCI.2014.2326101"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32964-7_51"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/s12293-012-0090-2"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/s11721-007-0005-x"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.1999.785498"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/MCI.2006.1597056"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/1569901.1570026"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-018-3638-3"},{"key":"ref43","first-page":"252","article-title":"Ant-Q: A reinforcement learning approach to the traveling salesman problem","author":"gambardella","year":"1995","journal-title":"Proc 12th Int Conf Machine Learning"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/s40595-016-0059-z"}],"container-title":["IEEE Computational Intelligence Magazine"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10207\/8956094\/08957215.pdf?arnumber=8957215","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T17:01:03Z","timestamp":1651078863000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8957215\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2]]},"references-count":45,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/mci.2019.2954644","relation":{},"ISSN":["1556-603X","1556-6048"],"issn-type":[{"value":"1556-603X","type":"print"},{"value":"1556-6048","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,2]]}}}