Scribd
Upload
158 views4 pages

Principles of Transportation Engineeering: Service Station

This document discusses fundamentals of queuing theory and different queuing models. It introduces common queueing notation and describes the D/D/1, M/D/1, and M/M/1 queueing models. It provides the basic formulas to calculate average queue length, waiting time, and time in the system for each model. It then gives examples of applying the models to calculate metrics for vehicle arrival and service at a recreational park entrance.

Uploaded by

Romel Decenilla
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
158 views4 pages

Principles of Transportation Engineeering: Service Station

This document discusses fundamentals of queuing theory and different queuing models. It introduces common queueing notation and describes the D/D/1, M/D/1, and M/M/1 queueing models. It provides the basic formulas to calculate average queue length, waiting time, and time in the system for each model. It then gives examples of applying the models to calculate metrics for vehicle arrival and service at a recreational park entrance.

Uploaded by

Romel Decenilla
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

Principles of Transportation Engineeering

Learning Module Series


Unit 2: Traffic Stream Models & Traffic Flow Fundamentals
Lesson 3: Fundamentals of Queuing Theory

Queuing Theory
Queuing at a gasoline station or at a toll gate, falling in line to transact at the
cahier’s office, or just getting a movie ticket at Robinsons Mall Tuguegarao,
queuing at a busy parking lot, falling in line at McDonald’s or Jollibee to order
your food, jet planes waiting before being given the signal to land or takeoff-
these are everyday occurrences that would surely test one’s patience.

Queuing analysis provides ways of assessing the impacts of these activities by


knowing the magnitude of vehicular delay and the extent of queue propagated.
The models that will be discussed in this module are derived based on some
assumptions related to arrival and departure patterns, and the prevailing queue
discipline.

Service Station
Input Output

The input is normally characterized by some form of arrival pattern usually


given by its arrival distribution. The output generally depends on the queue
discipline and the service mechanism at the service station. The most common
type of queue discipline is the so-called FIFO or fist-in first-out, i.e., the first
one that arrives at the service station gets served first and therefore the first to
leave the system as well. Service mechanism refers to the manner customers are
served at the station. For example, a toll booth that charges a single fee, accepts
Principles of Transportation Engineeering
Learning Module Series
Unit 2: Traffic Stream Models & Traffic Flow Fundamentals
Lesson 3: Fundamentals of Queuing Theory

only a fixed amount, and does not give back any change will have a fairly
uniform service rate compared to a booth that charges variable toll fees and
gives back change up to the last centavo.
Kendall’s notation is popularly used to describe the queuing system. It takes the
form:
A/B/C (n)
Where:
A= represents the input or arrival pattern
B = represents the service mechanism
C = represents the number of servers
n = represents the limit of queue or users

Arrivals and departures may either follow a random or deterministic pattern.


Markov (M) is used for random processes while deterministic (D) is used for
processes that are characterized by regular or constant arrivals or departures.
Typical examples of these processes are:

M/M/1 (∞) -random arrival and departure (service rate); one or single server;
infinite queue (no limit).
M/M/N (∞)- random arrival and departure; N or multiple servers; infinite
queue.
D/D/1 (100)- regular arrival; regular service rate or departure; single server;
limit queue is 100.

A combination of Markov and Deterministic processes, say M/D/1, may also be


used.

• D/D/1 Queuing

Due to the regularity of both a rivals and departures, it is more


convenient to analyze a D/D/1 queuing system graphically. Arrivals and
departures are easily represented by straight lines with the slopes
corresponding to their rates.

This queueing model is the simplest having deterministic arrivals,


deterministic departures, and one departure channel.

• M/D/1 Queueing
The M/D/1 queueing system assumes that the arrivals of vehicles follow
a negative exponential distribution, a probability distribution
characterized by randomness. Departure is assumed to be regular as in
the D/D/1.
Queueing that has exponentially distributed arrivals, deterministic
departures, and one departure channel.
Principles of Transportation Engineeering
Learning Module Series
Unit 2: Traffic Stream Models & Traffic Flow Fundamentals
Lesson 3: Fundamentals of Queuing Theory

Let 𝜆 -arrival rate


µ - departure rate

Then,
𝜆
𝜌=
𝜇
Is the traffic density or utilization factor.

Note that if 𝜌 < 1 then 𝜆 < 𝜇, which means that the system is stable.
Otherwise, queue becomes longer and longer (unstable condition).

Basic Formula for M/D/1:

1. Average length of queue:


2𝜌 − 𝜌 2
𝑚
̅=
2(1 − 𝜌)
2. Average waiting time:
𝜌
𝑤
̅=
2𝜇 (1 − 𝜌)
3. Average time spent in the system:
2− 𝜌
𝑡̅ =
2𝜇(1 − 𝜌)

• M/M/1 Queueing

The M/M/1 queueing system assumes negative exponential for both


arrival and departure distributions.
Queueing that has exponentially distributed arrivals, exponentially
distributed departures and one departure channel.

Basic Formula for M/M/1:

1. Average length of queue:


𝜆2
𝑚
̅=
𝜇 (𝜇 − 𝜆 )

2. Average waiting time:


𝜆
𝑤
̅=
𝜇 (𝜇 − 𝜆 )

3. Average time spent in the system:


1
𝑡̅ =
𝜇−𝜆
Principles of Transportation Engineeering
Learning Module Series
Unit 2: Traffic Stream Models & Traffic Flow Fundamentals
Lesson 3: Fundamentals of Queuing Theory

Sample Problems:

1. Vehicles arrive at an entrance to a recreational park. There is a single


gate (at which the vehicles must stop), where a park attendant
distributes a free brochure. The park opens at 8:00 AM., at which time
vehicles begin to arrive at a rate of 480 veh/hour. After 20 minutes, the
arrival flow rate declines to 120 veh/hour, and it continues at that level
for the remainder of the day. If the time required to distribute the
brochure is 15 seconds, and assuming D/D/1 queueing,

a. Determine the length of queue at 8:10 AM


b. Determine the longest vehicle queue
c. Determine the longest vehicle delay in minutes
d. Determine the time that the queue will dissipate

2. Consider the entrance to the recreational park describe in the previous


example. However, let the average arrival rate be 180 veh/hour and
Poisson distributed (exponential times between arrivals) over the entire
period from park opening time (8:00AM) until closing at dusk.
Determine the following:

a. Average length of queue


b. Waiting time in queue
c. Average time spent in queue

3. Assume that the park attendant in the previous examples takes an


average of 15 seconds to distribute brochures, but the distribution time
varies depending on whether park patrons have questions relating to
park operating policies. Given an average arrival rate of 180 veh/hour,
compute the following:

a. Average length of queue


b. Average waiting time in queue
c. Average time spent in the system

You might also like