Next Article in Journal
Real-Time Management for an EV Hybrid Storage System Based on Fuzzy Control
Next Article in Special Issue
Choquet-like Integrals with Multi-Neighborhood Approximation Numbers for Novel Covering Granular Reduction Methods
Previous Article in Journal
Adaptive Multi-Path Routing Protocol in Autonomous Vehicular Networks
Previous Article in Special Issue
Fixed/Preassigned-Time Stochastic Synchronization of Complex-Valued Fuzzy Neural Networks with Time Delay
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

An Integrated Group Decision-Making Framework for the Evaluation of Artificial Intelligence Cloud Platforms Based on Fractional Fuzzy Sets

1
Department of Mathematics, Abdul Wali Khan University Mardan, Mardan 23200, Khyber Pakhtunkhwa, Pakistan
2
Department of Information Systems, Faculty of Computing and Information Technology, King Abdulaziz University, Jeddah 21589, Saudi Arabia
*
Author to whom correspondence should be addressed.
Mathematics 2023, 11(21), 4428; https://doi.org/10.3390/math11214428
Submission received: 5 August 2023 / Revised: 29 August 2023 / Accepted: 29 August 2023 / Published: 25 October 2023

Abstract

:
Due to the rapid development of machine learning and artificial intelligence (AI), the analysis of AI cloud platforms is now a key area of research. Assessing the wide range of frameworks available and choosing the ideal AI cloud providers that may accommodate the demands and resources of a company is mandatory. There are several options, all having their own benefits and limitations. The evaluation of artificial intelligence cloud platforms is a multiple criteria group decision-making (MCGDM) process. This article establishes a collection of Einstein geometric aggregation operators (AoPs) and a novel Fractional Fuzzy VIKOR and Fractional Fuzzy Extended TOPSIS based on the entropy weight of criteria in fractional fuzzy sets (FFSs) for this scenario. The FFSs provide an evaluation circumstance containing more information, which makes the final decision-making results more accurate. Finally, this framework is then implemented in a computational case study for the evaluation of artificial intelligence cloud platforms and comparison of this model with other existing approaches, such as the extended GRA approach, to check the consistency and accuracy of the proposed technique. The most optimal artificial intelligence cloud platform is I 1

1. Introduction

Machine learning (ML) may be highly suitable for cloud computing applications. Cloud services allow for fast deployment. Spin-down, shutdown, and activation of large-scale computing collections with zero downtime, with information never leaving the servers or IT system of enterprises. Cloud services are adaptable as enterprises develop. Approaches involving artificial intelligence (AI) are especially beneficial in this context. In particular, certain assignments may demand that AI models be trained on hundreds of terabytes of organized information. Consequently, developers do not need to start tasks from the beginning. These characteristics guarantee that AI development is effective, obtainable, and comprehensible. Cloud AI platforms deliver an entirely novel environment for business enterprises that want to explore AI but may not know where to start [1,2,3,4]. Due to the rising use of AI technologies, analysis of cloud platforms that offer AI services is becoming more and more crucial. Yet, existing evaluation techniques frequently fail to identify ambiguity and uncertainty related to decision-making in this circumstance. The problems present in the analysis of AI cloud service platforms were recently investigated utilizing the multi-criteria group decision-making (MCGDM) method [5,6,7]. Therefore, many theories were developed to handle the uncertainty and impreciseness in such scenarios. First of all, L.A Zadeh [8] in 1965 developed the notion of a new set called fuzzy set (FS) having one positive degree of membership (DM) and that DM belongs to the close interval [0, 1]. The FS has failed to illustrate the uncertainty of an object because there is no analysis of the non-membership degree. To cover this drawback, Attanassov [9,10] introduced the new notion of the intuitionistic fuzzy set (IFS) having two degrees: one is the positive degree of membership (DM), and the other is called the degree of negative non-membership (DNM) with the condition that the sum of these two degrees is always in the domain of zero and one. The IFS is of great importance in decision-making (DM) and is supposed to be the most powerful tool for dealing with uncertainties in MCDM scenarios. However, after some time, there are many cases where the accumulation of DM and DNM exceeds one, which violates the basic property of IFS. To handle these limitations of IFS, Yager [11,12] introduced the phrase concept of a new set called Pythagorean fuzzy set (PyFS), also with two degrees: one is the positive DM, and the other is the negative DNM with the condition that the accumulation of the squares of DM and DNM always pertain to the close interval [0, 1]. PyFS is more widely used in decision-making (DM) issues than IFS and FS. PyFS restricts the decision experts in many real-world problems. To deal with these limitations, more detailed algorithms were needed. After that, Yager [13] broadened the concept of PyFS and established the new notion of a set called q-rung orthopair fuzzy set (𝓺-ROFS) having also two degrees; one is DM and the other is DNM with the condition that the sum of the q t h   ( q Z ) power of DM and DNM pertains to the close interval zero and one. It is the generalized form of PyFS, IFS, and FS. After the development of 𝓺-ROFS many scholars researched and solved many real-life decision-making (MD) problems which was not solved by other extensions of FS. However, 𝓺-ROFS also has some limitations because its domain has no analysis about the fractional numbers (FNs). To solve this problem, Abdullah et al. [14] extended the domain of 𝓺-ROFS to fractional numbers (FNs) and developed the notion of a new set called fractional fuzzy set (FFS), which is also a two-degree system, but here one degree is called DM, and the other is DNM with the condition that 0 η F f + υ F f 1 where ( f = p / q ) is fractional number (FN). FFS generalized all the extensions of FSs.
From the above literature review, we concluded that no study has been conducted on the fractional fuzzy set (FFS). The FFS is the extension of FS, IFS, PyFS, and q-ROFS. So, we define the Einstein sum and product in an FFS environment, and on the basis of these Einstein operations, we define Einstein operational laws and their application to real-world decision-making problems.

1.1. Related Studies

The role of aggregation operators (AoPs) is very advantageous in MCDM problems. Aggregation operators are used to collect (aggregate) the expert knowledge that exceeds the knowledge of individual experts. Now, there are some Einstein geometric aggregation operators (AoPs) in the literature review, which are based on different extensions of fuzzy sets (FS). Some of them are reviewed as follows. Zhao et al. [15] defined a collection of Einstein AoPs and also applied them to real-life situations in an IF environment. Abdullah et al. [16] and Mahmood et al. [17] discussed a series of Einstein AoPs and their application to decision-making for PyFS information. Zulqarnain et al. [18] and Wu et al. [19] reviewed a group of Einstein geometric AoPs for q-ROF information and also applied them to a decision-making system.
Consequently, keeping in mind the significance and application of the aforementioned aggregation operators in our proposed study, we broadened the already existing operators and introduced the notion of fractional fuzzy Einstein geometric aggregation operators (AoPs) in an FFS environment.
Methods are the specific tools and procedures you use to collect and analyze data and find the best optimal alternative. Different techniques are used to help us in various group decision-making problems. Here, we discussed some methods as follows. Vikram et al. [20] discussed the steps of extended TOPSIS methods applied to decision-making problems in an IF environment. Lue et al. [21] also discussed the main points of the extended TOPSIS method in an IF environment. After that, Zhang and Zeshui [22] discussed the steps of the extended TOPSIS method and its applications to decision-making problems in a PyFS environment. Fatih et al. [23] also discussed the steps of the extended TOPSIS method and applied it to a real-life (risk analysis) decision-making scenario of PyFS information. Recently, Ravinder [24] discussed the steps of the extended TOPSIS method and its application to many real-world complex problems on PyFS information. Mehmet et al. [25] extended the extended TOPSIS method to a q-ROFS environment and its application to multi-criteria decision-making problems. Furthermore, Jakub et al. [26] discussed the steps of the VIKOR method in an IF environment. Pratibha [27] highlighted the steps of the VIKOR method in a PyFS environment and applied it to decision-making problems (DMPs). Further, many scholars [28,29,30] analyzed the VIKOR approach for different advancements of FSs.
Based on the above literature review, we conclude that there is no extensive utilization of the extended TOPSIS method and VIKOR method applied to FFS information.

1.2. Motivation of This Study

Based on the above literature review, the authors reach the result that there is no remarkable study implemented on FFS information. The motivation supporting this technique is to present a more detailed and comprehensive analysis of AI cloud platforms by including a variety of parameters and implementing along the vagueness present in personal assessments. Using FFSs, the motivation of the developed study is outlined as follows;
  • To define new Einstein operational laws in an FFS environment.
  • On the basis of these operational laws, define a new set of Einstein geometric aggregation operators (AoPs) in the same environment.
  • To develop a new approach to the extended TOPSIS method and VIKOR method in an FFS environment.
  • To verify and apply the proposed method to a real-life decision-making issue, as discussed below.

1.3. Contribution of This Study

From the above overall discussion, the authors conclude that there is no utilization of FFS information in any decision support system. So, we proposed some studies on FFS. As demonstrated by the earlier discussion of the literature studies that are currently available, a qualitative study analyzing the AICP using the VIKOR approach and the extended TOPSIS approach under FFSs has still not been conducted. Therefore, the VIKOR approach and the extended TOPSIS technique under FFSs are proposed to analyze the AICP MCGDM. The main contributions of this study are outlined as follows:
  • We defined new Einstein operational laws in an FFS environment.
  • On the basis of these operational laws, we defined a new Einstein geometric aggregation operator (AoPs) in an FFS environment.
  • The FF–VIKOR technique and FF-Extended TOPSIS approach were formulated for MCGDM issues in an FFS environment.
  • We verified our proposed method with a real-life decision-making issue for the evaluation of artificial intelligence cloud platforms.
