Discrete time SMP and numerical solution 147
4.2.2 Non-Homogeneous Case
As above in the homogoneous case, we consider that a taxicab driver will work
for eight hours with time intervals of 15 minutes and so we will consider the
transient case within 32 time periods for which
(,)
ij
t
φ
represents the probability
that a driver being in state i at time s will be in state j at time t.
Though this example is one of the simplest that can be done, it will clearly
confirm that non-homogeneity, as already shown, gives some intrinsic
supplementary difficulties.
Also, we will try to show all the steps that are necessary to understand the
development of a DTNHSMP.
This time, the input is:
m = 3,
T = 32,
and the non-homogeneous Markov chain, reported in the following table.
P(0) P(5) P(10)
0.3 0.4 0.3 0.39 0.35 0.26 0.49 0.3 0.21
0.4 0.2 0.4 0.35 0.32 0.33 0.3 0.42 0.28
0.32 0.38 0.3 0.28 0.33 0.39 0.23 0.28 0.49
P(20) P(25) P(29)
0.54 0.35 0.11 0.5 0.4 0.1 0.5 0.4 0.1
0.3 0.62 0.08 0.3 0.6 0.1 0.3 0.6 0.1
0.23 0.18 0.59 0.24 0.13 0.63 0.2 0.1 0.7
Other input should be the matrix
]
(,)
ij
st=F , the discrete time increasing
probability distribution of the waiting time in each state i, given that the arrival
time in the state i was at time s and that the next state to be successively occupied
is j.
From the data, we can construct these distribution functions, as in the
homogeneous cases.
To compute for each s, i and j the related d.f.,
(,), (, 1), (, 2), , (,32), 32,
ij ij ij ij
FssFss Fss Fs s
+≤… (4.11)
we first introduce the following quantities:
() ( (, 1), (, 2), , (,32), (,33))
ij ij ij ij ij
svss vss vs vs=+ +v … . (4.12)
(, 1)
ij
vss+
gives the number of all the runs for which the taxi driver arrived at
time s in the state i and finished the new course in the state j in a time less than or
equal to 15 minutes (including the waiting time before beginning the new
course).