Optimization of the electric vehicle charging strategy problem for sustainable intercity travels with multiple refueling stops

Abstract

Electric vehicle (EV) drivers considering long-distance trips still face range anxiety due to the limited range of EVs and the scarcity of charging stations. Thus, it becomes important to ensure the feasibility of the selected route and determine an optimal charging strategy. As a crucial aspect of decision support for EV drivers, this study proposes a mixed integer linear programming (MILP) approach for the EV charging strategy problem (EVCSP), incorporating a piecewise linear approximation technique to address the challenges posed by nonlinear charging times. The proposed optimization model, namely CSPM determines where, when, and how much to charge an EV for a specified route to minimize travel time and cost. The solution time of large-scale test problems and a case study on Türkiye reveal the robustness and reliability of the CSPM. Furthermore, two multi-objective optimization methods (the weighted sum and the lexicographic method) are applied to the case study, and the results are analyzed. The results indicate that the travel cost is more sensitive to the selected charging strategy, with a range of 46.09 % across the applied charging strategies, whereas travel time remains more resilient, with a maximum fluctuation of 19.77 %. A comparative analysis with a full charging strategy reveals that the CSPM reduces the travel time by 60.1 % and improves the cost efficiency by 105.72 %.