In Bell M.G.H. (1995. Transportation Research B 29, 287-295), a new logit assignment formulation was developed, which considered all possible paths in the network while still retaining the absence of a need for path enumeration. In his formulation, it presumes that the sum of a geometric series...

The concept of reserve capacity has been used extensively for performance measure and timing design of individual signal-controlled intersections. In this paper, we extend this concept to a general signalcontrolled road network under time-stationary conditions. The whole capacity of a road...

Environmental sustainability is closely related to transportation, especially to the road network, because vehicle emissions and noise damage the environment and have adverse effects on human health. It is, therefore, important to take their effect into account when designing and managing road...

Consider a general, heterogeneous geographical space with a set of competitive facilities, where the customers' demand locations from each of the facilities are continuously dispersed over the area. The total demand generated from a particular location in the space is fixed, but the demands from...

In this paper we propose a model and algorithm for solving the equilibrium assignment problem in a congested, dynamic and schedule-based transit network. We assume that the time varying origin-destination trip demand is given. All travelers have full predictive information (that have been gained...

This paper presents a path-based traffic assignment formulation and its solution algorithm for solving an asymmetric traffic assignment problem based on the TRANSYT traffic model, a well-known procedure to determine the queues and delays in a signal-controlled network with explicit...

In this paper, a predictive dynamic traffic assignment model in congested capacity-constrained road networks is formulated. A traffic simulator is developed to incrementally load the traffic demand onto the network, and updates the traffic conditions dynamically. A time-dependent shortest path...

Consider a city with several highly compact central business districts (CBD), and the commuters' destinations from each of them are dispersed over the whole city. Since at a particular location inside the city the traffic movements from different CBDs share the same space and do not cancel out...