Abstract
A two-stage stochastic programming model is established to minimize EV's expected total journey time under stochastic traffic conditions, by jointly optimizing the allocation of chargers and the distribution of EV flows. Based on sample average approximation, a feasible deterministic equivalent of the original stochastic problem is obtained. Then, a hybrid solution method, composing of a Tabu-based search and sequential quadratic programming (SQP), is proposed. The Tabu heuristic manages the charger allocation problem, where each solution candidate undergoes a second-stage EV flow optimization. SQP is applied to optimally distribute the EV flows, which is proved to be a convex problem. Extensive simulations are carried out using the eastern Massachusetts highway network. Results show that the proposed algorithm outperforms existing approaches by finding high-quality charger allocation and optimal flow distribution policies under different traffic conditions. Additionally, the two-stage model designates charging resource sufficiency by statistically estimating a lower bound for the number of chargers to allocate, which in practice helps to prevent over-investment on charging resources.
Accepted Version (
Free)
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call