The structure of the study is outlined as follows. We write the introduction in the Section 1. In Section 2, the fundamental knowledge related to FS is discussed. The Einstein norms and operational laws are reviewed, and on the basis of these laws, we propose Einstein geometric aggregation operators in Section 3. The Methodology-I of the extended TOPSIS method is analyzed in Section 4. The Methodology of the VIKOR method is discussed in Section 5. A real-life case study was discussed in Section 6. The numerical results of the proposed VIKOR method are in Section 7. The numerical results of the proposed extended TOPSIS method are discussed in Section 8. Comparative analysis and discussion are examined in Section 9. In Section 10, we end with the conclusion.

2. Fundamental Knowledge

Let Z ϕ be a non-empty set. An FS 𝔒 can be described in the form of a mathematical expression, 𝔒 = z , η ~ O z | z Z , where   η B   is a mapping Z : η B   0 ,   1 and for each z Z , η B z is known as the grade of membership of z in Z . An IFS can be defined as equation = z , η ~ z , υ ~ z | z Z , where η ~ z and υ ~ z are mapping from Z to [ 0 ,   1 ] with the condition 0     η ~ z + υ ~ z   1 for every z in Z . The PFS P can be defined as P = z , η ~ P z , υ ~ P z | z Z , where η ~ P z , υ ~ P z : Z [0, 1] with the condition that 0 η ~ P 2 z + υ ~ P 2 z 1 for all z Z , and they represent the degree of MD and DNM of an object z Z to the set P. Let π P ( z ) = 1 η ~ P z υ ~ P z is denotes indeterminacy membership degree of   z . Let Z ϕ be a non-empty set. The 𝓺-ROFS Q can be defined as, Q = z , η ~ Q z , υ ~ Q z , 0 η ~ Q q z + υ ~ Q q z 1 | z Z , where η ~ P z , υ ~ P z are the function of membership and non-membership and always belong to [0, 1] and Ω Q ( z ) = 1 η ~ Q q z υ ~ Q q z q are the degree of indeterminacy. The FFS is a F mathematical object of the form F  = z , η ~ F z , υ ~ F z , 0 η ~ F f z + υ ~ F f z 1 | z Z where ( f = p / q ) and η ~ F : X   [ 0,1 ] and   υ ~ F : X   [ 0,1 ] are the membership and NM mappings with the condition that 0 η F f + υ F f 1 for all z Z . In addition, Ω F ( z ) = 1 η ~ F f z υ ~ v f z f denote the indeterminacy MD of z Z .
From the above equations, it can be determined that among q-ROFS, IFS, and PFS, FFS is the most popular type with the condition that 0 η F f + υ F f 1, where ( f = p / q ) , when p and q take distinct numbers, we obtain distinct FSs.
Case 1.
If ( f = p q 1 , p = q = 1 ) , then the FF set becomes the IF set.
= z , η ~ z , υ ~ z | z Z with subject 0     η ~ z + υ ~ z   1 for all z Z .
Case 2.
If   ( f = p q 1 , p = 2 q ) , then the FF set becomes the PyFS set.
P = z , η ~ P z , υ ~ P z | z Z with the condition that 0 η ~ P 2 z + υ ~ P 2 z 1 for all z Z .
Case 3.
If ( f = p q 1 ,   p = 3 , q = 1 ) , then FFS reduces to Farmatean fuzzy set.
Q = z , η ~ Q z , υ ~ Q z , 0 η ~ Q 3 z + υ ~ Q 3 z 1 | z Z for all z Z .
Case 4.
If ( f = p q 1 ,   p 3 , q = 1 ) , then FFS reduces to 𝓺-ROFS.
Q = z , η ~ Q z , υ ~ Q z , 0 η ~ Q q z + υ ~ Q q z 1 | z Z for all z Z .
Let R = ( η ~ R , υ ~ R ) be a FFN. Then, the score function S r R and accuracy function A r ( R ) can be defined as follow:
S r R = η ~ R ( z ) f υ ~ R ( z ) f ,   where 1 S r z 1
A r R = η ~ R ( z ) f + υ ~ R ( z ) f ,   where   0 S r z 1

3. Fractional Fuzzy Einstein norms and Aggregation Operators (AoPs)

Let S and T be two fractional fuzzy numbers (FFNs). Then, the Einstein norms are defined as,
S T = S . ϵ T 1 + 1 S f . ϵ ( 1 T f ) f
S T = S f + T f 1 + S f . ϵ T f f

3.1. Fractional Fuzzy Einstein Operational Laws

In the current section, first, we introduced the fractional fuzzy Einstein operational laws based on Einstein t-norm and t-conorm in an FFS setting.
R 1 ϵ R 2 = η ~ 1 f + η ~ 2 f 1 + η ~ 1 f . ϵ η ~ 2 f f , υ ~ 1 . ϵ υ ~ 2 1 + 1 υ ~ 1 f . ϵ ( 1 υ ~ 2 f ) f
R 1 ϵ R 2 = a 1 . ϵ a 2 1 + 1 η ~ 1 f . ϵ 1 η ~ 2 f f , υ ~ 1 f . ϵ υ ~ 2 f 1 + υ ~ 1 f . ϵ υ ~ 2 f f
I . ϵ R = 1 + η ~ f I + 1 η ~ f I 1 + η ~ f I + 1 η ~ f I f , 2 f υ ~ I 2 υ ~ f I + υ ~ f I f
R γ = 2 f · ϵ η ~ γ 2 η ~ f γ + η ~ f γ f , 1 + υ ~ f γ 1 υ ~ f γ 1 + υ ~ f γ + 1 υ ~ f γ f

3.2. Fractional Fuzzy Einstein Geometric Aggregation Operators

Here, we shall develop the fractional fuzzy geometric aggregation operators with the help of Einstein norms and operational laws. Now we discuss one by one as follows:

3.3. Fractional Fuzzy Einstein Weighted Geometric Aggregation Operator (AoP)

Let R ρ = ( η ~ R ρ , υ ~ R ρ ) ρ = 1 ,   2 ,   3 ,   n be a collection of all fractional fuzzy numbers. Then, the fractional fuzzy Einstein weighted geometric FFEWG aggregation operator can be defined as where ( f = p / q ),
F F E W G w R 1 , R 2 , R 3 , . . . , R n = 2 ρ = 1 n η ~ R ρ f w ρ f ρ = 1 n 2 η ~ R ρ f w ρ + ρ = 1 n η ~ R ρ f w ρ f , ρ = 1 n 1 + υ ~ R ρ f w ρ ρ = 1 n 1 υ ~ R ρ f w ρ f ρ = 1 n 1 + υ ~ R ρ f w ρ + ρ = 1 n 1 υ ~ R ρ f w ρ f
where w =   w 1 ,   w 2 , w 3 ,   .   .   .   ,   w n T are the accumulated weighted vectors such that w ρ 0 , 1 ,   ρ = 1 n w ρ = 1 .

3.4. Fractional Fuzzy Einstein Order Weighted Geometric Aggregation Operator (AoP)

Let R ρ = ( η ~ R ρ , υ ~ R ρ ) ρ = 1 ,   2 ,   3 ,   n be a collection of fuzzy fractional values. Then, the fractional fuzzy Einstein-ordered weighted geometric FFEOWG aggregation operator can be defined as where ( f = p / q ),
F F E O W G w R 1 , R 2 , R 3 ,   .   .   .   , R n = 2 ρ = 1 n η ~ R σ ρ f w ρ f ρ = 1 n 2 η ~ R σ ρ f w ρ + ρ = 1 n η ~ R σ ρ f w ρ f , ρ = 1 n 1 + υ ~ R σ ρ f w ρ ρ = 1 n 1 υ ~ R σ ρ f w ρ f ρ = 1 n 1 + υ ~ R σ ρ f w ρ + ρ = 1 n 1 υ ~ R σ ρ f w ρ f
where w =   w 1 , w 2 , w 3 , . . . , w n T is the weighted vector of R σ ρ ρ = 1 ,   2 ,   3 ,   n such that w ρ 0 , 1 ,   ρ = 1 n w ρ = 1 . In addition, σ 1 , σ 2 , σ 3 ,   , σ ( n ) is a permutation of ( 1 , 2 , 3 , , n ) such that R σ ρ R σ ρ 1 for all ρ .

3.5. Fractional Fuzzy Einstein Hybrid Geometric Aggregation Operator (AoP)

