SlideShare a Scribd company logo
Copyright Ā© CC-BY-NC 2019, BJMSR
Bangladesh Journal of Multidisciplinary Scientific Research; Vol. 1, No. 2
ISSN 2687-850X E-ISSN 2687-8518
July-September; 2019
Published by Centre for Research on Islamic Banking & Finance and Business
46
Application of Single-Server Queue System in Performance Analysis of Shuttle
Bus Operation: A Case Study of Federal University of Technology Akure
Kanyio Olufunto Adedotun
Department of Transport Management Technology
The Federal University of Technology,Akure
Ondo State, Nigeria
E-mail: oobembe97@gmail.com
Abstract
This study has examined the performance of University transport bus shuttle based on utilization using a Single-server queue
system which occur if arrival and service rate is Poisson distributed (single queue) (M/M/1) queue. In the methodology, Single-
server queue system was modelled based on Poisson Process with the introduction of Laplace Transform. Also, PASTA was
introduced in queuing systems with Poisson arrivals. It is concluded that the performance of University transport bus shuttle is
93 percent which indicates a very good performance such that the supply of shuttle bus in FUTA is capable of meeting the
demand. This study can be improved upon by examining the peak and off-peak period of traffic in the two major corridors
(North gate and South gate) of FUTA, the economic cost of operating bus shuttle services can also be examined.
Keywords: Single-Server Queue System; Transit Shuttle Buses; FUTA
1.Introduction
The issues arising from transportation has continually subjected to various debates in the urban societies. Globally, several
attempts have been made to tackle the challenges, although the situation is not getting much better (Aderamo, 2012; Adanikin,
Olutaiwo, and Obafemi, 2017; Sidiq, 2019). Managing transport infrastructures is crucial to facilitate accessible, affordable,
reliable, safe, and efficient that movement of people and goods, which can be achieved by continous assessment of transport
performance indicators. Among the various modes of transport, the road transport is highly predominant which offers door-to-
door service as in the case of the Federal University of Technology Akure (FUTA). Road transport infrastructure in the
University is commonly plied by shuttle buses for the movement of the students, staff, members and non-members of the
Institution to and from the University on a daily basis.
Among the noticeable transportation problems in the University are traffic congestion; longer commuting; public
transport inadequacy; difficulties for tricycles to have access to routes being plied by shuttle buses, challenge of freight
distribution from one end of the University to another end, and other challenges which all impacts the performance of the
University transport shuttle. This study concentrates on the performance of University transport bus shuttle with the aim of
examining the bus shuttle efficiency based on utilization.
Adeniran and Kanyio (2019) have laid a foundation of model on single-server queue system which this study will
absolutely rely on. A similar study was conducted by Adanikin, Olutaiwo, and Obafemi (2017) on the performance study of
University of Ado Ekiti (UNAD) transit shuttle buses. They adopted traffic volume, speed, density and revenue as main
parameters of performance of transport shuttles, and find that the morning peak period (8.00am to 9.00am) has 234
vehicles/hr, evening peak period (2.00pm to 3.00pm) has 284 vehicles/hr, while the off-peak period (11.00am to 12.00pm)
has 156 vehicles/hr. Also, The average stopping time was 6.55 minutes, average interval between arrivals of motorists was 16.40
seconds, the average queue length was 14.23 people, and the average waiting time at the bus-stop 4.17 minutes. These values
were obtained using the queuing theory and shows much commuters time is lost on transit queues. This study focuses on the
performance of bus terminal in FUTA, and does not factor in other parameters such as peak period, traffic volume, traffic speed,
density, and others.
A very close study was examined by Sidiq (2019) on single-server queue system of shuttle bus performance in the
Federal University of Technology Akure. In his study, Single server queue system was modelled based on Poisson Process with
the introduction of Laplace Transform which was culled from Adeniran and Kanyio (2019). The study finds that the
performance of University transport bus shuttle is 96.6 percent which indicates a very good performance such that the supply of
Copyright Ā© CC-BY-NC 2019, BJMSR
www.cribfb.com/journal/index.php/BJMSR Bangladesh Journal of Multidisciplinary Scientific Research Vol. 1, No. 2; 2019
47
shuttle bus in FUTA is capable of meeting the demand. This present study was conducted barely two weeks after the study of
Sidiq was conducted, and will replicate the methodology of Sidiq as culled from Adeniran and Kanyio (2019).
2. Methodology
2.1 Concept of Queuing
The concept of queue was first used for the analysis of telephone call traffic in 1913 (Copper, 1981; Gross and Harris, 1985;
Bastani, 2009). In a system that deals with the rate of arrival and service rate, waiting time is inevitable and it is always
influenced by queue length. It is therefore crucial to minimize the waiting time to the lowest level in the bus terminal (Jain,
Mohanty and Bohm, 2007). This is referred to as queuing system (Adeniran and Kanyio, 2019).
The basic application of queue is shown in Figure 1, also the basic quantities are:
i. Number of customers in queue L (for length);
ii. Time spent in queue W for (wait)
Figure1: Basic application of queue
Source: Adeniran and Kanyio (2019)
Examples of queue system are:
1. Single-server queue system: This is also referred to as single queue, single server. It is simple if arrivals and services are
Poisson distributed (M/M/1) queue. It has limited number of spots and not difficult. Figure 2 depicts single-server
queue system.
Figure 2: Single-server queue system
Source: Adeniran and Kanyio (2019)
2. Multi-server queue system: This is comprises of single queue, many servers (M/M/c) queue. The c is referred to as
Poisson servers. Figure 3 depicts multiple-server queue system.
Figure 3: Multiple-server queue system
Source: Adeniran and Kanyio (2019)
Copyright Ā© CC-BY-NC 2019, BJMSR
www.cribfb.com/journal/index.php/BJMSR Bangladesh Journal of Multidisciplinary Scientific Research Vol. 1, No. 2; 2019
48
In single-server queue system, arrival and service processes are Poisson such that
a. Customers arrive at an average rate of Ī» per unit time;
b. Customers are serviced at an average rate of Āµ per unit time;
c. Interarrival and inter-service time are exponential and independent;
d. Hypothesis of Poisson arrivals is reasonable; and
e. Hypothesis of exponential service times are not so reasonable (Adeniran and Kanyio, 2019)
In order to explain how the queuing system works, there is need to first introduce the Poisson Process (PP). It has exceptional
properties and is a very important process in queuing theory. To simplify the model, we often assume customer arrivals follow a
PP. The Laplace Transform (LT) is also a very powerful tool that was adopted in the analysis (Trani, 2011). Apart from PP
and LT, there is focus on the queue model itself (Adeniran and Kanyio, 2019).
2.2 Modelling of Single Queue System
2.2.1 Queuing system from Poisson Process and ā€œPASTAā€
The Poisson Process (PP) is important in queue theory due to its outstanding properties. According to Adan and Resing
(2015), queuing system is achieved as ā€œlet N(t) be the number of arrivals in [0, t] for a PP with rate Ī», i.e. the time between
successive arrivals is exponentially distributed with parameter Ī» and independent of the past. Then N(t) has a Poisson
distribution with parameter Ī»t. This is culled from Adeniran and Kanyio (2019).
P(N(t) = k) =
(Ī»t)k
k!
eāˆ’Ī»t
, for k = 0, 1, 2ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ Equation 1
The mean, and coefficient of variation of N(t) are
Mean: E(N(t)) = Ī»t;
Coefficient of Variation: c2
N(t) =
1
Ī»t
ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ Equation 2
By the memoryless property of Poisson distribution, it can be verified that
P(arrival in (t, t + āˆ†t]) = Ī»āˆ†t + 0(āˆ†t) ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ Equation 3
Hence, when āˆ†t is small,
P(arrival in (t, t + āˆ†t)) ā‰ˆ Ī»āˆ†t ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ Equation 4
In each small time interval of length āˆ†t the occurrence of an arrival is equally likely. In other words, Poisson arrivals occur
completely randomly in time. The Poisson Process is an extremely useful process for modelling purposes in many practical
applications. An important property of the Poisson Process is called ā€œPASTAā€ (Poisson Arrivals See Time Averages).
PASTA is meant for queuing systems with Poisson arrivals, (M/./. systems), arriving vehicles find on average the same situation
in the queuing system as an outside observer looking at the system at an arbitrary point in time. More precisely, the fraction of
vehicles finding on arrival the system in some state A is exactly the same as the fraction of time the system is in state A.
2.2.2 Laplace Transform
The Laplace transform LX(s) of a nonnegative random variable X with distribution function f(x) is define as:
LX(s) = E(eāˆ’sX
) = āˆ« eāˆ’sX
āˆž
x=0
f(x)dx ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ Equation 5
It can be noted that
LX(0) = E(eāˆ’X .0
) = E(1) = 1 ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ Equation 6
and
L1
X(0) = E((eāˆ’sX
)1
)|s=0
= E(āˆ’Xeāˆ’sX
)|s=0
Copyright Ā© CC-BY-NC 2019, BJMSR
www.cribfb.com/journal/index.php/BJMSR Bangladesh Journal of Multidisciplinary Scientific Research Vol. 1, No. 2; 2019
49
= āˆ’E(X) ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ Equation 7
Correspondingly,
L (k)
x
(0) = (āˆ’1)k
E(Xk
) ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ Equation 8
There are many useful properties of Laplace Transform. These properties can make calculations easier when dealing with
probability. For instance, let X, Y, Z be three random variables with
Z = X +Y and X, Y are independent.
Then the Laplace Transform of Z can be found as:
LZ(s) = LX(s) Ā· LY (s) ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ Equation 9
Moreover, when Z with probability P equals X, with probability 1 āˆ’ P equals Y, then
LZ(s) = PLX(s) + (1 āˆ’ P)LY (s) ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ Equation 10
Laplace Transforms of some useful distributions can now be introduced.
a. Suppose X is a random variable which follows an exponential distribution with rate Ī». The Laplace Transform of X is
LX(s) =
(Ī»)
Ī» + s
ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ Equation 11
b. Suppose X is a random variable which follows an Erlang āˆ’ r distribution with rate Ī». Then X can be written as:
X = X1 + X2 + Ā· Ā· Ā· + Xr ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ Equation 12
where Xi are i.i.d. exponential with rate Ī». Therefore, we have
LX(s) = LX1(s) Ā· LX2(s)ā€¦ LXr(s)
= (
Ī»
Ī» + s
)
n
ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ Equation 13
c. Suppose X is a constant real number c, then
LX(s) = E(eāˆ’sX
)
= E(eāˆ’sc
)
= eāˆ’sc
ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ Equation 14 (culled from Adeniran and Kanyio, 2019)
2.2.3 Basic queuing systems
Kendallā€™s notation shall be used to describe a queuing system as denoted by:
A/B/m/K/n/D ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦. Equation 15 (Adan and Resing, 2016)
Where
A: distribution of the interarrival times
B: distribution of the service times
m: number of servers
K: capacity of the system, the maximum number of passengers in the system including the one being
serviced
n: population size of sources of passengers
D: service discipline
G shall be used to denote general distribution, M used for exponential distribution (M stands for Memoryless), D be used for
deterministic times (Sztrik, 2016).
A/B/m is also used to describe a queuing system, where:
A stands for distribution of interarrival times,
B stands for distribution of service times and
m stands for number of servers.
Hence M/M/1 denotes a system with Poisson arrivals, exponentially distributed service times and a single server.
M/G/m denotes an m- server system with Poisson arrivals and generally distributed service times, and so on.
In this section, the basic queuing models (M/M/1 system), which is a system with Poisson arrivals, exponentially distributed
service times and a single server. The following part is retrieved from Queuing Systems (Adan and Resing, 2016).
Firstly, it is assumed that inter-arrivals follows an exponential distribution with rate Ī», and service time follows the exponential
distribution with rate Āµ. Further, in the single service model, to avoid queue length instability, it is assume that:
According to Adanikin, Olutaiwo and Obafemi (2017),
Copyright Ā© CC-BY-NC 2019, BJMSR
www.cribfb.com/journal/index.php/BJMSR Bangladesh Journal of Multidisciplinary Scientific Research Vol. 1, No. 2; 2019
50
Utilization (R) =
Average Arrival Rate (Ī»)
Average service rate (Ī¼)
< 1 ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦.. Equation 16
Here R is the fraction of time the server is working (called the utility factor). Time-dependent behaviour of this system will be
considered firstly, then the limiting behaviour. Let Rn(t) denote the probability that at time t there are n passengers in the
system.
Then by equation 3, when āˆ†t ā†’ 0,
R0(t + āˆ†t) = (1 āˆ’ Ī»āˆ†t)R0(t) + Āµāˆ†tR1(t) + 0(āˆ†t) ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦.. Equation 17
Rn(t + āˆ†t) = Ī»āˆ†tRnāˆ’1(t) + (1 āˆ’ (Ī» + Āµ)āˆ†t)Rn(t) + Āµāˆ†tRn+1(t) + 0(āˆ†t) ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦.. Equation 18
where n = 1,2, ...
Hence, by tending āˆ†t ā†’ 0, the following infinite set of differential equations for Rn(t) will be obtained.
R1
0 (t) = āˆ’Ī»R0(t) + ĀµR1(t) ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦.. Equation 19
R1
n(t) = Ī»pnāˆ’1(t) āˆ’ (Ī» + Āµ)Rn(t) + ĀµRn+1(t), n = 1,2, ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦.. Equation 20
It is very difficult to solve these differential equations. However, when we focus on the limiting or equilibrium behaviour of this
system, it is much easier.
It was revealed by (Sztrik, 2016) that when t ā†’āˆž, R1
n(t) ā†’ 0 and Rn(t) ā†’ Rn. It follows that the limiting probabilities Rn
satisfy equations
0 = āˆ’Ī»R0 + ĀµR1ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦.. Equation 21
0 = Ī»Rnāˆ’1 āˆ’ (Ī» + Āµ)Rn + ĀµRn+1, , n = 1,2, ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ Equation 22
Moreover, Rn also satisfy
āˆ‘ Rn = 1
āˆž
n=0 ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦.. Equation 23
which is called the normalization equation. We can also use a flow diagram to derive the normalization equations directly. For
an M/M/1 system, the flow diagram is shown in figure 4:
Figure 4: Process diagram for M/M/1 Queue, k=1,2,3,... (Ademoh and Anosike, 2014; Adeniran and Kanyio, 2019)
The rate matrix of the system is:
Q =
āˆ’Ī» Ī» 0 0 0 . . .
Āµ āˆ’(Āµ + Ī») Ī» 0 0 . . .
0 Āµ āˆ’(Āµ + Ī») Ī» 0 . . .
0 0 Āµ āˆ’(Āµ + Ī») Ī» . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦.. Equation 24
Notice that the sum of each row equals 0.
In order to determine the equations from the flow diagram, a global balance principle was adopted. Global balance principle
states that for each set of states under the equilibrium condition, the flow out of set is equal to the flow into that set. Based on
figure 1,
Copyright Ā© CC-BY-NC 2019, BJMSR
www.cribfb.com/journal/index.php/BJMSR Bangladesh Journal of Multidisciplinary Scientific Research Vol. 1, No. 2; 2019
51
š‘†š‘”š‘Žš‘”š‘’ š‘…š‘Žš‘”š‘’ š¼š‘› = š‘…š‘Žš‘”š‘’ š‘‚š‘¢š‘”
0 Āµš‘…1 = šœ†š‘…0
1 šœ†š‘…0 + Āµš‘…2 = (šœ† + Āµ)š‘…1
2 šœ†š‘…1 + Āµš‘…3 = (šœ† + Āµ)š‘…2
This is exactly the normalization equation. To solve the equation, firstly, it was assume that
(R) =
š“š‘£š‘’š‘Ÿš‘Žš‘”š‘’ š“š‘Ÿš‘Ÿš‘–š‘£š‘Žš‘™ š‘…š‘Žš‘”š‘’ (šœ†)
š“š‘£š‘’š‘Ÿš‘Žš‘”š‘’ š‘ š‘’š‘Ÿš‘£š‘–š‘š‘’ š‘Ÿš‘Žš‘”š‘’ (šœ‡)
which is known as the utilization factor. From the equilibrium equation of state 0, we have:
R1 = Rp0 ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦. Equation 25
When equation 25 was substituted into the equilibrium equation of state 1, then:
Ī»p0 + Āµp2 = (Ī» + Āµ)Rp0
=
šœ†2
šœ‡
p0 ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦.. Equation 26
That is
Āµp2 =
šœ†2
šœ‡
p0 ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦. Equation 27
Therefore,
p2 = R2
p0 ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦. Equation 28
Generally,
pk = Rk
p0 ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦. Equation 29
Since
āˆ‘āˆž
š‘›=0 pn = 1 ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦. Equation 30
Using (1.29), we can replace pk by R0. Then
āˆ‘āˆž
š‘›=0 Rn
p0 = 1ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦.. Equation 31
That is
1
1āˆ’š‘…
p0 = 1
p0 = 1 ā€“ Rā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦. Equation 32
Moreover, for any k,
pk = Rk
(1 āˆ’R) ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦. Equation 33
Finally is the limiting probability pk in the M/M/1 system. The expected queue length L is given by
E(L) = āˆ‘ i. pi
āˆž
i=0
= āˆ‘ i. Ri
āˆž
i=0
(1 āˆ’ R)
= R(1 āˆ’ R) āˆ‘ i. Ri
āˆž
i=0
= R(1 āˆ’ R) (āˆ‘怖i. Ri)i
āˆž
i=1
怗
= R(1-R) (
1
1āˆ’R
)i
=
R
1āˆ’R
..............................Equation 34 (Culled from Adeniran and Kanyio, 2019)
3. Results and Discussion
3.1. Traffic Survey
3.1.1 Stopping time of shuttle bus
Stopping time refers to the total time duration the shuttle bus spends at the bus stop. The stopping time is made up of:
a) The boarding stop time ā€œAā€: This is also made up of the time taken to close the door = 12 seconds; time taken by the
driver to check the traffic before take-off = 5 seconds; and time taken to park the bus and open the bus for commuters
= 5 seconds.
A = (12+5+5) = 22 seconds
b) The average boarding time per passenger = ā€œB1ā€ = 17 seconds
c) Number of passengers boarding = n1 = 18 passengers.
Copyright Ā© CC-BY-NC 2019, BJMSR
www.cribfb.com/journal/index.php/BJMSR Bangladesh Journal of Multidisciplinary Scientific Research Vol. 1, No. 2; 2019
52
Mathematically, stopping time T = A + B1* n1
Stopping Time = (22 + (17*18)) = (22+306) = 328 seconds
Stopping Time = 5.47 minutes
3.2 Waiting Time
This is the length of time spent by the passengers at the bus stop before boarding a bus. It is also referred to as Delay. The
queuing theory is employed in this study.
a) Average arrival rate (Ī») = 226 passengers/hour
Ī» =
226
3600
= 0.0628
b) Average service rate (Ī¼) = 243 passengers/hour
Ī¼ =
243
3600
= 0.0675
c) Average interval between arrival =
1
Ī»
=
1
0.0628
= 15.924 Seconds
d) Average interval between service rate =
1
Ī¼
=
1
0.0675
= 14.815 Seconds
e) Average queue length =
šœ†2
šœ‡(šœ‡āˆ’šœ†)
=
0.06282
0.0675(0.0675āˆ’0.0628)
= =
0.0039
0.00032
= 12.19 Passengers
f) Average waiting time in the queue =
Ī»
šœ‡(šœ‡āˆ’šœ†)
=
0.0628
0.0675(0.0675āˆ’0.0628)
= =
0.0628
0.00032
= 196.25 Seconds = 3.27 Minutes
g) Average time spent in the system (bus stop) =
1
Ī¼āˆ’Ī»
=
1
0.0675 āˆ’ 0.0628
= 212.76 Seconds = 3.55 Minutes
h) Efficiency of shuttle bus operation based on bus stop utilization (R) =
šœ†
šœ‡
R =
0.0628
0.0675
= 0.93
It is important to note that the Utilization factor is less than 1(R< 1), hence the performance of University transport bus
shuttle is 93 percent which indicates a very good performance such that the supply of shuttle bus in FUTA is capable of meeting
the demand.
4. Conclusion and Recommendation
This study has examined the performance of University transport bus shuttle based on utilization using a Single-server queue
system which occur if arrival and service rate is Poisson distributed (single queue) (M/M/1) queue. It is concluded that the
performance of University transport bus shuttle is 93 percent which indicates a very good performance such that the supply of
shuttle bus in FUTA is capable of meeting the demand. This result is very close to that of Sidiq (2019) which finds that the
performance of University transport bus shuttle is 96.6 percent. This study can be improved upon by examining the peak and
off-peak period of traffic in the two major corridors (North gate and South gate) of FUTA, the economic cost of operating bus
shuttle services can also be examined.
References
Adan, I., and Resing, J. (2015). Queuing Systems. Department of Mathematics and Computer
Science, Eindhoven University of Technology, Netherlands, 2015.
Adanikin, A., Olutaiwo, A., and Obafemi, T. (2017). Performance Study of University of Ado Ekiti (UNAD) Transit Shuttle
Buses. American Journal of Traffic and Transportation Engineering, 2(5): 67-73 doi: 10.11648/j.ajtte.20170205.12.
Ademoh, N. A., and Anosike, E. N. (2014). Queuing Modelling of Air Transport Passengers of Nnamdi Azikiwe International
Airport Abuja, Nigeria Using Multi Server Approach. Middle East Journal of Scientific Research 21 (12): 2326-2338,
2014 doi: 10.5829/idosi.mejsr.2014.21.12.21807.
Adeniran, A. O., and Kanyio, O. A. (2019). Quantitative Model of Single-Server Queue System. Indian Journal of Engineering,
16, 177-183.
Aderamo, A. J. (2012). Urban transportation problems and challenges in Nigeria: A plannerā€™s view. Prime Journals. 2(3), 198-
203.
Copyright Ā© CC-BY-NC 2019, BJMSR
www.cribfb.com/journal/index.php/BJMSR Bangladesh Journal of Multidisciplinary Scientific Research Vol. 1, No. 2; 2019
53
Bastani P. (2009). A Queuing Model of Hospital Congestion. MSc. Thesis submitted to Department of Mathematics Simon
Fraser University
Copper, R. B. (1981). Introduction to Queuing Theory, 2nd
Edition North Holland.
Gross, D., and Harris, C. M. (1985). Fundamentals of Queuing Theory, 2nd
ed. John Wiley & Sons: New York.
Jain, J. L., Mohanty, S. G., and Bohm, W. (2007). A Course on Queuing Models, Statistics: A series of Textbooks and
Monographs, Chapman & Hall/CRC, Taylor & Francis Group.
Sidiq, O. Ben. (2019). Single-Server Queue System of Shuttle Bus Performance: Federal University of Technology Akure as
Case Study. American International Journal of Multidisciplinary Scientific Research, 5(3), 9-14
Sztrik, J. (2012). Basic Queuing Theory. University of Debrecen, Faculty of Informatics.
Trani, A., A. (2011). Introduction to Transportation Engineering, Introduction to Queuing Theory. Virginia Polytechnic
Institute and State University, US, Pp: 2-46.
Copyrights
Copyright for this article is retained by the author(s), with first publication rights granted to the journal. This is an open-access
article distributed under the terms and conditions of the Creative Commons Attribution license
(http://creativecommons.org/licenses/by/4.0/).

More Related Content

Similar to Application Of Single-Server Queue System In Performance Analysis Of Shuttle Bus Operation A Case Study Of Federal University Of Technology Akure

Accessibility analysis of public transport networks in urban areas
Accessibility analysis of public transport networks in urban areasAccessibility analysis of public transport networks in urban areas
Accessibility analysis of public transport networks in urban areas
Mayank Bansal
Ā 
Ant Colony Optimisation Approaches For The Transportation Assignment Problem
Ant Colony Optimisation Approaches For The Transportation Assignment ProblemAnt Colony Optimisation Approaches For The Transportation Assignment Problem
Ant Colony Optimisation Approaches For The Transportation Assignment Problem
Sara Parker
Ā 
A Computational Study Of Traffic Assignment Algorithms
A Computational Study Of Traffic Assignment AlgorithmsA Computational Study Of Traffic Assignment Algorithms
A Computational Study Of Traffic Assignment Algorithms
Nicole Adams
Ā 
A Computational Study Of Traffic Assignment Algorithms
A Computational Study Of Traffic Assignment AlgorithmsA Computational Study Of Traffic Assignment Algorithms
A Computational Study Of Traffic Assignment Algorithms
Alicia Buske
Ā 
A Review on Performance of Toll Plaza by using Queuing Theory
A Review on Performance of Toll Plaza by using Queuing TheoryA Review on Performance of Toll Plaza by using Queuing Theory
A Review on Performance of Toll Plaza by using Queuing Theory
ijtsrd
Ā 
A comparison between M/M/1 and M/D/1 queuing models to vehicular traffic atKa...
A comparison between M/M/1 and M/D/1 queuing models to vehicular traffic atKa...A comparison between M/M/1 and M/D/1 queuing models to vehicular traffic atKa...
A comparison between M/M/1 and M/D/1 queuing models to vehicular traffic atKa...
IOSR Journals
Ā 
Ieeepro techno solutions 2013 ieee embedded project - emergency management ...
Ieeepro techno solutions   2013 ieee embedded project - emergency management ...Ieeepro techno solutions   2013 ieee embedded project - emergency management ...
Ieeepro techno solutions 2013 ieee embedded project - emergency management ...
srinivasanece7
Ā 
Adaptive traffic lights based on traffic flow prediction using machine learni...
Adaptive traffic lights based on traffic flow prediction using machine learni...Adaptive traffic lights based on traffic flow prediction using machine learni...
Adaptive traffic lights based on traffic flow prediction using machine learni...
IJECEIAES
Ā 
PLANNING FOR FACILITY NEEDS IN TRAIN STATION BASED ON COMPARISON OF CONNECTIN...
PLANNING FOR FACILITY NEEDS IN TRAIN STATION BASED ON COMPARISON OF CONNECTIN...PLANNING FOR FACILITY NEEDS IN TRAIN STATION BASED ON COMPARISON OF CONNECTIN...
PLANNING FOR FACILITY NEEDS IN TRAIN STATION BASED ON COMPARISON OF CONNECTIN...
IAEME Publication
Ā 
TRBAM2020 Public Transit posters - University of Twente.
TRBAM2020 Public Transit posters - University of Twente.TRBAM2020 Public Transit posters - University of Twente.
TRBAM2020 Public Transit posters - University of Twente.
Konstantinos Gkiotsalitis
Ā 
0505.pdf
0505.pdf0505.pdf
Sincronismo no sistema de hong kong
Sincronismo no sistema de hong kongSincronismo no sistema de hong kong
Sincronismo no sistema de hong kong
Tiago Moreira
Ā 
710201909
710201909710201909
710201909
IJRAT
Ā 
A New Paradigm in User Equilibrium-Application in Managed Lane Pricing
A New Paradigm in User Equilibrium-Application in Managed Lane PricingA New Paradigm in User Equilibrium-Application in Managed Lane Pricing
A New Paradigm in User Equilibrium-Application in Managed Lane Pricing
CSCJournals
Ā 
Comparative study of traffic signals with and without signal coordination of ...
Comparative study of traffic signals with and without signal coordination of ...Comparative study of traffic signals with and without signal coordination of ...
Comparative study of traffic signals with and without signal coordination of ...
IRJET Journal
Ā 
Comparative study of traffic signals with and without signal coordination of ...
Comparative study of traffic signals with and without signal coordination of ...Comparative study of traffic signals with and without signal coordination of ...
Comparative study of traffic signals with and without signal coordination of ...
IRJET Journal
Ā 
The Study of Bus Rapid Transit (BRT) System at University Road Peshawar, Paki...
The Study of Bus Rapid Transit (BRT) System at University Road Peshawar, Paki...The Study of Bus Rapid Transit (BRT) System at University Road Peshawar, Paki...
The Study of Bus Rapid Transit (BRT) System at University Road Peshawar, Paki...
IOSR Journals
Ā 
A Frequency Based Transit Assignment Model That Considers Online Information ...
A Frequency Based Transit Assignment Model That Considers Online Information ...A Frequency Based Transit Assignment Model That Considers Online Information ...
A Frequency Based Transit Assignment Model That Considers Online Information ...
Scott Faria
Ā 
MODERN TECHNOLOGIES USE IN TRANSPORTATION ENGINEERING
MODERN TECHNOLOGIES USE IN TRANSPORTATION ENGINEERINGMODERN TECHNOLOGIES USE IN TRANSPORTATION ENGINEERING
MODERN TECHNOLOGIES USE IN TRANSPORTATION ENGINEERING
IRJET Journal
Ā 
ENHANCING URBAN ROAD NETWORK EFFICIENCY IN KERALA, INDIA: A COMPREHENSIVE ANA...
ENHANCING URBAN ROAD NETWORK EFFICIENCY IN KERALA, INDIA: A COMPREHENSIVE ANA...ENHANCING URBAN ROAD NETWORK EFFICIENCY IN KERALA, INDIA: A COMPREHENSIVE ANA...
ENHANCING URBAN ROAD NETWORK EFFICIENCY IN KERALA, INDIA: A COMPREHENSIVE ANA...
IRJET Journal
Ā 

Similar to Application Of Single-Server Queue System In Performance Analysis Of Shuttle Bus Operation A Case Study Of Federal University Of Technology Akure (20)

Accessibility analysis of public transport networks in urban areas
Accessibility analysis of public transport networks in urban areasAccessibility analysis of public transport networks in urban areas
Accessibility analysis of public transport networks in urban areas
Ā 
Ant Colony Optimisation Approaches For The Transportation Assignment Problem
Ant Colony Optimisation Approaches For The Transportation Assignment ProblemAnt Colony Optimisation Approaches For The Transportation Assignment Problem
Ant Colony Optimisation Approaches For The Transportation Assignment Problem
Ā 
A Computational Study Of Traffic Assignment Algorithms
A Computational Study Of Traffic Assignment AlgorithmsA Computational Study Of Traffic Assignment Algorithms
A Computational Study Of Traffic Assignment Algorithms
Ā 
A Computational Study Of Traffic Assignment Algorithms
A Computational Study Of Traffic Assignment AlgorithmsA Computational Study Of Traffic Assignment Algorithms
A Computational Study Of Traffic Assignment Algorithms
Ā 
A Review on Performance of Toll Plaza by using Queuing Theory
A Review on Performance of Toll Plaza by using Queuing TheoryA Review on Performance of Toll Plaza by using Queuing Theory
A Review on Performance of Toll Plaza by using Queuing Theory
Ā 
A comparison between M/M/1 and M/D/1 queuing models to vehicular traffic atKa...
A comparison between M/M/1 and M/D/1 queuing models to vehicular traffic atKa...A comparison between M/M/1 and M/D/1 queuing models to vehicular traffic atKa...
A comparison between M/M/1 and M/D/1 queuing models to vehicular traffic atKa...
Ā 
Ieeepro techno solutions 2013 ieee embedded project - emergency management ...
Ieeepro techno solutions   2013 ieee embedded project - emergency management ...Ieeepro techno solutions   2013 ieee embedded project - emergency management ...
Ieeepro techno solutions 2013 ieee embedded project - emergency management ...
Ā 
Adaptive traffic lights based on traffic flow prediction using machine learni...
Adaptive traffic lights based on traffic flow prediction using machine learni...Adaptive traffic lights based on traffic flow prediction using machine learni...
Adaptive traffic lights based on traffic flow prediction using machine learni...
Ā 
PLANNING FOR FACILITY NEEDS IN TRAIN STATION BASED ON COMPARISON OF CONNECTIN...
PLANNING FOR FACILITY NEEDS IN TRAIN STATION BASED ON COMPARISON OF CONNECTIN...PLANNING FOR FACILITY NEEDS IN TRAIN STATION BASED ON COMPARISON OF CONNECTIN...
PLANNING FOR FACILITY NEEDS IN TRAIN STATION BASED ON COMPARISON OF CONNECTIN...
Ā 
TRBAM2020 Public Transit posters - University of Twente.
TRBAM2020 Public Transit posters - University of Twente.TRBAM2020 Public Transit posters - University of Twente.
TRBAM2020 Public Transit posters - University of Twente.
Ā 
0505.pdf
0505.pdf0505.pdf
0505.pdf
Ā 
Sincronismo no sistema de hong kong
Sincronismo no sistema de hong kongSincronismo no sistema de hong kong
Sincronismo no sistema de hong kong
Ā 
710201909
710201909710201909
710201909
Ā 
A New Paradigm in User Equilibrium-Application in Managed Lane Pricing
A New Paradigm in User Equilibrium-Application in Managed Lane PricingA New Paradigm in User Equilibrium-Application in Managed Lane Pricing
A New Paradigm in User Equilibrium-Application in Managed Lane Pricing
Ā 
Comparative study of traffic signals with and without signal coordination of ...
Comparative study of traffic signals with and without signal coordination of ...Comparative study of traffic signals with and without signal coordination of ...
Comparative study of traffic signals with and without signal coordination of ...
Ā 
Comparative study of traffic signals with and without signal coordination of ...
Comparative study of traffic signals with and without signal coordination of ...Comparative study of traffic signals with and without signal coordination of ...
Comparative study of traffic signals with and without signal coordination of ...
Ā 
The Study of Bus Rapid Transit (BRT) System at University Road Peshawar, Paki...
The Study of Bus Rapid Transit (BRT) System at University Road Peshawar, Paki...The Study of Bus Rapid Transit (BRT) System at University Road Peshawar, Paki...
The Study of Bus Rapid Transit (BRT) System at University Road Peshawar, Paki...
Ā 
A Frequency Based Transit Assignment Model That Considers Online Information ...
A Frequency Based Transit Assignment Model That Considers Online Information ...A Frequency Based Transit Assignment Model That Considers Online Information ...
A Frequency Based Transit Assignment Model That Considers Online Information ...
Ā 
MODERN TECHNOLOGIES USE IN TRANSPORTATION ENGINEERING
MODERN TECHNOLOGIES USE IN TRANSPORTATION ENGINEERINGMODERN TECHNOLOGIES USE IN TRANSPORTATION ENGINEERING
MODERN TECHNOLOGIES USE IN TRANSPORTATION ENGINEERING
Ā 
ENHANCING URBAN ROAD NETWORK EFFICIENCY IN KERALA, INDIA: A COMPREHENSIVE ANA...
ENHANCING URBAN ROAD NETWORK EFFICIENCY IN KERALA, INDIA: A COMPREHENSIVE ANA...ENHANCING URBAN ROAD NETWORK EFFICIENCY IN KERALA, INDIA: A COMPREHENSIVE ANA...
ENHANCING URBAN ROAD NETWORK EFFICIENCY IN KERALA, INDIA: A COMPREHENSIVE ANA...
Ā 

More from Tracy Drey

2007 Ap World History Dbq Essay Example. Online assignment writing service.
2007 Ap World History Dbq Essay Example. Online assignment writing service.2007 Ap World History Dbq Essay Example. Online assignment writing service.
2007 Ap World History Dbq Essay Example. Online assignment writing service.
Tracy Drey
Ā 
20Th Century History Essay Questions. Online assignment writing service.
20Th Century History Essay Questions. Online assignment writing service.20Th Century History Essay Questions. Online assignment writing service.
20Th Century History Essay Questions. Online assignment writing service.
Tracy Drey
Ā 
5 Paragraph Essay Svenska. Online assignment writing service.
5 Paragraph Essay Svenska. Online assignment writing service.5 Paragraph Essay Svenska. Online assignment writing service.
5 Paragraph Essay Svenska. Online assignment writing service.
Tracy Drey
Ā 
1234 Essay Help. Online assignment writing service.
1234 Essay Help. Online assignment writing service.1234 Essay Help. Online assignment writing service.
1234 Essay Help. Online assignment writing service.
Tracy Drey
Ā 
A DollS House Critical Analysis Essay. Online assignment writing service.
A DollS House Critical Analysis Essay. Online assignment writing service.A DollS House Critical Analysis Essay. Online assignment writing service.
A DollS House Critical Analysis Essay. Online assignment writing service.
Tracy Drey
Ā 
3 Places I Would Like To Visit Essay. Online assignment writing service.
3 Places I Would Like To Visit Essay. Online assignment writing service.3 Places I Would Like To Visit Essay. Online assignment writing service.
3 Places I Would Like To Visit Essay. Online assignment writing service.
Tracy Drey
Ā 
A Essay On Pollution. Online assignment writing service.
A Essay On Pollution. Online assignment writing service.A Essay On Pollution. Online assignment writing service.
A Essay On Pollution. Online assignment writing service.
Tracy Drey
Ā 
6 Paragraph Essay Example. Online assignment writing service.
6 Paragraph Essay Example. Online assignment writing service.6 Paragraph Essay Example. Online assignment writing service.
6 Paragraph Essay Example. Online assignment writing service.
Tracy Drey
Ā 
3Hrc Essay. Online assignment writing service.
3Hrc Essay. Online assignment writing service.3Hrc Essay. Online assignment writing service.
3Hrc Essay. Online assignment writing service.
Tracy Drey
Ā 
15 Page Essay Example. Online assignment writing service.
15 Page Essay Example. Online assignment writing service.15 Page Essay Example. Online assignment writing service.
15 Page Essay Example. Online assignment writing service.
Tracy Drey
Ā 
5 Paragraph Essay Template Elementary. Online assignment writing service.
5 Paragraph Essay Template Elementary. Online assignment writing service.5 Paragraph Essay Template Elementary. Online assignment writing service.
5 Paragraph Essay Template Elementary. Online assignment writing service.
Tracy Drey
Ā 
1984 Research Essay Thesis. Online assignment writing service.
1984 Research Essay Thesis. Online assignment writing service.1984 Research Essay Thesis. Online assignment writing service.
1984 Research Essay Thesis. Online assignment writing service.
Tracy Drey
Ā 
A Level Art Essay Structure. Online assignment writing service.
A Level Art Essay Structure. Online assignment writing service.A Level Art Essay Structure. Online assignment writing service.
A Level Art Essay Structure. Online assignment writing service.
Tracy Drey
Ā 
4 Paragraph Essay. Online assignment writing service.
4 Paragraph Essay. Online assignment writing service.4 Paragraph Essay. Online assignment writing service.
4 Paragraph Essay. Online assignment writing service.
Tracy Drey
Ā 
A Short Essay On Diwali In English. Online assignment writing service.
A Short Essay On Diwali In English. Online assignment writing service.A Short Essay On Diwali In English. Online assignment writing service.
A Short Essay On Diwali In English. Online assignment writing service.
Tracy Drey
Ā 
13 Reasons Why Essay. Online assignment writing service.
13 Reasons Why Essay. Online assignment writing service.13 Reasons Why Essay. Online assignment writing service.
13 Reasons Why Essay. Online assignment writing service.
Tracy Drey
Ā 
1012 Sat Essay. Online assignment writing service.
1012 Sat Essay. Online assignment writing service.1012 Sat Essay. Online assignment writing service.
1012 Sat Essay. Online assignment writing service.
Tracy Drey
Ā 
A Essay About My Family In Spanish. Online assignment writing service.
A Essay About My Family In Spanish. Online assignment writing service.A Essay About My Family In Spanish. Online assignment writing service.
A Essay About My Family In Spanish. Online assignment writing service.
Tracy Drey
Ā 
2004 Ap Lit Essay Examples. Online assignment writing service.
2004 Ap Lit Essay Examples. Online assignment writing service.2004 Ap Lit Essay Examples. Online assignment writing service.
2004 Ap Lit Essay Examples. Online assignment writing service.
Tracy Drey
Ā 
14 Paragraph Essay. Online assignment writing service.
14 Paragraph Essay. Online assignment writing service.14 Paragraph Essay. Online assignment writing service.
14 Paragraph Essay. Online assignment writing service.
Tracy Drey
Ā 

More from Tracy Drey (20)

2007 Ap World History Dbq Essay Example. Online assignment writing service.
2007 Ap World History Dbq Essay Example. Online assignment writing service.2007 Ap World History Dbq Essay Example. Online assignment writing service.
2007 Ap World History Dbq Essay Example. Online assignment writing service.
Ā 
20Th Century History Essay Questions. Online assignment writing service.
20Th Century History Essay Questions. Online assignment writing service.20Th Century History Essay Questions. Online assignment writing service.
20Th Century History Essay Questions. Online assignment writing service.
Ā 
5 Paragraph Essay Svenska. Online assignment writing service.
5 Paragraph Essay Svenska. Online assignment writing service.5 Paragraph Essay Svenska. Online assignment writing service.
5 Paragraph Essay Svenska. Online assignment writing service.
Ā 
1234 Essay Help. Online assignment writing service.
1234 Essay Help. Online assignment writing service.1234 Essay Help. Online assignment writing service.
1234 Essay Help. Online assignment writing service.
Ā 
A DollS House Critical Analysis Essay. Online assignment writing service.
A DollS House Critical Analysis Essay. Online assignment writing service.A DollS House Critical Analysis Essay. Online assignment writing service.
A DollS House Critical Analysis Essay. Online assignment writing service.
Ā 
3 Places I Would Like To Visit Essay. Online assignment writing service.
3 Places I Would Like To Visit Essay. Online assignment writing service.3 Places I Would Like To Visit Essay. Online assignment writing service.
3 Places I Would Like To Visit Essay. Online assignment writing service.
Ā 
A Essay On Pollution. Online assignment writing service.
A Essay On Pollution. Online assignment writing service.A Essay On Pollution. Online assignment writing service.
A Essay On Pollution. Online assignment writing service.
Ā 
6 Paragraph Essay Example. Online assignment writing service.
6 Paragraph Essay Example. Online assignment writing service.6 Paragraph Essay Example. Online assignment writing service.
6 Paragraph Essay Example. Online assignment writing service.
Ā 
3Hrc Essay. Online assignment writing service.
3Hrc Essay. Online assignment writing service.3Hrc Essay. Online assignment writing service.
3Hrc Essay. Online assignment writing service.
Ā 
15 Page Essay Example. Online assignment writing service.
15 Page Essay Example. Online assignment writing service.15 Page Essay Example. Online assignment writing service.
15 Page Essay Example. Online assignment writing service.
Ā 
5 Paragraph Essay Template Elementary. Online assignment writing service.
5 Paragraph Essay Template Elementary. Online assignment writing service.5 Paragraph Essay Template Elementary. Online assignment writing service.
5 Paragraph Essay Template Elementary. Online assignment writing service.
Ā 
1984 Research Essay Thesis. Online assignment writing service.
1984 Research Essay Thesis. Online assignment writing service.1984 Research Essay Thesis. Online assignment writing service.
1984 Research Essay Thesis. Online assignment writing service.
Ā 
A Level Art Essay Structure. Online assignment writing service.
A Level Art Essay Structure. Online assignment writing service.A Level Art Essay Structure. Online assignment writing service.
A Level Art Essay Structure. Online assignment writing service.
Ā 
4 Paragraph Essay. Online assignment writing service.
4 Paragraph Essay. Online assignment writing service.4 Paragraph Essay. Online assignment writing service.
4 Paragraph Essay. Online assignment writing service.
Ā 
A Short Essay On Diwali In English. Online assignment writing service.
A Short Essay On Diwali In English. Online assignment writing service.A Short Essay On Diwali In English. Online assignment writing service.
A Short Essay On Diwali In English. Online assignment writing service.
Ā 
13 Reasons Why Essay. Online assignment writing service.
13 Reasons Why Essay. Online assignment writing service.13 Reasons Why Essay. Online assignment writing service.
13 Reasons Why Essay. Online assignment writing service.
Ā 
1012 Sat Essay. Online assignment writing service.
1012 Sat Essay. Online assignment writing service.1012 Sat Essay. Online assignment writing service.
1012 Sat Essay. Online assignment writing service.
Ā 
A Essay About My Family In Spanish. Online assignment writing service.
A Essay About My Family In Spanish. Online assignment writing service.A Essay About My Family In Spanish. Online assignment writing service.
A Essay About My Family In Spanish. Online assignment writing service.
Ā 
2004 Ap Lit Essay Examples. Online assignment writing service.
2004 Ap Lit Essay Examples. Online assignment writing service.2004 Ap Lit Essay Examples. Online assignment writing service.
2004 Ap Lit Essay Examples. Online assignment writing service.
Ā 
14 Paragraph Essay. Online assignment writing service.
14 Paragraph Essay. Online assignment writing service.14 Paragraph Essay. Online assignment writing service.
14 Paragraph Essay. Online assignment writing service.
Ā 

Recently uploaded

Educational Technology in the Health Sciences
Educational Technology in the Health SciencesEducational Technology in the Health Sciences
Educational Technology in the Health Sciences
Iris Thiele Isip-Tan
Ā 
Bonku-Babus-Friend by Sathyajith Ray (9)
Bonku-Babus-Friend by Sathyajith Ray  (9)Bonku-Babus-Friend by Sathyajith Ray  (9)
Bonku-Babus-Friend by Sathyajith Ray (9)
nitinpv4ai
Ā 
A Visual Guide to 1 Samuel | A Tale of Two Hearts
A Visual Guide to 1 Samuel | A Tale of Two HeartsA Visual Guide to 1 Samuel | A Tale of Two Hearts
A Visual Guide to 1 Samuel | A Tale of Two Hearts
Steve Thomason
Ā 
Philippine Edukasyong Pantahanan at Pangkabuhayan (EPP) Curriculum
Philippine Edukasyong Pantahanan at Pangkabuhayan (EPP) CurriculumPhilippine Edukasyong Pantahanan at Pangkabuhayan (EPP) Curriculum
Philippine Edukasyong Pantahanan at Pangkabuhayan (EPP) Curriculum
MJDuyan
Ā 
NEWSPAPERS - QUESTION 1 - REVISION POWERPOINT.pptx
NEWSPAPERS - QUESTION 1 - REVISION POWERPOINT.pptxNEWSPAPERS - QUESTION 1 - REVISION POWERPOINT.pptx
NEWSPAPERS - QUESTION 1 - REVISION POWERPOINT.pptx
iammrhaywood
Ā 
RESULTS OF THE EVALUATION QUESTIONNAIRE.pptx
RESULTS OF THE EVALUATION QUESTIONNAIRE.pptxRESULTS OF THE EVALUATION QUESTIONNAIRE.pptx
RESULTS OF THE EVALUATION QUESTIONNAIRE.pptx
zuzanka
Ā 
Elevate Your Nonprofit's Online Presence_ A Guide to Effective SEO Strategies...
Elevate Your Nonprofit's Online Presence_ A Guide to Effective SEO Strategies...Elevate Your Nonprofit's Online Presence_ A Guide to Effective SEO Strategies...
Elevate Your Nonprofit's Online Presence_ A Guide to Effective SEO Strategies...
TechSoup
Ā 
PrƩsentationvvvvvvvvvvvvvvvvvvvvvvvvvvvv2.pptx
PrƩsentationvvvvvvvvvvvvvvvvvvvvvvvvvvvv2.pptxPrƩsentationvvvvvvvvvvvvvvvvvvvvvvvvvvvv2.pptx
PrƩsentationvvvvvvvvvvvvvvvvvvvvvvvvvvvv2.pptx
siemaillard
Ā 
Jemison, MacLaughlin, and Majumder "Broadening Pathways for Editors and Authors"
Jemison, MacLaughlin, and Majumder "Broadening Pathways for Editors and Authors"Jemison, MacLaughlin, and Majumder "Broadening Pathways for Editors and Authors"
Jemison, MacLaughlin, and Majumder "Broadening Pathways for Editors and Authors"
National Information Standards Organization (NISO)
Ā 
What is Digital Literacy? A guest blog from Andy McLaughlin, University of Ab...
What is Digital Literacy? A guest blog from Andy McLaughlin, University of Ab...What is Digital Literacy? A guest blog from Andy McLaughlin, University of Ab...
What is Digital Literacy? A guest blog from Andy McLaughlin, University of Ab...
GeorgeMilliken2
Ā 
RHEOLOGY Physical pharmaceutics-II notes for B.pharm 4th sem students
RHEOLOGY Physical pharmaceutics-II notes for B.pharm 4th sem studentsRHEOLOGY Physical pharmaceutics-II notes for B.pharm 4th sem students
RHEOLOGY Physical pharmaceutics-II notes for B.pharm 4th sem students
Himanshu Rai
Ā 
How to Predict Vendor Bill Product in Odoo 17
How to Predict Vendor Bill Product in Odoo 17How to Predict Vendor Bill Product in Odoo 17
How to Predict Vendor Bill Product in Odoo 17
Celine George
Ā 
Oliver Asks for More by Charles Dickens (9)
Oliver Asks for More by Charles Dickens (9)Oliver Asks for More by Charles Dickens (9)
Oliver Asks for More by Charles Dickens (9)
nitinpv4ai
Ā 
CIS 4200-02 Group 1 Final Project Report (1).pdf
CIS 4200-02 Group 1 Final Project Report (1).pdfCIS 4200-02 Group 1 Final Project Report (1).pdf
CIS 4200-02 Group 1 Final Project Report (1).pdf
blueshagoo1
Ā 
Juneteenth Freedom Day 2024 David Douglas School District
Juneteenth Freedom Day 2024 David Douglas School DistrictJuneteenth Freedom Day 2024 David Douglas School District
Juneteenth Freedom Day 2024 David Douglas School District
David Douglas School District
Ā 
How Barcodes Can Be Leveraged Within Odoo 17
How Barcodes Can Be Leveraged Within Odoo 17How Barcodes Can Be Leveraged Within Odoo 17
How Barcodes Can Be Leveraged Within Odoo 17
Celine George
Ā 
Ł…ŲµŲ­Ł Ų§Ł„Ł‚Ų±Ų§Ų”Ų§ŲŖ Ų§Ł„Ų¹Ų“Ų± Ų£Ų¹ŲÆ Ų£Ų­Ų±Ł Ų§Ł„Ų®Ł„Ų§Ł Ų³Ł…ŁŠŲ± ŲØŲ³ŁŠŁˆŁ†ŁŠ.pdf
Ł…ŲµŲ­Ł Ų§Ł„Ł‚Ų±Ų§Ų”Ų§ŲŖ Ų§Ł„Ų¹Ų“Ų±   Ų£Ų¹ŲÆ Ų£Ų­Ų±Ł Ų§Ł„Ų®Ł„Ų§Ł Ų³Ł…ŁŠŲ± ŲØŲ³ŁŠŁˆŁ†ŁŠ.pdfŁ…ŲµŲ­Ł Ų§Ł„Ł‚Ų±Ų§Ų”Ų§ŲŖ Ų§Ł„Ų¹Ų“Ų±   Ų£Ų¹ŲÆ Ų£Ų­Ų±Ł Ų§Ł„Ų®Ł„Ų§Ł Ų³Ł…ŁŠŲ± ŲØŲ³ŁŠŁˆŁ†ŁŠ.pdf
Ł…ŲµŲ­Ł Ų§Ł„Ł‚Ų±Ų§Ų”Ų§ŲŖ Ų§Ł„Ų¹Ų“Ų± Ų£Ų¹ŲÆ Ų£Ų­Ų±Ł Ų§Ł„Ų®Ł„Ų§Ł Ų³Ł…ŁŠŲ± ŲØŲ³ŁŠŁˆŁ†ŁŠ.pdf
Ų³Ł…ŁŠŲ± ŲØŲ³ŁŠŁˆŁ†ŁŠ
Ā 
Haunted Houses by H W Longfellow for class 10
Haunted Houses by H W Longfellow for class 10Haunted Houses by H W Longfellow for class 10
Haunted Houses by H W Longfellow for class 10
nitinpv4ai
Ā 
Nutrition Inc FY 2024, 4 - Hour Training
Nutrition Inc FY 2024, 4 - Hour TrainingNutrition Inc FY 2024, 4 - Hour Training
Nutrition Inc FY 2024, 4 - Hour Training
melliereed
Ā 
BƀI Tįŗ¬P Bį»” TRį»¢ TIįŗ¾NG ANH Lį»šP 9 Cįŗ¢ NĂM - GLOBAL SUCCESS - NĂM Hį»ŒC 2024-2025 - ...
BƀI Tįŗ¬P Bį»” TRį»¢ TIįŗ¾NG ANH Lį»šP 9 Cįŗ¢ NĂM - GLOBAL SUCCESS - NĂM Hį»ŒC 2024-2025 - ...BƀI Tįŗ¬P Bį»” TRį»¢ TIįŗ¾NG ANH Lį»šP 9 Cįŗ¢ NĂM - GLOBAL SUCCESS - NĂM Hį»ŒC 2024-2025 - ...
BƀI Tįŗ¬P Bį»” TRį»¢ TIįŗ¾NG ANH Lį»šP 9 Cįŗ¢ NĂM - GLOBAL SUCCESS - NĂM Hį»ŒC 2024-2025 - ...
Nguyen Thanh Tu Collection
Ā 

Recently uploaded (20)

Educational Technology in the Health Sciences
Educational Technology in the Health SciencesEducational Technology in the Health Sciences
Educational Technology in the Health Sciences
Ā 
Bonku-Babus-Friend by Sathyajith Ray (9)
Bonku-Babus-Friend by Sathyajith Ray  (9)Bonku-Babus-Friend by Sathyajith Ray  (9)
Bonku-Babus-Friend by Sathyajith Ray (9)
Ā 
A Visual Guide to 1 Samuel | A Tale of Two Hearts
A Visual Guide to 1 Samuel | A Tale of Two HeartsA Visual Guide to 1 Samuel | A Tale of Two Hearts
A Visual Guide to 1 Samuel | A Tale of Two Hearts
Ā 
Philippine Edukasyong Pantahanan at Pangkabuhayan (EPP) Curriculum
Philippine Edukasyong Pantahanan at Pangkabuhayan (EPP) CurriculumPhilippine Edukasyong Pantahanan at Pangkabuhayan (EPP) Curriculum
Philippine Edukasyong Pantahanan at Pangkabuhayan (EPP) Curriculum
Ā 
NEWSPAPERS - QUESTION 1 - REVISION POWERPOINT.pptx
NEWSPAPERS - QUESTION 1 - REVISION POWERPOINT.pptxNEWSPAPERS - QUESTION 1 - REVISION POWERPOINT.pptx
NEWSPAPERS - QUESTION 1 - REVISION POWERPOINT.pptx
Ā 
RESULTS OF THE EVALUATION QUESTIONNAIRE.pptx
RESULTS OF THE EVALUATION QUESTIONNAIRE.pptxRESULTS OF THE EVALUATION QUESTIONNAIRE.pptx
RESULTS OF THE EVALUATION QUESTIONNAIRE.pptx
Ā 
Elevate Your Nonprofit's Online Presence_ A Guide to Effective SEO Strategies...
Elevate Your Nonprofit's Online Presence_ A Guide to Effective SEO Strategies...Elevate Your Nonprofit's Online Presence_ A Guide to Effective SEO Strategies...
Elevate Your Nonprofit's Online Presence_ A Guide to Effective SEO Strategies...
Ā 
PrƩsentationvvvvvvvvvvvvvvvvvvvvvvvvvvvv2.pptx
PrƩsentationvvvvvvvvvvvvvvvvvvvvvvvvvvvv2.pptxPrƩsentationvvvvvvvvvvvvvvvvvvvvvvvvvvvv2.pptx
PrƩsentationvvvvvvvvvvvvvvvvvvvvvvvvvvvv2.pptx
Ā 
Jemison, MacLaughlin, and Majumder "Broadening Pathways for Editors and Authors"
Jemison, MacLaughlin, and Majumder "Broadening Pathways for Editors and Authors"Jemison, MacLaughlin, and Majumder "Broadening Pathways for Editors and Authors"
Jemison, MacLaughlin, and Majumder "Broadening Pathways for Editors and Authors"
Ā 
What is Digital Literacy? A guest blog from Andy McLaughlin, University of Ab...
What is Digital Literacy? A guest blog from Andy McLaughlin, University of Ab...What is Digital Literacy? A guest blog from Andy McLaughlin, University of Ab...
What is Digital Literacy? A guest blog from Andy McLaughlin, University of Ab...
Ā 
RHEOLOGY Physical pharmaceutics-II notes for B.pharm 4th sem students
RHEOLOGY Physical pharmaceutics-II notes for B.pharm 4th sem studentsRHEOLOGY Physical pharmaceutics-II notes for B.pharm 4th sem students
RHEOLOGY Physical pharmaceutics-II notes for B.pharm 4th sem students
Ā 
How to Predict Vendor Bill Product in Odoo 17
How to Predict Vendor Bill Product in Odoo 17How to Predict Vendor Bill Product in Odoo 17
How to Predict Vendor Bill Product in Odoo 17
Ā 
Oliver Asks for More by Charles Dickens (9)
Oliver Asks for More by Charles Dickens (9)Oliver Asks for More by Charles Dickens (9)
Oliver Asks for More by Charles Dickens (9)
Ā 
CIS 4200-02 Group 1 Final Project Report (1).pdf
CIS 4200-02 Group 1 Final Project Report (1).pdfCIS 4200-02 Group 1 Final Project Report (1).pdf
CIS 4200-02 Group 1 Final Project Report (1).pdf
Ā 
Juneteenth Freedom Day 2024 David Douglas School District
Juneteenth Freedom Day 2024 David Douglas School DistrictJuneteenth Freedom Day 2024 David Douglas School District
Juneteenth Freedom Day 2024 David Douglas School District
Ā 
How Barcodes Can Be Leveraged Within Odoo 17
How Barcodes Can Be Leveraged Within Odoo 17How Barcodes Can Be Leveraged Within Odoo 17
How Barcodes Can Be Leveraged Within Odoo 17
Ā 
Ł…ŲµŲ­Ł Ų§Ł„Ł‚Ų±Ų§Ų”Ų§ŲŖ Ų§Ł„Ų¹Ų“Ų± Ų£Ų¹ŲÆ Ų£Ų­Ų±Ł Ų§Ł„Ų®Ł„Ų§Ł Ų³Ł…ŁŠŲ± ŲØŲ³ŁŠŁˆŁ†ŁŠ.pdf
Ł…ŲµŲ­Ł Ų§Ł„Ł‚Ų±Ų§Ų”Ų§ŲŖ Ų§Ł„Ų¹Ų“Ų±   Ų£Ų¹ŲÆ Ų£Ų­Ų±Ł Ų§Ł„Ų®Ł„Ų§Ł Ų³Ł…ŁŠŲ± ŲØŲ³ŁŠŁˆŁ†ŁŠ.pdfŁ…ŲµŲ­Ł Ų§Ł„Ł‚Ų±Ų§Ų”Ų§ŲŖ Ų§Ł„Ų¹Ų“Ų±   Ų£Ų¹ŲÆ Ų£Ų­Ų±Ł Ų§Ł„Ų®Ł„Ų§Ł Ų³Ł…ŁŠŲ± ŲØŲ³ŁŠŁˆŁ†ŁŠ.pdf
Ł…ŲµŲ­Ł Ų§Ł„Ł‚Ų±Ų§Ų”Ų§ŲŖ Ų§Ł„Ų¹Ų“Ų± Ų£Ų¹ŲÆ Ų£Ų­Ų±Ł Ų§Ł„Ų®Ł„Ų§Ł Ų³Ł…ŁŠŲ± ŲØŲ³ŁŠŁˆŁ†ŁŠ.pdf
Ā 
Haunted Houses by H W Longfellow for class 10
Haunted Houses by H W Longfellow for class 10Haunted Houses by H W Longfellow for class 10
Haunted Houses by H W Longfellow for class 10
Ā 
Nutrition Inc FY 2024, 4 - Hour Training
Nutrition Inc FY 2024, 4 - Hour TrainingNutrition Inc FY 2024, 4 - Hour Training
Nutrition Inc FY 2024, 4 - Hour Training
Ā 
BƀI Tįŗ¬P Bį»” TRį»¢ TIįŗ¾NG ANH Lį»šP 9 Cįŗ¢ NĂM - GLOBAL SUCCESS - NĂM Hį»ŒC 2024-2025 - ...
BƀI Tįŗ¬P Bį»” TRį»¢ TIįŗ¾NG ANH Lį»šP 9 Cįŗ¢ NĂM - GLOBAL SUCCESS - NĂM Hį»ŒC 2024-2025 - ...BƀI Tįŗ¬P Bį»” TRį»¢ TIįŗ¾NG ANH Lį»šP 9 Cįŗ¢ NĂM - GLOBAL SUCCESS - NĂM Hį»ŒC 2024-2025 - ...
BƀI Tįŗ¬P Bį»” TRį»¢ TIįŗ¾NG ANH Lį»šP 9 Cįŗ¢ NĂM - GLOBAL SUCCESS - NĂM Hį»ŒC 2024-2025 - ...
Ā 

Application Of Single-Server Queue System In Performance Analysis Of Shuttle Bus Operation A Case Study Of Federal University Of Technology Akure

  • 1. Copyright Ā© CC-BY-NC 2019, BJMSR Bangladesh Journal of Multidisciplinary Scientific Research; Vol. 1, No. 2 ISSN 2687-850X E-ISSN 2687-8518 July-September; 2019 Published by Centre for Research on Islamic Banking & Finance and Business 46 Application of Single-Server Queue System in Performance Analysis of Shuttle Bus Operation: A Case Study of Federal University of Technology Akure Kanyio Olufunto Adedotun Department of Transport Management Technology The Federal University of Technology,Akure Ondo State, Nigeria E-mail: oobembe97@gmail.com Abstract This study has examined the performance of University transport bus shuttle based on utilization using a Single-server queue system which occur if arrival and service rate is Poisson distributed (single queue) (M/M/1) queue. In the methodology, Single- server queue system was modelled based on Poisson Process with the introduction of Laplace Transform. Also, PASTA was introduced in queuing systems with Poisson arrivals. It is concluded that the performance of University transport bus shuttle is 93 percent which indicates a very good performance such that the supply of shuttle bus in FUTA is capable of meeting the demand. This study can be improved upon by examining the peak and off-peak period of traffic in the two major corridors (North gate and South gate) of FUTA, the economic cost of operating bus shuttle services can also be examined. Keywords: Single-Server Queue System; Transit Shuttle Buses; FUTA 1.Introduction The issues arising from transportation has continually subjected to various debates in the urban societies. Globally, several attempts have been made to tackle the challenges, although the situation is not getting much better (Aderamo, 2012; Adanikin, Olutaiwo, and Obafemi, 2017; Sidiq, 2019). Managing transport infrastructures is crucial to facilitate accessible, affordable, reliable, safe, and efficient that movement of people and goods, which can be achieved by continous assessment of transport performance indicators. Among the various modes of transport, the road transport is highly predominant which offers door-to- door service as in the case of the Federal University of Technology Akure (FUTA). Road transport infrastructure in the University is commonly plied by shuttle buses for the movement of the students, staff, members and non-members of the Institution to and from the University on a daily basis. Among the noticeable transportation problems in the University are traffic congestion; longer commuting; public transport inadequacy; difficulties for tricycles to have access to routes being plied by shuttle buses, challenge of freight distribution from one end of the University to another end, and other challenges which all impacts the performance of the University transport shuttle. This study concentrates on the performance of University transport bus shuttle with the aim of examining the bus shuttle efficiency based on utilization. Adeniran and Kanyio (2019) have laid a foundation of model on single-server queue system which this study will absolutely rely on. A similar study was conducted by Adanikin, Olutaiwo, and Obafemi (2017) on the performance study of University of Ado Ekiti (UNAD) transit shuttle buses. They adopted traffic volume, speed, density and revenue as main parameters of performance of transport shuttles, and find that the morning peak period (8.00am to 9.00am) has 234 vehicles/hr, evening peak period (2.00pm to 3.00pm) has 284 vehicles/hr, while the off-peak period (11.00am to 12.00pm) has 156 vehicles/hr. Also, The average stopping time was 6.55 minutes, average interval between arrivals of motorists was 16.40 seconds, the average queue length was 14.23 people, and the average waiting time at the bus-stop 4.17 minutes. These values were obtained using the queuing theory and shows much commuters time is lost on transit queues. This study focuses on the performance of bus terminal in FUTA, and does not factor in other parameters such as peak period, traffic volume, traffic speed, density, and others. A very close study was examined by Sidiq (2019) on single-server queue system of shuttle bus performance in the Federal University of Technology Akure. In his study, Single server queue system was modelled based on Poisson Process with the introduction of Laplace Transform which was culled from Adeniran and Kanyio (2019). The study finds that the performance of University transport bus shuttle is 96.6 percent which indicates a very good performance such that the supply of
  • 2. Copyright Ā© CC-BY-NC 2019, BJMSR www.cribfb.com/journal/index.php/BJMSR Bangladesh Journal of Multidisciplinary Scientific Research Vol. 1, No. 2; 2019 47 shuttle bus in FUTA is capable of meeting the demand. This present study was conducted barely two weeks after the study of Sidiq was conducted, and will replicate the methodology of Sidiq as culled from Adeniran and Kanyio (2019). 2. Methodology 2.1 Concept of Queuing The concept of queue was first used for the analysis of telephone call traffic in 1913 (Copper, 1981; Gross and Harris, 1985; Bastani, 2009). In a system that deals with the rate of arrival and service rate, waiting time is inevitable and it is always influenced by queue length. It is therefore crucial to minimize the waiting time to the lowest level in the bus terminal (Jain, Mohanty and Bohm, 2007). This is referred to as queuing system (Adeniran and Kanyio, 2019). The basic application of queue is shown in Figure 1, also the basic quantities are: i. Number of customers in queue L (for length); ii. Time spent in queue W for (wait) Figure1: Basic application of queue Source: Adeniran and Kanyio (2019) Examples of queue system are: 1. Single-server queue system: This is also referred to as single queue, single server. It is simple if arrivals and services are Poisson distributed (M/M/1) queue. It has limited number of spots and not difficult. Figure 2 depicts single-server queue system. Figure 2: Single-server queue system Source: Adeniran and Kanyio (2019) 2. Multi-server queue system: This is comprises of single queue, many servers (M/M/c) queue. The c is referred to as Poisson servers. Figure 3 depicts multiple-server queue system. Figure 3: Multiple-server queue system Source: Adeniran and Kanyio (2019)
  • 3. Copyright Ā© CC-BY-NC 2019, BJMSR www.cribfb.com/journal/index.php/BJMSR Bangladesh Journal of Multidisciplinary Scientific Research Vol. 1, No. 2; 2019 48 In single-server queue system, arrival and service processes are Poisson such that a. Customers arrive at an average rate of Ī» per unit time; b. Customers are serviced at an average rate of Āµ per unit time; c. Interarrival and inter-service time are exponential and independent; d. Hypothesis of Poisson arrivals is reasonable; and e. Hypothesis of exponential service times are not so reasonable (Adeniran and Kanyio, 2019) In order to explain how the queuing system works, there is need to first introduce the Poisson Process (PP). It has exceptional properties and is a very important process in queuing theory. To simplify the model, we often assume customer arrivals follow a PP. The Laplace Transform (LT) is also a very powerful tool that was adopted in the analysis (Trani, 2011). Apart from PP and LT, there is focus on the queue model itself (Adeniran and Kanyio, 2019). 2.2 Modelling of Single Queue System 2.2.1 Queuing system from Poisson Process and ā€œPASTAā€ The Poisson Process (PP) is important in queue theory due to its outstanding properties. According to Adan and Resing (2015), queuing system is achieved as ā€œlet N(t) be the number of arrivals in [0, t] for a PP with rate Ī», i.e. the time between successive arrivals is exponentially distributed with parameter Ī» and independent of the past. Then N(t) has a Poisson distribution with parameter Ī»t. This is culled from Adeniran and Kanyio (2019). P(N(t) = k) = (Ī»t)k k! eāˆ’Ī»t , for k = 0, 1, 2ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ Equation 1 The mean, and coefficient of variation of N(t) are Mean: E(N(t)) = Ī»t; Coefficient of Variation: c2 N(t) = 1 Ī»t ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ Equation 2 By the memoryless property of Poisson distribution, it can be verified that P(arrival in (t, t + āˆ†t]) = Ī»āˆ†t + 0(āˆ†t) ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ Equation 3 Hence, when āˆ†t is small, P(arrival in (t, t + āˆ†t)) ā‰ˆ Ī»āˆ†t ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ Equation 4 In each small time interval of length āˆ†t the occurrence of an arrival is equally likely. In other words, Poisson arrivals occur completely randomly in time. The Poisson Process is an extremely useful process for modelling purposes in many practical applications. An important property of the Poisson Process is called ā€œPASTAā€ (Poisson Arrivals See Time Averages). PASTA is meant for queuing systems with Poisson arrivals, (M/./. systems), arriving vehicles find on average the same situation in the queuing system as an outside observer looking at the system at an arbitrary point in time. More precisely, the fraction of vehicles finding on arrival the system in some state A is exactly the same as the fraction of time the system is in state A. 2.2.2 Laplace Transform The Laplace transform LX(s) of a nonnegative random variable X with distribution function f(x) is define as: LX(s) = E(eāˆ’sX ) = āˆ« eāˆ’sX āˆž x=0 f(x)dx ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ Equation 5 It can be noted that LX(0) = E(eāˆ’X .0 ) = E(1) = 1 ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ Equation 6 and L1 X(0) = E((eāˆ’sX )1 )|s=0 = E(āˆ’Xeāˆ’sX )|s=0
  • 4. Copyright Ā© CC-BY-NC 2019, BJMSR www.cribfb.com/journal/index.php/BJMSR Bangladesh Journal of Multidisciplinary Scientific Research Vol. 1, No. 2; 2019 49 = āˆ’E(X) ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ Equation 7 Correspondingly, L (k) x (0) = (āˆ’1)k E(Xk ) ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ Equation 8 There are many useful properties of Laplace Transform. These properties can make calculations easier when dealing with probability. For instance, let X, Y, Z be three random variables with Z = X +Y and X, Y are independent. Then the Laplace Transform of Z can be found as: LZ(s) = LX(s) Ā· LY (s) ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ Equation 9 Moreover, when Z with probability P equals X, with probability 1 āˆ’ P equals Y, then LZ(s) = PLX(s) + (1 āˆ’ P)LY (s) ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ Equation 10 Laplace Transforms of some useful distributions can now be introduced. a. Suppose X is a random variable which follows an exponential distribution with rate Ī». The Laplace Transform of X is LX(s) = (Ī») Ī» + s ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ Equation 11 b. Suppose X is a random variable which follows an Erlang āˆ’ r distribution with rate Ī». Then X can be written as: X = X1 + X2 + Ā· Ā· Ā· + Xr ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ Equation 12 where Xi are i.i.d. exponential with rate Ī». Therefore, we have LX(s) = LX1(s) Ā· LX2(s)ā€¦ LXr(s) = ( Ī» Ī» + s ) n ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ Equation 13 c. Suppose X is a constant real number c, then LX(s) = E(eāˆ’sX ) = E(eāˆ’sc ) = eāˆ’sc ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ Equation 14 (culled from Adeniran and Kanyio, 2019) 2.2.3 Basic queuing systems Kendallā€™s notation shall be used to describe a queuing system as denoted by: A/B/m/K/n/D ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦. Equation 15 (Adan and Resing, 2016) Where A: distribution of the interarrival times B: distribution of the service times m: number of servers K: capacity of the system, the maximum number of passengers in the system including the one being serviced n: population size of sources of passengers D: service discipline G shall be used to denote general distribution, M used for exponential distribution (M stands for Memoryless), D be used for deterministic times (Sztrik, 2016). A/B/m is also used to describe a queuing system, where: A stands for distribution of interarrival times, B stands for distribution of service times and m stands for number of servers. Hence M/M/1 denotes a system with Poisson arrivals, exponentially distributed service times and a single server. M/G/m denotes an m- server system with Poisson arrivals and generally distributed service times, and so on. In this section, the basic queuing models (M/M/1 system), which is a system with Poisson arrivals, exponentially distributed service times and a single server. The following part is retrieved from Queuing Systems (Adan and Resing, 2016). Firstly, it is assumed that inter-arrivals follows an exponential distribution with rate Ī», and service time follows the exponential distribution with rate Āµ. Further, in the single service model, to avoid queue length instability, it is assume that: According to Adanikin, Olutaiwo and Obafemi (2017),
  • 5. Copyright Ā© CC-BY-NC 2019, BJMSR www.cribfb.com/journal/index.php/BJMSR Bangladesh Journal of Multidisciplinary Scientific Research Vol. 1, No. 2; 2019 50 Utilization (R) = Average Arrival Rate (Ī») Average service rate (Ī¼) < 1 ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦.. Equation 16 Here R is the fraction of time the server is working (called the utility factor). Time-dependent behaviour of this system will be considered firstly, then the limiting behaviour. Let Rn(t) denote the probability that at time t there are n passengers in the system. Then by equation 3, when āˆ†t ā†’ 0, R0(t + āˆ†t) = (1 āˆ’ Ī»āˆ†t)R0(t) + Āµāˆ†tR1(t) + 0(āˆ†t) ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦.. Equation 17 Rn(t + āˆ†t) = Ī»āˆ†tRnāˆ’1(t) + (1 āˆ’ (Ī» + Āµ)āˆ†t)Rn(t) + Āµāˆ†tRn+1(t) + 0(āˆ†t) ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦.. Equation 18 where n = 1,2, ... Hence, by tending āˆ†t ā†’ 0, the following infinite set of differential equations for Rn(t) will be obtained. R1 0 (t) = āˆ’Ī»R0(t) + ĀµR1(t) ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦.. Equation 19 R1 n(t) = Ī»pnāˆ’1(t) āˆ’ (Ī» + Āµ)Rn(t) + ĀµRn+1(t), n = 1,2, ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦.. Equation 20 It is very difficult to solve these differential equations. However, when we focus on the limiting or equilibrium behaviour of this system, it is much easier. It was revealed by (Sztrik, 2016) that when t ā†’āˆž, R1 n(t) ā†’ 0 and Rn(t) ā†’ Rn. It follows that the limiting probabilities Rn satisfy equations 0 = āˆ’Ī»R0 + ĀµR1ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦.. Equation 21 0 = Ī»Rnāˆ’1 āˆ’ (Ī» + Āµ)Rn + ĀµRn+1, , n = 1,2, ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ Equation 22 Moreover, Rn also satisfy āˆ‘ Rn = 1 āˆž n=0 ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦.. Equation 23 which is called the normalization equation. We can also use a flow diagram to derive the normalization equations directly. For an M/M/1 system, the flow diagram is shown in figure 4: Figure 4: Process diagram for M/M/1 Queue, k=1,2,3,... (Ademoh and Anosike, 2014; Adeniran and Kanyio, 2019) The rate matrix of the system is: Q = āˆ’Ī» Ī» 0 0 0 . . . Āµ āˆ’(Āµ + Ī») Ī» 0 0 . . . 0 Āµ āˆ’(Āµ + Ī») Ī» 0 . . . 0 0 Āµ āˆ’(Āµ + Ī») Ī» . . . . . . . . . . . . . . . . . . . . . . . . . . . ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦.. Equation 24 Notice that the sum of each row equals 0. In order to determine the equations from the flow diagram, a global balance principle was adopted. Global balance principle states that for each set of states under the equilibrium condition, the flow out of set is equal to the flow into that set. Based on figure 1,
  • 6. Copyright Ā© CC-BY-NC 2019, BJMSR www.cribfb.com/journal/index.php/BJMSR Bangladesh Journal of Multidisciplinary Scientific Research Vol. 1, No. 2; 2019 51 š‘†š‘”š‘Žš‘”š‘’ š‘…š‘Žš‘”š‘’ š¼š‘› = š‘…š‘Žš‘”š‘’ š‘‚š‘¢š‘” 0 Āµš‘…1 = šœ†š‘…0 1 šœ†š‘…0 + Āµš‘…2 = (šœ† + Āµ)š‘…1 2 šœ†š‘…1 + Āµš‘…3 = (šœ† + Āµ)š‘…2 This is exactly the normalization equation. To solve the equation, firstly, it was assume that (R) = š“š‘£š‘’š‘Ÿš‘Žš‘”š‘’ š“š‘Ÿš‘Ÿš‘–š‘£š‘Žš‘™ š‘…š‘Žš‘”š‘’ (šœ†) š“š‘£š‘’š‘Ÿš‘Žš‘”š‘’ š‘ š‘’š‘Ÿš‘£š‘–š‘š‘’ š‘Ÿš‘Žš‘”š‘’ (šœ‡) which is known as the utilization factor. From the equilibrium equation of state 0, we have: R1 = Rp0 ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦. Equation 25 When equation 25 was substituted into the equilibrium equation of state 1, then: Ī»p0 + Āµp2 = (Ī» + Āµ)Rp0 = šœ†2 šœ‡ p0 ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦.. Equation 26 That is Āµp2 = šœ†2 šœ‡ p0 ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦. Equation 27 Therefore, p2 = R2 p0 ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦. Equation 28 Generally, pk = Rk p0 ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦. Equation 29 Since āˆ‘āˆž š‘›=0 pn = 1 ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦. Equation 30 Using (1.29), we can replace pk by R0. Then āˆ‘āˆž š‘›=0 Rn p0 = 1ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦.. Equation 31 That is 1 1āˆ’š‘… p0 = 1 p0 = 1 ā€“ Rā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦. Equation 32 Moreover, for any k, pk = Rk (1 āˆ’R) ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦ā€¦. Equation 33 Finally is the limiting probability pk in the M/M/1 system. The expected queue length L is given by E(L) = āˆ‘ i. pi āˆž i=0 = āˆ‘ i. Ri āˆž i=0 (1 āˆ’ R) = R(1 āˆ’ R) āˆ‘ i. Ri āˆž i=0 = R(1 āˆ’ R) (āˆ‘怖i. Ri)i āˆž i=1 怗 = R(1-R) ( 1 1āˆ’R )i = R 1āˆ’R ..............................Equation 34 (Culled from Adeniran and Kanyio, 2019) 3. Results and Discussion 3.1. Traffic Survey 3.1.1 Stopping time of shuttle bus Stopping time refers to the total time duration the shuttle bus spends at the bus stop. The stopping time is made up of: a) The boarding stop time ā€œAā€: This is also made up of the time taken to close the door = 12 seconds; time taken by the driver to check the traffic before take-off = 5 seconds; and time taken to park the bus and open the bus for commuters = 5 seconds. A = (12+5+5) = 22 seconds b) The average boarding time per passenger = ā€œB1ā€ = 17 seconds c) Number of passengers boarding = n1 = 18 passengers.
  • 7. Copyright Ā© CC-BY-NC 2019, BJMSR www.cribfb.com/journal/index.php/BJMSR Bangladesh Journal of Multidisciplinary Scientific Research Vol. 1, No. 2; 2019 52 Mathematically, stopping time T = A + B1* n1 Stopping Time = (22 + (17*18)) = (22+306) = 328 seconds Stopping Time = 5.47 minutes 3.2 Waiting Time This is the length of time spent by the passengers at the bus stop before boarding a bus. It is also referred to as Delay. The queuing theory is employed in this study. a) Average arrival rate (Ī») = 226 passengers/hour Ī» = 226 3600 = 0.0628 b) Average service rate (Ī¼) = 243 passengers/hour Ī¼ = 243 3600 = 0.0675 c) Average interval between arrival = 1 Ī» = 1 0.0628 = 15.924 Seconds d) Average interval between service rate = 1 Ī¼ = 1 0.0675 = 14.815 Seconds e) Average queue length = šœ†2 šœ‡(šœ‡āˆ’šœ†) = 0.06282 0.0675(0.0675āˆ’0.0628) = = 0.0039 0.00032 = 12.19 Passengers f) Average waiting time in the queue = Ī» šœ‡(šœ‡āˆ’šœ†) = 0.0628 0.0675(0.0675āˆ’0.0628) = = 0.0628 0.00032 = 196.25 Seconds = 3.27 Minutes g) Average time spent in the system (bus stop) = 1 Ī¼āˆ’Ī» = 1 0.0675 āˆ’ 0.0628 = 212.76 Seconds = 3.55 Minutes h) Efficiency of shuttle bus operation based on bus stop utilization (R) = šœ† šœ‡ R = 0.0628 0.0675 = 0.93 It is important to note that the Utilization factor is less than 1(R< 1), hence the performance of University transport bus shuttle is 93 percent which indicates a very good performance such that the supply of shuttle bus in FUTA is capable of meeting the demand. 4. Conclusion and Recommendation This study has examined the performance of University transport bus shuttle based on utilization using a Single-server queue system which occur if arrival and service rate is Poisson distributed (single queue) (M/M/1) queue. It is concluded that the performance of University transport bus shuttle is 93 percent which indicates a very good performance such that the supply of shuttle bus in FUTA is capable of meeting the demand. This result is very close to that of Sidiq (2019) which finds that the performance of University transport bus shuttle is 96.6 percent. This study can be improved upon by examining the peak and off-peak period of traffic in the two major corridors (North gate and South gate) of FUTA, the economic cost of operating bus shuttle services can also be examined. References Adan, I., and Resing, J. (2015). Queuing Systems. Department of Mathematics and Computer Science, Eindhoven University of Technology, Netherlands, 2015. Adanikin, A., Olutaiwo, A., and Obafemi, T. (2017). Performance Study of University of Ado Ekiti (UNAD) Transit Shuttle Buses. American Journal of Traffic and Transportation Engineering, 2(5): 67-73 doi: 10.11648/j.ajtte.20170205.12. Ademoh, N. A., and Anosike, E. N. (2014). Queuing Modelling of Air Transport Passengers of Nnamdi Azikiwe International Airport Abuja, Nigeria Using Multi Server Approach. Middle East Journal of Scientific Research 21 (12): 2326-2338, 2014 doi: 10.5829/idosi.mejsr.2014.21.12.21807. Adeniran, A. O., and Kanyio, O. A. (2019). Quantitative Model of Single-Server Queue System. Indian Journal of Engineering, 16, 177-183. Aderamo, A. J. (2012). Urban transportation problems and challenges in Nigeria: A plannerā€™s view. Prime Journals. 2(3), 198- 203.
  • 8. Copyright Ā© CC-BY-NC 2019, BJMSR www.cribfb.com/journal/index.php/BJMSR Bangladesh Journal of Multidisciplinary Scientific Research Vol. 1, No. 2; 2019 53 Bastani P. (2009). A Queuing Model of Hospital Congestion. MSc. Thesis submitted to Department of Mathematics Simon Fraser University Copper, R. B. (1981). Introduction to Queuing Theory, 2nd Edition North Holland. Gross, D., and Harris, C. M. (1985). Fundamentals of Queuing Theory, 2nd ed. John Wiley & Sons: New York. Jain, J. L., Mohanty, S. G., and Bohm, W. (2007). A Course on Queuing Models, Statistics: A series of Textbooks and Monographs, Chapman & Hall/CRC, Taylor & Francis Group. Sidiq, O. Ben. (2019). Single-Server Queue System of Shuttle Bus Performance: Federal University of Technology Akure as Case Study. American International Journal of Multidisciplinary Scientific Research, 5(3), 9-14 Sztrik, J. (2012). Basic Queuing Theory. University of Debrecen, Faculty of Informatics. Trani, A., A. (2011). Introduction to Transportation Engineering, Introduction to Queuing Theory. Virginia Polytechnic Institute and State University, US, Pp: 2-46. Copyrights Copyright for this article is retained by the author(s), with first publication rights granted to the journal. This is an open-access article distributed under the terms and conditions of the Creative Commons Attribution license (http://creativecommons.org/licenses/by/4.0/).