{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T19:06:14Z","timestamp":1743015974302,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030850814"},{"type":"electronic","value":"9783030850821"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,7,17]],"date-time":"2021-07-17T00:00:00Z","timestamp":1626480000000},"content-version":"vor","delay-in-days":197,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Electric and autonomous mobility will increasingly rely on advanced route planning algorithms. Robust testing of these algorithms is dependent on the availability of large realistic data sets. Such data sets should capture realistic time-varying traffic patterns and corresponding travel-time and energy-use predictions. Ideally, time-varying availability of charging infrastructure and vehicle-specific charging-power curves should be included in the data to support advanced planning.<\/jats:p><jats:p>We contribute with a modular testbed architecture including a semi-synthetic data generator that uses a state-of-the-art traffic simulator, real traffic distribution patterns, EV-specific data, and elevation data to generate time-dependent travel-time and energy-use weights in a road-network graph. 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\/978-3-030-85082-1_6","type":"book-chapter","created":{"date-parts":[[2021,8,10]],"date-time":"2021-08-10T16:16:47Z","timestamp":1628612207000},"page":"61-71","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Semi-synthetic Data and Testbed for Long-Distance E-Vehicle Routing"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9760-3566","authenticated-orcid":false,"given":"Andrius","family":"Barauskas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9768-4258","authenticated-orcid":false,"given":"Agn\u0117","family":"Brilingait\u0117","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9781-9690","authenticated-orcid":false,"given":"Linas","family":"Bukauskas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vaida","family":"\u010ceikut\u0117","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alminas","family":"\u010civilis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2046-6110","authenticated-orcid":false,"given":"Simonas","family":"\u0160altenis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,7,17]]},"reference":[{"key":"6_CR1","doi-asserted-by":"publisher","unstructured":"\u00c5kerblom, N., Chen, Y., Chehreghani, M.H.: An online learning framework for energy-efficient navigation of electric vehicles. In: IJCAI, pp. 2051\u20132057. ijcai.org (2020). https:\/\/doi.org\/10.24963\/ijcai.2020\/284","DOI":"10.24963\/ijcai.2020\/284"},{"key":"6_CR2","doi-asserted-by":"publisher","unstructured":"Baum, M., Dibbelt, J., Wagner, D., Z\u00fcndorf, T.: Modeling and engineering constrained shortest path algorithms for battery electric vehicles. Transp. Sci. 54(6), 1571\u20131600 (2020). https:\/\/doi.org\/10.1287\/trsc.2020.0981","DOI":"10.1287\/trsc.2020.0981"},{"key":"6_CR3","doi-asserted-by":"publisher","unstructured":"Brinkhoff, T.: A framework for generating network-based moving objects. GeoInformatica 6(2), 153\u2013180 (2002). https:\/\/doi.org\/10.1023\/A:1015231126594","DOI":"10.1023\/A:1015231126594"},{"key":"6_CR4","unstructured":"Chargeprice: Open EV Data. https:\/\/github.com\/chargeprice\/open-ev-data. Accessed 7 Mar 2021"},{"key":"6_CR5","doi-asserted-by":"publisher","unstructured":"Codeca, L., Frank, R., Faye, S., Engel, T.: Luxembourg SUMO traffic (lust) scenario: traffic demand evaluation. IEEE Intell. Transp. Syst. Mag. 9(2), 52\u201363 (2017). https:\/\/doi.org\/10.1109\/MITS.2017.2666585","DOI":"10.1109\/MITS.2017.2666585"},{"key":"6_CR6","unstructured":"ElaadNL: Open data sets. https:\/\/platform.elaad.io. Accessed 12 Mar 2021"},{"key":"6_CR7","unstructured":"Geofabrik GmbH: Openstreetmap data extracts (2020). http:\/\/download.geofabrik.de\/. Accessed 5 Sept 2020"},{"key":"6_CR8","unstructured":"German Aerospace Center (DLR) and others.: Sumo \u2013 simulation of urban mobility (2020). https:\/\/sumo.dlr.de\/docs\/. Accessed 24 Feb 2020"},{"key":"6_CR9","unstructured":"Institut fuer Theroretische Informatik, Karlsruher Institut fuer Technology (KIT): KaTCH - Karlsruhe Time-Dependent Contraction Hierarchies (2016). https:\/\/github.com\/GVeitBatz\/KaTCH. Accessed 16 Mar 2021"},{"key":"6_CR10","unstructured":"Jarvis, A., Reuter, H.I., Nelson, A., Guevara, E.: Hole-filled seamless SRTM data v4 (2008). http:\/\/srtm.csi.cgiar.org. Accessed 24 Feb 2020"},{"key":"6_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-662-45079-6_3","volume-title":"Simulation of Urban Mobility","author":"T Kurczveil","year":"2014","unstructured":"Kurczveil, T., L\u00f3pez, P.\u00c1., Schnieder, E.: Implementation of an energy model and a charging infrastructure in SUMO. In: Behrisch, M., Krajzewicz, D., Weber, M. (eds.) SUMO 2013. LNCS, vol. 8594, pp. 33\u201343. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-45079-6_3"},{"key":"6_CR12","doi-asserted-by":"publisher","unstructured":"L\u00f3pez, P.\u00c1., et al.: Microscopic traffic simulation using SUMO. In: ITSC, pp. 2575\u20132582. IEEE (2018). https:\/\/doi.org\/10.1109\/ITSC.2018.8569938","DOI":"10.1109\/ITSC.2018.8569938"},{"key":"6_CR13","unstructured":"Open Charge Map: The Open Charge Map API. https:\/\/openchargemap.org\/site\/develop\/api. Accessed 7 Mar 2021"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Pramanik, A., Rahman, M., Anam, I., Ali, A.A., Amin, A., Rahman, M.: Modeling traffic congestion in developing countries using google maps data (2020). preprint at arXiv:2011.02359","DOI":"10.1007\/978-3-030-73100-7_36"},{"key":"6_CR15","doi-asserted-by":"publisher","unstructured":"Russo, D., Roy, B.V., Kazerouni, A., Osband, I., Wen, Z.: A tutorial on Thompson sampling. Found. Trends Mach. Learn. 11(1), 1\u201396 (2018). https:\/\/doi.org\/10.1561\/2200000070","DOI":"10.1561\/2200000070"},{"key":"6_CR16","doi-asserted-by":"publisher","unstructured":"Yu, J., Fu, Z., Sarwat, M.: Dissecting GeoSparkSim: a scalable microscopic road network traffic simulator in apache spark. Distrib. Parallel Databases 38(4), 963\u2013994 (2020). https:\/\/doi.org\/10.1007\/s10619-020-07306-x","DOI":"10.1007\/s10619-020-07306-x"},{"key":"6_CR17","doi-asserted-by":"publisher","unstructured":"Zafar, N., Haq, I.U.: Traffic congestion prediction based on estimated time of arrival. PLoS ONE 15(12) (2020). https:\/\/doi.org\/10.1371\/journal.pone.0238200","DOI":"10.1371\/journal.pone.0238200"},{"key":"6_CR18","unstructured":"Zhao, X., Spall, J.C.: Modeling traffic networks using integrated route and link data (2018). preprint at arXiv:1811.01314"}],"container-title":["Communications in Computer and Information Science","New Trends in Database and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-85082-1_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T16:48:17Z","timestamp":1710348497000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-85082-1_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030850814","9783030850821"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-85082-1_6","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"17 July 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ADBIS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Advances in Databases and Information Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tartu","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Estonia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 August 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 August 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"adbis2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/adbis2021.cs.ut.ee\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"70","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"18","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Workshops: submissions: 17,  papers accepted: DOING 2021: 3, SIMPDA 2021: 1, MADEISD 2021: 4, MegaData 2021: 1, CAoNS 2021: 2","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}