The fractional fuzzy Einstein hybrid geometric FFEHG aggregation operator can be defined as,
F F E H G w ( R 1 , R 2 , R 3 ,   .   .   .   , R n ) = 2 ρ = 1 n η ~ R ̿ σ ρ f w ρ f ρ = 1 n 2 η ~ R ̿ σ ρ f w ρ + ρ = 1 n η ~ R ̿ σ ρ f w ρ f , ρ = 1 n 1 + υ ~ R ̿ σ ρ f w ρ ρ = 1 n 1 υ ~ R ̿ σ ρ f w ρ f ρ = 1 n 1 + υ ~ R ̿ σ ρ f w ρ + ρ = 1 n 1 υ ~ R ̿ σ ρ f w ρ f
where R ̿ σ ρ = R ρ n w ρ ρ = 1 ,   2 ,   3 ,   n , w =   w 1 ,   w 2 , w 3 ,   .   .   .   ,   w n T be the weighted vector of fractional fuzzy Einstein hybrid geometric operator. If the weighted vector w =   w 1 ,   w 2 , w 3 ,   .   .   .   ,   w n T access to 1 n , 1 n , 1 n ,   .   .   .   , 1 n T , then the vector R 1 n W 1 , R 2 n W 2 , R 3 n W 3 , , R n n W n access R 1 , R 2 , R 3 ,   ,   R n T .
Theorem 1.
Let  R ρ = η ~ R ρ , υ ~ R ρ , ρ = 1 ,   2 ,   3 ,   n be a group of fractional fuzzy numbers. Following that, their aggregated values by employing FFEWA AoP is also a fractional fuzzy number (FFN), where ( f = p / q ),
F F E W G w R 1 , R 2 , R 3 ,   .   .   .   , R n = 2 f ρ = 1 n η ~ R ρ f w ρ ρ = 1 n 2 η ~ R ρ f w ρ + ρ = 1 n η ~ R ρ f w ρ f   ,   ρ = 1 n 1 + υ ~ R ρ f w ρ ρ = 1 n 1 υ ~ R ρ f w ρ f ρ = 1 n 1 + υ ~ R ρ f w ρ + ρ = 1 n 1 υ ~ R ρ f w ρ f
Proof. 
First, mathematical induction can be used to prove this theorem for every positive integer’s n.
For n = 2
w 1 R 1 = 2 f η ~ R ρ f w 1 2 η ~ R ρ f w 1 + η ~ R ρ f w 1 f , 1 + υ ~ R ρ f w 1 1 υ ~ R ρ f w 1 f 1 + υ ~ R ρ f w 1 + f 1 υ ~ R ρ f w 1
And
w 2 R 2 = 2 f η ~ R ρ f w 2 2 η ~ R ρ f w 2 + η ~ R ρ f w 2 f , 1 + υ ~ R ρ f w 2 1 υ ~ R ρ f w 2 f 1 + υ ~ R ρ f w 2 + f 1 υ ~ R ρ f w 2
Then
F F E W G w R 1 , R 2 = 2 f ρ = 1 2 η ~ R ρ f w ρ ρ = 1 2 2 η ~ R ρ f w ρ + ρ = 1 2 η ~ R ρ f w ρ f , ρ = 1 2 1 + υ ~ R ρ f w ρ ρ = 1 2 1 υ ~ R ρ f w ρ f ρ = 1 2 1 + υ ~ R ρ f w ρ + ρ = 1 2 1 υ ~ R ρ f w ρ f ,
Then, the result is true for n = 2. Now, under consideration that the Equation (10). It is fair for h = c .
F F E W G w R 1 , R 2 , R 3 , . . . , R c . = 2 f ρ = 1 c η ~ R ρ f w ρ ρ = 1 c 2 η ~ R ρ f w ρ + ρ = 1 c η ~ R ρ f w ρ f , ρ = 1 c 1 + υ ~ R ρ f w ρ ρ = 1 c 1 υ ~ R ρ f w ρ f ρ = 1 c 1 + υ ~ R ρ f w ρ + ρ = 1 c 1 υ ~ R ρ f w ρ f
If the Equation (27) is true for n =   c . Next, when n = c + 1, we have
F F E W G w R 1 , R 2 , R 3 , . . . , R c + 1 = 2 f ρ = 1 c . η ~ R ρ f w ρ ρ = 1 c 2 η ~ R ρ f w ρ + ρ = 1 c η ~ R ρ f w ρ f , ρ = 1 c 1 + υ ~ R ρ f w ρ ρ = 1 c 1 υ ~ R ρ f w ρ f ρ = 1 c 1 + υ ~ R ρ f w ρ + ρ = 1 c 1 υ ~ R ρ f w ρ f ϵ 2 f ρ = 1 c + 1 η ~ R ρ f w ρ ρ = 1 c + 1 2 η ~ R ρ f w ρ + ρ = 1 c + 1 η ~ R ρ f w ρ f , ρ = 1 c + 1 1 + υ ~ R ρ f w ρ ρ = 1 c + 1 1 υ ~ R ρ f w ρ f ρ = 1 c + 1 1 + υ ~ R ρ f w ρ + ρ = 1 c + 1 1 υ ~ R ρ f w ρ f
Let
r 1 = 2 f ρ = 1 c . η ~ R ρ f w ρ , s 1 = ρ = 1 c 2 η ~ R ρ f w ρ + ρ = 1 c η ~ R ρ f w ρ f , r 2 = ρ = 1 c 1 + υ ~ R ρ f w ρ ρ = 1 c 1 υ ~ R ρ f w ρ f , s 2 = ρ = 1 c 1 + υ ~ R ρ f w ρ + ρ = 1 c 1 υ ~ R ρ f w ρ f , t 1 = 2 f ρ = 1 c + 1 η ~ R ρ f w ρ , u 1 = £ = 1 l 2 υ ~ R ρ F Ѿ £ + £ = 1 l υ ~ R ρ F Ѿ £ F t 2 = ρ = 1 c + 1 2 η ~ R ρ f w ρ + ρ = 1 c + 1 η ~ R ρ f w ρ f , u 2 = ρ = 1 c + 1 1 + υ ~ R ρ f w ρ + ρ = 1 c + 1 1 υ ~ R ρ f w ρ f
Then, inserting these values into Equation (11) now yields
F F E W G w R 1 , R 2 , R 3 , . . . , R c + 1 = r 1 s 1 , t 1 u 1 ϵ r 2 s 2 , t 2 u 2 .
By applying Einstein’s operational laws, we attain,
F F E W G w R 1 , R 2 , R 3 , . . . , R c + 1 = r 1 f s 2 f + r 2 f s 1 f f s 1 f s 2 f + r 1 f r 2 f F , t 1 t 2 f 2 u 1 f u 2 f u 1 f t 2 f t 1 f u 2 f + t 1 f t 2 f f .
Putting the values of r 1 f s 2 f + r 2 f s 1 f , s 1 f s 2 f + r 1 f r 2 f , t 1 t 2 , 2 u 1 f u 2 f u 1 f t 2 f t 1 f u 2 f + t 1 f t 2 f in Equation (11) we attain;
R 1 , R 2 , R 3 , . . . , R c + 1 = 2 f ρ = 1 c + 1 η ~ R ρ f w ρ ρ = 1 c + 1 2 η ~ R ρ f w ρ + ρ = 1 c + 1 η ~ R ρ f w ρ f , ρ = 1 c + 1 1 + υ ~ R ρ f w ρ ρ = 1 c + 1 1 υ ~ R ρ f w ρ f ρ = 1 c + 1 1 + υ ~ R ρ f w ρ + ρ = 1 c + 1 1 υ ~ R ρ f w ρ f
Therefore, Equation (11) is fair for n=   c + 1 ; consequently, Equation (11) is valid for every ρ . □
1.1
Idempotency: if R ˙ σ ρ = R ˙ ρ , then
F F E W G w R 1 , R 2 , R 3 , . . . , R n = R ˙ .
Proof. 
As
F F E W G w R 1 , R 2 , R 3 , . . . , R n = 2 f ρ = 1 n η ~ R ρ f w ρ ρ = 1 n 2 η ~ R ρ f w ρ + ρ = 1 n η ~ R ρ f w ρ f , ρ = 1 n 1 + υ ~ R ρ f w ρ ρ = 1 n 1 υ ~ R ρ f w ρ f ρ = 1 n 1 + υ ~ R ρ f w ρ + ρ = 1 n 1 υ ~ R ρ f w ρ f 2 f ρ = 1 n η ~ R ˙ ρ f w ρ ρ = 1 n 2 η ~ R ˙ ρ f w ρ + ρ = 1 n η ~ R ˙ ρ f w ρ f , ρ = 1 n 1 + υ ~ R ˙ ρ f w ρ ρ = 1 n 1 υ ~ R ˙ ρ f w ρ f ρ = 1 n 1 + υ ~ R ˙ ρ f w ρ + ρ = 1 n 1 υ ~ R ˙ ρ f w ρ f = R ˙ .
1.2
Boundedness:
R ˙ m i n F F E W G w R 1 , R 2 , R 3 , . . . , R n R ˙ m i x ,
where
R ˙ m i n = min ρ η ~ R ρ , max ρ υ ~ R ρ ,
R ˙ m a x = max ρ η ~ R ρ , min ρ υ ~ R ρ .
Proof. 
Let ψ ( v ) = 2 v F v F F , v   (0, 1] where   f = p / q , for simplicity p = 2 q , then ψ ( v ) = 2 v 2 v 2 2 , d f d v = 2 v 3 v 2 2 v 2 < 0, that is, ψ ( v ) is a decreasing function on (0, 1].
As   η ~ R ˙ m i n η ~ R ρ η ~ R ˙ m a x for   all   ρ ,   then   h   ( η ~ R ˙ m i n ) h ( η ~ R ρ ) h ( η ~ R ˙ m a x ) ,   i . e . ,   2 η ~ R ˙ m a x 2 η ~ R ˙ m a x 2 2 η ~ R ρ 2 η ~ R ρ 2 2 η ~ R ˙ m i n 2 η ~ R ˙ m i n 2 ,   then   £ = 1 h 2 η ~ R ˙ m a x 2 η ~ R ˙ m a x 2 w ρ £ = 1 h 2 η ~ R ρ 2 η ~ R ρ 2 w ρ £ = 1 h 2 η ~ R ˙ m i n 2 η ~ R ˙ m i n 2 w ρ 2 η ~ R ˙ m a x 2 η ~ R ˙ m a x 2 ρ = 1 n w ρ ρ = 1 n 2 η ~ R ρ 2 η ~ R ρ 2 w ρ 2 η ~ R ˙ m i n 2 η ~ R ˙ m i n 2 ρ = 1 n w ρ 2 η ~ R ˙ m a x 2 η ~ R ˙ m a x 2 + 1 ρ = 1 n 2 η ~ R ρ 2 η ~ R ρ 2 w ρ + 1 2 η ~ R ˙ m i n 2 η ~ R ˙ m i n 2 + 1       η ~ R ˙ m i n 2 2 1 ρ = 1 n 2 η ~ R ρ 2 η ~ R ρ 2 w ρ + 1 η ~ R ˙ m a x 2 2 R ˙ m i n 2 ρ = 1 n η ~ R ρ 2 w ρ ρ = 1 n 2 η ~ R ρ 2 w ρ + ρ = 1 n η ~ R ρ 2 w ρ R ˙ m a x
Again, consider β(y) = 1 y 2 1 + y 2 , y [0, 1] then β (y) = 2 y 1 + y 2 2 1 + y 2 1 y 2   < 0 , that is, β(x) is a strictly decreasing function on the close interval [0, 1].
As   υ ~ R ˙ m i n υ ~ R ρ υ ~ R ˙ m a x for   all   £ ,   then   β ( υ ~ R ˙ m a x ) β ( υ ~ R ρ ) β ( υ ~ R ˙ m i n ) ,   i . e   1 υ ~ R ˙ m a x 2 1 + υ ~ R ˙ m a x 2 1 υ ~ R ρ 2 1 + υ ~ R ρ 2 1 υ ~ R ˙ m i n 2 1 + υ ~ R ˙ m i n 2 ,   1 υ ~ R ˙ m a x 2 1 + υ ~ R ˙ m a x 2 w ρ 1 υ ~ R ρ 2 1 + υ ~ R ρ 2 w ρ 1 υ ~ R ˙ m i n 2 1 + υ ~ R ˙ m i n 2 w ρ ,   £ = 1 h 1 υ ~ R ˙ m a x 2 1 + υ ~ R ˙ m a x 2 w ρ £ = 1 h 1 υ ~ R ρ 2 1 + υ ~ R ρ 2 w ρ £ = 1 h 1 υ ~ R ˙ m i n 2 1 + υ ~ R ˙ m i n 2 w ρ ,   1 υ ~ R ˙ m a x 2 1 + υ ~ R ˙ m a x 2 £ = 1 h w ρ £ = 1 h 1 υ ~ R ρ 2 1 + υ ~ R ρ 2 w ρ 1 b Γ ˙ m i n 2 1 + b Γ ˙ m i n 2 £ = 1 h w ρ 1 + υ ~ R ˙ m i n 2 2 £ = 1 h 1 υ ~ R ρ 2 1 + υ ~ R ρ 2 w ρ + 1 1 + υ ~ R ˙ m a x 2 υ ~ R ˙ m i n ρ = 1 n 1 + υ ~ R ρ 2 w ρ ρ = 1 n 1 υ ~ R ρ 2 w ρ ρ = 1 n 1 υ ~ R ρ 2 w ρ + ρ = 1 n 1 + υ ~ R ρ 2 w ρ υ ~ R ˙ m a x .
Suppose   that   F F E W G w R 1 , R 2 , R 3 , . . . , R n = R ˙ = ( υ ~ R ˙ , υ ~ R ˙ ) .
Then the Equations (16) and (17) can be written as:
η ~ R ˙ m i n η ~ R ρ η ~ R ˙ m a x And     υ ~ R ˙ m i n υ ~ R ρ υ ~ R ˙ m a x
Thus S c R ˙ ˙ S c R ˙ m a x , and S c ( R ˙ )   S c R ˙ m i n . If S c ( R ˙ ) < S c ( R ˙ m a x ) , and S c ( R ˙ ) > S c ( R ˙ m i n ) . Then
R ˙ m i n F F E W G w R 1 , R 2 , R 3 , . . . , R n R ˙ m i x
If S c R ˙ = S c ( R ˙ m a x ) . Then A r R ˙ = A r ( R ˙ m a x )
Thus F F E W G w R 1 , R 2 , R 3 , . . . , R n =   R ˙ m i x . If S c R ˙ =   S c R ˙ m i n . Then A r R ˙ = A r ( R ˙ m i n )
Thus F F E W G w R 1 , R 2 , R 3 , . . . , R n =   R ˙ m i n . Thus, from the above, we have;
R ˙ m i n F F E W G w R 1 , R 2 , R 3 , . . . , R n R ˙ m i x .
Hence proved Equation (15). □
1.3
Monotonicity: let R ° = η ~ R ρ ° , υ ~ R ρ ° be a collection of fractional fuzzy figures and η ~ R ρ   η ~ R ρ ° , υ ~ R ρ   υ ~ R ρ ° for all ρ , then
F F E W G w R 1 , R 2 , R 3 , . . . , R n F F E W G w R 1 * , R 2 * , R 3 * ,   .   .   .   , R n * .
Proof. 
Same as above. Let ψ ( v ) = 2 v F v F F , v   (0, 1] where   f = p / q , for simplicity p = 2 q , then ψ ( v ) = 2 v 2 v 2 2 , d f d v = 2 v 3 v 2 2 v 2 < 0, that is, ψ ( v ) is a decreasing function on (0, 1].
If η ~ R ρ   η ~ R ρ ° , for every ρ , then ψ ( η ~ R ρ )   ψ ( η ~ R ρ ° ) , for all ρ , i.e., 2 η ~ R ρ 2 η ~ R ρ 2 ° 2 η ~ R ρ ° η ~ R ρ ° ,   ρ = (1, 2, 3, n).
Let suppose w =   w 1 ,   w 2 , w 3 ,   .   .   .   ,   w n T be the weight vector of R ρ , ( ρ = 1, 2, 3, ,h) that is w ρ belongs to close interval 0 and 1, ( ρ = 1, 2, 3, ,h) and ρ = 1 n w ρ = 1 , we attain,
2 η ~ R ρ 2 ° η ~ R ρ 2 ° w ρ 2 a η ~ R ρ 2 ° 2 η ~ R ρ 2 ° w ρ ,   ρ = 1 , 2 , 3 , n
Thus
ρ = 1 n 2 η ~ R ρ 2 ° η ~ R ρ 2 ° w ρ ρ = 1 n 2 η ~ R ρ 2 η ~ R ρ 2 w ρ ρ = 1 n 2 η ~ R ρ 2 ° η ~ R ρ 2 ° w ρ + 1 ρ = 1 n 2 η ~ R ρ 2 η ~ R ρ 2 w ρ + 1 1 ρ = 1 n 2 η ~ R ρ 2 η ~ R ρ 2 w ρ + 1 1 ρ = 1 n 2 η ~ R ρ 2 ° η ~ R ρ 2 ° w ρ + 1 2 ρ = 1 n 2 η ~ R ρ 2 η ~ R ρ 2 w ρ + 1 2 ρ = 1 n 2 η ~ R ρ 2 ° η ~ R ρ 2 ° w ρ + 1
That is,
2 ρ = 1 n η ~ R ρ 2 w ρ ρ = 1 n 2 η ~ R ρ 2 w ρ + ρ = 1 n η ~ R ρ 2 w ρ 2 ρ = 1 n η ~ R ρ 2 ° w ρ ρ = 1 n 2 η ~ R ρ 2 ° w ρ + ρ = 1 n η ~ R ρ 2 ° w ρ .
Again, consider β(y) = 1 y 2 1 + y 2 , y [0, 1] then β (y) = 2 y 1 + y 2 2 1 + y 2 1 y 2   < 0 , that is, β(x) is a strictly decreasing function on the close interval [0, 1].
If υ ~ R ρ   υ ~ R ρ ° , for all £ , then β ( υ ~ R ρ ° )   β ( υ ~ R ρ ) , for all £ , i.e., 1 υ ~ R ρ 2 ° 1 + υ ~ R ρ ° 1 υ ~ R ρ 1 + υ ~ R ρ , £ =1, 2, 3… h.
Let suppose w =   w 1 ,   w 2 , w 3 ,   .   .   .   ,   w n T be the weight vector of R ρ , ( ρ = 1, 2, 3, , n ) such that Ѿ ρ [0, 1], ( ρ = 1, 2, 3, ,n) and ρ = 1 n w ρ = 1 , we gain;
1 υ ~ R ρ 2 ° 1 + υ ~ R ρ 2 ° w ρ 1 υ ~ R ρ 2 1 + υ ~ R ρ 2 w ρ ,   ρ = 1 ,   2 ,   3 ,   , n
Thus
£ = 1 h 1 υ ~ R ρ 2 ° 1 + υ ~ R ρ 2 ° w ρ £ = 1 h 1 υ ~ R ρ 2 1 + υ ~ R ρ 2 w ρ 1 + £ = 1 h 1 υ ~ R ρ 2 ° 1 + υ ~ R ρ 2 ° w ρ 1 + £ = 1 h 1 υ ~ R ρ 2 1 + υ ~ R ρ 2 w ρ 1 1 + £ = 1 h 1 υ ~ R ρ 2 1 + υ ~ R ρ 2 w ρ 1 1 + £ = 1 h 1 υ ~ R ρ 2 ° 1 + υ ~ R ρ 2 ° w ρ 2 1 + £ = 1 h 1 υ ~ R ρ 2 1 + υ ~ R ρ 2 w ρ 2 1 + £ = 1 h 1 υ ~ R ρ 2 ° 1 + υ ~ R ρ 2 ° w ρ 2 1 + £ = 1 h 1 υ ~ R ρ 2 1 + υ ~ R ρ 2 w ρ 1 2 1 + £ = 1 h 1 υ ~ R ρ 2 ° 1 + υ ~ R ρ 2 ° w ρ 1 ,
i.e.,
ρ = 1 n 1 + υ ~ R ρ 2 w ρ ρ = 1 n 1 υ ~ R ρ 2 w ρ ρ = 1 n 1 + υ ~ R ρ 2 w ρ + ρ = 1 n 1 υ ~ R ρ 2 w ρ ρ = 1 n 1 + υ ~ R ρ 2 ° w ρ ρ = 1 n 1 υ ~ R ρ 2 ° w ρ ρ = 1 n 1 + υ ~ R ρ 2 ° w ρ + ρ = 1 n 1 υ ~ R ρ 2 ° w ρ .
Let F F E W G w R 1 , R 2 , R 3 , . . . , R n = η ~ R ρ , υ ~ R ρ = R and F F E W G w R 1 * , R 2 * , R 3 * ,   .   .   .   , R h * = η ~ R ρ ° , υ ~ R ρ °   =   R ° , then the inequalities (1) and (2) are changed into the forms: η ~ R ρ   η ~ R ρ ° and υ ~ R ρ υ ~ R ρ ° , respectively. Thus s R =   η ~ R ρ υ ~ R ρ η ~ R ρ ° υ ~ R ρ ° = s R ° .
If S r R < S r R ° , then, we attain;
F F E H G ϖ , Ѿ R 1 , R 2 , R 3 ,   .   .   .   , R h < F F E W G w R 1 * , R 2 * , R 3 * ,   .   .   .   , R n *
If S r R = S r R ° , i.e., η ~ R ρ υ ~ R ρ = η ~ R ρ ° υ ~ R ρ ° , then by conditions η ~ R ρ   η ~ R ρ ° and υ ~ R ρ υ ~ R ρ ° . For all k, we have η ~ R ρ =   η ~ R ρ ° and υ ~ R ρ = υ ~ R ρ ° , thus A r R =   η ~ R ρ + υ ~ R ρ = η ~ R ρ ° + υ ~ R ρ ° = A r R ° , from this definition, it follows:
F F E W G w R 1 , R 2 , R 3 , . . . , R n = F F E H G ϖ , Ѿ R 1 * , R 2 * , R 3 * ,   .   .   .   , R n * .
From Equations (22) and (23), we prove that Equation (19) always holds. □

