{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T19:02:00Z","timestamp":1754161320190,"version":"3.41.2"},"reference-count":5,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T00:00:00Z","timestamp":1556668800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T00:00:00Z","timestamp":1556668800000},"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,5]]},"DOI":"10.1109\/icce-tw46550.2019.8991884","type":"proceedings-article","created":{"date-parts":[[2020,2,14]],"date-time":"2020-02-14T04:51:37Z","timestamp":1581655897000},"page":"1-2","source":"Crossref","is-referenced-by-count":1,"title":["Ant Colony Optimization Based Dynamic Scheduling Routing Algorithm in Internet of Vehicles"],"prefix":"10.1109","author":[{"given":"Hai-Tao","family":"Zhao","sequence":"first","affiliation":[{"name":"Nanjing University of Posts and Telecommunications,Nanjing,P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xuan-Pei","family":"Zhu","sequence":"additional","affiliation":[{"name":"Nanjing University of Posts and Telecommunications,Nanjing,P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chen","family":"He","sequence":"additional","affiliation":[{"name":"Nanjing University of Posts and Telecommunications,Nanjing,P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiang","family":"Ren","sequence":"additional","affiliation":[{"name":"Nanjing University of Posts and Telecommunications,Nanjing,P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yin-Yang","family":"Zhu","sequence":"additional","affiliation":[{"name":"Nanjing University of Posts and Telecommunications,Nanjing,P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2017.2768665"},{"key":"ref3","first-page":"1","article-title":"A hierarchical algorithm based on Density Peaks Clustering and Ant Colony Optimization for Traveling Salesman Problem[J]","author":"erchong","year":"2018","journal-title":"IEEE Access"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1177\/1550147718793799"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2016.2556742"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2017.2746569"}],"event":{"name":"2019 IEEE International Conference on Consumer Electronics - Taiwan (ICCE-TW)","start":{"date-parts":[[2019,5,20]]},"location":"Yilan, Taiwan","end":{"date-parts":[[2019,5,22]]}},"container-title":["2019 IEEE International Conference on Consumer Electronics - Taiwan (ICCE-TW)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8966968\/8991681\/08991884.pdf?arnumber=8991884","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,28]],"date-time":"2025-07-28T19:41:36Z","timestamp":1753731696000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8991884\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5]]},"references-count":5,"URL":"https:\/\/doi.org\/10.1109\/icce-tw46550.2019.8991884","relation":{},"subject":[],"published":{"date-parts":[[2019,5]]}}}