Latest revision as of 12:49, 16 February 2021

Abstract

  In this study we develop an exact solution method to optimize the location and capacity of charging stations to satisfy the fast charging needs of electric vehicles in urban areas. Stochastic recharge demands, capacity limitations of charging stations and drivers’ route preferences (deviation tolerances) are simultaneously considered to address this challenging problem faced by recharging infrastructure planners or investors. Taking a scenario based approach to model demand uncertainty, we first propose a compact two stage stochastic programming formulation. We then project out the second stage decision variables from the compact formulation by describing the extreme rays of its polyhedral cone and obtain (1) a cut formulation that enables an efficient branch and cut algorithm to solve large problem instances (2) a novel characterization for feasible solutions to the capacitated covering problems. We test our algorithm on the Chicago metropolitan area network, by considering real world origin-destination trip data to model charging demands. Our results attest the efficiency of the proposed branch and cut algorithm and provide significant managerial insights.

Original document

The different versions of the original document can be found in:

• http://dx.doi.org/10.1016/j.trb.2018.11.001

• http://hdl.handle.net/20.500.11851/3810

• https://api.elsevier.com/content/article/PII:S0191261517311402?httpAccept=text/xml,

https://api.elsevier.com/content/article/PII:S0191261517311402?httpAccept=text/plain,

http://dx.doi.org/10.1016/j.trb.2018.11.001 under the license https://www.elsevier.com/tdm/userlicense/1.0/

• https://www.sciencedirect.com/science/article/pii/S0191261517311402,

https://ideas.repec.org/a/eee/transb/v119y2019icp22-44.html,

https://academic.microsoft.com/#/detail/2901464792