{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T11:06:35Z","timestamp":1742641595520,"version":"3.37.3"},"reference-count":26,"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\/501100003453","name":"Natural Science Foundation of Guangdong Province","doi-asserted-by":"publisher","award":["2018A030313119"],"id":[{"id":"10.13039\/501100003453","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Ordinary University Innovation Project of Guangdong Province","award":["2018KTSCX350"]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/access.2020.2969075","type":"journal-article","created":{"date-parts":[[2020,1,23]],"date-time":"2020-01-23T21:16:00Z","timestamp":1579814160000},"page":"20646-20657","source":"Crossref","is-referenced-by-count":8,"title":["A Smart Path Recommendation Method for Metro Systems With Passenger Preferences"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6725-019X","authenticated-orcid":false,"given":"Wei","family":"Li","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7696-7566","authenticated-orcid":false,"given":"Qin","family":"Luo","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0822-2268","authenticated-orcid":false,"given":"Qing","family":"Cai","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/S2046-0430(16)30169-1"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.3141\/1752-14"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2010.02.005"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.3141\/2284-07"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1177\/1748301816680470"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.trb.2004.07.004"},{"article-title":"Algorithm of valid path set generation for urban rail transit based on space-time prism","year":"0","author":"li","key":"ref16"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1080\/15472450.2015.1082911"},{"key":"ref18","first-page":"1562","article-title":"A modified k-shortest paths algorithm for solving the earliest arrival problem on the time-dependent model of transportation systems","volume":"2012","author":"yang","year":"0","journal-title":"Proc Int Multi Conf Eng Comput Sci"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.12815\/kits.2018.17.3.72"},{"key":"ref4","first-page":"88","article-title":"An efficient implementation of an algorithm for finding K shortest simple paths","volume":"34","author":"hadjiconstantinou","year":"1999","journal-title":"Networks Int J"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795290477"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.trb.2017.04.012"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1061\/(ASCE)TE.1943-5436.0000812"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/S0191-2615(97)00011-8"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/S0191-2615(98)00030-7"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230100403"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.3141\/1783-18"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1155\/2018\/2710608"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2014.07.005"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.tra.2015.04.023"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.trb.2017.05.001"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2018.04.003"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.trb.2014.09.003"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.trb.2016.07.006"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8948470\/08967102.pdf?arnumber=8967102","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T15:56:10Z","timestamp":1642002970000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8967102\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":26,"URL":"https:\/\/doi.org\/10.1109\/access.2020.2969075","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2020]]}}}