4. Methodology-I Proposed VIKOR Method for FFS Information

In 1998, Opricovic [31] introduced the VIKOR method as a multi-criteria decision-making (MCDM) method having multiple conflicting criteria involved. Over time, many scholars extended the VIKOR method to different extensions of FS. Now, we introduce the VIKOR approach in an FFS environment.
Let us consider that there are m alternatives ℑ = I 1 , I 2 , I 3 I m and n criteria 𝔘 = U 1 , U 2 , U 3 U n . Then, the expert decision matrices (DMs) can be represented by 𝔻 = d i j m × n and here d i j be an attribute value of the alternative I i under the attribute U j where i = 1 ,   2 ,   3 ,   m and j = 1 ,   2 ,   3 ,   n. The stepwise algorithm of the proposed FF-VIKOR method is given as follows:
Step-1. Collect information for decision matrices (DMs).
D = d i j m × n = I 1 I 2 I m d 11 d 12 d 1 n d 21 d 22 d 2 n d m 1 d m 2 d m n
Step-2. Normalize the decision matrices (DMs).
Step-3. Using the proposed FFEWG aggregation operators (AoPs) to aggregate the DMs.
F F E W G w R 1 , R 2 , R 3 , . . . , R n = 2 f ρ = 1 n η ~ R ρ f w ρ ρ = 1 n 2 η ~ R ρ f w ρ + ρ = 1 n η ~ R ρ f w ρ f , ρ = 1 n 1 + υ ~ R ρ f w ρ ρ = 1 n 1 υ ~ R ρ f w ρ f ρ = 1 n 1 + υ ~ R ρ f w ρ + ρ = 1 n 1 υ ~ R ρ f w ρ f .
Step-4. From the decision matrix, calculate the positive ideal solution (PIS) and negative ideal solution (NIS) by the following equations.
d j + = max 1 i m η ~ i j , min 1 i m υ ~ i j = η ~ j + , υ ~ j +
d j = min 1 i m η ~ i j , max 1 i m υ ~ i j = η ~ j , υ ~ j
Step-5. VIKOR Approach calculates the two primary distance measures. One is the distance between alternatives and ideal solutions denoted by S i and the other R i represents the maximum distance. Both are determined as follows,
S i = j = 1 n w j d e u ( d i j , d j + ) d e u ( d j , d j + )
R i = max j w j d e u ( d i j , d j + ) d e u ( d j , d j + )
where d e u is the Euclidean distance between FFNs.
Step-6. Determine the aggregate average and maximum distance Q i by formula,
Q i = γ S i S ̿ S + S ̿ + ( 1 γ ) R i R ̿ R + R ̿
where S ̿ = min i S i , S + = max i S i , R ̿ = min i R i , R + = max i R i and γ are the weight for the procedure of maximum benefits and γ .
Step-7. Rank the alternatives in the ascending order S i , R i and Q i . The minimized value of Q i will be the best optimal alternative.
The graphical presentation of the proposed decision making method is given in Figure 1.

