TY - GEN
T1 - Locating battery charging stations to facilitate almost shortest paths
AU - Arkin, Esther M.
AU - Carmi, Paz
AU - Katz, Matthew J.
AU - Mitchell, Joseph S.B.
AU - Segal, Michael
N1 - Publisher Copyright:
© Esther M. Arkin, Paz Carmi, Matthew J. Katz, Joseph S. B. Mitchell, and Michael Segal; licensed under Creative Commons License CC-BY.
PY - 2014/9/1
Y1 - 2014/9/1
N2 - We study a facility location problem motivated by requirements pertaining to the distribution of charging stations for electric vehicles: Place a minimum number of battery charging stations at a subset of nodes of a network, so that battery-powered electric vehicles will be able to move between destinations using "t-spanning" routes, of lengths within a factor t > 1 of the length of a shortest path, while having sufficient charging stations along the way. We give constantfactor approximation algorithms for minimizing the number of charging stations, subject to the t-spanning constraint. We study two versions of the problem, one in which the stations are required to support a single ride (to a single destination), and one in which the stations are to support multiple rides through a sequence of destinations, where the destinations are revealed one at a time.
AB - We study a facility location problem motivated by requirements pertaining to the distribution of charging stations for electric vehicles: Place a minimum number of battery charging stations at a subset of nodes of a network, so that battery-powered electric vehicles will be able to move between destinations using "t-spanning" routes, of lengths within a factor t > 1 of the length of a shortest path, while having sufficient charging stations along the way. We give constantfactor approximation algorithms for minimizing the number of charging stations, subject to the t-spanning constraint. We study two versions of the problem, one in which the stations are required to support a single ride (to a single destination), and one in which the stations are to support multiple rides through a sequence of destinations, where the destinations are revealed one at a time.
KW - Approximation algorithms
KW - Geometric spanners
KW - Transportation networks
UR - http://www.scopus.com/inward/record.url?scp=84908308851&partnerID=8YFLogxK
U2 - 10.4230/OASIcs.ATMOS.2014.25
DO - 10.4230/OASIcs.ATMOS.2014.25
M3 - Conference contribution
AN - SCOPUS:84908308851
T3 - OpenAccess Series in Informatics
SP - 25
EP - 33
BT - 14th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2014
A2 - Funke, Stefan
A2 - Mihalak, Matus
PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
T2 - 14th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2014
Y2 - 11 September 2014 through 11 September 2014
ER -
