TON DUC THANG UNIVERSITY

FACULTY OF CIVIL ENGINEERING

DEPARTMENT OF TRANSPORTATION ENGINEERING

TRANSPORTATION ENGINEERING
CÔNG TRÌNH GIAO THÔNG

Course number: 801041

Lecturer: Dr. PHAN TÔ ANH VŨ

Department of Transportation Engineering HCMC, July. 2016
15/05/2016 801041 - TRAFFIC FLOW 1
 CHAPTER 2
TRAFFIC FLOW
(LÝ THUYẾT DÒNG XE)
CONTENTS:
2.1. SPACE-TIME RELATIONSHIPS
2.2. QUEUING ANALYSIS
2.3. NETWORK ANALYSIS
2.4. TRAFFIC FLOW MODELS
2.5. TRAFFIC DATA ANALYSIS
LEARNING OUTCOMES:
- Students are be able to apply some theories,
such as space-time relationships, Queuing
analysis to solve the problem of traffic operation.
- Students knows some traffic flow models and
traffic date analysis.
 2.1. SPACE-TIME RELATIONSHIPS

t2

t1
Space-time diagram

15/05/2016 801041 - TRAFFIC FLOW 5

 2.1. SPACE-TIME RELATIONSHIPS

 Direct Graphical Solutions

Transit system
Single track 15
km long
Train 10 min
interval
dispatched from
each end (W-E)
5 min layovers
Neglect stop
time at stations
Uniform speed
45 km/h both
• Determine number and location of double-track sections, directions
and the minimum length required for such sections in order
for trains running as much as 2 min behind schedule to pass
one another without delay

15/05/2016 801041 - TRAFFIC FLOW 6

 2.1. SPACE-TIME RELATIONSHIPS

Rail line 90 km
long
7.5 km long
double-track
section located
between 60-67.5
km from W end
A train leaves W
end at 1:00 p.m.
and travel E at
constant speed of
45 km/h
The second train
leaves from the E
1) Determine earliest time the W-bound train can arrive at the W end at 1:30 p.m.
end of the line and may travel at
2) Determine the latest dispatch time (after 1:00 p.m.) that will any speed up to 90
allow the W-bound train to reach its destination without km/h
unnecessary delay

15/05/2016 801041 - TRAFFIC FLOW 7

 2.1. SPACE-TIME RELATIONSHIPS

Example: Runway Capacity Analysis

Analysis of capacity for
airport runways used
for landings only.
vi: The speed of lead
 aircraft.
t ij  vj: The speed of trailing
vj aircraft.
: the length of the
approach path
: the minimum distance
separation

Time separation at runway threshold, vi ≤ vj

15/05/2016 801041 - TRAFFIC FLOW 8
 2.1. SPACE-TIME RELATIONSHIPS

   1 1 
tij      
 vj  v j vi 

Time separation at runway threshold, vi >vj

15/05/2016 801041 - TRAFFIC FLOW 9
 2.2. QUEUING ANALYSIS

 A second major issue in the analysis of traffic

system is the analysis of travel times and delays.
 Travel time will be thought of as the time required to
cover a fixed distance.
 Travel time may vary for a number of reasons, such
as:
 Weather
 Transportation facility geometry
 Vehicle characteristics
 Driver behavior
15/05/2016
 Interference by801041
other traffic (cản trở)
- TRAFFIC FLOW 10
 2.2. QUEUING ANALYSIS

 Delay is a more subtle (tinh tế) concept. It may be

defined as the difference between the actual travel time
on a given segment of a transportation system and
some ideal travel time for that segment.

15/05/2016 801041 - TRAFFIC FLOW 11

 2.2. QUEUING ANALYSIS

Queuing system schematic diagram

 Queuing theory involves the analysis of

what is known as a queuing system (A
server, a stream of customers, and a
queue)

15/05/2016 801041 - TRAFFIC FLOW 12

 2.2. QUEUING ANALYSIS

 Queuing theory Fundamentals

A (t): Arrival function

Arrival function for airport runway

15/05/2016 801041 - TRAFFIC FLOW 13

 2.2. QUEUING ANALYSIS

 Queuing theory Fundamentals

Arrival and departure for airport runway

15/05/2016 801041 - TRAFFIC FLOW 14
 2.2. QUEUING ANALYSIS

 From this figure, to determine number of

interesting things:
 The numbers of customer in queue at any
given time, or length queue.
 The delay to each customer,
 The summation of delay to all customers
 Given the density of the queue

15/05/2016 801041 - TRAFFIC FLOW 15

 2.2. QUEUING ANALYSIS

Queuing diagram features

15/05/2016 801041 - TRAFFIC FLOW 16

 2.2. QUEUING ANALYSIS

Queuing diagram, smooth curve approximation