5. Methodology-II Proposed Extended TOPSIS Method for FFS Information

The detailed algorithm of the extended TOPSIS method is given as follows:
Step-1. Collect information for decision matrices (DMs). Generally,
D = d i j m × n = I 1 I 2 I m d 11 d 12 d 1 n d 21 d 22 d 2 n d m 1 d m 2 d m n
Step-2. Using the proposed FFEWG aggregation operators (AoPs) to aggregate the DMs.
F F E W G w R 1 , R 2 , R 3 , . . . , R n = 2 f ρ = 1 n η ~ R ρ f w ρ ρ = 1 n 2 η ~ R ρ f w ρ + ρ = 1 n η ~ R ρ f w ρ f , ρ = 1 n 1 + υ ~ R ρ f w ρ ρ = 1 n 1 υ ~ R ρ f w ρ f ρ = 1 n 1 + υ ~ R ρ f w ρ + ρ = 1 n 1 υ ~ R ρ f w ρ f .
Step-3. From the decision matrix, calculate the positive ideal solution (PIS) and negative ideal solution (NIS) by the following equations.
d j + = max 1 i m η ~ i j , min 1 i m υ ~ i j = η ~ j + , υ ~ j +
d j = min 1 i m η ~ i j , max 1 i m υ ~ i j = η ~ j , υ ~ j
Step-4. Find out the distance of each alternative with FF-PIS and FF-NIS employing the following normalized Euclidean distance formula among FFNs;
D ( d j , d j + ) = η ~ d f η ~ d j + f 2 + υ ~ d f υ ~ d j + f 2 + π d f π d j + f 2
We can obtain the following two fractional fuzzy distance matrices;
D + = ( d i j , d j + ) m × n = I 1 I 2 I m d ( d 11 , d 1 + ) d ( d 12 , d 2 + ) d ( d 1 n , d n + ) d ( d 21 , d 2 + ) d ( d 22 , d 2 + ) d ( d 2 n , d n + ) d ( d m 1 , d m + ) d ( d m 2 , d m + ) d ( d m n , d n + )
D = ( d i j , d j ) m × n = I 1 I 2 I m d ( d 11 , d 1 ) d ( d 12 , d 2 ) d ( d 1 n , d n ) d ( d 21 , d 2 ) d ( d 22 , d 2 ) d ( d 2 n , d n ) d ( d m 1 , d m ) d ( d m 2 , d m ) d ( d m n , d n )
Step-5. Calculate the weight of the aggregated table and then deduce the weighted fractional fuzzy distance of all alternatives with PIS and NIS. We can represent as,
Λ i * = j = 1 n w j D * j , i = 1 ,   2 ,   3 , , ,   where   ( = + o r )
Step-6. Deduce the relative closeness (RC) index of all alternatives I i as below;
ζ i + = Λ + ( d i j , d j + ) Λ + ( d i , d j + ) + Λ ( d i j , d j )
Step-7. Ranking. Bigger the value of ζ i + will be the best optimal alternative   I i .
The flow chart of the proposed algorithm-II is given in Figure 2.

