Search

In a recent paper a traffic assignment model has been constructed in which the cost on a link may depend not only on its load, but also on the loads on other links of the network. In this paper it is shown that this model is also capable of handling the case of several classes of users in the same transportation network each of which has an individual cost function and, at the same time, contributes to its own and other classes' cost functions in an individual way. Typical applications arise not only in street networks where vehicles of different types share the same roads (e.g., trucks and passenger cars) but also in other types of transportation networks (e.g., telephone networks). An algorithm is constructed for finding the system-optimizing flow pattern for such a multiclass-user transportation network. [ABSTRACT FROM AUTHOR]

This paper develops an analytic model of the mean running time for trains on a single track railway. Trains operating at several different speeds in each direction are permitted. Priority systems are included in the model to control train behavior when meets and overtakes occur and delay times due to implementing these priority schemes are calculated. It is assumed that the departing times for trains are independent random variables that are uniformly distributed over the time period of interest. The resulting mean running times, including delays, for each speed class in each direction are found by solving a set of linear equations. [ABSTRACT FROM AUTHOR]

The general problem is that of locating a central facility in a network so as to minimize the sum of its distances from the sources of flow to it, each distance being appropriately weighted to reflect the associated flow volume and/or cost. In this paper, simple one-pass solution algorithms are given for two classes of topologically simple networks, namely those which are either acyclic or contain exactly one cycle. The first algorithm is based on a reduction procedure that may also yield useful simplification of problems involving general networks. [ABSTRACT FROM AUTHOR]

Alternative methods of analysing gap acceptance data are considered with a view to removing the bias implicit in the situation in which minor road vehicle drivers exhibit consistent behavior and all accepted and rejected gaps are taken into account. Simulation techniques are used to show that some of these suggested methods are invalid, but verification is obtained for a method derived by the author in an earlier paper that simply requires the displacement of the gap acceptance curve time scale by an amount equal to the product of the variance of the observed gap acceptance distribution (sec²) and the major road volume (veh/sec). This, it is contended, is easier to apply than an alternative method of estimating the critical gap distribution parameters given by MCNEIL AND MORGAN. A theoretical relation is determined between the mean of the critical gap distribution and the Raff critical lag that shows the two to be equal only when the gap acceptance curve takes the form of a step function. [ABSTRACT FROM AUTHOR]

Before we can construct models for multilane traffic flow, we must be able to describe single-lane traffic. This paper considers some of these methods of description including the use of headway and counting distributions. Another method of describing point processes is by means of product densities. These are essentially joint probabilities of two or more vehicles passing a point at different specified times. Product densities have been used in many fields including particle physics, ecology, and road traffic. The idea of using product densities is simple and attractive, but they do have two major disadvantages: (i) except in simple cases, headway distributions are very difficult to derive from product densities, and (ii) product density estimates for different time lags are cor- related, so that tests of hypotheses are not easy to perform. An alternative to product densities is proposed. For want of a better name these are called termination rates. The termination rate after lag τ is the probability of a vehicle passing a point in a small interval of time, divided by the length of the small interval and conditional upon the last vehicle having passed a time τ previously. These are very similar to mortality rates for humans or scrap page rates for commodities with limited life-times. The interrelations between these statistics are quoted but not derived. Various sets of data are used to illustrate the less common statistics. Some analysis is given of a sample of data from the Congress (now Eisenhower) Expressway in Chicago. Variance to mean ratios are used to show that there is a strong correlation between lanes even though the autocorrelations of headways within lanes are very small. Bivariate termination rates have been estimated for each lane. Given a vehicle in one lane, it was found that the expected number of vehicles in a neighboring lane within 2 or 3 sec was enhanced by about 10-15 percent. [ABSTRACT FROM AUTHOR]

Investigations of motorist delays at the intersection of a major and minor road have involved variations of one or the other of two merging strategies: (i) MILLER'S[8] model that assumes that a minor-road motorist makes consecutive decisions consistently, and (ii) that of WEISS AND MARADUDIN[7] that assumptions that a different, independent decision is made for each headway. In this paper we show that results for both models may be obtained easily, using the results of queuing theory, if certain reasonable assumptions are made. Simple expressions for the Laplace-Stieltjes transforms and means of the delays are derived in the case of independent major-road headways with a common, general distribution. For exponential headways, a numerical study shows the mean Miller delay to increase with the variation in the merge times, while the mean Weiss-Maradudin delay decreases. To illustrate the application of the expressions obtained, we investigate the reduction in the delay achieved by inserting a traffic island between two streams of major-road traffic. [ABSTRACT FROM AUTHOR]