Battery Electric Vehicles Network Equilibrium With Flow-Dependent Energy Consumption

Recent studies show that energy consumption of battery electric vehicles (BEVs) increases in traffic congestion. Therefore, it is important to consider the effect of link flow on BEV energy consumption. The flow-dependent energy consumption changes the route choice and user equilibrium conditions. In this paper, some shortcomings of available BEV flow-dependent energy consumption user equilibrium models are shown first. Then, “sufficient” as well as “sufficient and necessary” user equilibrium based on the generalized travel time of each path and sub-path penalties are defined and modeled for flow-dependent energy consumption. While it is difficult to solve the sufficient and necessary model, the sufficient model can be solved directly with commercial solvers for small to medium-sized networks by generating all paths. An iterative algorithm is also presented to generate paths as required to solve the problem for larger networks. Numerical examples demonstrate the model and proposed algorithm, and analyze the impact of flow-dependent energy consumption on equilibrium conditions

The multi-modal traffic assignment problem.

Thesis. 1979. Ph.D.--Massachusetts Institute of Technology. Alfred P. Sloan School of Management.MICROFICHE COPY AVAILABLE IN ARCHIVES AND DEWEY.Bibliography: leaves 141-150.Ph.D

A splitting rate model of traffic re-routeing and traffic control

Non peer reviewedPublisher PD

APPLICATION OF DWELL TIME FUNCTIONS IN TRANSIT ASSIGNMENT MODEL

The transit assignment process applied as part of the development of the Tehran transportation model is described. The process includes development of various models for dwell time as a function of transit volume. Dwell time is the time a transit vehicle spends at a stop to allow passengers to alight and board. This method was implemented by using EMME/2 transportation planning software. The calculation of dwell time is necessary in modeling transit assignment because an accurate estimation of dwell time will lead to more precise transit assignment results. The area analyzed in the model comprises various transportation analysis zones in the city of Tehran. The model output was shown to be statistically significant. Calculations were found to be valid when compared with observed data

Algorithm for Equilibrium Transit Assignment Problem

Transit assignment is an important problem in the literature of transportation. Almost all competitive algorithms in this area are strategy based. For uncongested transit networks, the problem may be formulated into an optimization problem for which good solution algorithms exist. A variational inequality formulation of the problem with several solution methods is also presented in the literature for congested networks. This paper is devoted to solving a transit assignment problem based on complementarity formulation using path flows. The solution algorithm exploits the three concepts of decomposition, path generation, and linearization. The procedure has been applied on a large-scale real-case transit network under fixed travel times as well as flow-dependent dwell times. Computational experiments show rapid convergence of the algorithm. Moreover, for the limited experiments performed, the computational time for the flow-dependent problem is only about twice that of the case for the fixed travel times, without an appreciable excess memory requirement