{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T03:14:38Z","timestamp":1729653278619,"version":"3.28.0"},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,10]]},"DOI":"10.1109\/itsc.2009.5309878","type":"proceedings-article","created":{"date-parts":[[2009,11,16]],"date-time":"2009-11-16T18:24:27Z","timestamp":1258395867000},"page":"1-6","source":"Crossref","is-referenced-by-count":0,"title":["Optimal path in dynamic and stochastic networks"],"prefix":"10.1109","author":[{"given":"Tahar","family":"Berradia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joseph","family":"Mouzna","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"15","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2010.07.064"},{"key":"13","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1002\/net.10049","article-title":"on the online shortest path problem with limited arc cost dependecies","volume":"40","author":"ziliaskopoulos","year":"2002","journal-title":"Networks"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.20.3.182"},{"key":"11","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1016\/S0191-2615(98)00016-2","article-title":"expected shortest paths in dynamic and stoxhastic traffic networks","volume":"32","author":"rilett","year":"1998","journal-title":"Transportation Research B"},{"journal-title":"Optimal routing in time-varying stochastic networks Algorithms and implementation","year":"1997","author":"miller-hooks","key":"12"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.3141\/1645-21"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(01)00354-X"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(01)00354-X"},{"key":"10","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1287\/trsc.36.2.218.562","article-title":"a heuristic seach approach for non-staionary shortest path problem with terminal costs","volume":"36","author":"white","year":"2002","journal-title":"Transportation Science"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-0037(199603)27:2<133::AID-NET5>3.0.CO;2-L"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.34.2.198.12304"},{"year":"0","key":"5"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1520-6750(199812)45:8<769::AID-NAV2>3.0.CO;2-#"},{"key":"9","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1287\/opre.41.1.91","article-title":"dynamic shortest paths in acyclic networks with markovian arc costs","volume":"41","author":"tsitsiklis","year":"1993","journal-title":"Operations Research"},{"journal-title":"Genetic Algorithms in Search Optimization and Machine Learning","year":"1989","author":"goldberg","key":"8"}],"event":{"name":"2009 12th International IEEE Conference on Intelligent Transportation Systems (ITSC)","start":{"date-parts":[[2009,10,4]]},"location":"St. Louis","end":{"date-parts":[[2009,10,7]]}},"container-title":["2009 12th International IEEE Conference on Intelligent Transportation Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5305882\/5309513\/05309878.pdf?arnumber=5309878","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,18]],"date-time":"2017-06-18T21:50:08Z","timestamp":1497822608000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5309878\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,10]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/itsc.2009.5309878","relation":{},"subject":[],"published":{"date-parts":[[2009,10]]}}}