Abstract
This study addresses the location problem of electric vehicle charging stations considering drivers’ range anxiety and path deviation. The problem is to determine the optimal locations of EV charging stations in a network under a limited budget that minimize the accumulated range anxiety of concerned travelers over the entire trips. A compact mixed-integer nonlinear programming model is first developed for the problem without resorting to the path and detailed charging pattern pre-generation. After examining the convexity of the model, we propose an efficient outer-approximation method to obtain the ε-optimal solution to the model. The model is then extended to incorporate the charging impedance, e.g., the charging time and cost. Numerical experiments in a 25-node benchmark network and a real-life Texas highway network demonstrate the efficacy of the proposed models and solution method and analyze the impact of the battery capacity, path deviation tolerance, budget and the subset of OD pairs on the optimal solution and the performance of the system.
Original language | English |
---|---|
Pages (from-to) | 164-188 |
Number of pages | 25 |
Journal | Transportation Research Part C: Emerging Technologies |
Volume | 114 |
DOIs | |
Publication status | Published - May 2020 |
Keywords
- Compact formulation
- EV charging station location
- Outer-approximation algorithm
- Path deviation
- Range anxiety
ASJC Scopus subject areas
- Civil and Structural Engineering
- Automotive Engineering
- Transportation
- Computer Science Applications