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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Transportation Research Part C: Emerging Technologies
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.