DROPS

Document

DOI: 10.4230/LIPIcs.ISAAC.2016.7

An Efficient Algorithm for Placing Electric Vehicle Charging Stations

Authors: Pankaj K. Agarwal, Jiangwei Pan, and Will Victor

Published in: LIPIcs, Volume 64, 27th International Symposium on Algorithms and Computation (ISAAC 2016)

Abstract

Motivated by the increasing popularity of electric vehicles (EV) and a lack of charging stations in the road network, we study the shortest path hitting set (SPHS) problem. Roughly speaking, given an input graph G, the goal is to compute a small-size subset H of vertices of G such that by placing charging stations at vertices in H, every shortest path in G becomes EV-feasible, i.e., an EV can travel between any two vertices of G through the shortest path with a full charge. In this paper, we propose a bi-criteria approximation algorithm with running time near-linear in the size of G that has a logarithmic approximation on |H| and may require the EV to slightly deviate from the shortest path. We also present a data structure for computing an EV-feasible path between two query vertices of G.

Cite as

Pankaj K. Agarwal, Jiangwei Pan, and Will Victor. An Efficient Algorithm for Placing Electric Vehicle Charging Stations. In 27th International Symposium on Algorithms and Computation (ISAAC 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 64, pp. 7:1-7:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)

Copy BibTex To Clipboard

@InProceedings{agarwal_et_al:LIPIcs.ISAAC.2016.7,
  author =	{Agarwal, Pankaj K. and Pan, Jiangwei and Victor, Will},
  title =	{{An Efficient Algorithm for Placing Electric Vehicle Charging Stations}},
  booktitle =	{27th International Symposium on Algorithms and Computation (ISAAC 2016)},
  pages =	{7:1--7:12},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-026-2},
  ISSN =	{1868-8969},
  year =	{2016},
  volume =	{64},
  editor =	{Hong, Seok-Hee},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.7},
  URN =		{urn:nbn:de:0030-drops-67782},
  doi =		{10.4230/LIPIcs.ISAAC.2016.7},
  annote =	{Keywords: Shortest path hitting set, Charging station placement, Electric vehicle}
}

Search Results

Documents authored by Victor, Will

An Efficient Algorithm for Placing Electric Vehicle Charging Stations

Abstract

Cite as

Thanks for your feedback!

Could not send message