{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T22:44:29Z","timestamp":1783032269979,"version":"3.54.6"},"reference-count":34,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/100012542","name":"Sichuan Science and Technology Program","doi-asserted-by":"publisher","award":["2018GZDZX0033"],"award-info":[{"award-number":["2018GZDZX0033"]}],"id":[{"id":"10.13039\/100012542","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/access.2020.3028467","type":"journal-article","created":{"date-parts":[[2020,10,2]],"date-time":"2020-10-02T20:19:51Z","timestamp":1601669991000},"page":"180773-180783","source":"Crossref","is-referenced-by-count":55,"title":["Dynamic Path Planning Based on Improved Ant Colony Algorithm in Traffic Congestion"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1920-7039","authenticated-orcid":false,"given":"Chunjiang","family":"Wu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8314-754X","authenticated-orcid":false,"given":"Shijie","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8793-3190","authenticated-orcid":false,"given":"Licai","family":"Xiao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1257\/pol.20170195"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2019.08.026"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2019.2922597"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2020.2983491"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2020.3015916"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"issue":"2","key":"ref7","first-page":"216","article-title":"Transitivit\u00e9 et Connexit\u00e9","volume":"249","author":"Roy","year":"1959","journal-title":"Comptes Rendus Hebdomadaires Des Seances De L Academie Des Sciences"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24693-0_81"},{"key":"ref9","first-page":"1652","article-title":"The focussed $d^{*}$\n algorithm for real-time replanning","volume":"95","author":"Stentz","year":"1995","journal-title":"IJCAI"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/168304.168305"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/3477.484436"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.1999.782657"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/MCI.2006.329691"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/508791.508907"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ICNN.1995.488968"},{"key":"ref16","first-page":"1942","article-title":"Particle swarm optimization","volume-title":"Proc. IEEE Int. Conf. Neural Netw.","volume":"4","author":"Eberhart"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/S0303-2647(97)01708-5"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.proeng.2011.08.515"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-016-2161-7"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.3969\/j.issn.1004-4132.2010.02.025"},{"key":"ref21","first-page":"181","article-title":"A hybrid discrete particle swarm optimization for the traveling salesman problem","volume-title":"Proc. Asia\u2013Pacific Conf. Simulated Evol. Learn.","author":"Li"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1166\/asl.2016.7864"},{"issue":"2","key":"ref23","first-page":"260","article-title":"Solving TSP problem based on hybrid algorithm of ant colony and particle swarm optimization","volume":"2","author":"Zhang","year":"2008","journal-title":"China Sci. Technol. Inf."},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2015.01.068"},{"issue":"4","key":"ref25","first-page":"402","article-title":"A hybrid algorithm of ant colony and particle swarm optimization on solving TSP problem","volume":"24","author":"Min","year":"2006","journal-title":"J. Jilin Univ."},{"issue":"8","key":"ref26","first-page":"89","article-title":"An application of ant colony algorithm based on particle swarm optimization in TSP","volume":"26","author":"Cai","year":"2009","journal-title":"J. Comput. Simul."},{"issue":"34","key":"ref27","first-page":"60","article-title":"Hybrid algorithm of ant colony and particle swarm to solve TSP problem","volume":"48","author":"Sun","journal-title":"J. Comput. Eng. Appl."},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ICNDS.2010.5479311"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.2991\/iske.2007.91"},{"key":"ref30","first-page":"1616","article-title":"A hybrid ACO-PSO technique for path planning","volume-title":"Proc. 2nd Int. Conf. Comput. Sustain. Global Develop. (INDIACom)","author":"Gigras"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/NGCT.2016.7877428"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.4028\/www.scientific.net\/AMR.143-144.1154"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-009-0179-6"},{"issue":"3","key":"ref36","first-page":"31","article-title":"Parameter analysis of ant colony algorithm","volume":"20","author":"Jiang","year":"2007","journal-title":"J. Comput. Eng. Appl."}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8948470\/09211493.pdf?arnumber=9211493","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,24]],"date-time":"2024-01-24T01:43:04Z","timestamp":1706060584000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9211493\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":34,"URL":"https:\/\/doi.org\/10.1109\/access.2020.3028467","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]}}}