{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T10:32:13Z","timestamp":1750156333513,"version":"3.37.3"},"reference-count":47,"publisher":"Informa UK Limited","issue":"1","license":[{"start":{"date-parts":[[2022,5,20]],"date-time":"2022-05-20T00:00:00Z","timestamp":1653004800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100011002","name":"National Social Science Fund General Project of China","doi-asserted-by":"publisher","award":["18BTQ058"],"award-info":[{"award-number":["18BTQ058"]}],"id":[{"id":"10.13039\/501100011002","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61502299"],"award-info":[{"award-number":["61502299"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100010857","name":"Science and Technology Key Project of Jiangxi Province","doi-asserted-by":"publisher","award":["20142BBE50015"],"award-info":[{"award-number":["20142BBE50015"]}],"id":[{"id":"10.13039\/501100010857","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["Connection Science"],"published-print":{"date-parts":[[2022,12,31]]},"DOI":"10.1080\/09540091.2022.2061916","type":"journal-article","created":{"date-parts":[[2022,5,20]],"date-time":"2022-05-20T07:30:05Z","timestamp":1653031805000},"page":"1500-1518","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":2,"title":["A graph algorithm for the time constrained shortest path"],"prefix":"10.1080","volume":"34","author":[{"given":"Pan","family":"Liu","sequence":"first","affiliation":[{"name":"Faculty of Business Information, Shanghai Business School, Shanghai, People\u2019s Republic of China"},{"name":"Shanghai Key Laboratory of Computer Software Testing and Evaluating, Shanghai, People\u2019s Republic of China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wulan","family":"Huang","sequence":"additional","affiliation":[{"name":"Faculty of Business Information, Shanghai Business School, Shanghai, People\u2019s Republic of China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"301","published-online":{"date-parts":[[2022,5,20]]},"reference":[{"key":"CIT0001","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-020-05034-y"},{"key":"CIT0002","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230130212"},{"key":"CIT0003","doi-asserted-by":"publisher","DOI":"10.1109\/12.663776"},{"key":"CIT0004","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45749-6_15"},{"key":"CIT0005","doi-asserted-by":"publisher","DOI":"10.1155\/2013\/702694"},{"key":"CIT0006","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230190402"},{"key":"CIT0007","doi-asserted-by":"publisher","DOI":"10.1109\/ICAMechS.2016.7813483"},{"key":"CIT0008","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-61550-4_153"},{"key":"CIT0009","doi-asserted-by":"publisher","DOI":"10.1002\/net.20247"},{"key":"CIT0010","doi-asserted-by":"publisher","DOI":"10.1109\/6979.994796"},{"key":"CIT0011","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.1998.685137"},{"key":"CIT0012","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2007.897965"},{"key":"CIT0013","doi-asserted-by":"publisher","DOI":"10.23940\/ijpe.21.05.p3.433443"},{"key":"CIT0014","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(91)90083-2"},{"key":"CIT0015","doi-asserted-by":"publisher","DOI":"10.1016\/S0927-0507(05)80106-9"},{"key":"CIT0016","doi-asserted-by":"publisher","DOI":"10.1002\/net.10090"},{"key":"CIT0017","doi-asserted-by":"publisher","DOI":"10.1080\/09540091.2019.1609418"},{"key":"CIT0018","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2018.1551391"},{"key":"CIT0019","doi-asserted-by":"publisher","DOI":"10.15807\/jorsj.39.77"},{"key":"CIT0020","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-25486-2_2"},{"key":"CIT0021","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2014.08.001"},{"key":"CIT0022","doi-asserted-by":"publisher","DOI":"10.1109\/APNOMS.2014.6996609"},{"key":"CIT0023","unstructured":"Joyner, D., Van Nguyen, M. & Cohen, N. (2010). Algorithmic graph theory. Google Code. https:\/\/google-code-archive-downloads.storage.googleapis.com\/v2\/code.google.com\/graphbook\/latest-r1984.pdf"},{"key":"CIT0024","unstructured":"Kjerrstrom, J. (2001). The resource constrained shortest path problem. resource, 1. http:\/\/citeseerx.ist.psu.edu\/viewdoc\/download?doi=10.1.1.101.7348&rep=rep1&type=pdf"},{"key":"CIT0025","unstructured":"Kot, M. (2003). The state explosion problem. Retrieved May, 18, 2015. http:\/\/www.cs.vsb.cz\/kot\/download\/Texts\/StateSpace.pdf"},{"key":"CIT0026","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-85968-7_13"},{"key":"CIT0027","unstructured":"Li, Y., He, R., Zhang, Z. & Guo, Y. (2005). Models and algorithms for shortest paths in a time dependent network. Paper presented at the International Symposium on OR and its Applications (pp.\u00a0319-328)."},{"key":"CIT0028","doi-asserted-by":"publisher","DOI":"10.1007\/s40747-020-00143-6"},{"key":"CIT0029","doi-asserted-by":"publisher","DOI":"10.1109\/WCICA.2008.4594514"},{"key":"CIT0030","doi-asserted-by":"publisher","DOI":"10.1016\/j.trb.2016.09.015"},{"key":"CIT0031","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45253-2_30"},{"key":"CIT0032","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-85968-7_12"},{"key":"CIT0033","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.2021.1092"},{"key":"CIT0034","doi-asserted-by":"publisher","DOI":"10.1002\/net.21511"},{"key":"CIT0035","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2006.05.007"},{"key":"CIT0036","doi-asserted-by":"publisher","DOI":"10.1002\/net.20212"},{"key":"CIT0037","doi-asserted-by":"publisher","DOI":"10.1016\/j.trc.2015.08.014"},{"key":"CIT0038","doi-asserted-by":"publisher","DOI":"10.1002\/net.21856"},{"key":"CIT0039","doi-asserted-by":"publisher","DOI":"10.1080\/09540091.2021.1997914"},{"key":"CIT0040","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2013.10.044"},{"key":"CIT0041","doi-asserted-by":"publisher","DOI":"10.1080\/09540091.2021.1993137"},{"key":"CIT0042","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2015.2401003"},{"key":"CIT0043","doi-asserted-by":"publisher","DOI":"10.1080\/09540091.2020.1832960"},{"key":"CIT0044","doi-asserted-by":"publisher","DOI":"10.14778\/2732939.2732941"},{"key":"CIT0045","doi-asserted-by":"publisher","DOI":"10.1080\/09540091.2022.2026888"},{"key":"CIT0046","doi-asserted-by":"publisher","DOI":"10.1080\/09540091.2021.1936455"},{"key":"CIT0047","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2011.03.008"}],"container-title":["Connection Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/09540091.2022.2061916","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,17]],"date-time":"2023-04-17T15:31:44Z","timestamp":1681745504000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/09540091.2022.2061916"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,20]]},"references-count":47,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,12,31]]}},"alternative-id":["10.1080\/09540091.2022.2061916"],"URL":"https:\/\/doi.org\/10.1080\/09540091.2022.2061916","relation":{},"ISSN":["0954-0091","1360-0494"],"issn-type":[{"type":"print","value":"0954-0091"},{"type":"electronic","value":"1360-0494"}],"subject":[],"published":{"date-parts":[[2022,5,20]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=ccos20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=ccos20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"},{"value":"2022-01-30","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-03-30","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-05-20","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}