Академический Документы
Профессиональный Документы
Культура Документы
ANNU
Dr.Geetanjali Sharma
2017-2018
1 / 29
Kendall Notation 1/2/3(/4/5/6) Distributions M/M/1 Queueing Model State of the system Transition from one state to an
Outlines
Kendall Notation 1/2/3(/4/5/6)
Distributions
M/M/1 Queueing Model
State of the system
Transition from one state to another state in a queuing system
Performance measures of M/M/1 queues
Minimization of Traffic Congestion by Using Queueing Theory
INTRODUCTION
Few Negative Impact Of The Traffic Congestion
Steps Preventing Traffic Congestion
Representation of The Bhagwanpur Golambar Intersection Traffic
Flow Model Using Queueing Theory
Description Of The Model(M/M/1):(∞ /Fif0)
Assumptions Of The Model
Conclusion
2 / 29
Kendall Notation 1/2/3(/4/5/6) Distributions M/M/1 Queueing Model State of the system Transition from one state to an
• 1 Arrival Distribution
• 2 Service Distribution
• 3 Number of servers
• 4 Total storage (including servers)
(infinite if not specified)
• 5 Population Size
(infinite if not specified)
• 6 Service Discipline(FCFS/FIFO)
3 / 29
Kendall Notation 1/2/3(/4/5/6) Distributions M/M/1 Queueing Model State of the system Transition from one state to an
Distributions
4 / 29
Kendall Notation 1/2/3(/4/5/6) Distributions M/M/1 Queueing Model State of the system Transition from one state to an
5 / 29
Kendall Notation 1/2/3(/4/5/6) Distributions M/M/1 Queueing Model State of the system Transition from one state to an
7 / 29
Kendall Notation 1/2/3(/4/5/6) Distributions M/M/1 Queueing Model State of the system Transition from one state to an
9 / 29
Kendall Notation 1/2/3(/4/5/6) Distributions M/M/1 Queueing Model State of the system Transition from one state to an
Hence P0 = 1−ρ
i.e. Probability of no customer in the system
To determine performance measures Ls , Lq , Ws , Wq in the queu-
ing system we need to determine the average number of customers
in the system.
• The average number of customers, Ls in the system can be written as,
Ls = ∞
P
n=0 n × Pn
= ρ(1 − ρ) ∞ n−1
P
n=0 nρ
∂ n
We know that (ρ )=nρn−1
∂ρ
∂ P
Ls = ρ(1 − ρ) ( ∞ n
n=0 ρ )
∂ρ
11 / 29
Kendall Notation 1/2/3(/4/5/6) Distributions M/M/1 Queueing Model State of the system Transition from one state to an
∂ 1
Ls = ρ(1 − ρ) ( )
∂ρ 1 − ρ
or
λ
Ls =
(µ − λ)
Using Littles law, according to which the average number of cus-
tomers in the service system is the product of arrival rate and average time
a customer spends in the system.
λ 1 1
Ws = ( )×( )=( )
µ−λ λ µ−λ
Average time a customer spends in the queue, Wq, can be deter-
mined by subtracting expected service time or average service time
from average time a customer spends in the system, Ws
λ2
Wq =
µ × (µ − λ)
14 / 29
Kendall Notation 1/2/3(/4/5/6) Distributions M/M/1 Queueing Model State of the system Transition from one state to an
ABSTRACT
Traffic congestion is a phenomenon of increased disruption of the
traffic movement. In India, with increasing vehicles on the road,
traffic congestion is quickly increasing. Much has been written
about the queueing theory technique and its powerful application.
This paper is an attempt to analyze the contribution and
application of queueing theory in the field of traffic congestion. For
this Bhagwanpur Golambar intersection of Muzaffarpur city
(located in India) is chosen.
The paper summarizes a range of queueing theory results in the
following areas: waiting time, utilization analysis and system
design. The traffic congestion follows a repeatable pattern during
the day, and the locals accept it as a daily routine.
15 / 29
Kendall Notation 1/2/3(/4/5/6) Distributions M/M/1 Queueing Model State of the system Transition from one state to an
I.INTRODUCTION
Traffic research still cannot fully predict under which condition traf-
fic jam may suddenly occur. Because of the poor correlation of
theoretical models to actual observed traffic flows, transportation
planners and highway engineers attempt to forecast traffic flow using
empirical models. Their working traffic models typically use a com-
bination of macro micro mesoscopic features and may add matrix
entropy effects by platooning group of vehicles and by randomising
the flow pattern within individual segments of the network. These
models are then calibrated by measuring actual traffic flows on the
links in the network and the baseline flows are adjusted accordingly.
16 / 29
Kendall Notation 1/2/3(/4/5/6) Distributions M/M/1 Queueing Model State of the system Transition from one state to an
17 / 29
Kendall Notation 1/2/3(/4/5/6) Distributions M/M/1 Queueing Model State of the system Transition from one state to an
18 / 29
Kendall Notation 1/2/3(/4/5/6) Distributions M/M/1 Queueing Model State of the system Transition from one state to an
In the above figure, round shape in the middle represents the Bhag-
wanpur Golambar and incoming arrows to the Golambar represent
the arrival of vehicles.
19 / 29
Kendall Notation 1/2/3(/4/5/6) Distributions M/M/1 Queueing Model State of the system Transition from one state to an
20 / 29
Kendall Notation 1/2/3(/4/5/6) Distributions M/M/1 Queueing Model State of the system Transition from one state to an
21 / 29
Kendall Notation 1/2/3(/4/5/6) Distributions M/M/1 Queueing Model State of the system Transition from one state to an
23 / 29
Kendall Notation 1/2/3(/4/5/6) Distributions M/M/1 Queueing Model State of the system Transition from one state to an
24 / 29
Kendall Notation 1/2/3(/4/5/6) Distributions M/M/1 Queueing Model State of the system Transition from one state to an
25 / 29
Kendall Notation 1/2/3(/4/5/6) Distributions M/M/1 Queueing Model State of the system Transition from one state to an
26 / 29
Kendall Notation 1/2/3(/4/5/6) Distributions M/M/1 Queueing Model State of the system Transition from one state to an
VII.Conclusion
The queueing theoryis an effective mathematical technique for solving
various acute problems of any organization or system. As queueing the-
ory focuses on representation of traffic situation by using mathematical
terms and formulas, its application cover a wide range of present situation
including the traffic congestion.
• It can be reduced by either increasing road capacity or by reducing
traffic.
• We can provide separate lanes for specific user groups.
• Variable message signs can be installed along the roadway to advice
road users.
• Increasing width of the channel of congested route or building up of
highways.
• Introducing public transport such as busses and office cabs.
• There must be parking restriction for the motor vehicles by the
roadside (i.e. at unauthorized place), so that congestion can be
reduced.
27 / 29
Kendall Notation 1/2/3(/4/5/6) Distributions M/M/1 Queueing Model State of the system Transition from one state to an
References
28 / 29
Kendall Notation 1/2/3(/4/5/6) Distributions M/M/1 Queueing Model State of the system Transition from one state to an
Thanks
29 / 29