{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,30]],"date-time":"2024-12-30T18:57:09Z","timestamp":1735585029125,"version":"3.28.0"},"reference-count":23,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,12,1]],"date-time":"2020-12-01T00:00:00Z","timestamp":1606780800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,12,1]],"date-time":"2020-12-01T00:00:00Z","timestamp":1606780800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,12,1]],"date-time":"2020-12-01T00:00:00Z","timestamp":1606780800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,12,1]]},"DOI":"10.1109\/ssci47803.2020.9308156","type":"proceedings-article","created":{"date-parts":[[2021,1,5]],"date-time":"2021-01-05T23:12:38Z","timestamp":1609888358000},"page":"313-320","source":"Crossref","is-referenced-by-count":6,"title":["Ant Colony optimization with Heuristic Repair for the Dynamic Vehicle Routing Problem"],"prefix":"10.1109","author":[{"given":"Iae S.","family":"Bonilha","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michalis","family":"Mavrovouniotis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Felipe M.","family":"Muller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Georgios","family":"Ellinas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marios","family":"Polycarpou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"journal-title":"Dynamic vrps A study of scenarios","year":"1998","author":"kilby","key":"ref10"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-005-4922-6"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2012.6252885"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2014.10.002"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1002\/net.21628"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-739X(00)00043-1"},{"key":"ref16","first-page":"618","article-title":"Ant colony optimisation applied to a dynamically changing problem","volume":"2358","author":"angus","year":"2002","journal-title":"Developments in Applied Artificial Intelligence Ser Lecture Notes in Computer Science"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-37192-9_61"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0017457"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/2739480.2754651"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/MCI.2019.2954644"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2005.846356"},{"key":"ref6","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 Ser Lecture Notes in Computer Science"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/3-540-45365-2_22","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 Lecture Notes in Computer Science"},{"key":"ref8","first-page":"309","article-title":"MAX–MIN ant system and local search for the traveling salesman problem","author":"st\u00fctzle","year":"1997","journal-title":"Proceedings of 1997 IEEE International Conference on Evolutionary Computation"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1287\/opre.40.6.1086"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s11721-007-0005-x"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/SSCI44817.2019.9003153"},{"journal-title":"Computer and Intractability A Guide to the Theory of NP-Completeness","year":"1979","author":"garey","key":"ref9"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/0925-5273(96)00031-X"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2016.08.012"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2016.2556742"},{"key":"ref23","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/978-3-642-18965-4_9","article-title":"Designing evolutionary algorithms for dynamic optimization problems","author":"branke","year":"2003","journal-title":"Advances in Evolutionary Computing ser Natural Computing Series"}],"event":{"name":"2020 IEEE Symposium Series on Computational Intelligence (SSCI)","start":{"date-parts":[[2020,12,1]]},"location":"Canberra, ACT, Australia","end":{"date-parts":[[2020,12,4]]}},"container-title":["2020 IEEE Symposium Series on Computational Intelligence (SSCI)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9308061\/9308107\/09308156.pdf?arnumber=9308156","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,30]],"date-time":"2022-06-30T15:19:03Z","timestamp":1656602343000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9308156\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,12,1]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1109\/ssci47803.2020.9308156","relation":{},"subject":[],"published":{"date-parts":[[2020,12,1]]}}}