No 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.

This study researches the dynamical location optimization problem of a mobile charging station (MCS) powered by a LiFePO 4 battery to meet charging demand of electric vehicles (EVs). In city suburbs, a large public charging tower is deployed to provide recharging services for MCS. The EV’s driver can reserve a real-time off-street charging service on the MCS through a vehicular communication network. This study formulates a multi-period nonlinear flow-refueling location model (MNFRLM) to optimize the location of the MCS based on a network designed by Nguyen and Dupuis (1984). The study transforms the MNFRLM model into a linear integer programming model using a linearization algorithm, and obtains global solution via the NEOS cloud CPLEX solver. Numerical experiments are presented to demonstrate the model and its solution algorithm.