Queuing Analysis

Download as pptx, pdf, or txt
Download as pptx, pdf, or txt
You are on page 1of 17

QUEUING

ANALYSIS

Prepared by:
Jerson Opis
TRAVEL TIMES & DELAYS

Travel time – the time required to cover a fixed distance.

Travel time may vary for a number


of reasons, that include:
Environmental conditions, weather.
Transportation Facilities
Vehicle Characteristics
Driver’s behavior
Interference by other traffic.
TRAFFIC ANALYSIS TECHNIQUES

Arrivals Departures
Queue Server

Queuing System Schematic Diagram

Delay – difference between the actual travel time on a


given or ideal travel time on a given segment.
There are two particular travel time suited for
comparison with the actual performance of the system.
 Travel time under free flow condition.
(no interference with other traffic)
 Travel time at capacity.

Queuing Delay – result when demand for facility exceeds


its capacity, and can be studied by Queuing Theory.
Queuing Theory – analysis of Queuing System,
which is compose of Server and a Queue.

 Server – a stream of customers who demand


services.
 Queue – line of customers waiting to be
served.
QUEUING THEORY &
FUNDAMENTALS

Where:
A(t)= Arrival function

9
QUEUING THEORY &
FUNDAMENTALS

• From that queuing diagram, It is


possible to determine a number
of interesting things:

• The number of customers in


queue at any given time, or
queue length.
• The delay to each customer,
assuming the order of service is
the same as the order of arrival.
• The summation of delay to all
customers.
Where:
A(t) - Arrival function
D(t) - Departure function
W(t) -Delay of customer arriving
time
Q(t) -Number of customers in
queue at that time.
Then the,
Shaded part- Total delay or
summation of delay to all
customer. 8.15

11
Queuing Diagrams have several
important properties:

• The slope of D(t) is the departure


rate; A(t) is the Arrival rate.
• The departure rate cannot exceed
the service rate or capacity of the
server. It may be less.
• Cumulative departures can never be
exceed cumulative arrivals. D(t) can
never be above A(t) in queuing 8.16
diagram.

12
QUEUE DISCIPLINE

Relationship between the order in which customers arrive


demanding service and the order in which they are
served.
 firs-in, first-out (FIFO)  random service
customers are served in the no relationship between the
order of which they arrive. order of arrival and service.
 last-in, first-out (LIFO)  priority service
most recent arrival is always certain customers are
served next. Rare in served ahead of others.
transportation engineering.
STOCHASTIC QUEUING MODELS

Difference between M/D/1 queuing system and M/M/1


queuing system
• M/D/1
-has exponentially distributed arrival times but fixed
service time (constant).
M/M/1
- Both arrivals and service times are exponentially
distributed.

15
STOCHASTIC QUEUING MODELS
M/D/I M/M/I

Q= 2ρ - ρ² Q= ρ² Where :
2(1–ρ) 1–ρ λ = arrival rate
μ = service rate
W= ρ W= λ ρ = λ μ = traffic
intensity
2μ ( 1 – ρ ) μ(μ–λ)

t= 2- ρ t= 1
2μ ( 1 – ρ ) μ–λ
Transportation Applications of
Queuing Theory

Airport Mass Transit


 Operations on Runways  Ticket Windows
Airspace on Runway Dispensing Machine
Baggage Handling Operations on Fare
Ticketing Gates
Check in Operations Platform Capacities
Checkpoint
Departure Lounges
Highways Railroads
Toll Booths Yard Operations
Effects of Capacity
Changes due to Water Transportation
Geometry. Locks and Port
Temporary Capacity Operations
Changes due to
Incidents. Freight Transportation
Effects of Traffic Signals Loading and Unloading
Operations
Railroad Grade Crossing
Example Problem 8.1

Morning peak traffic upstream of a toll booth is given


below. The toll plaza consists of three booths, each of
which can handle an average of one vehicle every 6s.
Using queuing diagram, determine the maximum
queue, the longest delay to an individual vehicle, and
total delay.
Time period 10-min. Cumulative
volume 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

You might also like