Junction interactions and monotonicity in traffic assignment

We consider the traffic equilibrium problem when the travel demand is inelastic and stationary in time. Junction interactions, which abound in urban road networks, are permitted. We prove that the set of equilibria (solutions to the assignment problem) is convex when certain monotonicity and continuity conditions are statisfied at each junction.     

TRAMS: Transit route animation and modelling by simulation

Public transport managers and operators face increasingly difficult problems in providing adequate levels of service at reasonable social and financial costs. A greater demand exists for analytical techniques which allow them to evaluate changes in operational strategies before committing themselves to implementation in the field. This paper describes the development of a discrete event simulation model for the analysis of on-street transit routes. The structure of the model is described and details are provided of the types of events which are explicitly modelled in the TRAMS package. The input requirements are described, and the modular nature of the simulation model is highlighted. The various options for output format are described, including the use of a computer graphics real-time animation option. The range of output performance measures are then discussed, and some comments on areas of application conclude the paper.     

Information needs of the continuing urban transportation planning process

Urban transportation is identified as a functional element in the broader context of urban facilities and services. From this point of view, the relative merits of separate information systems for transportation planning and general urban planning, as contrasted to unified systems for all urban management functions, are discussed. The overriding need to make the most effective use of urban resources argues strongly for the unification of urban information systems to the greatest possible extent consistent with the special data requirements of various functional programs. The need to identify and correlate data items for very small areal units and to keep current records of the constantly shifting patterns of social and economic activities in urban areas present difficult, but not insurmountable technical problems. However, the most serious barrier to the development and implementation of comprehensive urban information systems is concluded to be institutional, rather than technical, in nature.     

The impact of job assignment rules for straddle carriers on the throughput of container terminals

Straddle carriers represent a critical resource in the handling of containers within a container terminal. It is essential that they are deployed in an as efficient manner as possible. The research presented in this paper is motivated by the need to critically evaluate job assignment rules for straddle carriers that operate in a multiple straddle environment. This is achieved by developing a discrete event simulation model using industrial simulation software to model a container terminal located in Melbourne, Australia. The model accounts for variables such as the number of straddle carriers needed, the speed of straddle carriers, the arrival rate of trucks, and the job assignment rule. A principal finding of the study is that increasing the number of straddles in the present set‐up from 6 to 7 has a negligible effect on daily throughput. However, an increase in the number of straddles to 7 is expected to have a profound effect on reducing the average waiting time of trucks within the terminal from over 16 minutes to under 9 minutes, a decrease of 46.5%. However, a further increase in the number of straddles results in no further increase in daily throughput. It was observed that the throughput of the terminal is very sensitive to the speeds at which straddles travel. The management of the terminal has proposed a new heuristic job assignment rule for straddles, because the present rule does not assign the jobs to straddles closest to the truck requesting to load or unload a container. As a result a new heuristic job assignment rule was tested. The simulation results revealed that both the old and new rules performed equally well using performance indicators such as average container flow time, daily throughput, average waiting time of jobs, number of jobs in the queue, and straddle utilisation. Therefore, the new rule will not improve these performance measures if implemented     

Taxicab operating characteristics in the United States

In 1982, a national survey of U.S. taxicab operators was conducted. This survey sought to assess the economic, operational and organizational status of the industry and to determine how these characteristics have been changing in response to rising costs and an economic recession. Two results of this survey are reported in this paper; the size structure and the organization of the industry. Both of these characteristics show that it has recently been undergoing two fundamental changes. These are the rapid switch away from employees as drivers to independent contractor drivers and decreasing average company size.     

Simplifications for single-route transit-ridership forecasting models

The growth in popularity of microcomputers has reemphasized the need for simplified transit-planning techniques. This paper describes and evaluates a single-route ridership forecasting model which is designed to fit within a modest-sized microcomputer. The model is based upon the traditional four-step urban transportation modeling process, but it is simplified by removing the possibility of multiple transfers and by eliminating the highway network. An analysis of model error shows that these simplifications do not appreciably affect the accuracy of the forecasts. A particular advantage of implementing the model on a microcomputer is the user-friendliness that can be achieved by employing interactive color graphics for data input.     

Latent structure in road systems

The application of Q-analysis to road transport systems is introduced in this paper, but no prior knowledge of the methodology is assumed. It is argued that the route-link relation of transport systems has a connectivity structure overlooked by conventional transportation theory, and that this structure constrains traffic flow. This is illustrated at the micro-level by a complicated road intersection, and at the macro-level with a simple analysis of a town. The representation of road systems is discussed in this context, and it leads to a new result called the Link Face Theorem. It is suggested that the conventional theory can be usefully extended by studying the latent structure of road systems which is presently overlooked.     

A computer model for finding the time-dependent minimum path in a transit system with fixed schedules

This paper describes the development of a computer model and algorithms for finding the time-dependent minimum path between two stations in a multi-route, multi-mode transit system running to fixed schedules. Selection of the minimum path can be based either on journey time or on weighted time. A worked example using a simple transit network is given to illustrate how the model works. The model has several applications in transport planning: it can be used for generating route schedule information to guide transit users, for assisting in route schedule coordination, and for analyzing transit system accessibility.     

The dynamics of traffic assignment and traffic control: A theoretical study

The paper considers traffic assignment, with traffic controls, in an increasingly dynamic way. First, a natural way of introducing the responsive policy, P_o, into steady state traffic assignment is presented. Then it is shown that natural stability results follow within a dynamical version of this static equilibrium model (still with a constant demand). We are able to obtain similar stability results when queues are explicitly allowed for, provided demand is constant. Finally we allow demand to vary with time; we consider the dynamic assignment problem with signal-settings now fixed. Here we assume that vehicles are very short and that deterministic queueing theory applies, and show that the time-dependent queueing delay at the bottleneck at the end of a link is a monotone function of the time-dependent input profile to the bottleneck. We have been unable to obtain results when dynamic demand and responsive signal control are combined.