6. Real Life Decision Making Problem

In this section, we provide a case study of the evaluation of artificial intelligence cloud platforms. We recommend the VIKOR method and the extended TOPSIS method to make decisions and rank the alternatives, and we compare them with other existing approaches.

Case Study

At the end of 2022, this analysis was initiated when numerous round-table sessions with stakeholders were scheduled. A specialist panel contributed to generating the eligibility standards and possible outcomes for a decision. Members of the panel were chosen from a group of outstanding and competent people depending on an assortment of parameters.
Scholars demonstrated that the main advantage was expertise in the AI-cloud service sector. The second most crucial factor was professional managerial knowledge (minimum of five years as a prominent supervisor), and the third was membership in the company’s management team. These renowned individuals took part in a physical debate that included broad inquiries before developing a set of the necessary attributes and alternatives for assessing implications parameters utilizing the AICP ratings. After the collection of the above lists, the same chosen attribute and options were eliminated, allowing the last decision to be purely attributable to the options available. Table 1 contains the names of the specialists who are part of the committee.
The inspection of crucial AICP factors not only assists big enterprises but also offers important customer service and financial advantages. Most AI service provider companies offer substantial deep data science, machine learning platforms, and API services. Therefore, an AI cloud can save time and assets for companies. However, AI cloud evolution is incomplete until it transforms into highly innovative enterprises or, more precisely, into the digital businesses of the next generation. To create such an environment of unbounded innovation, the transition of AICPs must give the most importance to six crucial operations. Additionally, promoting development, the most significant issues confronting enterprises in the coming year could be managed with support from the AI cloud, including chip shortages and increasing energy prices, which affect every aspect, including hardware purchases and business continuity. In the future, AI cloud providers and analytics organizations can enhance these services in the AICP. AI clouds and their subdomains are the primary drivers of the rapid expansion of technological ecosystems. Gartner defines AI cloud as the use of “advanced analysis and logic-based techniques” to replicate human intelligence. AI clouds offer various applications to individuals and businesses across industries. User organizations and their technology partners frequently design, customize, and operate AI cloud implementations in many prominent AICPs. Given the worldwide expansion of AI software, these systems are crucial. Gartner projected the market to reach $62.5 billion in 2022, a 21.3% rise from its value in 2021. International Data Corporation anticipates this market to reach $549.9 billion by 2025. The evaluation of AICP involves many critical functions, such as U 1 smart robotics, U 2 the capacity to prototype and test applications rapidly and affordably (lower costs), U 3 higher and more effective digital security, U 4 simply integration into the operational and security environment of other applications currently supported in the enterprise (broader perspectives), U 5 the ability to rapidly scale up from prototype to large-scale analysis and computation environments, and U 6 optimal management of data. Furthermore, the weights of the three decision-makers were D m = (0.32, 0.34, 0.34). Decision matrices of three DMs for FFSs.
Determining the best optimal alternative, we adopted the suggested strategy to speed up the selection.

7. Numerical Result of the Proposed VIKOR Method for FFS information

Step-1. Collect the expert information in the form of DMs for FFNs. The detail of all decision epert are giving Table 2, Table 3 and Table 4.
Step-2. No need for normalization as all data are uniform.
Step-3. Aggregate these expert data using Equation (7).
The detail information of aggregated data of all expert are given in Table 5 and the weight information are given Table 6.
Step-4. Calculate the PIS and NIS using Equations (24) and (25). The PIS and NIS are given in Table 7.
Step-5. Calculate the Distances. The distance measure given in Table 8 and the maximum distance measure are given in Table 9.
Step-6. Calculate the average and maximum distance by (28) and given in Table 10.
Step-7. Ranking. Minimum the value of Q i will be the best optimal alternative. The ranking information are given in Table 11. The graphical presentation of the ranking re given in Figure 3.

8. Numerical Results of Our Proposed Extended TOPSIS Method for FFS information

Step-1. Represent Table 1, Table 2, and Table 3 same as methodology-I.
Step-2. Using the proposed FFEWG aggregation operators (AoPs) to aggregate the DMs.
F F E W G w R 1 , R 2 , R 3 , . . . , R n = 2 f ρ = 1 n η ~ R ρ f w ρ ρ = 1 n 2 η ~ R ρ f w ρ + ρ = 1 n η ~ R ρ f w ρ f , ρ = 1 n 1 + υ ~ R ρ f w ρ ρ = 1 n 1 υ ~ R ρ f w ρ f ρ = 1 n 1 + υ ~ R ρ f w ρ + ρ = 1 n 1 υ ~ R ρ f w ρ f .
Step-3. Calculate PIS and NIS Same as Table 6 of methodology-I.
Step-4. Calculate distances with PIS and NIS Equation (31). The result is given in Table 12 and Table 13.
Step-5. Calculate the weighted Fractional fuzzy distance of all alternatives with PIS and NIS by Equation (32) and information is given in Table 14 and Table 15.
Step-6. Determine the relative closeness indices ζ i + by Equation (33) and information is given in Table 16.
Step-7. Rank the alternatives I i . The bigger value of the alternative will be the most optimal and the details are given in Table 17. The graphical view of the proposed Extended TOPSIS method is given in Figure 4.

9. Comparative Analysis and Discussion

In this section, we can compare the proposed method with the extended GRA, and the calculation of alternative scores was performed by the well-known extended GRA method by Khan, Abdullah (2018) [32] to check the stability, validity, and correctness of the proposed methods.
Moreover, our suggested operators possess a broad variety of practicality because of the availability of parameter f = p / q . Under FFS circumstances, we construct a systematic comparison between our proposed Einstein geometric aggregation operators (AoPs) and the extended TOPSIS approach and VIKOR approach with the existing PyF extended GRA approach [32]. To analyze the results obtained utilizing the existing approach, first, we determine the expert data for assessment. After that, we must give each criterion a weight to illustrate their order of importance. These weights can be obtained by decision maker (DM) importance or by applying the entropy measure. Once the weights and criteria are determined, we examine each alternative to each criterion. Implementing the PyF extended GRA methodology to rank the alternatives. In light of the distinctive characteristics of the PyF extended GRA approach, different outcomes were attained while processing the exact initial data. Despite the fact that these suggested approaches’ results are different from the existing approaches, the optimal alternative is always the same I 1 .
The results of the comparison are demonstrated in Table 18 as follows and overall result is given in Table 19.

10. Conclusions and Future Research Directions

The efficiency of the recommended FF-VIKOR technique and FF-Extended TOPSIS technique were analyzed. In this study, the FF–VIKOR approach and the FF-Extended TOPSIS approach were used for MCGDM using FFSs. Detailed illustrations of AICP assessment and comparison analysis were employed to verify the sustainability of this novel approach. The following are consequences of the broadened model: The FF–VIKOR technique and FF-Extended TOPSIS approach were developed to resolve the fractional fuzzy MCGDM, in which the entropy measure technique was used to estimate the weight of every attribute under the FFSs. Numerous difference-solving approaches and comparative analysis display the applicability of this enhanced approach; subsequently, it could be utilized in the analysis of the critical functions of an AICP. Making a decision on an AICP may enable enterprises to save both time and money. Additionally, in the future, the AI cloud can help enterprises to overcome key challenges. Moreover, the results of the suggested approach are identical to those of the other analyzed approaches, as the present study focused solely on the technique of surveying, which was used to evaluate and assess the AICPs based on the opinions of experts and available literature. Data for examining the indicators of the AICPs were collected from three industry experts. In the future, algorithms and approaches can be implemented for novel real-life decision-making problems and possible applications in robot selection, neural networking, pattern recognition, etc.

Author Contributions

Conceptualization, A.O.A.; Methodology, S.; Formal analysis, S.; Investigation, S.A. and A.O.A.; Writing—original draft, S.; Writing—review & editing, S.A. All authors have read and agreed to the published version of the manuscript.

Funding

This research work was funded by Institutional Fund Project under grant no. IFPIP: 812-611-1443. The authors gratefully acknowledge the technical and financial support provided by the Ministry of education and King Abdulaziz university, DSR, Jeddah, Saudi Arabia.

Data Availability Statement

Data sharing is not applicable to this article, as no datasets were generated or analyzed during the current study.

Acknowledgments

This research work was funded by Institutional Fund Project under grant no. IFPIP: 812-611-1443. The authors gratefully acknowledge the technical and financial support provided by the Ministry of education and King Abdulaziz university, DSR, Jeddah, Saudi Arabia.

Conflicts of Interest

The authors declare that they have no conflict of interest.

