{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T19:01:51Z","timestamp":1754161311838,"version":"3.41.2"},"reference-count":24,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"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":[[2019,7]]},"DOI":"10.1109\/icca.2019.8899966","type":"proceedings-article","created":{"date-parts":[[2019,11,25]],"date-time":"2019-11-25T18:20:18Z","timestamp":1574706018000},"page":"1391-1396","source":"Crossref","is-referenced-by-count":1,"title":["Data-Driven Distributionally Robust Shortest Path Problem Using the Wasserstein Ambiguity Set"],"prefix":"10.1109","author":[{"given":"Zhuolin","family":"Wang","sequence":"first","affiliation":[{"name":"Tsinghua University,Department of Automation and BNRist,Beijing,P.R. China,100084"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Keyou","family":"You","sequence":"additional","affiliation":[{"name":"Tsinghua University,Department of Automation and BNRist,Beijing,P.R. China,100084"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shiji","family":"Song","sequence":"additional","affiliation":[{"name":"Tsinghua University,Department of Automation and BNRist,Beijing,P.R. China,100084"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chao","family":"Shang","sequence":"additional","affiliation":[{"name":"Tsinghua University,Department of Automation and BNRist,Beijing,P.R. China,100084"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","article-title":"A min-max solution of an inventory problem","author":"scarf","year":"1957","journal-title":"RAND CORP SANTA MONICA CA Tech Rep"},{"key":"ref11","article-title":"Kullback-leibler divergence constrained distn.butionally robust optimization","author":"hu","year":"2013","journal-title":"available on Optimization Online"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-015-0929-7"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1080\/14697680701455410"},{"key":"ref14","first-page":"52","article-title":"On a space of totally additive functions, vestn","volume":"13","author":"kantorovich","year":"1958","journal-title":"Vestnik Leningrad Univ"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.trb.2009.11.003"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2018.10.006"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s00440-006-0004-7"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s00440-014-0583-7"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-017-1172-1"},{"key":"ref4","article-title":"Exploring route choice behavior using geographic information system-based alternative routes and hypothetical travel time information input","author":"abdel-aty","year":"1995","journal-title":"Transportation Research Record"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2015.2498160"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.trb.2011.03.003"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.trb.2010.06.001"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.trb.2016.11.012"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.endm.2013.05.132"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2016.2543262"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2010.2048030"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2017.2709798"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2.4.393"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32160-3_1"},{"key":"ref21","article-title":"Topics in optimal transportation","author":"villani","year":"2003","journal-title":"Amencan Mathematical Soc"},{"key":"ref24","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/978-1-4757-3403-4_7","article-title":"On duality theory of conic linear problems","volume":"57","author":"shapiro","year":"2001","journal-title":"Nonconvex Optimization and Its Applications"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.trb.2017.04.006"}],"event":{"name":"2019 IEEE 15th International Conference on Control and Automation (ICCA)","start":{"date-parts":[[2019,7,16]]},"location":"Edinburgh, UK","end":{"date-parts":[[2019,7,19]]}},"container-title":["2019 IEEE 15th International Conference on Control and Automation (ICCA)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8892593\/8899472\/08899966.pdf?arnumber=8899966","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,28]],"date-time":"2025-07-28T19:37:14Z","timestamp":1753731434000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8899966\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":24,"URL":"https:\/\/doi.org\/10.1109\/icca.2019.8899966","relation":{},"subject":[],"published":{"date-parts":[[2019,7]]}}}