{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,21]],"date-time":"2026-03-21T21:51:53Z","timestamp":1774129913603,"version":"3.50.1"},"reference-count":30,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"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":[[2019,12]]},"DOI":"10.1109\/ssci44817.2019.9003153","type":"proceedings-article","created":{"date-parts":[[2020,2,21]],"date-time":"2020-02-21T07:49:24Z","timestamp":1582271364000},"page":"1660-1667","source":"Crossref","is-referenced-by-count":18,"title":["Parallel Ant Colony Optimization for the Electric Vehicle Routing Problem"],"prefix":"10.1109","author":[{"given":"Michalis","family":"Mavrovouniotis","sequence":"first","affiliation":[]},{"given":"Changhe","family":"Li","sequence":"additional","affiliation":[]},{"given":"Georgios","family":"Ellinas","sequence":"additional","affiliation":[]},{"given":"Marios","family":"Polycarpou","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1049\/iet-its.2014.0177"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/4235.585892"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s40595-016-0059-z"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24652-7_8"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-739X(99)00124-7"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2011.05.042"},{"key":"ref15","article-title":"A survey on the electric vehicle routing problem: variants and solution approaches","volume":"2019","author":"abd tonci cari?","year":"2019","journal-title":"Journal of Advanced Transportation"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.trpro.2014.10.026"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/MELCON.2014.6820550"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2847765"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/SSCI.2018.8628831"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1155\/2017\/5098183"},{"key":"ref4","first-page":"177","article-title":"Parallel genetic algorithms for a hypercube","author":"tanese","year":"1987","journal-title":"Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32937-1_2"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2010.02.017"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/HIS.2008.87"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1049\/iet-its.2017.0008"},{"key":"ref5","first-page":"33","article-title":"The Island Model Genetic Algorithm: On Separability, Population Size and Convergence","volume":"7","author":"whitley","year":"1998","journal-title":"Journal of Computing and Information Technology"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/11839088_20"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0056911"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2002.800880"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/CIDUE.2014.7007861"},{"key":"ref1","author":"garey","year":"1979","journal-title":"Computer and Intractability A Guide to the Theory of NP-Completeness"},{"key":"ref20","first-page":"722","author":"st\u00fctzle","year":"1998","journal-title":"Parallelization strategies for Ant Colony Optimization"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45591-4_87"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626406002691"},{"key":"ref24","first-page":"309","article-title":"${\\mathcal{M}}{\\mathcal{A}}{\\mathcal{X}} - {\\mathcal{M}}{\\mathcal{I}}{\\mathcal{N}}$ 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":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.trpro.2016.02.007"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/B978-1-55860-377-6.50039-6"},{"key":"ref25","doi-asserted-by":"crossref","first-page":"889","DOI":"10.1016\/S0167-739X(00)00043-1","article-title":"${\\mathcal{M}}{\\mathcal{A}}{\\mathcal{X}} - {\\mathcal{M}}{\\mathcal{I}}{\\mathcal{N}}$ ant system","volume":"16","author":"st\u00fctzle","year":"2000","journal-title":"Future Generation Computer Systems"}],"event":{"name":"2019 IEEE Symposium Series on Computational Intelligence (SSCI)","location":"Xiamen, China","start":{"date-parts":[[2019,12,6]]},"end":{"date-parts":[[2019,12,9]]}},"container-title":["2019 IEEE Symposium Series on Computational Intelligence (SSCI)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8975711\/9002648\/09003153.pdf?arnumber=9003153","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,17]],"date-time":"2022-07-17T21:50:36Z","timestamp":1658094636000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9003153\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12]]},"references-count":30,"URL":"https:\/\/doi.org\/10.1109\/ssci44817.2019.9003153","relation":{},"subject":[],"published":{"date-parts":[[2019,12]]}}}