{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T15:50:06Z","timestamp":1725637806040},"reference-count":13,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,10]]},"DOI":"10.1109\/itsc.2013.6728545","type":"proceedings-article","created":{"date-parts":[[2014,1,31]],"date-time":"2014-01-31T18:36:25Z","timestamp":1391193385000},"page":"2138-2145","source":"Crossref","is-referenced-by-count":8,"title":["Generalised time-dependent graphs for fully multimodal journey planning"],"prefix":"10.1109","author":[{"given":"Jan","family":"Hrncir","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michal","family":"Jakob","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"13","first-page":"343","article-title":"A Multi-Modal route planning approach with an improved genetic algorithm","author":"yu","year":"2010","journal-title":"Joint International Conference on Theory Data Handling and Modelling in GeoSpatial Information Science"},{"key":"11","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1007\/11561071_51","article-title":"Highway hierarchies hasten exact shortest path queries","author":"sanders","year":"2005","journal-title":"ESA 3669 of Lecture Notes in Computer Science"},{"journal-title":"Timetable Information and Shortest Paths","year":"2005","author":"schulz","key":"12"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2003.12.019"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1145\/1498698.1537599"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1126\/science.1137521"},{"key":"10","first-page":"88","article-title":"Experimental comparison of shortest path approaches for timetable information","author":"pyrga","year":"2004","journal-title":"Proc 4th Workshop on Algorithm Engineering and Experiments (ALENEX)"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1016\/S0965-8564(00)00043-4"},{"key":"6","article-title":"Computing the shortest path: A search meets graph theory","author":"goldberg","year":"2005","journal-title":"Proceedings of the 16th Annual ACMSIAM Symposium on Discrete Algorithms"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1145\/28869.28874"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04128-0_53"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1145\/1227161.1227166"},{"journal-title":"Multi-Modal Route Planning","year":"2009","author":"pajor","key":"8"}],"event":{"name":"2013 16th International IEEE Conference on Intelligent Transportation Systems - (ITSC 2013)","start":{"date-parts":[[2013,10,6]]},"location":"The Hague, Netherlands","end":{"date-parts":[[2013,10,9]]}},"container-title":["16th International IEEE Conference on Intelligent Transportation Systems (ITSC 2013)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6712176\/6728201\/06728545.pdf?arnumber=6728545","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,22]],"date-time":"2017-06-22T03:05:50Z","timestamp":1498100750000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6728545\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/itsc.2013.6728545","relation":{},"subject":[],"published":{"date-parts":[[2013,10]]}}}