References

  1. Talpur, N.; Abdulkadir, S.J.; Alhussian, H.; Hasan, M.H.; Aziz, N.; Bamhdi, A. Deep Neuro-Fuzzy System application trends, challenges, and future perspectives: A systematic survey. Artif. Intell. Rev. 2023, 56, 865–913. [Google Scholar] [CrossRef] [PubMed]
  2. George, N.; Kadan, A.B.; Vijayan, V.P. Multi-objective load balancing in cloud infrastructure through fuzzy based decision making and genetic algorithm based optimization. IAES Int. J. Artif. Intell. 2023, 12, 678–685. [Google Scholar] [CrossRef]
  3. Bansal, V.; Bhardwaj, A.; Singh, J.; Verma, D.; Tiwari, M.; Siddi, S. Using Artificial Intelligence to Integrate Machine Learning, Fuzzy Logic, and The IOT as A Cybersecurity System. In Proceedings of the 2023 3rd International Conference on Advance Computing and Innovative Technologies in Engineering (ICACITE), Greater Noida, India, 12–13 May 2023; IEEE: Toulouse, France, 2023; pp. 762–769. [Google Scholar]
  4. Aksjonov, A.; Nedoma, P.; Vodovozov, V.; Petlenkov, E.; Herrmann, M. Detection and evaluation of driver dis-traction using machine learning and fuzzy logic. IEEE Trans. Intell. Transp. Syst. 2018, 20, 2048–2059. [Google Scholar] [CrossRef]
  5. Peng, B.; Zhou, J.; Peng, D. Cloud model based approach to group decision making with uncertain pure linguistic information. J. Intell. Fuzzy Syst. 2017, 32, 1959–1968. [Google Scholar] [CrossRef]
  6. Shirazi, S.A.R.; Khan, A.H.; Rasool, S.; Anwar, A.; Ammar, M. Load Balancing of Cloud Computing Service Model Empowered with Fuzzy Logic. Sir Syed Res. J. Eng. Technol. 2023, 13, 10–16. [Google Scholar] [CrossRef]
  7. Yuan, X.; Shi, C.; Wang, Z. The Optimization of Hospital Financial Management Based on Cloud Technology and Wireless Network Technology in the Context of Artificial Intelligence. Wirel. Commun. Mob. Comput. 2022, 2022, 9998311. [Google Scholar] [CrossRef]
  8. Zadeh, L. Fuzzy sets. Inform. Control 1965, 8, 338–353. [Google Scholar] [CrossRef]
  9. Atanassov, K.T. On Intuitionistic Fuzzy Sets Theory; Springer: Berlin/Heidelberg, Germany, 2012; Volume 283. [Google Scholar]
  10. Atanassov, K. Intuitionistic fuzzy sets. Int. J. Bioautom. 2016, 20, 1. [Google Scholar]
  11. Yager, R.R. Pythagorean fuzzy subsets. In Proceedings of the 2013 Joint IFSA World Congress and NAFIPS Annual Meeting (IFSA/NAFIPS), Edmonton, AB, Canada, 24–28 June 2013; IEEE: Toulouse, France, 2013; pp. 57–61. [Google Scholar]
  12. Yager, R.R. Properties and applications of Pythagorean fuzzy sets. In Imprecision and Uncertainty in Information Rep-Resentation and Processing: New Tools Based on Intuitionistic Fuzzy Sets and Generalized Nets; Springer: Berlin/Heidelberg, Germany, 2016; pp. 119–136. [Google Scholar]
  13. Yager, R.R. Generalized orthopair fuzzy sets. IEEE Trans. Fuzzy Syst. 2016, 25, 1222–1230. [Google Scholar] [CrossRef]
  14. Abdullah, S.; Al-Shomrani, M.M.; Liu, P.; Ahmad, S. A new approach to three-way decisions making based on fractional fuzzy decision-theoretical rough set. Int. J. Intell. Syst. 2022, 37, 2428–2457. [Google Scholar] [CrossRef]
  15. Zhao, X.; Wei, G. Some intuitionistic fuzzy Einstein hybrid aggregation operators and their application to multi-ple attribute decision making. Knowl. Based Syst. 2013, 37, 472–479. [Google Scholar] [CrossRef]
  16. Rahman, K.; Abdullah, S.; Ahmed, R.; Ullah, M. Pythagorean fuzzy Einstein weighted geometric aggregation operator and their application to multiple attribute group decision making. J. Intell. Fuzzy Syst. 2017, 33, 635–647. [Google Scholar] [CrossRef]
  17. Ali, Z.; Mahmood, T.; Ullah, K.; Khan, Q. Einstein geometric aggregation operators using a novel complex intervalvalued pythagorean fuzzy setting with application in green supplier chain management. Rep. Mech. Eng. 2021, 2, 105–134. [Google Scholar] [CrossRef]
  18. Zulqarnain, R.M.; Ali, R.; Awrejcewicz, J.; Siddique, I.; Jarad, F.; Iampan, A. Some Einstein Geometric Aggregation Operators for q-Rung Orthopair Fuzzy Soft Set with Their Application in MCDM. IEEE Access 2022, 10, 88469–88494. [Google Scholar] [CrossRef]
  19. Wu, X.; Ali, Z.; Mahmood, T.; Liu, P. A Multi-attribute Decision-Making Method with Complex q-Rung Orthopair Fuzzy Soft Information Based on Einstein Geometric Aggregation Operators. Int. J. Fuzzy Syst. 2023, 25, 2218–2233. [Google Scholar] [CrossRef]
  20. Bali, V.; Bali, S.; Gaur, D.; Rani, S.; Kumar, R. Commercial-off-the Shelf Vendor Selection: A Multi-Criteria Deci-sion-Making Approach Using Intuitionistic Fuzzy Sets and TOPSIS. Oper. Res. Eng. Sci. Theory Appl. 2023. [Google Scholar] [CrossRef]
  21. Luo, X.; Guo, S.; Du, B.; Guo, J.; Jiang, P.; Tan, T. Multi-criteria decision-making of manufacturing resources alloca-tion for complex product system based on intuitionistic fuzzy information entropy and TOPSIS. Complex Intell. Syst. 2023, 9, 5013–5032. [Google Scholar] [CrossRef]
  22. Zhang, X.; Xu, Z. Extension of TOPSIS to Multiple Criteria Decision Making with Pythagorean Fuzzy Sets. Int. J. Intell. Syst. 2014, 29, 1061–1078. [Google Scholar] [CrossRef]
  23. Ak, M.F.; Gul, M. AHP–TOPSIS integration extended with Pythagorean fuzzy sets for information security risk analysis. Complex Intell. Syst. 2019, 5, 113–126. [Google Scholar] [CrossRef]
  24. Kumar, R.; Gandotra, N. Suman A novel pythagorean fuzzy entropy measure using MCDM application in preference of the advertising company with TOPSIS approach. Mater. Today Proc. 2023, 80, 1742–1746. [Google Scholar] [CrossRef]
  25. Nver, M.; Olgun, M. Continuous Function Valued q-Rung Orthopair Fuzzy Sets and an Extended TOPSIS. Int. J. Fuzzy Syst. 2023, 25, 2203–2217. [Google Scholar]
  26. Więckowski, J.; Kizielewicz, B.; Sałabun, W. Handling decision-making in Intuitionistic Fuzzy environment: PyIFDM package. SoftwareX 2023, 22, 101344. [Google Scholar] [CrossRef]
  27. Rani, P.; Mishra, A.R.; Pardasani, K.R.; Mardani, A.; Liao, H.; Streimikiene, D. A novel VIKOR approach based on entropy and divergence measures of Pythagorean fuzzy sets to evaluate renewable energy technologies in India. J. Clean. Prod. 2019, 238, 117936. [Google Scholar]
  28. Mahmood, T.; Ali, Z.; Naeem, M. Aggregation operators and CRITIC-VIKOR method for confidence complex q-rung orthopair normal fuzzy information and their applications. CAAI Trans. Intell. Technol. 2023, 8, 40–63. [Google Scholar] [CrossRef]
  29. Salsabeela, V.; Athira, T.M.; John, S.J.; Baiju, T. Multiple criteria group decision making based on q-rung orthopair fuzzy soft sets. Granul. Comput. 2023, 8, 1067–1080. [Google Scholar]
  30. Akram, M.; Shumaiza Rodríguez Alcantud, J.C. VIKOR Method with Trapezoidal Bipolar Fuzzy Sets. In Multi-Criteria Decision Making Methods with Bipolar Fuzzy Sets 2023; Springer Nature: Singapore, 2023; pp. 67–91. [Google Scholar]
  31. Opricovic, S.; Tzeng, G.-H. Multicriteria Scheduling in Water Resources Engineering Using Genetic Algorithm. In Computing in Civil and Building Engineering; ASCE: New York, NY, USA, 2000; pp. 1434–1441. [Google Scholar]
  32. Khan, M.S.A.; Abdullah, S. Interval-valued Pythagorean fuzzy GRA method for multiple-attribute decision mak-ing with incomplete weight information. Int. J. Intell. Syst. 2018, 33, 1689–1716. [Google Scholar] [CrossRef]
