Locating new passenger facilities on a transportation network

This paper examines the problem of locating additional passenger facilities on a transportation network to supplement ones that already exist. A distinction is made between “supporting” facilities which operate only in concert with already existing ones and “new” facilities which are self-sufficient and operate independently. It is shown that, when the objective is to maximize the utility of travel times to all users, at least one set of optimal locations for the new facilities exist on the nodes of the network if the utility function for travel times is convex. This result is proven under very general conditions including the assumption of a probabilistic transportation network, i.e. a network where travel times on network branches are random variables. A straightforward algorithm for solving a specific simple case is also provided and the results are illustrated by examples.     

Evaluating the assumption of independent turning probabilities

Several urban traffic models make the convenient assumption that turning probabilities are independent, meaning that the probability of turning right (or left or going straight through) at the downstream intersection is the same for all travelers on that roadway, regardless of their origin or destination. In reality most travelers make turns according to planned routes from origins to destinations. The research reported here identifies and quantifies the deviations that result from this assumption of independent turning probabilities.An analysis of this type requires a set of reasonably realistic “original” route flows, which were obtained by a static user-equilibrium traffic assignment and an entropy maximization condition for most likely route flows. These flows are compared with those route flows resulting from the Assumption of Independent Turning Probabilities (ITP). A small subnetwork of 3 km by 5 km in Tucson, Arizona, was chosen as a case study. An overall “typical ratio” of 2.2 between original route flows and ITP route flows was obtained. Aggregating route flows to origin–destination flows led to an overall “typical ratio” of 1.7. Such deviations are particularly high for routes that go back-and-forth, reaching a ratio of more than 3 in certain time periods. Substantial deviations for origins and destinations that are on the same border of the subnetwork are also observed in the analyses. In addition, under the ITP assumption, morning rush hour traffic peaking is the same in all directions, while in the original flows some directions do not exhibit a peak in the morning rush hour period. Overall, the conclusion of the paper is that the assumption of independent turning probabilities leads to substantial deviations both at the route level and at the origin–destination level, even for such a small network of the case study. These deviations are particularly detrimental when a network is being modeled and studied for route-based measures of effectiveness such as the number and types of routes passing a point – for monitoring specified vehicles and/or managing detouring strategies.     

A real-time traffic signal control system: architecture, algorithms, and analysis

The paper discusses a real-time traffic-adaptive signal control system referred to as RHODES. The system takes as input detector data for real-time measurement of traffic flow, and “optimally” controls the flow through the network. The system utilizes a control architecture that (1) decomposes the traffic control problem into several subproblems that are interconnected in an hierarchical fashion, (2) predicts traffic flows at appropriate resolution levels (individual vehicles and platoons) to enable pro-active control, (3) allows various optimization modules for solving the hierarchical subproblems, and (4) utilizes a data structure and computer/communication approaches that allow for fast solution of the subproblems, so that each decision can be downloaded in the field appropriately within the given rolling time horizon of the corresponding subproblem. The RHODES architecture, algorithms, and its analysis are presented. Laboratory test results, based on implementation of RHODES on simulation models of actual scenarios, illustrate the effectiveness of the system.