Using activity patterns to place electric vehicle charging stations in urban regions. Pal, A., Rangudu, P., Ravi, S. S., & Vullikanti, A. K. In IEEE Workshop Parallel Distributed Processing Computational Social Systems (IPDPS), pages 1143–1152, Vancouver, Canada, May, 2018.
Using activity patterns to place electric vehicle charging stations in urban regions [link]Paper  abstract   bibtex   
There is growing interest in the adoption of electric vehicles (EVs) in urban regions. However, because of the limited battery range, the EV charging station infrastructure needs to be significantly expanded. We introduce EVChargingStation, the problem of optimizing charging stations so that each EV can be charged at a location within a certain service distance. Our formulation explicitly incorporates urban activity patterns, and considers multiple types of charging stations. We show that EVChargingStation is NP-hard, in general, and present approximation algorithms with provable performance guarantees. We evaluate one of our algorithms using a detailed urban activity model for the city of Portland, OR. Our results show a tradeoff between the number of charging stations and the maximum service distance, thus providing a systematic methodology for urban planners to evaluate policies for increasing EV deployment. We also show that considering such activity patterns is necessary, in the sense that deploying charging stations at "high traffic" locations can lead to significantly worse solutions.
@inproceedings{pal_using_2018,
	address = {Vancouver, Canada},
	title = {Using activity patterns to place electric vehicle charging stations in urban regions},
	url = {https://ieeexplore.ieee.org/abstract/document/8425543},
	abstract = {There is growing interest in the adoption of electric vehicles (EVs) in urban regions. However, because of the limited battery range, the EV charging station infrastructure needs to be significantly expanded. We introduce EVChargingStation, the problem of optimizing charging stations so that each EV can be charged at a location within a certain service distance. Our formulation explicitly incorporates urban activity patterns, and considers multiple types of charging stations. We show that EVChargingStation is NP-hard, in general, and present approximation algorithms with provable performance guarantees. We evaluate one of our algorithms using a detailed urban activity model for the city of Portland, OR. Our results show a tradeoff between the number of charging stations and the maximum service distance, thus providing a systematic methodology for urban planners to evaluate policies for increasing EV deployment. We also show that considering such activity patterns is necessary, in the sense that deploying charging stations at "high traffic" locations can lead to significantly worse solutions.},
	booktitle = {IEEE Workshop Parallel Distributed Processing Computational Social Systems (IPDPS)},
	author = {Pal, Anamitra and Rangudu, Pavan and Ravi, S. S. and Vullikanti, Anil K.},
	month = may,
	year = {2018},
	keywords = {approximation algorithms, Approximation algorithms, Batteries, charging stations, Charging stations, Electric vehicle charging, electric vehicles, Systematics, urban activity patterns, Urban areas},
	pages = {1143--1152},
}

Downloads: 0