TRAFFIC ANALYSIS

TECHNIQUES
&
TRAFFIC FLOW

TEAM E : QUADRO ALTRAFLOW

Lowel ~ Kate ~ Jeryl ~ Jhonny

TRAFFIC ANALYSIS
TECHNIQUES
01

01 Space-Time Relationship

02 Queuing Analysis

03 Network Analysis
TRAFFIC ANALYSIS TECHNIQUES

- are a set of methodologies used to study and

evaluate traffic conditions, patterns, and flow
within transportation networks.
TRAFFIC ANALYSIS TECHNIQUES
Key traffic analysis techniques include:

Space-Time Queueing Network

Relationship Analysis Analysis

Focuses on how vehicles Examines the build-up of Maps out entire

move over time and vehicles at intersections, transportation systems,
space, helping to monitor traffic signals, or examining the connections
vehicle speeds and congestion points, offering and paths between
locations. insights into how to different roads to optimize
manage delays and traffic flow across large
improve flow. areas.
 Space-Time Relationship

The figure represents a Simple Space- Time Diagram. The

curve A-A represents the position of a vehicle (or some other
event) at all times between t1 and t2. Such a curve is known
as a Trajectory. In cases in which distance is the vertical axis,
the slope of the trajectory is the speed of the vehicle; in cases
in which distance is the horizontal axis, the reciprocal of speed
(sometimes known as rate of travel) is represented by the
slope. Space-Time Diagram

Space- time diagrams are used in several different ways. Where the problems involved are
simple enough, they may be used to provide direct graphical solutions. In more complicated
cases, they may be used as an aid in developing analytical solutions to control problems,
simulation models and theoretical models of traffic flow.
 Space-Time Relationship

• DEVELOPMENT OF ANALYTICAL SOLUTIONS

Most space-time problems are complicated enough that it is not efficient to use graphical methods for routine solutions. In this
case, space-time diagrams are often used to derive analytical relationships, which may then be used to produce a large
number of solutions quickly and accurately. An example of this type of use of space-time diagrams is the derivation of basic
relationships used in the analysis of capacity for airport runways used for landings only.

• Runway capacity is largely a function of the air traffic rules used by the air traffic control system.
• FUNDAMENTAL RULE: When flying under certain minimum conditions, all aircraft at a given elevation must maintain certain
minimum longitudinal distance separations.
• Minimum distance separation is 3 nautical miles.
• COMMON APPROACH PATH – path from the entry gate to the runway threshold.
• CAPACITY OF A RUNWAY is the max number of aircraft it can handle per unit time (say, per hour). This, in turn, is the
reciprocal of the average time separation between aircraft at the runway threshold.
 Space-Time Relationship

• DEVELOPMENT OF ANALYTICAL SOLUTIONS

CASE 1

Time separation at runway threshold

vi ≤ vj

Where:

tij = time separation between the two aircraft

δ = minimum distance separation
vj = speed of the trailing aircraft
 Space-Time Relationship

• DEVELOPMENT OF ANALYTICAL SOLUTIONS

CASE 2
Time separation at runway threshold

vi >vj

Where:

vj = speed of the leading aircraft

y = length of the common approach path
• DEVELOPMENT OF SIMULATION MODELS

Development of a graphical solution is useful in determining the proper order of calculations to move from
what is known to what is unknown, and can be used as a basis for developing a computer model of the
behaviour of the system.

• BLOCK SIGNAL CONTROL SYSTEMS – intended to provide protection for trains against collisions and
other hazards such as broken rails.

• BLOCKS – electrically insulated sections of track.

• OCCUPIED – whether a train is in particular block

• SIGNAL SYSTEM – used to warn or control trains approaching the occupied block. Most commonly
involve a set of colored lights along the track or in the locomotive operator’s signals. • ASPECTS –
meaningful combinations of signal lights.
• TWO-BLOCK, THREE-ASPECT SYSTEM

It is the simplest system. Signal lights

are either red, yellow, or green.
•THREE-BLOCK, THREE-ASPECT SYSTEM

It is in which an extra block is added. This is

common on many subway lines. It permits a
simple and reliable automatic train stop
device to be activated at the second red
signal behind a train, activating the brakes if
the driver should fail to do so. The distance
between following trains is increased,
however, as can be seen from the Figure b,
and capacity is reduced.
•THREE-BLOCK, FOUR-ASPECT SYSTEM

It can be devised by using double

lights. In this case red-red and
green-green signals replace the red
and green signals of the simpler
systems, and there are two
intermediate levels of restricted speed.
 Queueing Analysis

A second major issue in analysis of traffic systems is the

analysis of times and delays. Normally travel time will be
thought of as the time required to cover a fixed distance, and
will be of course the reciprocal average speed at which that
distance is covered.
 Queueing Analysis

Queuing diagrams have several important properties. It is very important that students understand these
properties and be able to apply them to actual queuing problems. These are:

The slope of D(t) is the departure rate; the slope of A(t) is the arrived rate.
The departure rate cannot exceed the service rate or capacity of the server. It may be less.
Cumulative departures can never exceed cumulative arrivals. D(t) can never be above A(t) in the queuing
diagram.
When a queue is present, the departure rate will equal the service rate. When no queue is present, the
departure rate will equal the arrival rate. The queue first forms when the arrival rate first exceeds the service rate.
 QUEUING THEORY

Queuing Theory is the mathematics of waiting lines. It is extremely useful in predicting and
evaluating system performance. It has been used for operations research, manufacturing and
system analysis.

