Placement of Loading Stations for Electric Vehicles : Allowing Small Detours
Dateien
Datum
Autor:innen
Herausgeber:innen
ISSN der Zeitschrift
Electronic ISSN
ISBN
Bibliografische Daten
Verlag
Schriftenreihe
Auflagebezeichnung
Internationale Patentnummer
Angaben zur Forschungsförderung
Projekt
Open Access-Veröffentlichung
Sammlungen
Core Facility der Universität Konstanz
Titel in einer weiteren Sprache
Publikationstyp
Publikationsstatus
Erschienen in
Zusammenfassung
We consider the problem of covering a street network with loading stations for electric vehicles (EVs) such that EVs can travel along shortest paths and only require small detours (e.g., at most 3 km) to recharge along the route. We show that this problem can be formulated as a Hitting Set problem. Unfortunately, it turns out that even the explicit problem instance construction requires too much time and space to be practical. Therefore, we develop several approximation algorithms and heuristics to solve the problem. Our experiments show that even though small, the allowed detours lead to a considerable reduction in the number of required loading stations. Moreover, we devise an algorithm for planning high-quality EV-routes in a network with loading stations placed by our approach. We empirically show the usability of the routes by evaluating the number of reloading stops and the actually induced detour.
Zusammenfassung in einer weiteren Sprache
Fachgebiet (DDC)
Schlagwörter
Konferenz
Rezension
Zitieren
ISO 690
FUNKE, Stefan, André NUSSER, Sabine STORANDT, 2016. Placement of Loading Stations for Electric Vehicles : Allowing Small Detours. ICAPS 2016 : 26th International Conference on Automated Planning and Scheduling. London, UK, 12. Juni 2016 - 17. Juni 2016. In: COLES, Amanda, ed. and others. Proceedings of the Twenty-Sixth International Conference on Automated Planning and Scheduling. Palo Alto: The AAAI Press, 2016, pp. 131-139. ISBN 978-1-57735-757-5BibTex
@inproceedings{Funke2016Place-43755, year={2016}, title={Placement of Loading Stations for Electric Vehicles : Allowing Small Detours}, url={https://www.aaai.org/ocs/index.php/ICAPS/ICAPS16/paper/view/13086}, isbn={978-1-57735-757-5}, publisher={The AAAI Press}, address={Palo Alto}, booktitle={Proceedings of the Twenty-Sixth International Conference on Automated Planning and Scheduling}, pages={131--139}, editor={Coles, Amanda}, author={Funke, Stefan and Nusser, André and Storandt, Sabine} }
RDF
<rdf:RDF xmlns:dcterms="http://purl.org/dc/terms/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:bibo="http://purl.org/ontology/bibo/" xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#" xmlns:foaf="http://xmlns.com/foaf/0.1/" xmlns:void="http://rdfs.org/ns/void#" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > <rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/43755"> <dc:creator>Nusser, André</dc:creator> <dc:contributor>Storandt, Sabine</dc:contributor> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2018-11-09T10:28:47Z</dcterms:available> <dc:contributor>Nusser, André</dc:contributor> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <foaf:homepage rdf:resource="http://localhost:8080/"/> <dc:contributor>Funke, Stefan</dc:contributor> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/> <dc:language>eng</dc:language> <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/43755"/> <dcterms:title>Placement of Loading Stations for Electric Vehicles : Allowing Small Detours</dcterms:title> <dc:creator>Funke, Stefan</dc:creator> <dcterms:issued>2016</dcterms:issued> <dc:creator>Storandt, Sabine</dc:creator> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2018-11-09T10:28:47Z</dc:date> <dcterms:abstract xml:lang="eng">We consider the problem of covering a street network with loading stations for electric vehicles (EVs) such that EVs can travel along shortest paths and only require small detours (e.g., at most 3 km) to recharge along the route. We show that this problem can be formulated as a Hitting Set problem. Unfortunately, it turns out that even the explicit problem instance construction requires too much time and space to be practical. Therefore, we develop several approximation algorithms and heuristics to solve the problem. Our experiments show that even though small, the allowed detours lead to a considerable reduction in the number of required loading stations. Moreover, we devise an algorithm for planning high-quality EV-routes in a network with loading stations placed by our approach. We empirically show the usability of the routes by evaluating the number of reloading stops and the actually induced detour.</dcterms:abstract> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/> </rdf:Description> </rdf:RDF>