{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T08:58:06Z","timestamp":1730278686908,"version":"3.28.0"},"reference-count":21,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,9,19]],"date-time":"2021-09-19T00:00:00Z","timestamp":1632009600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,9,19]],"date-time":"2021-09-19T00:00:00Z","timestamp":1632009600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,9,19]],"date-time":"2021-09-19T00:00:00Z","timestamp":1632009600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,9,19]]},"DOI":"10.1109\/itsc48978.2021.9564651","type":"proceedings-article","created":{"date-parts":[[2021,10,25]],"date-time":"2021-10-25T19:52:26Z","timestamp":1635191546000},"page":"653-659","source":"Crossref","is-referenced-by-count":1,"title":["Graph Embedding and Approximate Dynamic Programming for the Reliable Shortest Path Problem"],"prefix":"10.1109","author":[{"given":"Qihang","family":"Peng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hongliang","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chuan","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.trb.2020.05.013"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2018.05.022"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1287\/opre.17.4.583"},{"key":"ref13","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1002\/atr.5670390104","article-title":"Path finding under uncertainty","volume":"39","author":"chen","year":"2005","journal-title":"Journal of Advanced Transportation"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.113192"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.tre.2013.07.002"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1512\/iumj.1957.6.56038"},{"journal-title":"node2vec Scalable feature learning for networks","year":"2016","author":"grover","key":"ref17"},{"key":"ref18","article-title":"Efficient estimation of word representations in vector space","author":"mikolov","year":"2013","journal-title":"ICLR International Conference on Learning Representations"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.trb.2015.04.002"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.jclepro.2020.121130"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.trb.2017.04.006"},{"key":"ref5","article-title":"Lagrangian relaxation for the multiple constrained robust shortest path problem","volume":"2019","author":"pan","year":"2019","journal-title":"Mathematical Problems in Engineering"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.trb.2018.11.013"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.trb.2018.12.011"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2017.11.023"},{"key":"ref1","first-page":"1","article-title":"On the shortest a-reliable path problem","author":"corredor-montenegro","year":"2021","journal-title":"Journal of the Spanish Society of Statistics and Operations Research"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1088\/1742-6596\/1368\/3\/032008"},{"journal-title":"Transportation Network Test Problems","year":"0","author":"bar-gera","key":"ref20"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.tra.2012.01.003"}],"event":{"name":"2021 IEEE International Intelligent Transportation Systems Conference (ITSC)","start":{"date-parts":[[2021,9,19]]},"location":"Indianapolis, IN, USA","end":{"date-parts":[[2021,9,22]]}},"container-title":["2021 IEEE International Intelligent Transportation Systems Conference (ITSC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9564393\/9564395\/09564651.pdf?arnumber=9564651","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T15:47:39Z","timestamp":1652197659000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9564651\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,19]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/itsc48978.2021.9564651","relation":{},"subject":[],"published":{"date-parts":[[2021,9,19]]}}}