{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T06:08:17Z","timestamp":1774937297787,"version":"3.50.1"},"reference-count":29,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["71802099"],"award-info":[{"award-number":["71802099"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Research Projects of Philosophy and Social Sciences in Universities of Jiangsu Province","award":["2020SJZDA062"],"award-info":[{"award-number":["2020SJZDA062"]}]},{"name":"Research Projects of Philosophy and Social Sciences in Universities of Jiangsu Province","award":["2020SJA2058"],"award-info":[{"award-number":["2020SJA2058"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2021]]},"DOI":"10.1109\/access.2021.3056067","type":"journal-article","created":{"date-parts":[[2021,2,2]],"date-time":"2021-02-02T06:25:48Z","timestamp":1612247148000},"page":"21258-21266","source":"Crossref","is-referenced-by-count":35,"title":["An Adaptive Variable Neighborhood Search Ant Colony Algorithm for Vehicle Routing Problem With Soft Time Windows"],"prefix":"10.1109","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2144-8520","authenticated-orcid":false,"given":"Meiling","family":"He","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0777-811X","authenticated-orcid":false,"given":"Zhixiu","family":"Wei","sequence":"additional","affiliation":[]},{"given":"Xiaohui","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Yongtao","family":"Peng","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2894681"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2012.06.008"},{"key":"ref12","first-page":"20","article-title":"Review in finding path problem classification and algorithms in vehicle routing","volume":"3","author":"el aziz","year":"2014","journal-title":"Int J Intell Inf Syst"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.3020093"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.3032018"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.jclepro.2020.124112"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.3023741"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.3003000"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2018.12.086"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.jclepro.2019.03.185"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(97)00031-2"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2018.02.006"},{"key":"ref27","doi-asserted-by":"crossref","first-page":"625","DOI":"10.21629\/JSEE.2018.03.20","article-title":"Multi-type ant system algorithm for the time dependent vehicle routing problem with time windows","volume":"29","author":"deng","year":"2018","journal-title":"J Syst Eng Electron"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2019.02.017"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2601791"},{"key":"ref29","year":"2020","journal-title":"Best Known Solution Values"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.trc.2009.08.005"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.26.2.69"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.31.2.170"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.endm.2016.03.043"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.promfg.2017.07.361"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.35.2.254"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2010.10.011"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s11047-020-09783-6"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2020.100675"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1080\/10170660609509001"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1162\/106454699568728"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2013.10.017"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.tre.2010.09.010"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/9312710\/09343859.pdf?arnumber=9343859","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,17]],"date-time":"2021-12-17T19:56:32Z","timestamp":1639770992000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9343859\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":29,"URL":"https:\/\/doi.org\/10.1109\/access.2021.3056067","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]}}}