Locating battery charging stations to facilitate almost shortest paths

Esther M. Arkin; Paz Carmi; Matthew J. Katz; Joseph S.B. Mitchell; Michael Segal

doi:10.4230/OASIcs.ATMOS.2014.25

Locating battery charging stations to facilitate almost shortest paths

Esther M. Arkin
, Paz Carmi
, Matthew J. Katz
, Joseph S.B. Mitchell
, Michael Segal

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

1 Scopus citations

Abstract

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.

Original language	English
Title of host publication	14th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2014
Editors	Stefan Funke, Matus Mihalak
Publisher	Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Pages	25-33
Number of pages	9
ISBN (Electronic)	9783939897750
DOIs	https://doi.org/10.4230/OASIcs.ATMOS.2014.25
State	Published - 1 Sep 2014
Event	14th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2014 - Wroclaw, Poland Duration: 11 Sep 2014 → 11 Sep 2014

Publication series

Name	OpenAccess Series in Informatics
Volume	42
ISSN (Print)	2190-6807

Conference

Conference	14th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2014
Country/Territory	Poland
City	Wroclaw
Period	11/09/14 → 11/09/14

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

SDG 7 Affordable and Clean Energy

Keywords

Approximation algorithms
Geometric spanners
Transportation networks

ASJC Scopus subject areas

Geography, Planning and Development
Modeling and Simulation

Access to Document

10.4230/OASIcs.ATMOS.2014.25

Cite this

Arkin, E. M., Carmi, P., Katz, M. J., Mitchell, J. S. B., & Segal, M. (2014). Locating battery charging stations to facilitate almost shortest paths. In S. Funke, & M. Mihalak (Eds.), 14th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2014 (pp. 25-33). (OpenAccess Series in Informatics; Vol. 42). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/OASIcs.ATMOS.2014.25

Arkin, Esther M. ; Carmi, Paz ; Katz, Matthew J. et al. / Locating battery charging stations to facilitate almost shortest paths. 14th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2014. editor / Stefan Funke ; Matus Mihalak. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2014. pp. 25-33 (OpenAccess Series in Informatics).

@inproceedings{fa0de4c0523d427eab915f40bc9a3534,

title = "Locating battery charging stations to facilitate almost shortest paths",

abstract = "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.",

keywords = "Approximation algorithms, Geometric spanners, Transportation networks",

author = "Arkin, \{Esther M.\} and Paz Carmi and Katz, \{Matthew J.\} and Mitchell, \{Joseph S.B.\} and Michael Segal",

note = "Publisher Copyright: {\textcopyright} Esther M. Arkin, Paz Carmi, Matthew J. Katz, Joseph S. B. Mitchell, and Michael Segal; licensed under Creative Commons License CC-BY.; 14th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2014 ; Conference date: 11-09-2014 Through 11-09-2014",

year = "2014",

month = sep,

day = "1",

doi = "10.4230/OASIcs.ATMOS.2014.25",

language = "English",

series = "OpenAccess Series in Informatics",

publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",

pages = "25--33",

editor = "Stefan Funke and Matus Mihalak",

booktitle = "14th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2014",

address = "Germany",

}

Arkin, EM, Carmi, P , Katz, MJ, Mitchell, JSB & Segal, M 2014, Locating battery charging stations to facilitate almost shortest paths. in S Funke & M Mihalak (eds), 14th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2014. OpenAccess Series in Informatics, vol. 42, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, pp. 25-33, 14th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2014, Wroclaw, Poland, 11/09/14. https://doi.org/10.4230/OASIcs.ATMOS.2014.25

Locating battery charging stations to facilitate almost shortest paths. / Arkin, Esther M.; Carmi, Paz ; Katz, Matthew J. et al.
14th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2014. ed. / Stefan Funke; Matus Mihalak. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2014. p. 25-33 (OpenAccess Series in Informatics; Vol. 42).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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 - https://www.scopus.com/pages/publications/84908308851

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 -

Arkin EM, Carmi P , Katz MJ, Mitchell JSB, Segal M. Locating battery charging stations to facilitate almost shortest paths. In Funke S, Mihalak M, editors, 14th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2014. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. 2014. p. 25-33. (OpenAccess Series in Informatics). doi: 10.4230/OASIcs.ATMOS.2014.25

Locating battery charging stations to facilitate almost shortest paths

Abstract

Publication series

Conference

UN SDGs

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this