Electric Vehicle Tour Planning Considering Range Anxiety

Abstract

In this study, the tour planning problem for electric vehicles is investigated. We aim to derive the optimal route and thus, to maximize profitability and minimize range anxiety within the time horizon. To solve this problem, a bi-objective mixed integer model is proposed. Specifically, we first introduced the reliability of route planning and quantified it as a cost with specific functions. The nonlinear model was then converted into a bi-objective mixed integer linear program, and an interactive branch and bound algorithm was adopted. Numerical experiments conducted on different networks have shown that the model that considers range anxiety offers more effective solutions. This means that our model is able to plan the routes with high reliability and low risk of profit loss and accidents.