Stochastic traffic assignment of mixed electric vehicle and gasoline vehicle flow with path distance constraints

Abstract

This paper addresses a general stochastic user equilibrium (SUE) traffic assignment problem (TAP) for transport networks with electric vehicles (EV), where EV paths are restricted by the EV driving range limits. A minimization model for path-constrained SUE is first proposed as an extension of path-constrained deterministic user equilibrium (DUE) TAP, which also extends the existing general SUE models with link-based constraints to path-based constraints. The resulting SUE model and solution algorithm can be used for other conditions with similar path-based constraints. The equilibrium conditions reveal that any path cost in the network is the sum of corresponding link costs and a path specific out-of-range penalty term, while path out-of-range term should equal to zero to ensure feasible flows. We develop a modified method of successive averages (MSA) with a predetermined step size sequence where both multinomial logit and multinomial probit based loading procedure are applied to solve the TAP. The suggested methods incorporate K-shortest paths algorithm to generate the path set on a need basis. Finally, two numerical examples are presented to verify the proposed model and solution algorithms.