{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,23]],"date-time":"2026-07-23T00:25:44Z","timestamp":1784766344631,"version":"3.55.0"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2023,1,26]],"date-time":"2023-01-26T00:00:00Z","timestamp":1674691200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,1,26]],"date-time":"2023-01-26T00:00:00Z","timestamp":1674691200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100004504","name":"Lietuvos Mokslo Taryba","doi-asserted-by":"publisher","award":["01.2.2-LMT-K-718-02-0018"],"award-info":[{"award-number":["01.2.2-LMT-K-718-02-0018"]}],"id":[{"id":"10.13039\/501100004504","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Geoinformatica"],"published-print":{"date-parts":[[2023,10]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Advanced route planning algorithms are one of the key enabling technologies for emerging electric and autonomous mobility. Large realistic data sets are needed to test such algorithms under conditions that capture natural time-varying traffic patterns and corresponding travel-time and energy-use predictions. Further, the time-varying availability of charging infrastructure and vehicle-specific charging-power curves may be necessary to support advanced planning. While some data sets and synthetic data generators capture some of the aspects mentioned above, no integrated testbeds include all of them. We contribute with a modular testbed architecture. First, it includes a semi-synthetic data generator that uses a state-of-the-art traffic simulator, real traffic volume distribution patterns, EV-specific data, and elevation data. These elements support the generation of time-dependent travel-time and energy-use weights in a road-network graph. The generator ensures that the data satisfies the FIFO property, which is essential for time-dependent routing. Next, the testbed provides a thin layer of services that can serve as building blocks for future advanced routing algorithms. The experimental study demonstrates that the testbed can reproduce travel-time and energy-use patterns for long-distance trips similar to commercially available services.<\/jats:p>","DOI":"10.1007\/s10707-022-00485-y","type":"journal-article","created":{"date-parts":[[2023,1,26]],"date-time":"2023-01-26T06:02:20Z","timestamp":1674712940000},"page":"737-758","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Test-data generation and integration for long-distance e-vehicle routing"],"prefix":"10.1007","volume":"27","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9760-3566","authenticated-orcid":false,"given":"Andrius","family":"Barauskas","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9768-4258","authenticated-orcid":false,"given":"Agn\u0117","family":"Brilingait\u0117","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9781-9690","authenticated-orcid":false,"given":"Linas","family":"Bukauskas","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vaida","family":"\u010ceikut\u0117","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alminas","family":"\u010civilis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2046-6110","authenticated-orcid":false,"given":"Simonas","family":"\u0160altenis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,1,26]]},"reference":[{"issue":"6","key":"485_CR1","doi-asserted-by":"publisher","first-page":"1571","DOI":"10.1287\/trsc.2020.0981","volume":"54","author":"M Baum","year":"2020","unstructured":"Baum M, Dibbelt J, Wagner D, Z\u00fcndorf T (2020) Modeling and engineering constrained shortest path algorithms for battery electric vehicles. Transp Sci 54(6):1571\u20131600. https:\/\/doi.org\/10.1287\/trsc.2020.0981","journal-title":"Transp Sci"},{"key":"485_CR2","doi-asserted-by":"publisher","unstructured":"\u00c5kerblom N, Chen Y, Chehreghani MH (2020) An online learning framework for energy-efficient navigation of electric vehicles. In: IJCAI, pp 2051\u20132057. https:\/\/doi.org\/10.24963\/ijcai.2020\/284","DOI":"10.24963\/ijcai.2020\/284"},{"issue":"1","key":"485_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/2200000070","volume":"11","author":"D Russo","year":"2018","unstructured":"Russo D, Roy BV, Kazerouni A, Osband I, Wen Z (2018) A tutorial on thompson sampling. Found Trends Mach Learn 11(1):1\u201396. https:\/\/doi.org\/10.1561\/2200000070","journal-title":"Found Trends Mach Learn"},{"issue":"2","key":"485_CR4","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1109\/MITS.2017.2666585","volume":"9","author":"L Codeca","year":"2017","unstructured":"Codeca L, Frank R, Faye S, Engel T (2017) Luxembourg SUMO traffic (lust) scenario: traffic demand evaluation. IEEE Intell Transp Syst Mag 9 (2):52\u201363. https:\/\/doi.org\/10.1109\/MITS.2017.2666585","journal-title":"IEEE Intell Transp Syst Mag"},{"key":"485_CR5","doi-asserted-by":"publisher","unstructured":"Barauskas A, Brilingaite A, Bukauskas L, Ceikute V, Civilis A, Saltenis S (2021) Semi-synthetic data and testbed for long-distance e-vehicle routing. In: ADBIS, vol 1450, pp 61\u201371. https:\/\/doi.org\/10.1007\/978-3-030-85082-1_6","DOI":"10.1007\/978-3-030-85082-1_6"},{"issue":"2","key":"485_CR6","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/s10707-019-00366-x","volume":"24","author":"N Tempelmeier","year":"2020","unstructured":"Tempelmeier N, Dietze S, Demidova E (2020) Crosstown traffic - supervised prediction of impact of planned special events on urban traffic. GeoInformatica 24 (2):339\u2013370. https:\/\/doi.org\/10.1007\/s10707-019-00366-x","journal-title":"GeoInformatica"},{"key":"485_CR7","unstructured":"Zhao X, Spall JC (2018) Modeling traffic networks using integrated route and link data. Preprint at arXiv:1811.01314"},{"key":"485_CR8","doi-asserted-by":"crossref","unstructured":"Pramanik A, Rahman M, Anam I, Ali AA, Amin A, Rahman M (2020) Modeling traffic congestion in developing countries using google maps data. Preprint at arXiv:2011.02359","DOI":"10.1007\/978-3-030-73100-7_36"},{"key":"485_CR9","doi-asserted-by":"publisher","unstructured":"Zafar N, Haq IU (2020) Traffic congestion prediction based on estimated time of arrival. PLoS One, vol 15(12). https:\/\/doi.org\/10.1371\/journal.pone.0238200","DOI":"10.1371\/journal.pone.0238200"},{"key":"485_CR10","doi-asserted-by":"publisher","unstructured":"Sapre V, Kalambur S, Sitaram D, Bastian R (2018) Synthetic generation of traffic data for urban mobility. In: ICACCI, pp 2151\u20132157. https:\/\/doi.org\/10.1109\/ICACCI.2018.8554633","DOI":"10.1109\/ICACCI.2018.8554633"},{"key":"485_CR11","unstructured":"(2021). German aerospace center (DLR) and others: SUMO \u2014 simulation of Urban MObility. Accessed 28 Sept 2021. https:\/\/sumo.dlr.de\/docs"},{"issue":"2","key":"485_CR12","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1023\/A:1015231126594","volume":"6","author":"T Brinkhoff","year":"2002","unstructured":"Brinkhoff T (2002) A framework for generating network-based moving objects. GeoInformatica 6(2):153\u2013180. https:\/\/doi.org\/10.1023\/A:1015231126594","journal-title":"GeoInformatica"},{"key":"485_CR13","doi-asserted-by":"publisher","unstructured":"L\u00f3pez P\u00c1, Behrisch M, Bieker-Walz L, Erdmann J, Fl\u00f6tter\u00f6d Y, Hilbrich R, L\u00fccken L, Rummel J, Wagner P, WieBner E (2018) Microscopic traffic simulation using SUMO. In: ITSC, pp 2575\u20132582. https:\/\/doi.org\/10.1109\/ITSC.2018.8569938","DOI":"10.1109\/ITSC.2018.8569938"},{"issue":"4","key":"485_CR14","doi-asserted-by":"publisher","first-page":"963","DOI":"10.1007\/s10619-020-07306-x","volume":"38","author":"J Yu","year":"2020","unstructured":"Yu J, Fu Z, Sarwat M (2020) Dissecting geosparksim: a scalable microscopic road network traffic simulator in apache spark. Distrib Parallel Databases 38(4):963\u2013994. https:\/\/doi.org\/10.1007\/s10619-020-07306-x","journal-title":"Distrib Parallel Databases"},{"key":"485_CR15","doi-asserted-by":"publisher","unstructured":"Yu J, Wu J, Sarwat M (2015) Geospark: a cluster computing framework for processing large-scale spatial data. In: SIGSPATIAL, pp 70\u20131704. https:\/\/doi.org\/10.1145\/2820783.2820860","DOI":"10.1145\/2820783.2820860"},{"issue":"2","key":"485_CR16","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1145\/2898363","volume":"8","author":"K Ramamohanarao","year":"2017","unstructured":"Ramamohanarao K, Xie H, Kulik L, Karunasekera S, Tanin E, Zhang R, Khunayn EB (2017) SMARTS: scalable microscopic adaptive road traffic simulator. ACM Trans Intell Syst Technol 8(2):26\u201312622. https:\/\/doi.org\/10.1145\/2898363","journal-title":"ACM Trans Intell Syst Technol"},{"key":"485_CR17","doi-asserted-by":"publisher","unstructured":"AlDwyish A, Xie H, Tanin E, Karunasekera S, Ramamohanarao K (2017) Using a traffic simulator for navigation service. In: SIGSPATIAL, pp 78\u20131784. https:\/\/doi.org\/10.1145\/3139958.3139998","DOI":"10.1145\/3139958.3139998"},{"issue":"5","key":"485_CR18","doi-asserted-by":"publisher","first-page":"1490","DOI":"10.1007\/s00453-019-00655-9","volume":"82","author":"M Baum","year":"2020","unstructured":"Baum M, Dibbelt J, Pajor T, Sauer J, Wagner D, Z\u00fcndorf T (2020) Energy-optimal routes for battery electric vehicles. Algorithmica 82(5):1490\u20131546. https:\/\/doi.org\/10.1007\/s00453-019-00655-9","journal-title":"Algorithmica"},{"key":"485_CR19","unstructured":"(2021). OpenStreetMap foundation: openstreetmap. Accessed 28 Sept 2021. https:\/\/www.openstreetmap.org"},{"key":"485_CR20","unstructured":"(2021). Geofabrik GmbH: openstreetmap data extracts. Accessed 28 Sept 2021. http:\/\/download.geofabrik.de"},{"key":"485_CR21","unstructured":"Moeller C (2021) osm2po \u2014 openstreetmap converter and routing engine for java. Accessed 28 Sept 2021. https:\/\/osm2po.de"},{"key":"485_CR22","unstructured":"(2021). German aerospace center (DLR) and others: tools\/trip. Accessed 28 Sept 2021. https:\/\/sumo.dlr.de\/docs\/Tools\/Trip.html"},{"key":"485_CR23","doi-asserted-by":"publisher","unstructured":"Kurczveil T, L\u00f3pez P\u00c1, Schnieder E (2013) Implementation of an energy model and a charging infrastructure in sumo. In: Simulation of urban mobility user conference. Springer, pp 33\u201343. https:\/\/doi.org\/10.1007\/978-3-662-45079-6_3","DOI":"10.1007\/978-3-662-45079-6_3"},{"key":"485_CR24","unstructured":"Jarvis A, Reuter HI, Nelson A, Guevara E (2021) Hole-filled seamless SRTM data V4. Accessed 28 Sept 2021. http:\/\/srtm.csi.cgiar.org"},{"key":"485_CR25","unstructured":"(2021). Open charge map: the open charge map API. Accessed 7 Mar 2021. https:\/\/openchargemap.org\/site\/develop\/api"},{"key":"485_CR26","unstructured":"(2021). Chargeprice: open EV data. Accessed 7 Mar 2021. https:\/\/github.com\/chargeprice\/open-ev-data"},{"key":"485_CR27","unstructured":"(2021). ElaadNL: open data sets. Accessed 12 Mar 2021. https:\/\/platform.elaad.io"},{"issue":"1","key":"485_CR28","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/S0377-2217(99)00035-1","volume":"121","author":"K Sung","year":"2000","unstructured":"Sung K, Bell MG, Seong M, Park S (2000) Shortest paths in a network with time-dependent flow speeds. Eur J Oper Res 121(1):32\u201339","journal-title":"Eur J Oper Res"},{"key":"485_CR29","doi-asserted-by":"publisher","unstructured":"Kanoulas E, Du Y, Xia T, Zhang D (2006) Finding fastest paths on a road network with speed patterns. In: ICDE, p 10. https:\/\/doi.org\/10.1109\/ICDE.2006.71","DOI":"10.1109\/ICDE.2006.71"},{"key":"485_CR30","doi-asserted-by":"publisher","unstructured":"Batz GV, Geisberger R, Sanders P, Vetter C (2013) Minimum time-dependent travel times with contraction hierarchies. ACM J Exp Algorithmics, vol 18. https:\/\/doi.org\/10.1145\/2444016.2444020","DOI":"10.1145\/2444016.2444020"},{"key":"485_CR31","unstructured":"(2021). Institut fuer theroretische informatik, karlsruher institut fuer technology (KIT): KaTCH \u2013 Karlsruhe time-dependent contraction hierarchies. Accessed 16 Mar 2021. https:\/\/github.com\/GVeitBatz\/KaTCH"}],"container-title":["GeoInformatica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10707-022-00485-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10707-022-00485-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10707-022-00485-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,21]],"date-time":"2023-09-21T07:10:10Z","timestamp":1695280210000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10707-022-00485-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,26]]},"references-count":31,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,10]]}},"alternative-id":["485"],"URL":"https:\/\/doi.org\/10.1007\/s10707-022-00485-y","relation":{},"ISSN":["1384-6175","1573-7624"],"issn-type":[{"value":"1384-6175","type":"print"},{"value":"1573-7624","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,1,26]]},"assertion":[{"value":"14 October 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 November 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 December 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 January 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no known competing financial interests or personal relationships that could have influenced the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure statement"}}]}}