Characteristic of
Application of
Queuing Systems
Queuing Theory
• Costumer – refers to anything
that arrives at a facility and
requires service, e.g., people,
• Traffic Control machines, truck (cars).

• Airport Traffic, Airline • Server – refers to any

ticket sales resource that provides the
requested service, e.g.,
repairpersons, retrieval
machines, runways at
airport.
 Queueing Analysis

•STOCHASTIC QUEUING MODELS

Queuing Models are known as “deterministic queuing models”. They are appropriate for many
transportation applications because of the prevalence of distinct traffic peaks in which the capacities of
servers are exceeded on a regular basis.
 Queueing Analysis

•M / D / 1 Queue Model

An M/D/1 queue represents the queue length in a system having a single server, where arrivals are determined
by a Poisson process and job service times are fixed (deterministic). Features of interest for stochastic queuing
systems include the average queue length “Q”, the average waiting time “w”, and the average total delay time
spent in the system (queue waiting time plus service time) “t”.
 Queueing Analysis

•M / M / 1 Queue Model

Another commonly encountered stochastic queuing model, in which both arrivals and service times are
exponentially distributed and there is one channel. For the M / M / 1 model, the average queue length, waiting
time, and total delay are given by:
 Queueing Analysis

•TRANSPORTATION APPLICATIONS OF QUEUING THEORY

Queuing theory may be used for analyze a wide variety of transportation-related

problems.

• For airports, queuing theory can be used to model the operation of runways,
airspace on runway approaches, baggage handling systems, ticketing and check-in
operations, security checkpoints, and departure lounges.

• For highways, queuing theory can be used to analyze the operation of toll booths:
the effects of capacity changes due to geometrics; the effects of temporary capacity
changes due to incidents (such as accidents); the effects of traffic signals and other
control devices; and the effect of traffic disruptions caused by railroad grade
crossings, drawbridges, and the like.
 Queueing Analysis

•TRANSPORTATION APPLICATIONS OF QUEUING THEORY

• For mass transit systems, queuing theory can be used to analyze the use of ticket
windows or ticket dispensing machines, the operation of fare gates, and platform
capacities.

• For railroads, queuing theory can be used to analyze yard operations. For water
transportation, it can be used to analyze the operation of locks and port operations.
For all types of freight transportation, queuing theory can be used to analyze loading
and unloading operations. Any situation in which either demand or capacity may
change over time may be suitable for analysis by queuing theory.
 Queueing Analysis
Example problem

A ramp meter operates during morning peak period. Ramp meter cycles vary with time as shown in
the table below. The metering scheme allows one vehicle per cycle to pass the signal. The table
below gives the number of vehicle demanding service on the ramp during particular time intervals,
the cumulative demand for the ramp for the morning peak, and the ramp meter cycle for each
interval. Using a queuing diagram, determine the maximum queue, the maximum delay to any
vehicle, and the total delay.
Queueing Analysis
 Network Analysis
It refers to a structure that facilitates the movement of energy, matter, or information from
one location to another.

Network consist of a set of nodes connected by

links.

• Nodes - may be either origins or destination of

trips or decision points. Points at which
transportation facilities meet.

• Links - elements in the network which have cost

transportation facilities such as road, sidewalk,
or railway segments.

• Costs - Usually include travel time, travel

distance, money costs or some sort of weighted
sum of several cost elements.
 Network Analysis

There are two network analysis problems of particular interest in

transportation.

1. Traffic Assignment Problem – which consists of predicting traffic

volumes on each link in a network.

2. Minimum cost path – determination of the minimum length of

travel time (generally) from a certain origin to a certain
destination. Most efficient solution is Dijkstra’s algorithm.
 Network Analysis

The minimum path from node A to node F is found by tracing the last-node portion
of the label back from node F to node A. The path (in reverse order) is found to be
F-C-B-E-D-A.

Minimum path algorithm

TRAFFIC FLOW
 TRAFFIC FLOW

The study of interactions between travellers and infrastructure, with

the aim of understanding and developing an optimal transport
network with efficient movement of traffic and minimal traffic
congestion problems.
 Traffic Flow Models

1. Microscopic model
DESCRIBE CHARACTERISTICS SPECIFIC TO INDIVIDUAL PAIRS OF
VEHICLES WITHIN THE TRAFFIC STREAMS.

2. Macroscopic model
DESCRIBE CHARACTERISTICS OF THE TRAFFIC STREAM AS A
WHOLE.
 TRAFFIC DATA
Provides insights into the current and future travel patterns,
demands, and behaviors of road users.
 -The rate of change of distance with respect to time, and is
SPEED usually measured in either miles per hour( or kilometers
per hour) or feet per second(or meters per second),
depending on the application.

-Defined as the number of vehicles per unit distance

DENSITY
occupying a section of roadway at a given instant in
time, and is usually measured in vehicles per mile or per
kilometer.

-Defined as the fraction of time that vehicles are present

FLOW
at a point in space.

TRAFFIC DATA -The number of vehicles per unit time passing a

ANALYSIS OCCUPANCY point is space, and is usually expressed in vehicles
per hour.
 TWO BASIC TYPES OF COLLECTING TRAFFIC DATA

SPOT SPEED DATA TRAVEL TIME DATA

the instantaneous speed of

1 2 taken
o over more extended
a vehicle at a specified sections of roadway.
location.
THANKS