15/05/2016 801041 - TRAFFIC FLOW 17

 2.2. QUEUING ANALYSIS

 Queuing diagrams have some several

properties:
 The slope of D(t) is the departure rate
 The slope of A(t) is arrival rate
 The departure rate cannot exceed the
service rate or capacity of the server. It
may be less

15/05/2016 801041 - TRAFFIC FLOW 18

 2.2. QUEUING ANALYSIS

 Queuing diagrams have some several

properties:
 Cumulative departures can never exceed
cumulative arrivals. D(t) can never be
above A(t) in the queuing diagram.

15/05/2016 801041 - TRAFFIC FLOW 19

 2.2. QUEUING ANALYSIS

 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

15/05/2016 801041 - TRAFFIC FLOW 20

 2.2. QUEUING ANALYSIS

 Queue Discipline
 The most common queue discipline
encountered in transportation
applications is first-in, first-out (FIFO).
 One which has gotten considerable
attention in queuing theory literature, last-
in, first-out (LIFO).
Q (t )
 If the service rate m is constant: w(t ) 

15/05/2016 801041 - TRAFFIC FLOW 21
 2.2. QUEUING ANALYSIS

 Stochastic (ngẫu nhiên) Queuing Models

 M/D/1 queue, these are given by
2   2
Q
One Channel 2(1   )
Arrivals Service 
Exponentially Deterministic w
Distributed (No random variation) 2 (1   )
2
t
2 (1   )

m = service rate
 = traffic intensity
15/05/2016 801041 - TRAFFIC FLOW 22
 2.2. QUEUING ANALYSIS

 Transportation Application of Queuing Theory

Example: Morning peak traffic upstream of a toll booth is
given in the table below. The toll plaza consists of the three
booths, each of which can handle an average of one
vehicle every 6s. Using a queuing diagram, determine the
maximum queue, the longest delay to an individual
vehicle, and the total delay.
Time period 10 min volume Cumulative Volume
7:00-7:10 200 200
7:10-7:20 400 600
7:20-7:30 500 1100
7:30-7:40 250 1350
7:40-7:50 200 1550
7:50-8:00 150 1700
15/05/2016 801041 - TRAFFIC FLOW 23
 2.2. QUEUING ANALYSIS

15/05/2016 801041 - TRAFFIC FLOW 24

 2.3. NETWORK ANALYSIS

 A network consists of: nodes, links.

 Nodes may be either origins or
destinations.
 Links are elements in the network
 A schematic diagram illustrating the
elements of a network:

15/05/2016 801041 - TRAFFIC FLOW 25

 2.3. NETWORK ANALYSIS

Queuing diagram, smooth curve approximation

15/05/2016 801041 - TRAFFIC FLOW 26

 2.4. TRAFFIC FLOW MODELS

 Traffic flow models describe the

relationship among traffic states such as
speed, flow, and density.
 Models of traffic flow are often classified
as: microscopic and macroscopic.

15/05/2016 801041 - TRAFFIC FLOW 27

 2.4. TRAFFIC FLOW MODELS

 Microscopic models include: car-following

models, gap-models.
 Macroscopic models describe the
relationships among speed, flow, and
density.

15/05/2016 801041 - TRAFFIC FLOW 28

 2.4. TRAFFIC FLOW MODELS

Vehicle trajectories

15/05/2016 801041 - TRAFFIC FLOW 29

 2.4. TRAFFIC FLOW MODELS

Three-dimensional representation of cumulative

vehicle surface
15/05/2016 801041 - TRAFFIC FLOW 30
 2.5. TRAFFIC DATA ANALYSIS

 Flows and Volumes:

 Speed and Travel Time Data
 Other traffic data

15/05/2016 801041 - TRAFFIC FLOW 31

 2.5. TRAFFIC DATA ANALYSIS

 Flows and Volumes:

 x i  x
2  i

n
 x  x 
i
i
s
n 1

ni xi2 ( xi ) 2

s
n(n  1)

15/05/2016 801041 - TRAFFIC FLOW 32

 REVIEW

Question: Whether or not we apply theory of

traffic flow to solve the traffic jam in Ho Chi
Minh City? If possible, please give some
explanations for this issue? If impossible,
why?

15/05/2016 801041 - TRAFFIC FLOW 33

 REFERENCES
Text books:
[1]. Banks, H. J. (2004), Introduction to
Transportation Engineering, 2rd International Edition,
Mc Graw-Hill Education, USA.

15/05/2016 801041 - TRAFFIC FLOW 34

 THANK YOU
FOR YOUR ATTENTION!

Lecturer: Dr. PHAN TÔ ANH VŨ

Department of Transportation Engineering HCMC, July. 2016
15/05/2016 801041 - TRAFFIC FLOW 35