Network equilibrium of electric vehicles with stochastic range anxiety

摘要: This paper discusses a new traffic assignment problem with stochastic distance constraints, as an emerging modeling tool for describing networks that serve plug-in electric vehicles limited driving ranges. The range of is subject to onboard battery capacities and electricity consumption states well network-wide battery-recharging opportunities, which inevitably raise the so-called “range anxiety” concern in population. In addition varying rates, variation limits perceived by individual drivers also reflection their heterogeneous perception errors risk-taking behaviors depletion. presents convex programming model finite number constraints characterizing proposed problem, based on introduction path flow variable called cumulative rate. A linear approximation algorithm was further developed, encapsulating efficient k-shortest search procedure perform network loading. Numerical results obtained from conducting quantitative analyses example clearly illustrate applicability solution methods reveal mechanism impacting equilibrium.