Growing the charging station network for electric vehicles with trajectory data analytics

Electric vehicles (EVs) have undergone an explosive increase over recent years, due to the unparalleled advantages over gasoline cars in green transportation and cost efficiency. Such a drastic increase drives a growing need for widely deployed publicly accessible charging stations. Thus, how to strategically deploy the charging stations and charging points becomes an emerging and challenging question to urban planners and electric utility companies. In this paper, by analyzing a large scale electric taxi trajectory data, we make the first attempt to investigate this problem. We develop an optimal charging station deployment (OCSD) framework that takes the historical EV taxi trajectory data, road map data, and existing charging station information as input, and performs optimal charging station placement (OCSP) and optimal charging point assignment (OCPA). The OCSP and OCPA optimization components are designed to minimize the average time to the nearest charging station, and the average waiting time for an available charging point, respectively. To evaluate the performance of our OCSD framework, we conduct experiments on one-month real EV taxi trajectory data. The evaluation results demonstrate that our OCSD framework can achieve a 26%-94% reduction rate on average time to find a charging station, and up to two orders of magnitude reduction on waiting time before charging, over baseline methods. Moreover, our results reveal interesting insights in answering the question: “Super or small stations?”: When the number of deployable charging points is sufficiently large, more small stations are preferred; and when there are relatively few charging points to deploy, super stations is a wiser choice.

[1]  John N. Hooker,et al.  Finite Dominating Sets for Network Location Problems , 1991, Oper. Res..

[2]  Jing Yuan,et al.  On Discovery of Traveling Companions from Streaming Trajectories , 2012, 2012 IEEE 28th International Conference on Data Engineering.

[3]  Fei Wang,et al.  OceanST: A Distributed Analytic System for Large-Scale Spatiotemporal Mobile Broadband Data , 2014, Proc. VLDB Endow..

[4]  Sudipto Guha,et al.  A constant-factor approximation algorithm for the k-median problem (extended abstract) , 1999, STOC '99.

[5]  Xing Xie,et al.  Sensing the pulse of urban refueling behavior , 2013, UbiComp.

[6]  Vijay V. Vazirani,et al.  Primal-dual approximation algorithms for metric facility location and k-median problems , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[7]  Adam Meyerson,et al.  A k-Median Algorithm with Running Time Independent of Data Size , 2004, Machine Learning.

[8]  Fabián A. Chudak,et al.  Improved Approximation Algorithms for the Uncapacitated Facility Location Problem , 2003, SIAM J. Comput..

[9]  Jeffrey Scott Vitter,et al.  Approximation Algorithms for Geometric Median Problems , 1992, Inf. Process. Lett..

[10]  Xing Xie,et al.  Discovering regions of different functions in a city using human mobility and POIs , 2012, KDD.

[11]  Zhi-Li Zhang,et al.  The Routing Continuum from Shortest-Path to All-Path: A Unifying Theory , 2011, 2011 31st International Conference on Distributed Computing Systems.

[12]  S. Simić,et al.  Means and Their Inequalities , 1988 .

[13]  Éva Tardos,et al.  Approximation algorithms for facility location problems (extended abstract) , 1997, STOC '97.

[14]  Samir Khuller,et al.  Greedy strikes back: improved facility location algorithms , 1998, SODA '98.

[15]  Ignacio E. Grossmann,et al.  An outer-approximation algorithm for a class of mixed-integer nonlinear programs , 1987, Math. Program..

[16]  Yanchi Liu,et al.  Diagnosing New York city's noises with ubiquitous data , 2014, UbiComp.

[17]  Jiawei Zhang,et al.  Approximation algorithms for facility location problems , 2004 .

[18]  Liz Sonenberg Online Mechanism Design for Electric Vehicle Charging , 2011 .

[19]  Adrienne W. Kemp,et al.  Means and Their Inequalities. , 1989 .

[20]  Richard L. Church,et al.  The maximal covering location problem , 1974 .

[21]  Victor C. S. Lee,et al.  Exploring cell tower data dumps for supervised learning-based point-of-interest prediction , 2014, SIGSPATIAL/GIS.

[22]  Oded Berman,et al.  Optimal Location of Discretionary Service Facilities , 1992, Transp. Sci..

[23]  Sanjay Chawla,et al.  Inferring the Root Cause in Road Traffic Anomalies , 2012, 2012 IEEE 12th International Conference on Data Mining.

[24]  A. Land,et al.  An Automatic Method for Solving Discrete Programming Problems , 1960, 50 Years of Integer Programming.

[25]  Nicholas Jing Yuan,et al.  On discovery of gathering patterns from trajectories , 2013, 2013 IEEE 29th International Conference on Data Engineering (ICDE).

[26]  Zhenhong Lin,et al.  The fuel-travel-back approach to hydrogen station siting , 2008 .

[27]  Thomas L. Saaty,et al.  Elements of queueing theory , 1961 .

[28]  Ting Zhu,et al.  Region sampling and estimation of geosocial data with dynamic range calibration , 2014, 2014 IEEE 30th International Conference on Data Engineering.

[29]  Daniel Sperling,et al.  Using Geographic Information Systems to Evaluate Siting and Networks of Hydrogen Stations , 2004 .

[30]  Catherine Rosenberg,et al.  Distributed control of electric vehicle charging , 2013, e-Energy '13.

[31]  Ignacio E. Grossmann,et al.  An outer-approximation algorithm for a class of mixed-integer nonlinear programs , 1986, Math. Program..

[32]  S. L. Hakimi,et al.  Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph , 1964 .

[33]  Yu Zheng,et al.  U-Air: when urban air quality inference meets big data , 2013, KDD.

[34]  Licia Capra,et al.  Urban Computing: Concepts, Methodologies, and Applications , 2014, TIST.

[35]  S. N. Dorogovtsev,et al.  Giant strongly connected component of directed networks. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[36]  Mung Chiang,et al.  Cooperative content distribution and traffic engineering in an ISP network , 2009, SIGMETRICS '09.

[37]  François Baccelli,et al.  Elements Of Queueing Theory , 1994 .

[38]  Suresh K. Nair,et al.  Infrastructure development for conversion to environmentally friendly fuel , 2002, Eur. J. Oper. Res..

[39]  Zhi-Li Zhang,et al.  From Shortest-Path to All-Path: The Routing Continuum Theory and Its Applications , 2014, IEEE Transactions on Parallel and Distributed Systems.

[40]  Siyuan Liu,et al.  Towards mobility-based clustering , 2010, KDD.

[41]  Nikolaos V. Sahinidis,et al.  A polyhedral branch-and-cut approach to global optimization , 2005, Math. Program..

[42]  J. Clausen,et al.  Branch and Bound Algorithms-Principles and Examples , 2003 .