Figure 1. Detailed stepwise algorithm of proposed FF-VIKOR Approach.
Figure 1. Detailed stepwise algorithm of proposed FF-VIKOR Approach.
Mathematics 11 04428 g001
Figure 2. Detailed Algorithm of the Proposed FF-Extended TOPSIS Approach.
Figure 2. Detailed Algorithm of the Proposed FF-Extended TOPSIS Approach.
Mathematics 11 04428 g002
Figure 3. Outputs of the Proposed FF-VIKOR Approach.
Figure 3. Outputs of the Proposed FF-VIKOR Approach.
Mathematics 11 04428 g003
Figure 4. Outputs of the Proposed FF-Extended TOPSIS Approach.
Figure 4. Outputs of the Proposed FF-Extended TOPSIS Approach.
Mathematics 11 04428 g004
Table 1. Informastion of decision experts.
Table 1. Informastion of decision experts.
DMsResponsibilitiesMajorAssociationYears of ExperienceLevel of Education
1Enterprise ownerIT Supervision and Software EngineerMember of Council20Postdoc
2AI DeveloperIT Supervision and Big Data ExpertMember of Council14PhD
3Experienced Big Data Expert/Architect IT Supervision and Big Data ScientistMember of Council12PhD
Table 2. Expert Data-2.
Table 2. Expert Data-2.
Alternatives U 1 U 2 U 3 U 4 U 5 U 6
I 1 (0.8,0.5)(0.9,0.3)(0.7,0.5)(0.2,0.6)(0.2,0.4)(0.3,0.2)
I 2 (0.3,0.7)(0.7,0.4)(0.1,0.4)(0.3,0.4)(0.4,0.3)(0.6,0.4)
I 3 (0.4,0.1)(0.2,0.6)(0.3,0.8)(0.6,0.2)(0.3,0.4)(0.4,0.1)
I 4 (0.1,0.6)(0.5,0.8)(0.6,0.4)(0.2,0.8)(0.4,0.1)(0.1,0.9)
I 5 (0.3,0.9)(0.1,0.3)(0.2,0.6)(0.3,0.5)(0.4,0.5)(0.5,0.7)
Table 3. Expert Data-3.
Table 3. Expert Data-3.
Alternatives U 1 U 2 U 3 U 4 U 5 U 6
I 1 (0.7,0.4)(0.8,0.5)(0.6,0.9)(0.1,0.4)(0.1,0.2)(0.3,0.7)
I 2 (0.4,0.2)(0.4,0.4)(0.6,0.2)(0.5,0.7)(0.5,0.9)(0.2,0.4)
I 3 (0.5,0.4)(0.2,0.2)(0.4,0.1)(0.3,0.3)(0.4,0.2)(0.4,0.2)
I 4 (0.1,0.9)(0.3,0.1)(0.2,0.4)(0.4,0.7)(0.3,0.5)(0.5,0.1)
I 5 (0.8,0.3)(0.1,0.5)(0.8,0.7)(0.2,0.1)(0.7,0.4)(0.6,0.7)
Table 4. Expert Data-4.
Table 4. Expert Data-4.
Alternatives U 1 U 2 U 3 U 4 U 5 U 6
I 1 (0.6,0.3)(0.3,0.4)(0.9,0.3)(0.1,0.8)(0.3,0.4)(0.7,0.1)
I 2 (0.2,0.)(0.5,0.2)(0.7,0.4)(0.2,0.6)(0.4,0.6)(0.2,0.9)
I 3 (0.3,0.1)(0.7,0.6)(0.3,0.7)(0.3,0.4)(0.4,0.1)(0.3,0.2)
I 4 (0.6,0.9)(0.1,0.8)(0.4,0.1)(0.4,0.3)(0.2,0.6)(0.4,0.5)
I 5 (0.1,0.5)(0.4,0.3)(0.1,0.3)(0.6,0.4)(0.4,0.4)(0.9,0.3)
Table 5. Result of the aggregated expert data.
Table 5. Result of the aggregated expert data.
Alternatives U 1 U 2 U 3 U 4 U 5 U 6
I 1 (0.533,0.394)(0.501,0.382)(0.546,0.680)(0.124,0.519)(0.178,0.309)(0.369,0.462)
I 2 (0.276,0.502)(0.445,0.342)(0.341,0.309)(0.296,0.539)(0.387,0.673)(0.276,0.472)
I 3 (0.359,0.258)(0.296,0.446)(0.311,0.575)(0.348,0.269)(0.338,0.269)(0.337,0.157)
I 4 (0.184,0.745)0.239,0.590)(0.338,0.337)(0.303,0.653)(0.275,0.394)(0.268,0.641)
I 5 (0.286,0.654)(0.158,0.368)(0.254,0.564)(0.314,0.347)(0.425.0.407)(0.517,0.603)
Table 6. Weight of the aggregated table.
Table 6. Weight of the aggregated table.
Criteria U 1 U 2 U 3 U 4 U 5 U 6
0.15270.20380.10220.14940.24820.1437
Table 7. Result of the PIS and NIS d j + (j= 1, 2… 6).
Table 7. Result of the PIS and NIS d j + (j= 1, 2… 6).
d j + d 1 + d 2 + d 3 + d 4 + d 5 + d 6 +
(0.532,0.258)(0.501,0.342)(0.546,0.309)(0.348,0.269)(0.425,0.269)(0.517,0.157)
d j d 1 d 2 d 3 d 4 d 5 d 6
(0.183,0.745)(0.158,0.590)(0.254,0.680)(0.124,0.653)(0.178,0.673)(0.286,0.641)
Table 8. Result of the distance between alternative and ideal solution S i (i= 1, 2… 5) by (26).
Table 8. Result of the distance between alternative and ideal solution S i (i= 1, 2… 5) by (26).
S i S 1 S 2 S 3 S 4 S 5
0.3780.6550.3590.7630.524
Table 9. Result of the maximum distance R i (i= 1, 2… 5) by (27).
Table 9. Result of the maximum distance R i (i= 1, 2… 5) by (27).
R i R 1 R 2 R 3 R 4 R 5
0.1010.2250.1140.1930.135
Table 10. Result of the average and maximum distance Q i .
Table 10. Result of the average and maximum distance Q i .
Q i Q 1 Q 2 Q 3 Q 4 Q 5
0.0040.9510.0900.7650.283
Table 11. Ranking.
Table 11. Ranking.
Alternatives I 1 I 3 I 5 I 4 I 2
Table 12. Result of Distance with PIS D + .
Table 12. Result of Distance with PIS D + .
Alternatives d 1 + d 2 + d 3 + d 4 + d 5 + d 6 +
I 1 0.0750.0370.3410.6590.1140.998
I 2 0.2060.0530.1290.1930.3510.203
I 3 0.1160.1300.2470.0620.0750.121
I 4 0.4860.2410.1300.3240.1060.362
I 5 0.3520.1490.2460.0700.0840.295
Table 13. Result of Distance with NIS D .
Table 13. Result of Distance with NIS D .
Alternatives d 1 d 2 d 3 d 4 d 5 d 6
I 1 0.4180.2290.1430.1590.0030.002
I 2 0.3070.2350.3480.1410.0650.185
I 3 0.4690.1500.1330.3340.3590.350
I 4 0.0070.0300.3330.0400.2900.017
I 5 0.1360.2060.1460.2940.2890.128
Table 14. Result of the weighted distance with PIS Λ i + (i= 1, 2… 5).
Table 14. Result of the weighted distance with PIS Λ i + (i= 1, 2… 5).
Λ i + Λ 1 + Λ 2 + Λ 3 + Λ 4 + Λ 5 +
0.3240.2010.1150.2630.183
Table 15. Result of the weighted distance with NIS Λ i (i= 1, 2… 5).
Table 15. Result of the weighted distance with NIS Λ i (i= 1, 2… 5).
Λ i Λ 1 Λ 2 Λ 3 Λ 4 Λ 5
0.1490.1940.3050.1220.212
Table 16. Result of the RC.
Table 16. Result of the RC.
ζ i + ζ 1 + ζ 2 + ζ 3 + ζ 4 + ζ 5 +
0.6840.5080.2740.6830.463
Table 17. Ranking.
Table 17. Ranking.
Alternatives I 1 I 4 I 2 I 5 I 3
Table 18. Result of comparison.
Table 18. Result of comparison.
Various ApproachesScore Values
Extended GRA Method [32]0.2520.1850.1080.1280.084
Proposed FF-VIKOR Method0.0040.9510.0900.7650.283
Proposed FF-Extended TOPSIS Method0.6840.5080.2740.6830.463
Table 19. Overall Ranking.
Table 19. Overall Ranking.
Various Approaches Ranking
Existing GRA Method [32] I 1 I 2 I 3 I 4 I 5
Proposed FF-VIKOR Method I 1 I 3 I 5 I 4 I 2
Proposed FF-Extended TOPSIS Method I 1 I 4 I 2 I 5 I 3
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Abdullah, S.; Saifullah; Almagrabi, A.O. An Integrated Group Decision-Making Framework for the Evaluation of Artificial Intelligence Cloud Platforms Based on Fractional Fuzzy Sets. Mathematics 2023, 11, 4428. https://doi.org/10.3390/math11214428

AMA Style

Abdullah S, Saifullah, Almagrabi AO. An Integrated Group Decision-Making Framework for the Evaluation of Artificial Intelligence Cloud Platforms Based on Fractional Fuzzy Sets. Mathematics. 2023; 11(21):4428. https://doi.org/10.3390/math11214428

Chicago/Turabian Style

Abdullah, Saleem, Saifullah, and Alaa O. Almagrabi. 2023. "An Integrated Group Decision-Making Framework for the Evaluation of Artificial Intelligence Cloud Platforms Based on Fractional Fuzzy Sets" Mathematics 11, no. 21: 4428. https://doi.org/10.3390/math11214428

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop