Location of Electric Vehicle Charging Stations Under Uncertainty on the Driving Range
We study the problem of locating electric vehicle (EV) charging stations on road networks. We consider that the driving range, i.e. the maximum distance that a fully charged EV can travel before its battery runs empty, is subject to uncertainty and seek to maximize the expected coverage of the recharging demand. We first propose a new mixed-integer linear programming formulation for this stochastic optimization problem and compare it with a previously published one. We then develop a tabu search heuristic procedure to solve large-size instances of the problem. Our numerical experiments show that the new formulation leads to a better performance than the existing one and that the tabu search heuristic provides good quality solutions within short computation times.