Routing and charging locations for electric vehicles for intercity trips

This study addresses two problems in the context of battery electric vehicles (EVs) for intercity trips: the EV routing problem and the EV optimal charging station location problem (CSLP). The paper shows that EV routing on the shortest path subject to range feasibility for one origin–destination (O–D) pair, called the shortest walk problem (SWP), as well as a stronger version of the problem – the p-stop limited SWP – can be reduced to solving the shortest path problem on an auxiliary network. The paper then addresses optimal CSLPs in which EVs are range feasible with and without p-stops. We formulate the models as mixed-integer multi-commodity flow problems on the same auxiliary network without path and relay pattern enumeration. Benders decomposition is used to propose an exact solution approach. Numerical experiments are conducted using the Indiana state network.