{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T08:52:14Z","timestamp":1768294334130,"version":"3.49.0"},"reference-count":41,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2021,2,1]],"date-time":"2021-02-01T00:00:00Z","timestamp":1612137600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,2,1]],"date-time":"2021-02-01T00:00:00Z","timestamp":1612137600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,2,1]],"date-time":"2021-02-01T00:00:00Z","timestamp":1612137600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"National Key Research and Development Program of China","award":["2018YFB1004300"],"award-info":[{"award-number":["2018YFB1004300"]}]},{"DOI":"10.13039\/501100001809","name":"NSFC-Zhejiang Joint Fund for the Integration of Industrialization and Informatization","doi-asserted-by":"publisher","award":["U1609217"],"award-info":[{"award-number":["U1609217"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"publisher","award":["61761136020"],"award-info":[{"award-number":["61761136020"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"publisher","award":["61822701"],"award-info":[{"award-number":["61822701"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004731","name":"Zhejiang Provincial Natural Science Foundation","doi-asserted-by":"publisher","award":["LR18F020001"],"award-info":[{"award-number":["LR18F020001"]}],"id":[{"id":"10.13039\/501100004731","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004835","name":"100 Talents Program of Zhejiang University","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004835","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100004318","name":"Microsoft Research Asia","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100004318","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Intell. Transport. Syst."],"published-print":{"date-parts":[[2021,2]]},"DOI":"10.1109\/tits.2020.2964012","type":"journal-article","created":{"date-parts":[[2020,2,13]],"date-time":"2020-02-13T22:59:25Z","timestamp":1581634765000},"page":"1185-1195","source":"Crossref","is-referenced-by-count":29,"title":["Pareto-Optimal Transit Route Planning With Multi-Objective Monte-Carlo Tree Search"],"prefix":"10.1109","volume":"22","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2712-7274","authenticated-orcid":false,"given":"Di","family":"Weng","sequence":"first","affiliation":[]},{"given":"Ran","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Jianhui","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Jie","family":"Bao","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5224-4344","authenticated-orcid":false,"given":"Yu","family":"Zheng","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1119-3237","authenticated-orcid":false,"given":"Yingcai","family":"Wu","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2015.2498187"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2019.2901117"},{"key":"ref33","author":"cormen","year":"2009","journal-title":"Introduction to Algorithms"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/11871842_29"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2014.2345842"},{"key":"ref30","first-page":"507","article-title":"Multi-objective Monte-Carlo tree search","author":"wang","year":"2012","journal-title":"Proc Asian Conf Mach Learn"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2017.2758362"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2015.2436897"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/3173574.3173821"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/2093973.2094062"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2012.2186810"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2016.2535234"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/3200491"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.cag.2017.07.004"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2016.06.084"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2011.2158001"},{"key":"ref15","first-page":"374","article-title":"Optimizing bus transit network with parallel ant colony algorithm","volume":"5","author":"yu","year":"2005","journal-title":"Proc EASTS"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2015.2496783"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/CCBD.2016.015"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.4847"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2007.02.005"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/CIG.2013.6633658"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(80)90126-5"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1038\/nature25978"},{"key":"ref3","article-title":"Optimization of transit network to minimize transfers","author":"zhao","year":"2003"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.5038\/2375-0901.7.1.4"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2013.2263884"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.trb.2005.12.003"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2001.914855"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1061\/(ASCE)0733-947X(2006)132:1(40)"},{"key":"ref2","author":"mackechnie","year":"2018","journal-title":"How do bus routes and schedules get planned?"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2014.2298892"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tra.2008.03.011"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1061\/(ASCE)0733-947X(1998)124:4(368)"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1061\/(ASCE)0733-947X(2006)132:2(122)"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2010.08.020"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1038\/nature24270"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.2014.0534"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2017.09.040"},{"key":"ref26","first-page":"4222","article-title":"Monte Carlo tree search for multi-robot task allocation","author":"kartal","year":"2016","journal-title":"Proc AAAI"},{"key":"ref25","first-page":"3338","article-title":"Deep learning for real-time Atari game play using offline monte-carlo tree search planning","author":"guo","year":"2014","journal-title":"Proc NIPS"}],"container-title":["IEEE Transactions on Intelligent Transportation Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6979\/9345541\/08998192.pdf?arnumber=8998192","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:52:12Z","timestamp":1652194332000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8998192\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,2]]},"references-count":41,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tits.2020.2964012","relation":{},"ISSN":["1524-9050","1558-0016"],"issn-type":[{"value":"1524-9050","type":"print"},{"value":"1558-0016","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,2]]}}}