{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T08:51:39Z","timestamp":1730278299736,"version":"3.28.0"},"reference-count":13,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,9]]},"DOI":"10.1109\/itsc.2010.5625085","type":"proceedings-article","created":{"date-parts":[[2010,11,17]],"date-time":"2010-11-17T16:55:08Z","timestamp":1290012908000},"page":"980-985","source":"Crossref","is-referenced-by-count":0,"title":["The predecessor and the accounting algorithm speed up shortest path calculations in traffic routing applications"],"prefix":"10.1109","author":[{"given":"S.","family":"Demeyer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Goedgebeur","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Audenaert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Pickavet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Demeester","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1080\/10248079608903712"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(94)00152-3"},{"key":"3","first-page":"124","article-title":"Bi-directional Search","volume":"6","author":"pohl","year":"1971","journal-title":"Machine Intelligence"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2005.03.027"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"journal-title":"Real-time Vehicle Routing and Scheduling in Dynamic and Stochastic Traffic Networks","year":"1996","author":"fu","key":"10"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1007\/BF01840435"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70918-3_3"},{"key":"5","first-page":"804","article-title":"Engineering highway hierarchies","volume":"4168","author":"sanders","year":"2006","journal-title":"LNCS"},{"key":"4","first-page":"709","article-title":"a new route optimization algorithm for rapid decision support","volume":"2","author":"bander","year":"1991","journal-title":"Vehicle Navigation and Information Systems Conference 1991"},{"key":"9","first-page":"185","article-title":"Pareto shortest paths is often feasible in practice","volume":"2141","author":"muller-hannemann","year":"2001","journal-title":"LNCS"},{"key":"8","first-page":"156","article-title":"Computing the shortest path: A*search meets graph theory","author":"goldberg","year":"2005","journal-title":"Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms"}],"event":{"name":"2010 13th International IEEE Conference on Intelligent Transportation Systems - (ITSC 2010)","start":{"date-parts":[[2010,9,19]]},"location":"Funchal, Madeira Island, Portugal","end":{"date-parts":[[2010,9,22]]}},"container-title":["13th International IEEE Conference on Intelligent Transportation Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5610907\/5624963\/05625085.pdf?arnumber=5625085","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,18]],"date-time":"2017-03-18T20:29:52Z","timestamp":1489868992000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5625085\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,9]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/itsc.2010.5625085","relation":{},"subject":[],"published":{"date-parts":[[2010,9]]}}}