Showing papers on "Traffic wave published in 1969"

Simulation of traffic flows in a network

Abstract: A computer simulation program which deals with traffic flows in the network of a large area is described. Each road is segmented into blocks of several ten-meter lengths and is represented by a bidirectional list in computer memory. The movement of cars, i.e. the transfer of cars from one block to the next, is expressed by a proper formula. This formula is based on the supposition that the speed of cars in a block is determined only by the density of cars in the block, and this speed-versus-density curve is empirically given the numerical values.This simulation scheme has its excellent point in that it makes it possible to trace the dynamic behavior of traffic flows in a variety of situations, some examples of which are given for an actual area of the city of Kyoto, Japan.

Stochastic models in traffic flow theory: intersection control

Abstract: A NEW MODEL OF A VEHICLE-ACTUATED TRAFFIC SIGNAL IS INTRODUCED THIS MODEL IS A NATURAL GENERALIZATION OF THE FIXED-CYCLE TRAFFIC SINGAL AND CAN BE ANALYZED UNDER CERTAIN DEPENDENT INPUT CONDITIONS THE FIRST MODEL APPLIES TO THE INTERSECTION OF 2 ONE-WAY, ONE-LANE STREETS THE TIME-DEPENDENT AND ASYMPTOTIC BEHAVIOR OF THE TRAFFIC SIGNAL AND THE TRAFFIC QUEUES IS DETERMINED BY USING RESULTS FROM THE THEORY OF STORAGE EXACT DISTRIBUTIONS OF GREEN TIMES AND THEIR MOMENTS ARE DETERMINED CONDITIONS FOR ASYMPTOTIC STABILITY ARE GIVEN, AND WHEN THESE CONDITIONS ARE SATISFIED THE STEADY-STATE QUEUE SIZES ARE DETERMINED EXPECTED TOTAL DELAY PER CYCLE IS USED AS A CRITERION OF OPTIMALITY, AND THE OPTIMAL SIGNAL SETTINGS ARE GIVEN IN CERTAIN SPECIAL CASES THE MODEL IS GENERALIZED TO INCLUDE MORE COMPLICATED INTERSECTIONS, SUCH AS THE INTERSECTION OF K=2 ONE-WAY, ONE-LANE STREETS, A FOUR-WAY INTERSECTION WITH NO LEFT-TURNING VEHICLES, AND A FOUR-WAY INTERSECTION WITH A SEPARATE CYCLE PHASE FOR LEFT-TURNING VEHICLES TWO TYPES OF DEPENDENT INPUT PROCESSES ARE CONSIDERED-MARKOV CHAINS AND MARTINGALES MANY OF THE PRECEDING RESULTS CARRY OVER TO THESE TYPES OF INPUT PROCESSES /AUTHOR/

Some Aspects of a Switching Policy for Commuter Flow

Abstract: A wide range of signal switching policies may be adopted for control of traffic flow between a pair of intersections. One of the most important traffic situations is that in which rush-hour commuter traffic travels towards or away from a city center along radial roads. Under these circumstances opposing and tangential flow may be light. Earlier papers have shown that a modified form of the Dunne-Potts switching policy might be applied to pairs of intersections carrying commuter flow. Efficient and flexible operation of the system under a wide variety of flow conditions, and with the minimum of computer surveillance, was demonstrated. The present paper reports the results of further simulation experiments and discussed tentative solutions of some of the practical problems associated with the proposed scheme.