CC BY
41
COST-REVENUE ANALYSIS AND ANFIS COMPUTING OF HETEROGENEOUS QUEUING MODEL WITH A SECOND OPTIONAL SERVICE WITH FEEDBACK UNDER HYBRID VACATION
Divya K1 and Indhira K*
Department of Mathematics, School of Advanced Sciences, Vellore Institute of Technology, Vellore-632014, Tamil Nadu, India.
divya.k2020@vitstudent.ac.in, kindhira@vit.ac.in. Abstract
This research article examines an M/M/2 heterogeneous queueing model that provides two services: a mandatory first essential service (FES) and an optional second optional service (SOS). The model incorporates breakdown, feedback, and a hybrid vacation policy. Matrix expressions are structured to evaluate the stationary probability distribution of the number of customers in the system and system performance measures using the matrix-geometric approach (MGA). Additionally, formulas are being developed to estimate the model's performance indicators. The cost function is being evaluated to determine the best values of the system's decision variables, and an adaptive neural fuzzy inference system (ANFIS) based on soft computing technology is being utilized to validate the obtained results.
Keywords: Markovian queue, Breakdown, Hybrid vacation, Matrix geometric approach, ANFIS.
1. Introduction
Queuing theory is the study of how people behave in service systems like telephone systems and waiting lines. It is a branch of operations research that focuses on analysing the arrival and departure of packets or customers from a service system. Queuing theory is used to analyse a wide range of scenarios, such as traffic control, banking, manufacturing, computer and telecommunications networks, production and transportation systems, and even healthcare systems. In general, queuing theory involves finding an appropriate mathematical model to describe the system and then analysing it to determine how the system performs and how it can be improved. Morse [17] was the first to consider the concept of heterogeneous servers in multi-server queueing models, which is more realistic than assuming all servers provide service at an equal rate. In queuing systems with human servers, this assumption is impossible to implement as different servers can provide services at varying rates. It's obvious that heterogeneous services are essential to the functioning of almost every industrial system. Li and Stanford [9] explored heterogeneous multi-server accumulating priority queues. Krishnamoorthy et al. [14] presented a two heterogeneous servers queueing model. Chang et al. [5] investigate an unreliable-server retrial queue with customer feedback and impatience. They analyse the performance of the system through simulations and derive analytical expressions for its measures of performance and cost. Recently, Wu and Yang [25] examined a two-phase heterogeneous service model. They initially performed a single objective optimization using Canonical PSO then developed a bi-objective cost optimization model for the system and
waiting time in tandem.
In queueing theory, vacation refers to a period of time in which a server is unavailable to serve customers. There are several types of vacations, including planned and random, as well as hybrid vacations which combine the two. Planned vacations occur at predetermined intervals, while random vacations occur randomly throughout the queueing system's operation. Hybrid vacations combine both planned and random vacations in order to optimize the system's performance. Servi and Finn [19] work in queuing theory focused on working vacations (WV) for M/M/1 queues. In this approach, the server can continue servicing requests at a slower rate when customers are not present. Bouchentouf et al. [3] researched a multi-station unstable machine model with customer impatience and a working vacation schedule. Ziad et al. [29] examined a M/M/c queueing system with waiting servers, balking, reneging, and a K-variant working vacation interrupted by a Bernoulli schedule. Bouchentouf et al. [4] examine the performance and economics of a single server queueing model with feedback, impatient customers, and a vacation policy, finding an optimal control policy for vacation times, and providing their results, which can be used to make decisions regarding the system's parameters. Anshul Kumar et al. [16] investigated the hybrid holiday policy and a two-stage service procedure using matrix geometric techniques. This hybrid holiday is a combo of working vacation and complete vacation (CV), in which the server may begin in WV and continue to give service at a decreased rate when the server is idle. If there are clients present in WV, the server will linger in WV and offer service. If not, it will go to CV. The server will revert to its usual operations after the CV has been completed, and it will begin providing service to any customers who are ready at that time. Dual servers with varying service rates are a logical outgrowth of this concept.
The term "essential service" refers to services that servers must offer in order to satisfy customer needs. Optional services, on the other hand, are those that are provided based on customer demand. Essential services are usually core services that must be provided in order for the server to fulfil its role, while optional services are additional services that customers may choose to opt-in to receive. Laxmi and Jyothsna [22] examined a finite buffer impatient customer queue with WV, where the server offers two phases of service: essential and optional. Yang et al. [26] used SOS to an M/M/R queueing model and offered economic analysis. Several queueing models for optional services have been studied by researchers such as Anitha et al. [2], Chandrika and Kalaiselvi [6], Li and Wang [10], Yang and Chen [27], and others.
Realistically, it's not possible to have a completely reliable server because it could break at any time. Repair setups such as thresholds, backups, or restarts must be applied to restore service. Significant research on breakdown provides a model to investigate how such changes may reduce customer wait times in real-time service systems with a total failure server, such as those found in banks, manufacturing plants, contact centres, and so on.
Ye and Liu [28] applied the MGA to discover the steady-state solutions for a Markovian arrival single server queuing system with an operational breakdown. Vijayalakshmi et al. [23] used a matrix technique to examine the restricted capacity of a Markovian queueing model with working interruptions and two-phase service. The M/M/1 model with working breakdowns and recovery policies based on k-threshold recovery time and setup recovery was studied by Ezeagu et al. [8]. A queueing model for a service system with a secondary server was presented by Chakravarthy et al.
The Matrix Geometric Approch was first developed in the 1960s and has since become a fundamental tool in queueing theory. It was widely used in Markov chain models and queuing systems to solve difficult real-time p roblems. In particular, this method helps to determine the stationary behaviour of a queueing model by calculating the expected number of customers and expected times in the system. M.F. Neuts [18] was a key figure in the development of the Matrix Geometric Approach (MGA). Ke et al. [13] conducted research on an M/M/R queueing system with SOS. Shekhar et al. [21] employed metaheuristics to find effective emergency
vacation queueing techniques. Anshul and Madhu Jain [16] conducted an investigation into an unreliable server, they studied the effects of an MGA-based Markovian queueing model for a two-stage service system that utilises a hybrid vacation policy.
ANFIS, or Adaptive Neuro-Fuzzy Inference System, is an intelligent system that combines neural networks and fuzzy logic to model complex non-linear systems. It can be used for many applications, such as classification, prediction, control, and o ptimization. ANFIS can also be used for transient analysis, where it can generate more accurate insights about system dynamics. Jang [11] proposed the ANFIS as a tool to model complex systems. He demonstrated the application of ANFIS in modelling the nonlinear dynamics of a continuous-time system and provided references on the uses of ANFIS in various research fields. The article was an important milestone in furthering the application of ANFIS in the sciences. The content of Neuro-Fuzzy and Soft Computing: A Computational Approach to Learning and Machine Intelligence was analysed by Jang et al. [12]. ANFIS has been used in many research papers, including Ahuja et al. study of the transient of an unreliable single-server queueing model with multi-stage service and a working vacation. Sethi et al. [20] proposed a mathematical model to analyse the system and demonstrated that the parameters of the system can be optimised using an ANFIS approach. They also discussed the performance of different policies in terms of cost and found that an N-policy was the most efficient for cost optimization. An analysis of an MX /G /1 retrial queue with impatient customers, an unreliable server, a modified vacation policy, delayed repair, and a Bernoulli feedback system was presented by Upadhyaya and Kushwaha [24]. They also used an ANFIS computing approach to compare their numerical results to those obtained from explicit analytical formulas.
The structure of this paper is outlined in the following way: Section 2 outlines the model description and associated mathematical assumptions, as well as provides an explanation for the transition rate matrix. In Section 3, the stability condition is established and the matrix-geometric approach is explained. Performance measures such as the expected number of customers in the system in terms of system state probabilities and the total cost accumulated through different activities and cost elements are derived in Section 4. Section 5 provides numerical results, while the conclusions in Section 6 illustrate noteworthy features and potential areas for future research.
2. Model description
Under the hybrid vacation policy, we propose a heterogeneous Markovian queueing model with a second optional service with feedback and breakdown. This model is detailed as follows: The arrival pattern: In this model, customers arrive according to a Poisson process with an arrival rate of A.
The service pattern: The first-in-first-out policy directs the service discipline.We investigate a queueing model with two heterogeneous servers: the first server is constantly available and totally reliable, charges a service rate of ^o. while the second server has two distinct phases - an first essential phase (FES) and a second optional phase (SOS) - and is only occasionally accessible and unstable. server 2 charges for FES and for SOS, with the service rates for both following an exponential distribution.
Breakdown and repair rule : The queueing system has two servers, with the first server consisting of a single, reliable phase, and the second server consisting of two phases: FES and SOS. If both phases of the second server experience breakdowns with rates ^1, n2 and, it is immediately sent for repair with rates Q1 and d2, respectively.
Feedback rule: After receiving a service, an unsatisfied customer can decide to re-enter the system for another service, with a probability k referred to as "feedback", or they can choose to permanently exit the system with a probability k (=1-ic). Feedback service is consider as a new arival A.
The hybrid vacation strategy: During vacation periods, the server starts WV, which has an exponential distribution with a slower service rate of When the server gets empty during WV, it will switch to CV mode. While customers enter the system at CV, the server will return to its usual busy state and start serving customers. CV duration has an exponential distribution with a mean dv. The server enters the working period in the CV state with the probability £ of providing service to the customer. which is always 1.
Let us consider F(t) = {(W(t), J(t)); t > 0}be the bivariate Markov process (BMP) with a
Figure 1: State transition diagram of the model state space at time t. where W(t) represents the number of customers in the system, and
' 0, if server 2 is in Working vacation
J(t)
1, if server 2 is in Complete vacation
2, if server 2 is in FES
3, if server 2 is in SOS
4, if server 2 is in Breakdown
All stochastic processes in the system are independent of one another. The structure of this model's transition diagram is depicted in the below figure. 1.
2.1. Governing equations By using birth- death process, Governing equations can be formulated as follows:
(A + $v >0,0 = (F0 + Fv )'1,0 + K^0'0,1 + K(^0 + Vl F2 )'1,2 + k(F0 + F2 )'1,3 [k(f0 + Fv) + A + 0i]ii,0 =Ai0,0 + K(F0 + Fv >2,0 [k(f0 + Fv ) + A + $1 ]lm,0 =Alm-1,0 + K(F0 + Fv )'m+1,0 (%F0 + A)i0,i =$v '0,0 + KF0 '1,1 (KF0 + A)i1,1 =$v '0,1 + KF0 '2,1 (kF0 + A)lm,1 =$v 'm—1,1 + KF0 'm+1,1 [A + K(F0 + V1F1) + V0F1 + nt]l1,2 =£'1,1 + $1 '0,1 + V2F1'1,2 + 01*1,4 + K(F0 + F1 )'2,2 + K(F0 + F2 )'2,3 [A + K(F0 + V1F1 ) + V0 F1 + m ] 1 + $1 'm—1,1 + V2F1 lm,2 + 01'm,4 + K(F0 + F1 )'m+1,2
+ k(F0 + F2 )lm+1,3 [K(F0 + F2 ) + A + ^'1,3 =V0 F1'1,2 + 02'1,4 [K(F0 + F2) + A + n2 ]'m,3 =V0 F1'm,2 + 02 'm,4
[01 + 02] '1,4 =nill,2 + 72*1,3 [01 + 02 ]lm,4 =ni'm,2 + ^2 lm,3
To make obtaining solutions to our model easier and faster, we are employing the MGA. This method is used to obtain steady-state probabilities when the state-space increases rapidly. This technique helps us to achieve effective and numerically stable solutions that would otherwise be difficult and time-consuming to obtain.
2.2. Matrix Geometric Solution
The system state is symbolized by W(t) and J(t). Let {(W(t), J(t)); t > 0}, with the state space organised in lexicographical manner as follows.
Y = (0,0) U(0,1) U(m,n);n > 1,m = 0,1,2,3,4
The set of equations in section 2.1 are utilised to create the model's steady-state probability using the matrix-geometric approach. The block tridiagonal pattern is represented by the associated infinitesimal generator matrix g of this Markov chain, which is expressed as follows:
g
s0 T0 0 0 0
V0 Ui U0 0 0 0 U2 U1 U0 0 0 0 U2 U1 U0
0 0 0 U2 U1 U0
where
S0
and Ui
-(A+fa ) ß
U0
-[A+^i+a] 0 0 0
(A+ß)
T0
\A 0 0 0 ^ . L0 A 0 0 0.1'
V0
ra 0 0 0 0
0ß 0 0 0
00 7 0 0
00 S 0 0
00 0 0 0
A0000 0A000
0 0 A 0 0 ' U2 000A0 0000A
0
-[A+i+ß] S
0 -[A+71 +^1^1+7-^2^1] 00
a 0' 0ß
70
S 0 00
0 0
V0H1
-[A+V2+S]
00 61 62
Here, a= k[u0 + Uv], ß=KU0, 7= k[u0 + V U1], S=kU0 + U2].
0 0 V1 72
-[61+62 ]
Figure 2: Influence of vg on the idle state 10,0 of the servers
3. Stability Condition
Theorem 1. The system is stable if and only if p = J BB+c) < 1 Proof. Let us define the matrix U = U0 + U1 + U2 given by
U
-ifr 0 fa 0 0
0 ? 0 0
0 0 -[m+(v0-vi)n] v0m m
00 -s 5 0
00 e1 e2 -[e1+e2]
(1)
There exists a stationary probability I = (I0,11,I2,I3,I4) of U such that
ZU = 0; le = 1
(2)
where e = [1,1,1,1,1]T. Using theorem 3.1.1 of Netus [18], the necessary and sufficient condition for the stability of the system is as follows:
Solving 1 and 2, we get
I U0e < I U2e
A[I0 +11 +12 +13 +14] <al0 + PI + 7I2 + 5I3
(3)
(4)
A
P
— [(V2 + V0H1 + 5))e1 + (5 + m + m (V0 + V1 - V2 ))e2 ] < — [(^1 V1 + 5 + V0 m )e1 + K^2
01
01
+ (5 + V1 + (V0 + V1 - V2)e2)] (5)
A
p
—[Ae1 + be2] < [aei + be2 + c]
01 0-1
ae1 + be2
ae1 + be2 + c
<1
(6) (7)
Here
a =V2 + V0 + 5 b =5 + + m (V0 + V1 - V2) c =K(m1 V1 + ^2 )
Table 1: Impact of arrival rate A on perfomance measures
A E[LS ] E[Lq ] PIdle PS2 PWV PS2 P CV PS2 P FES PS2 P SOS PS2 P Bd
0.5 0.1862 0.0271 0.8393 0.9450 0.0365 0.0121 0.0032 0.0016
0.6 0.2378 0.0447 0.8069 0.9409 0.0358 0.0160 0.0046 0.0023
0.7 0.2904 0.0647 0.7744 0.9359 0.0349 0.0198 0.0062 0.0029
0.8 0.3480 0.0891 0.7416 0.9297 0.0347 0.0240 0.0081 0.0035
1 0.4780 0.1495 0.6757 0.9149 0.0321 0.0339 0.0134 0.0052
1.1 0.5539 0.1800 0.6423 0.9053 0.0310 0.0396 0.0172 0.0063
1.2 0.6411 0.2488 0.6085 0.8938 0.0299 0.0460 0.0218 0.0077
1.3 0.7384 0.3073 0.5757 0.8936 0.0185 0.0517 0.0266 0.0089
1.4 0.8442 0.3851 0.5398 0.8648 0.0274 0.0614 0.0344 0.0109
1.5 0.9796 0.4725 0.5044 0.8453 0.0261 0.0706 0.0431 0.0130
Table 2: Impact of service rates (p0, P1, P1, pv) on some perfomance measures
(po,Pi,pi,Pv) E[Ls] E[ Lq ] PIdle PS1 PWV PS1 1 CV PS1 1 FES PS1 1 SOS PS1 1 Bd
(3,1,1.5,1) 1.1737 0.6971 0.4440 0.8191 0.0136 0.0783 0.0611 0.0163
(4,1,1.5,1) 0.8109 0.3774 0.5651 0.9063 0.0118 0.0414 0.0108 0.0071
(5,2.5,1.5,1) 0.5589 0.1008 0.6414 0.9409 0.0104 0.0147 0.0098 0.0037
(6,3,1.5,1) 0.4409 0.1351 0.6941 0.9580 0.0181 0.0161 0.0054 0.0013
(7,3.5,2,1) 0.1693 0.0713 0.7334 0.9007 0.0161 0.0103 0.0018 0.0015
(7.5,4,2.5,1) 0.3313 0.0811 0.7495 0.9716 0.0151 0.0093 0.0014 0.0011
(8,4,3,1.5) 0.1884 0.0641 0.7751 0.9746 0.0146 0.0077 0.0017 0.0009
where
I = 0 I = 0 12 = V + ^ + To, = [^i + Fi (vo + vi - V2)02 + Fi vpdt] [V2(ni - FiV2) + FiV2(vo + vi)] + [KVi + KFl(vi - V2)](F0 + F2)
T4 = --- (8)
Here,
= ni(vi + ^2) + v2(0i - Fiv2) + nis + Fiv2(vo + vi) + (0i + 02)(S + voFi) + Fi(02 + ¿)(vi - v2)
Hence, System stability is ensured that p is equal to or less than i. ■
Figure 3: Influence of E[Ls] for different P0 w.r.t \
3.i. Stationary probability distribution
We define pmn = {(W(t) = m, J(t) = n)} where m indicates the total number of customers in the queue and n reflects the server state. Under the stability condition p < i. The prob. vector is described as follows: T = [T0,Ti,T2,T3,...], where T0 = [z0,0,¿0,i], m = 0; T = [im,o, im,i, im,2, im,3, im,4], m = i,2,3,4,.... Since the steady-state criterion is achieved, then the
Table 3: Impact of breakdown and repair rates (ni, 01, ^2, 02) on some perfomance measures
(n1,01, 72, 02) E[LS ] E[ Lq ] PIdle PS2 PS2 1 CV PS2 1 FES PS2 1 SOS PS2 1 Bd
(0.5,2,0.5,3) 0.5071 0.8011 0.0227 0.1204 0.0397 0.0159 0.4323 0.0109
(0.6,2,0.55,3) 0.6796 0.9203 0.0322 0.0297 0.0128 0.0044 0.3679 0.0113
(0.7,2,0.6,3) 0.6808 0.9219 0.0323 0.0289 0.0124 0.0042 0.3685 0.0113
(0.8,3,0.7,4) 0.6744 0.9130 0.0321 0.0391 0.0120 0.0035 0.3665 0.0113
(0.8,4,0.8,5) 0.6825 0.9241 0.0323 0.0294 0.0110 0.0027 0.3718 0.0113
(0.8,5,0.9,5) 0.6824 0.9240 0.0323 0.0303 0.0103 0.0026 0.3718 0.0113
sub prob.vectors li satisfy the following equations:
Z0S0 + I1V0 + 0 + .. .=0 (9)
Z0 T0 + J1U1 + I2U2 + 0 + .. .=0 (10)
I1U0 + I2U1 + I3U2 + 0 + .. .=0 (11)
I2U0 + I3U1 + I4U2 + 0 + .. .=0 (12)
liU0 + li+iU1 + Ii+2U2 + ... = 0 where i > 2 (13)
I = I1 Rj-1, where j > 2. (14)
Let the matrix R represents the rate matrix. By substituting equation 12 into the equations 7 to 11, we get
lo So + I1V0 =0 (15)
lo To +11 [U1 + RU2] =0 (16)
l1 [U0 + RU1 + R2U2] =0 (17)
Z1R[U0 + RU1 + R2U2] =0 (18)
l1 Ri-1 [U0 + RU1 + R2U2] =0 i > 2. (19)
The normalizing equation can be expressed as
Z0e +11 [I -R]-1e = 1 (20)
Here e is a column vector in which all elements are 1's in the corresponding column. By using methodologies from Neuts [18] and Latouche and Ramaswami [15]. we have estimated? the rate matrix R. Thus, R is a minimal non-negative solution of the matrix quadratic equations.
U0 + RU1 + R2U2 = 0 (21)
R = - U0 U-1 - R2 U2 U-1 (22)
Where R > 0 and it's an irreducible non-negative matrix of spectral radius smaller than one[18]. Matrix R can be calculated using an iterative approach as shown below.
R0 =0 (23)
Rn+1 = - U0U-1 - RkU2U-1 k > 1 (24)
All values of R will expand monotonically, and non-negative matrix R is converging to -U-1 and [U0 + R2U2]. The steady state is attained via the MGM.
0.2 0.18 0.1S 0.14 0.12
' to =i 0.1 LLI
0.08 0.0S 0.04 0.02 0
3 3.5 4 4.5 5 5.5 6
Figure 4: Influence of E[Ls] for different A w.r.t p0
4. Measuring the Performance Characteristics
The following are some performance measurements for the queueing model under consideration in terms of steady-state probability.
4.1. System State Probabilities
• The probability that the servers are idle: Pjdie = 10,0
• The probability of server 2 is in working vacation: P^y = ETO=i Lm,0
• The probability of server 2 is in complete vacation: PSy = ETO=i im,1
• The probability of server 2 is in FES: P^ES = ETO=i lm,2
• The probability of server 2 is in SOS: pSOs = ETO=i Lm,3
• The probability of server 2 is in breakdown: PSd = ETO=i W
4.2. Expected Numbers of Customers in the System and Queue
• The expected no.of customers in the system and queue:
TO TO TO TO TO
E[Ls] = £ mim,0 + £ mim,1 + £ mim,2 + £ mim,3 + £ mim,4
m=1 m=1 m=1 m=1 m=1
TOTOTOTOTO
E[Lq] = £ (m - 1)lm,0 + £ (m - 1)lm,1 + £ (m - 1)lm,2 + £ (m - 1)im,3 + £ (m - 1)lm,4
m=1 m=1 m=1 m=1 m=1
• The expected no.of customers served is calculated by:
TO
E[SC] = £ [p0lm,0 + (P0 + Pv)^0lm,1 + (^0 + U1 )U0lm,2 + (^0 + ^2)P0lm,3]
m=1
Figure 5: Influence of E[Ls] for different p0 w.r.t A
Figure 6: Influence of E [Ls] for different p 0 w.r.t A
4.3. Estimating the Cost and Revenue
Cost and revenue analysis play an important role in queuing systems as they provide an economic interpretation that can be applied to various technical and industrial situations. We define the total expected cost function per unit time and incorporate service rates as selection factors in order to find the optimal service rates that minimize the total cost f unction. The
following factors are incorporated into our prediction:
Cis = Each customer's holding cost per unit time in the system.
Cv = Cost per customer served in the vacation mode of the server 2.
CF = Cost per customer served in the FES mode of the server 2.
CS = Cost per customer served in the SOS mode of the server 2.
Cn = Cost per customer incurred when a broken down server is under repair.
Cp0 = Cost per customer served in the busy mode of the server 1.
Cp1 = Cost per customer served in the FES mode of the server 2.
Cp2 = Cost per customer served in the SOS mode of the server 2.
Figure 7: Influence of E[Ls] for different ^o w.r.t X
(a) X vs E[Lq], E[Ls]
(b) Fo vs E[Lq], E[Ls]
(c) Fi vs E[Lq], E[Ls] (d) vs E[Lq], E[Ls]
Figure 8: Influence of a few parameters on 2D representation
Total projected cost (TPC) is defined as:
TPC =CisLs + Cv ( Pw2v + PCV ) + CFP% S + CsP^s + Cv P^d + C^o Fo + CH m + Cn F2
If Rev represents customer service revenue, then the system's total anticipated revenue (TAR) is given by:
TAR = Rev * E[SC]
Divya K, Indhira K
COST ANALYSIS & ANFIS COMPUTING OF HETEROGENEOUS RT&A No 3 (74) QUEUEING MODEL UNDER HYBRID VACATION_Volume 18, September 2023
The total profit is given as:
Tprofit = TAR - TPC
The complexity and non-linearity of the cost and revenue functions make it difficult to analyse the behaviour of the cost-revenue model and identify the most suitable values. All computations have been rounded off to two decimal places.
Table 4: Cost set values for various cost aspects
Cost set Cls Cwv Ccv CF Cs CBd CV0 CVi C№
I 45 20 10 30 25 15 20 15 10
II 40 20 10 30 25 15 20 15 10
III 45 25 10 30 25 15 20 15 10
(d) (e)
Figure 9: ANFIS MF for (a) A, (b) p0, (c) p1, (d) p2 (e) pv input variables
4.4. Adaptive neuro-fuzzy inference system (ANFIS)
Jyh-Shing Roger Jang [11] was the person who first proposed ANFIS in 1992. The system combines both fuzzy logic and neural networks to capture much of the uncertainty and inexactness of real-life systems. In its simplest form, ANFIS consists of a number of inference rules that are used to make decisions or predictions. It can be used for classification, optimization, control, and other tasks where accurate predictions are needed. There are several types of ANFIS, including Type-1, Type-2, and hybrid systems. ANFIS is based on the principles of fuzzy logic, which allows it to consider multiple inputs and outputs simultaneously when making decisions. It also uses neural networks to adjust the strength of the rules. The Tagaki-Sugeno (TS) rule is a type of fuzzy inference system most commonly used for regression and control tasks. It is based on the Takagi-Sugeno-Kang formulation, which is an extension of the Mamdani type of fuzzy logic systems. TS rules combine both fuzzy sets and linear models to allow for more accurate predictions. The architecture of ANFIS can be briefly described with the use of fuzzy parameters. This is done using fuzzy "If-Then" rules, which allow us to perform ANFIS
input-output functions and input-output data pairs. Three components are needed for a fuzzy inference system:
(i) selection of fuzzy rules;
(ii) development of a data structure defining the membership functions (MF) used in the fuzzy rules;
(iii) a reasoning mechanism that performs the inference procedure based on the given fuzzy rules.
The fuzzy rules can be defined as
Rule 1 :"If x is X1 and y is Y1 then f1 = p1 x + q1 y + r1",
Rule 2 :"If x is X2 nd y is Y2 then f2 = p2x + q2y + r2".
ANFIS networks can be implemented by using the fuzzy toolbox of MATLAB software, where a Gaussian function is used to select fuzzy input parameters, like A, p0, p1, p2 and . Moreover, linguistic variables are also defined for input parameters as seen in Table 5.
Table 5: Values of the membership function for linguistics based on input parameters
Input parameters No. of membeship function Linguistic Values
A 5 very small, small, medium, large, very large
Fo, Fi, Fi 4 small, medium, large, very large
Fv 3 small, medium, large
5. Numerical Discussions
5.1. Sensitivity Analysis
In this section, MATLAB is utilized to illustrate how system behavior measurements are influenced by various p arameters. The service time, vacation time, breakdown time, and repair time are assumed to be exponentially distributed, and the stability criterion is met by giving the parameters random values. Subsequently, numeric results for the primary performance indicators are obtained.
Variations in A, (p0, p1, p2, , (n1, 01, i/2, 02), are provided to reveal average system size (E[ Ls]), average queue size (E[Lq]), and some performance measures in our queueing model.
Table 1 clearly depicts that as arrival rate (A) rises, E[Ls], E[Lq] also escalates for the value of p0 = 3, = 2, p2 = 1.5, = 1, n1 = 0.5, y2 = 0.7, 01 = 2, 02 = 3, k = 0.8, £ = 1, = 0.2, fa = 0.2, v0 = 0.2, v1 = 0.5, v2 = 0.3.
Table 2 clearly depicts that as (p0, p1, p2, pv) escalates, E[Ls], E[Lq] also diminish for the value of A = 1.7, n1 = 0.5, n2 = 0.7, 01 = 2, 02 = 3, k = 0.8, £ = 1, = 0.2, fa = 0.2, v0 = 0.2, v1 = 0.5, v2 = 0.3.
Table 3 clearly depicts that as (n1, 01, n2, 02) varies, E[Ls],E[Lq] are changed for the value of A = 1.7, p0 = 3, = 2, p2 = 1.5, = 1, k = 0.8, £ = 1, <pv = 0.2, = 0.2, v0 = 0.2, v1 = 0.5, v2 = 0.3.
Figure 2 illustrates the impact of v0 for various values of p2 on the servers' idle state (i0,0). The image illustrates that, when the value of p2 is held constant, the idle probability, shown by i0,0, drops as one increases the value of v0. This is because when v0 rises, the number of customers choosing for SOS increases, and as a consequence, the server's idle probability drops.
Figure 3 shows the increasing nature of the number of customer in the system with varying values of ^0- Figures. 4, 5, 6 and 7 demonstrate that an increase in the service rate of the second server in busy and vacation modes leads to a decrease in the number of customers (E[ Ls]) within the system. Moreover, these figures illustrate the effects on E[Ls] when varying values of
A, ni and are applied.
Figure 8 (a) indicates that as the arrival rate (A) increases, the expected queue length (E[Lq ]) and expected system length (E[Ls]) also rises. On the other hand, Figures 8 (b-d) show that when the service rate of server 1 (^0) or servers 2 ^2) increases, the expected queue length (E[Lq]) and the expected system length (E[Ls ]) diminish.
E[LJ 15 ^ E[Ls] 0 1
(d) vs Ls, Ws (e) vs Ls, Ws
Figure 10: Influence of a few parameters on 3D representation
Figure 10(a - e) shows a three-dimensional graph depicting system performance measures. In Figure 10 (a), the surface illustrates an increase in the arrival rate (A), expected system length (E[Ls]), and expected waiting time in the system (E[Ws]) increase. Figures 10 (b) and (c-d) demonstrate that as the service rates of server 1 (^0) and server 2 (^1, ^2) increase, the expected system length (E[Ls]) and the expected waiting time in the system (E[Ws]) decrease. Figure 10(e) further shows that when the vacation rate ^v increases, expected system length (E[Ls]) and expected waiting time in the system (E[Ws]) also decrease.
5.2. Anfis Computing and results
Tthe ANFIS results are constructed and verified by the Matlab software by executing the 'neuroFuzzyDesigner' command. The accuracy of the ANFIS outputs for E[Ls] can be examined using the absolute percentage errors. Aa is provided by
Aa =
E[ Ls ] - E[ Ls ]
E[ Ls ]
x 100%
where Aa is absolute percentage error, E[Ls] exact value of the expected no.of customers in
the system by analytical method, E[Ls] estimated expected no.of customers in the system by ANFIS technique for varying values of (i) A (ii) ^0 (iii) ^1 (iv) ^2 (v) ^v are recorded, and the absolute percentage errors (Aa) and accuracy of the estimated value in percentage of E[Ls] are also summarized in Tables 6-7.
Lesser The Fe value indicates that our ANFIS method is closer to the analytical method's
(a) A VsE[Ls]
(b) Vs E[Ls]
(c) m Vs E[ Ls ]
(d) Vs E[Ls ]
(e) Vs E[Ls]
Figure 11: E[Ls ] Vs (a) A, (b) ^, (c) m, (d) p2 (e) pv
results. Figures 7 (a-d) depict the graphs of membership functions for input values (i). lambda (ii) p0 (iii) fa (iv) pv. The tick marks in Fig. 11 (a-d) represent the ANFIS results for the ESL forecast, while the continuous lines represent the analytical results. In these images, there are check marks almost completely covering the curved lines. This suggests that both outcomes are favourable.
Table 6: Values of the Aa, E[Ls], E[Ls] by varying input parameters A, p0
A E[ Ls ] e[ Lis ] Aa m0 E[ Ls ] E[ Ls ] Aa
0.5 0.1862 0.186 0.1074 3 1.2737 1.27 0.2905
0.6 0.2378 0.238 0.0841 4 0.8209 0.821 0.0122
0.7 0.2904 0.290 0.1377 5 0.5589 0.559 0.0179
0.8 0.348 0.348 0.0000 6 0.4409 0.441 0.0227
1.0 0.478 0.478 0.0000 7 0.2693 0.269 0.1114
1.1 0.5539 0.554 0.0181 7.5 0.3323 0.332 0.0903
1.2 0.6411 0.641 0.0156 8 0.2884 0.288 0.1387
1.3 0.7384 0.738 0.0542
1.4 0.8442 0.844 0.0237
1.5 0.9796 0.98 0.0408
Average of K 0.0482 Average of Aa 0.0977
Accuracy in predicted value (%) 99.951 Accuracy in predicted value(%) 99.902
5.3. Cost Optimization
The estimated cost per unit of time TPC and total anticipated revenue TAR are found to be $132.3475 and $243.40 when certain values for the parameters are used such as A=1, p0=6, p1=3, p2=3.5, pv=2, n1=0.8, 61=5 , n2=0.9, 02=5, k=0.8, £=1, 0.1, ^=0.2, v0=0.2, v1=0.5, v2=0.3,
Table 7: Values of the Aa, E[Ls], E[Ls] by varying input parameters , p2 pv
m E[ Ls ] E[ Ls ] Aa P2 E[ Ls ] E[ Ls ] Aa Pv E[ Ls ] E[ Ls ] Aa
2 0.8209 0.821 2.5 0.5589 0.559
3 0.4409 0.441 3.5 0.2693 0.269
4 0.3323 0.332
Average of Aa Accuracy in predicted value (%)
0.0122 1.5 0.4409 0.441
0.0179 2 0.2693 0.269
0.0227 2.5 0.3323 0.332
0.1114 3 0.2884 0.29 0.0903
0.0509 Average of Aa
99.9491 Accuracy in
predicted value (%)
0.0227 1 0.8209 0.821 0.0122
0.1114 1.1 0.5589 0.559 0.0179
0.0903 1.2 0.4409 0.441 0.0227
0.5548 1.3 0.2693 0.269 0.1114
1.4 0.3323 0.332 0.0903
1.5 0.2884 0.29 0.5548 0.1948 Average of Aa 0.1349
99.8052 Accuracyin 99.8651
predicted value (%)
Rev=250 are taken into consideration. To gauge the impact of changing the cost parameters, the cost function was examined for three different cost set values, as displayed in Table 4. In the feasible interval, the cost function is convex with regard A, p1, p2 and n1, n2 as seen in Figs. 13(a-c) - 15(a-c).
0.5 1 1.5
arrival rate A
Figure 12: Impact of A on TPC, TAR
(a) TPC Vs A, E[Ls] (b) TPC Vs A, E[Ls] (c) TPC Vs A, E[Ls]
Figure 13: Total projected cost varying values of A, E[Ls ]
(a) TPC Vs m0, m (b) TPC Vs m0, m (c) TPC Vs m0, m
Figure 14: Total projected cost varying values of m0, m
(a) TPC Vs ni, E[Ls] (b) TPC Vs ni, E[Ls] (c) TPC Vs ni, E[U]
Figure 15: Total projected cost varying values of ni, E[Ls]
The effect of A on TPC and TAR in the model is depicted in Figure 12. As A increases, the total elapsed cost and total expected response also increase. The point at which there is neither gain nor loss is seen around A = 0.53, based on the set of cost values given for the model. If A is lower than 0.53, there will be a loss, and when A is greater than 0.53, the system will see a profit. Thus, with knowledge of the customer arrival rate, appropriate actions can be taken to reduce the TPC and maximize the TAR. Our model's TPC and TAR are shown with the relevant values in Table 8.
6. Conclusion
This research explores a heterogeneous and unreliable server queueing system with the addition of a second optional service, feedback, and breakdown in a hybrid vacation scheme. Through numerical examples, The efficiency of the matrix-geometric technique in determining steady-state probabilities and other performance metrics has been discovered. Utilizing the matrix-geometric approach and Adaptive Network-Based Fuzzy Interference System (ANFIS) for calculating performance indices and the cost function, it has been shown that the model can be used in a real-time system. By comparing the results from ANFIS and the numerical results, we can demonstrate the usefulness of a neural-fuzzy tool to assess the performance of queueing systems based on commercial and technological standards. Lastly, this strategy can be further applied to more realistic scenarios, such as those with the concepts of a phase-type arrival and impatient customer, standby servers and Markovian models like MAP/PH/1 and GIX/Geo/1 queues.
Acknowledgement: Not applicable
Funding: Not applicable
Data Availability: Not applicable
Supplementary Materials: Not applicable
Conflicts of Interest: The authors declare no conflict of interest.
References
[1] Ahuja, A. Jain, A. Jain, M. (2022) Transient analysis and ANFIS computing of unreliable single server queueing model with multiple stage service and functioning vacation. Mathematics and Computers in Simulation. 192:464-490. https://doi.org/10.1016/j.matcom. 2021.09.011
[2] Anitha, K. Maragathasundari, S. Bala, M. (2017) Queuing system of bulk arrival model with optional services in third stage and two different vacation policies. International Journal of Mathematics. 5:711-721.
[3] Bouchentouf, A. A. Boualem, M. Yahiaoui, L. Ahmad, H. (2022) A multi-station unreliable machine model with working vacation policy and customers' impatience. Quality Technology & Quantitative Management. 1-31. D01:10.1080/16843703.2022.2054088
[4] Bouchentouf, A. A. Cherfaoui, M. Boualem, M. (2019) Performance and economic analysis of a single server feedback queueing model with vacation and impatient customers. Opsearch . 56:300-323. http://dx.doi.org/10.1007/sl2597-019-00357-4
[5] Chang, F. M. Liu, T. H. Ke. J. C. (2019) On an unreliable-server retrial queue with customer feedback and impatience. Applied Mathematics and Modelling . 55:171-182. http: //dx.doi.org/10.1016/j.apm.2017.10.025
[6] Chandrika, K.U. Kalaiselvi. C. (2013) Batch arrival feedback queue with additional multi optional service and multiple vacation. International Journal of Scientific Research Publications. 3(3):1-8. https://www.ij srp.org/research-paper-0313.php?rp=P15833
[7] Chakravarthy, S.R. Shruti, Kulshrestha. (2020) Queueing model with server breakdowns, repairs, vacations, and backup server. Operations Research Perspectives. 7:100131 https: //doi.org/10.1016/j.orp.2019.100131
[8] Ezeagu, N.J. Orwa, G. O. Winckler. M.J. (2018) Transient analysis of a finite capacity M/M/1 queuing system with working breakdowns and recovery policies. Global Journal of Pure and Applied Mathematics . 14(8):1049-1065. D0I:10.12691/ajams-7-l-l
[9] Li, N. (2016) Stanford. Multi-server accumulating priority queues with heterogeneous servers. European Journal of Operational Research . 252(3):866-878. DOI: 10.1016/j . ej or. 2016.02.010
[10] Li, J. Wang, J. (2006) An M/G/1 retrial queue with second multi-optional service, feedback and unreliable server. Journal ofApplied Mathematics. 21:252-262.
[11] Jang, J.S. (1993) ANFIS: adaptive-network-based fuzzy inference system. IEEE Transactions on Systems, Man, and Cybernet ics. 23(3):665-685. http://dx.doi.org/10.1109/21.256541
[12] Jang, J.S.R. Sun, C.T. Mizutani. E. (1997) Neuro-fuzzy and soft computing-a computational approach to learning and machine intelligence. IEEE Transactions on Automat. 42(10):1482-1484. http://dx.doi.org/10.1109/TAC.1997.633847
[13] Ke, J.C. Wu, C.H. Pearn, W.L. (2013) Analysis of an infinite multi-server queue with an optional service. Computers & Industrial Engineering. 65(2):216-225. http: //dx. doi. org/ 10.1016/j.cie.2013.02.017
[14] Krishnamoorthy, A. Sreenivasan, C. (2012) An M/M/2 queueing system with heterogeneous servers including one with working vacation. International Journal of Stochastic Analysis.
[15] Latouche, G. Ramaswami, V. (1999) Introduction to matrix analytic methods in stochastic modeling. SIAM Review. . https://doi.org/10.1155/S1048953399000362
[16] Kumar Anshul, Madhu Jain. (2022) Cost Optimization of an Unreliable server queue with two stage service process under hybrid vacation policy. Mathematics and Computers in Simulation.259-281. https : //doi. org/10.1016/j .matcom. 2022.08.007
[17] Morse, P. M. (2004) Queues, inventories and maintenance: the analysis of operational systems with variable demand and supply. Courier Corporation.
[18] Neuts, M.F. (1981) Matrix-Geometric solutions in stochastic models. Johns Hopkins University Press .
[19] Servi, L.D. Finn, S.G. (2002) M/M/1 queues with working vacations (M/M/1/WV), Performance Evaluation. 50(1):41-52. http : //dx. doi. org/10.1016/S0166-5316 (02) 00057-3
[20] Sethi, R. Jain, M. Meena, R.K. Garg, D. (2020) Cost optimization and ANFIS computing of an unreliable M/M/1 queueing system with customers impatience under N-policy. International Journal of Applied Mathematics and Statistics . 6:1-14. https ://link, springer. com/article/10.1007/s40819-020-0802-0
[21] Shekhar, C. Varshney, S. Kumar. A. (2021) Matrix-geometric solution of multi-server queueing systems with Bernoulli scheduled modified vacation and retention of reneged customers: A meta-heuristic approach. Quality Technology & Quantitative Management. 18(1):39-66. http://dx.doi.org/10.1080/16843703.2020.1755088
[22] Vijaya Laxmi, P. Jyothsna, K. (2022) Cost and revenue analysis of an impatient customer queue with second optional service and working vacations. Communications in Statistics-Simulation and Computation. 51(8:4799-4814. 10.1080/03610918.2020.175237
[23] Vijayalakshmi, V. Kalidass, K. Pavitha, K. (2018) An M/M/1/N queue with working breakdowns and a two-phase service. International Journal of Pure and Applied Mathematics 119(15):2285-2297.
[24] Upadhyaya, S. Kushwaha, C. (2020) Performance prediction and ANFIS computing for unreliable retrial queue with delayed repair under modified vacation policy. International Journal of Mathematics in Operational Research. 17(4):437-466. https://doi.org/10.1504/ IJM0R.2020.110843
[25] Wu, C.H. Yang, D.Y. (2021) Bi-objective optimization of a queueing model with two-phase heterogeneous service . Computers & Operations Research 130:105230. http://dx.doi.org/ 10.1016/j.cor.2021.105230
[26] Yang,D.Y. Wang, K.H. Kuo, Y.T. (2011) Economic application in a fnite capacity multichannel queue with second optional channel. Applied Mathematics and Computation 217(18):7412-7419 . http://dx.doi.0rg/lO.lOl6/j.amc.2011.02.031
[27] Yang, D.Y. Chen, Y.H. (2018) Computation and optimization of a working breakdown queue with second optional service. Journal of Industrial and Production Engineering 35(3):181-188. http://dx.doi.org/10.1080/21681015.2018.1439113
[28] Ye, Q. Liu, L. (2017) Analysis of MAP/M/1 queue with working breakdowns. Communications in Statistics - Theory and Methods 47(13) 3073-308. http : //dx. doi. org/10.1080/ 03610926.2017.1346808
[29] Ziad, I. Laxmi, P.V. Bhavani, E.G. Bouchentouf, A. A. Majid . (2023) Matrix Geometric Solution of a Multi-Server Queue With Waiting Servers and Customers Impatience Under Variant Working Vacation and Vacation Interruption. Yugoslav journal of operations research . http://dx.doi.org/10.2298/YJ0R220315001Z
£
u
E-i
«g
.«
S
TS S
TS S
-o £
<<
TAR 00 G^ 00 c* 8 c* TAR K C^ K C^
in T-H ^ no T-H in T-H ^ Ifi rH CO MO m ^ MD m MD m ^
TPC CO .8 TPC o c^
cK T-H ^ T-H CO K T-H CO T-H MD CO T-H c-J ^ T-H
TAR K T-H K T-H K t-H TAR CO CO CO CO CO CO
<N 00 CO <N 00 CO <N 8 CO in <N 8. 8. ^ 8.
TPC CN ^ o <"1 ^ in TPC .8 CO r1 m
no T-H cK m T-H K T-H cK CO T-H 8. CO T-H T-H
TAR VC CO M2 CO VC CO TAR r1 <"1
cK ^ CO cK CO cK CO T-H <N "i uo m CO no m CO HO m CO
TPC CO MO o T-H CO TPC c^ ^ c^ c^ T-H
00 m T-H ^ m T-H CO vc T-H t^ uo CO T-H ^ CO T-H Gi T-H
TAR m c* m c* m c* TAR o o O
o CN CO o CN CO o CN CO T-H UO T-H ^ ^ o ^ ^ ^
TPC p m oo CO CO yi TPC CO .8 CN CN
m T-H o m T-H 8. m T-H T-H c-J T-H cK T-H
TAR K K K TAR 8 8 8
T-H C^ CN T-H CN T-H CN UO T-H C^ ^ C^ ^ CO ^
TPC m p 8 8 in <N TPC T-H T-H T-H
o m T-H T-H ^ m T-H at Gi m T-H ^ T-H m T-H
TAR m p m p m p TAR <N T-H CN T-H CN T-H
co vc CN CO CN co CN T-H UO 8. m ^ 8. m 8. m
TPC m m M2 T-H CO T-H T—H CN TPC T-H 8 CN
M0 ^ T-H T-H T—H m T-H T-H 8. m T-H MD VO T-H
f) ^ o
O O O
CO C^ C^
^ ^
CN CN CN
8 ^ ^
r1 C^ T-H
C^ c-J 8.
CO CO CO
t-H T-H T-H
T-H T-H T-H
^ ^ o
m m m
<N <N CN
T-H
uo
uo C^ ^
^ m
T-H T-H T-H
K K K
MD MD
m m m
<N <N CN
o 8 CO
c^ uo no
uo c^ ^
^ ^ m
T-H T-H T-H
CN CN CN
U0 U0 m
K
CN <N CN
m T-H
.8
T-H
m
T-H T-H T-H
m m m
c^
K
m m m
CN <N CN
CN CO
MD c^ o
^ m
T-H T-H T-H
CN CN CN
C^ C^ C^
8. 8. 8.
m m m
<N CN CN
K <N K
T-H .8
MD C^ ^
^ ^ m
T-H T-H T-H
