Next Article in Journal
Stationary-State Statistics of a Binary Neural Network Model with Quenched Disorder
Next Article in Special Issue
Semantic and Generalized Entropy Loss Functions for Semi-Supervised Deep Learning
Previous Article in Journal
A Parsimonious Granger Causality Formulation for Capturing Arbitrarily Long Multivariate Associations
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Spherical Fuzzy Logarithmic Aggregation Operators Based on Entropy and Their Application in Decision Support Systems

1
School of Economic and Management, Nanjing University of Aeronautics and Astronautics, Nanjing 211106, China
2
Department of Mathematics, Abdul Wali Khan University, Mardan 23200, Pakistan
*
Author to whom correspondence should be addressed.
Entropy 2019, 21(7), 628; https://doi.org/10.3390/e21070628
Submission received: 2 June 2019 / Revised: 20 June 2019 / Accepted: 23 June 2019 / Published: 26 June 2019

Abstract

:
Keeping in view the importance of new defined and well growing spherical fuzzy sets, in this study, we proposed a novel method to handle the spherical fuzzy multi-criteria group decision-making (MCGDM) problems. Firstly, we presented some novel logarithmic operations of spherical fuzzy sets (SFSs). Then, we proposed series of novel logarithmic operators, namely spherical fuzzy weighted average operators and spherical fuzzy weighted geometric operators. We proposed the spherical fuzzy entropy to find the unknown weights information of the criteria. We study some of its desirable properties such as idempotency, boundary and monotonicity in detail. Finally, the detailed steps for the spherical fuzzy decision-making problems were developed, and a practical case was given to check the created approach and to illustrate its validity and superiority. Besides this, a systematic comparison analysis with other existent methods is conducted to reveal the advantages of our proposed method. Results indicate that the proposed method is suitable and effective for the decision process to evaluate their best alternative.

1. Introduction

The complication of a system is growing every day in real life and getting the finest option from the set of possible ones is difficult for the decision makers. To attain a single objective is difficult to summarize but not incredible. Many organizations found difficulties with setting motivations, goals and opinions’ complications. Thus, organizational decisions simultaneously include numerous objectives, whether they regard individuals or committees. This reflection suggests, according to criteria solved optionally, restricting each decision maker to attain an ideal solution-optimum under each criterion involved in practical problems. Consequently, the decision maker is more concentrated to establish more applicable and reliable techniques to find the best options.
To handle the ambiguity and uncertainty data in decision-making problems, the classical or crisp methods cannot be always effective. Thus, dealing with such uncertain situations, Zadeh [1] in 1965 presented the idea of the fuzzy set. Zadeh assigns membership grades to elements of a set in the interval [0,1] by offering the idea of fuzzy sets (FSs). Zadeh’s work in this direction is remarkable as many of the set theoretic properties of crisp cases were defined for fuzzy sets. Fuzzy set theory got the attention of researchers and found its applications in decision science [2], artificial intelligence [3], and medical diagnosis [4], and its enormous applications are discussed in [5].
After many applications of fuzzy set theory, Atanassov observed that there are many shortcomings in this theory and introduced the notion of intuitionistic fuzzy sets [6] to generalize the concept of Zadeh’s fuzzy set. In intuitionistic fuzzy sets, each element is expressed by an ordered pair, and each pair is characterized by membership and non-membership grades on the condition that the sum of their grades are less than or equal to 1. During the last few decades, the intuitionistic fuzzy sets (IFSs) are fruitful and broadly utilized by researchers to grasp the ambiguity and imprecision data. To cumulate all the executive of criteria for alternatives, aggregation operators play a vital role throughout the information merging procedure. Xu [7] presented a weighted averaging operator while Xu and Yager [8] developed a geometric aggregation operator for aggregating the different intuitionistic fuzzy numbers. Verma [9] in 2015 proposed the generalized Bonferroni mean operator and, in [10], Verma and Sharma proposed the measure of inaccuracy using intuitionistic fuzzy information. Deschrijver [11] developed the IFS representation of t-norms and t-conorms. In some decision theories, the decision makers deal with the situation of particular attributes where values of their summation of membership degrees exceeds 1. In such conditions, IFS has no ability to obtain any satisfactory result. To overcome this situation, Yager [12] developed the idea of a Pythagorean fuzzy set (PyFS) as a generalization of IFS, which satisfies the fact that the value of square summation of its membership degrees is less then or equal to 1. Clearly, PyFS is more flexible than IFS to deal with the imprecision and ambiguity in the practical multi-criteria decision-making (MCDM) problems. Zhang and Xu [13] established an extension of TOPSIS to MCDM with PyFS information. The error for the proof of distance measure in Zhang and Xu [13] has been pointed out by Yang et al. [14]. For MCDM problems in a Pythagorean fuzzy environment, Yager and Abbasov [15] developed a series of aggregation operators. Peng and Yang [16] explained their relationship among these aggregation operators and established the superiority and inferiority ranking (SIR) for the multi-criteria group decision-making (MCGDM) method. Using Einstein operation, Garg [17] generalized Pythagorean fuzzy information aggregation. Gou et al. [18] studied many Pythagorean fuzzy functions and investigated their fundamental properties such as continuity, derivatively, and differentiability in detail. Zhang [19] put forward a ranked qualitative flexible (QUALIFLEX) multi-criteria approach with the closeness index-based ranking methods for multi-criteria Pythagorean fuzzy decision analysis. Zeng et al. [20] explored a hybrid method for Pythagorean fuzzy MCDM. Zeng [21], applied the Pythagorean fuzzy probabilistic OWA (PFPOWA) operator for MAGDM problems. For more study, we refer to [22,23,24].
IFS theory and PyFS theory have been successfully applied in different areas, but there are situations that cannot be represented by it in real life, such as voting, we may face human opinions involving more answers of the type: yes, abstain, no and refusal (for example, in a democratic election station, the council issues’ 500 voting papers for a candidate. The voting results are divided into four groups accompanied with the number of papers that are vote for ( 251 ) , abstain ( 99 ) , vote against ( 120 ) and refusal of voting ( 30 ) . Here, group abstain means that the voting paper is a white paper rejecting both agree and disagree for the candidate but still takes the vote, group refusal of voting is either invalid voting papers or did not take the vote. The candidate is successful because the number of support papers is over 50% (i.e., 250).
However, at least five people said later on in their blogs that they support the candidate in the last moment because they find that the support number seems larger than the against number. Such kind of examples (in which the number of abstains is a key factor and the group refusal of voting indeed exists) happened in reality and IFS and PyFS could not handle it). Thus, Cuong [25] proposed a new notion named picture fuzzy sets, which is an extension of fuzzy sets and intuitionistic fuzzy sets. Picture fuzzy sets give three membership degrees of an element named the positive membership degree, the neutral membership degree, and the negative membership degree, respectively. The picture fuzzy set solved the voting problem successfully, and is applied to clustering [26], fuzzy inference [27], and decision-making [28,29,30,31,32,33,34,35].
The neutrosophic set is another important generalizations of the classic set, fuzzy set, intuitionistic fuzzy set and picture fuzzy set to deal with uncertainties in decision-making problems. Many authors contributed in the decision-making theory using neutrosophic information. Ashraf [36] proposed the logarithmic hybrid aggregation operators for single value neutrosophic sets. Dragan et al. [37] proposed the novel approach for the selection of power generation technology using the combinative distance-based assessment (CODAS) method. Many decision-making approaches like [38,39] make important contributions using neutrosophic information.
The picture fuzzy set becomes more famous by introducing various kinds of aggregation operators. However, it has a shortcoming in that it is only valid for the environment whose sum of degrees is less than or equal to one. However, in day-to-day life, there are many situations where this condition is ruled out. For instance, if a person giving their preference in the form of positive, neutral and negative membership degrees towards a particular object is 0.7, 0.3 and 0.5, then clearly this situation is not handling with picture fuzzy set. In order to resolve it, Ashraf [40] proposed the notion of the spherical fuzzy set. For instance, corresponding to the above-considered example, we see that ( 0.7 ) 2 + ( 0.3 ) 2 + 0.5 2 = 0.94 and hence a spherical fuzzy set (SFS) is an extension of the existing extensions of fuzzy set theories. In the spherical fuzzy set, each element can be written in the form of triplet component, and each pair is categorized by a positive membership degree, a neutral membership degree and a negative membership degree such that the sum of their square is less than or equal to one. Ashraf [41] proposed some series of spherical aggregation operators using t-norm and t-conorm and gave its applications to show the effectiveness of proposed operators. Ashraf in [42] proposed the GRA method based on a spherical linguistic fuzzy Choquet integral environment and gave its application. For more study, we refer to [43,44,45].
The logarithmic operations being good alternatives, compared with the algebraic operations, have the potential to offer similar smooth estimations as the algebraic operations. However, there is little investigation on logarithmic operations on the IFSs and PyFSs. Motivated by these ideas, we develop a spherical fuzzy MCDM method based on the logarithmic aggregation operators, with the logarithmic operations of the spherical fuzzy sets (SFSs) handling spherical fuzzy MCDM within SFSs.
Thus, the goal of this article is to propose the decision-making method for MCDM problems in which there exist the interrelationships among the criteria. The contributions of this study are:
  • We develop some novel logarithmic operations for spherical fuzzy sets, which can overcome the weaknesses of algebraic operations and capture the relationship between various SFSs.
  • We extend logarithmic operators to logarithmic spherical fuzzy operators, namely logarithmic spherical fuzzy weighted averaging (L-SFWA), logarithmic spherical fuzzy ordered weighted averaging (L-SFOWA), logarithmic spherical fuzzy hybrid weighted averaging (L-SFHWA), logarithmic spherical fuzzy weighted geometric (L-SFWG), logarithmic spherical fuzzy ordered weighted geometric (L-SFOWG) and logarithmic spherical fuzzy hybrid weighted geometric (L-SFHWG) to SFSs, which can overcome the algebraic operators’ drawbacks.
  • We develop the spherical fuzzy entropy for spherical fuzzy information, which can help to find the unknown weights information of the criteria.
  • We develop an algorithm to deal with multi-attribute decision-making problems using spherical fuzzy information.
  • To show the effectiveness and reliability of the proposed spherical fuzzy logarithmic aggregation operators, the application of the proposed operator in emerging technology enterprises is developed.
  • Results indicate that the proposed technique is more effective and gives more accurate output as compared to existing studies.
In order to attain the research goal that has been stated above, the organization of this article is offered as: Section 2 concentrates on some basic notions and operations of existing extensions of fuzzy set theories and also some discussion to propose the spherical fuzzy entropy. Section 3 presents some novel logarithmic operational laws of SFSs. Section 4 defines the logarithmic aggregation operators for SFNs and discusses its properties. Section 5 presents an approach for handling the spherical fuzzy MCDM problem based on the proposed logarithmic operators. Section 5.1 uses an application case to verify the novel method and Section 5.2 presents the comparison study about algebraic and logarithmic aggregation operators. Section 6 concludes the study.

2. Preliminaries

The concepts and basic operations of existing extensions of fuzzy sets are recalled in this section, and they are the foundation of this study.
Definition 1
([27]). A mapping T ^ : Θ × Θ Θ is said to be triangular-norm if each element T ^ satisfies that:
(1) T ^ is commutative, monotonic and associative,
(2) T ^ v * , 1 = v * , each v * T ^ ,
where Θ = [ 0 , 1 ] is the unite interval.
Definition 2
([27]). A mapping S ^ : Θ × Θ Θ is said to be triangular-conorm if each element S ^ satisfies that
(1) S ^ is commutative, monotonic and associative,
(2) S ^ v * , 0 = v * , each v * S ^ ,
where Θ = [ 0 , 1 ] is the unite interval.
As different norms are the curial elements for proposing aggregation operators in fuzzy set theory, here we enlist some basic norms operations for fuzzy sets in Figure 1.
Now, we enlist different types of norms with its generators too in Figure 2 and Figure 3.
Definition 3
([15]). For a set ℜ, by a Pythagorean fuzzy set in ℜ, we mean a structure
ε = P σ r ˇ γ , N σ r ˇ γ | r ˇ γ ,
in which P σ : Θ and N σ : Θ indicate that the positive and negative grades in , Θ = 0 , 1 are the unit intervals. In addition, the following condition satisfied by ρ σ and N σ is 0 P σ 2 r ˇ γ + N σ 2 r ˇ γ 1 ; for all r ˇ . Then, ε is said to be a Pythagorean fuzzy set in ℜ.
Definition 4
([25]). For a set ℜ, by a picture fuzzy set in ℜ, we mean a structure
ε = P σ r ˇ γ , I σ r ˇ γ , N σ r ˇ γ | r ˇ γ ,
in which P σ : Θ , I σ : Θ and N σ : Θ indicate that the positive, neutral and negative grades in ℜ, Θ = 0 , 1 are the unit intervals. In addition, the following condition satisfied by P σ , I σ and N σ is 0 P σ r ˇ γ + I σ r ˇ γ + N σ r ˇ γ 1 , for all r ˇ γ . Then, ε is said to be a picture fuzzy set in ℜ.
Definition 5
([40]). For a set ℜ, by a spherical fuzzy set in ℜ, we mean a structure
ε = P σ r ˇ γ , I σ r ˇ γ , N σ r ˇ γ | r ˇ γ ,
in which P σ : Θ , I σ : Θ and N σ : Θ indicate that the positive, neutral and negative grades in ℜ, Θ = 0 , 1 are the unit intervals. In addition, the following condition satisfies by P σ , I σ and N σ is 0 P σ 2 r ˇ γ + I σ 2 r ˇ γ + N σ 2 r ˇ γ 1 , for all r ˇ γ . Then, ε is said to be a spherical fuzzy set in ℜ.
χ σ r ˇ γ = 1 P σ 2 r ˇ γ + I σ 2 r ˇ γ + N σ 2 r ˇ γ is said to be a refusal degree of r ˇ γ in ℜ, for SFS P σ r ˇ γ , I σ r ˇ γ , N σ r ˇ γ | r ˇ γ , which is triple components P σ r ˇ γ , I σ r ˇ γ , a n d N σ r ˇ γ is said to SFN denoted by e = P e , I e , N e , where P e , I e and N e [ 0 , 1 ] , with the condition that: 0 P e 2 + I e 2 + N e 2 1 .
Ashraf and Abdullah [40] proposed the basic operations of spherical fuzzy set as follows:
Definition 6.
For any two SFNs, ε ρ = P ξ ρ r ˇ γ , I ξ ρ r ˇ γ , N ξ ρ r ˇ γ and ε q = P ξ q r ˇ γ , I ξ q r ˇ γ , N ξ q r ˇ γ in ℜ. The union, intersection and compliment are proposed as:
(1) ε ρ ε q i f f r ˇ γ , P ξ ρ r ˇ γ P ξ q r ˇ γ , I ξ ρ r ˇ γ I ξ q r ˇ γ and N ξ ρ r ˇ γ N ξ q r ˇ γ ;
(2) ε ρ = ε q i f f ε ρ ε q and ε q ε ρ ;
(3) ε ρ ε q = max P ξ ρ , P ξ q , min I ξ ρ , I ξ q , min N ξ ρ , N ξ q ;
(4) ε ρ ε q = min P ξ ρ , P ξ q , min I ξ ρ , I ξ q , max N ξ ρ , N ξ q ;
(5) ε ρ = N ξ ρ , I ξ ρ , P ξ ρ .
Definition 7.
For any two SFNs, ε ρ = P ξ ρ r ˇ γ , I ξ ρ r ˇ γ , N ξ ρ r ˇ γ and ε q = P ξ q r ˇ γ , I ξ q r ˇ γ , N ξ q r ˇ γ in ℜ and β 0 ; then, the operations of SFNs are proposed as
(1) ε ρ ε q = P ξ ρ 2 + P ξ q 2 P ξ ρ 2 · P ξ q 2 , I ξ ρ · I ξ q , N ξ ρ · N ξ q ;
(2) β · ε ρ = 1 ( 1 P ξ ρ 2 ) β , ( I ξ ρ ) β , ( N ξ ρ ) β ;
(3) ε ρ ε q = P ξ ρ · P ξ q , I ξ ρ · I ξ q , N ξ ρ 2 + N ξ q 2 N ξ ρ 2 · N ξ q 2 ;
(4) ε ρ β = ( P ξ ρ ) β , ( I ξ ρ ) β , 1 ( 1 N ξ ρ 2 ) β .
(5) β ε ρ = β 1 ρ ξ ρ 2 , 1 β 2 I ξ ρ , 1 β 2 N ξ ρ i f β 0 , 1 , 1 β 1 ρ ξ ρ 2 , 1 1 β 2 I ξ ρ , 1 1 β 2 N ξ ρ i f β 1 .
Ashraf and Abdullah [40] introduced some properties based on Definition 7 as follows:
Definition 8.
For any three SFNs, ε ρ = P ξ ρ r ˇ γ , I ξ ρ r ˇ γ , N ξ ρ r ˇ γ , ε q = P ξ q r ˇ γ , I ξ q r ˇ γ , N ξ q r ˇ γ and ε l = P σ l r ˇ γ , I σ l r ˇ γ , N σ l r ˇ γ in ℜ and β 1 , β 2 0 . Then,
(1) ε ρ ε q = ε q ε ρ ;
(2) ε ρ ε q = ε q ε ρ ;
(3) β 1 ( ε ρ ε q ) = β 1 ε ρ β 1 ε q , β 1 > 0 ;
(4) ( ε ρ ε q ) β 1 = ε ρ ε q , β 1 > 0 ;
(5) β 1 ε ρ β 2 ε ρ = ( β 1 + β 2 ) ε ρ , β 1 > 0 , β 2 > 0 ;
(6) ε ρ ε ρ = ε ρ , β 1 > 0 , β 2 > 0 ;
(7) ( ε ρ ε q ) ε l = ε ρ ( ε q ε l ) ;
(8) ( ε ρ ε q ) ε l = ε ρ ( ε q ε l ) .
Definition 9.
For any SFN, ε ρ = P ξ ρ r ˇ γ , I ξ ρ r ˇ γ , N ξ ρ r ˇ γ in ℜ. Then, score and accuracy values are defined as
(1) S ˜ ( ε ρ ) = 1 3 ( 2 + P ξ ρ I ξ ρ N ξ ρ ) 0 , 1
(2) A ˜ ( ε ρ ) = P ξ ρ N ξ ρ 0 , 1 .
The score and accuracy values defined above suggest which SFN is greater than other SFNs. The comparison technique is defined in the next definition.
Definition 10.
For any SFNs, ε ρ = P ξ ρ r ˇ γ , I ξ ρ r ˇ γ , N ξ ρ r ˇ γ ρ = 1 , 2 in ℜ. Then, the comparison technique is proposed as
(1) If S ˜ ( ε 1 ) < S ˜ ( ε 2 ) , then ε 1 < ε 2 ,
(2) If S ˜ ( ε 1 ) > S ˜ ( ε 2 ) , then ε 1 > ε 2 ,
(3) If S ˜ ( ε 1 ) = S ˜ ( ε 2 ) , then
(a) A ˜ ( ε 1 ) < A ˜ ( ε 2 ) , then ε 1 < ε 2 ,
(b) A ˜ ( ε 1 ) > A ˜ ( ε 2 ) , then ε 1 > ε 2 ,
(c) A ˜ ( ε 1 ) = A ˜ ( ε 2 ) , then ε 1 ε 2 .
Ashraf and Abdullah [40] proposed aggregation operators for SFNs based on different norms:
Definition 11.
For any collection of SFNs, ε ρ = P ξ ρ r ˇ γ , I ξ ρ r ˇ γ , N ξ ρ r ˇ γ ρ = 1 , 2 , , n in ℜ. The structure of the spherical weighted averaging (SFWA) operator is
S F W A ε 1 , ε 2 , , ε n = ρ = 1 n β ρ ε ρ ,
where β ρ ρ = 1 , 2 , , n are weight vectors with β ρ 0 and ρ = 1 n β ρ = 1 .
Definition 12.
For any collection of SFNs, ε ρ = P ξ ρ r ˇ γ , I ξ ρ r ˇ γ , N ξ ρ r ˇ γ ρ = 1 , 2 , , n in ℜ. The structure of the spherical order weighted averaging (SFOWA) operator is
S F O W A ε 1 , ε 2 , , ε n = ρ = 1 n β ρ ε η ( ρ ) ,
where β ρ ρ = 1 , 2 , , n are weight vectors with β ρ 0 , ρ = 1 n β ρ = 1 and the ρ t h biggest weighted value is ε η ( ρ ) consequently by total order ε η ( 1 ) ε η ( 2 ) ε η ( n ) .
Definition 13.
For any collection of SFNs, ε ρ = P ξ ρ r ˇ γ , I ξ ρ r ˇ γ , N ξ ρ r ˇ γ ρ = 1 , 2 , , n in ℜ. The structure of the spherical hybrid weighted averaging (SFHWA) operator is
S F H W A ε 1 , ε 2 , , ε n = ρ = 1 n β ρ ε η ( ρ ) * ,
where β ρ ρ = 1 , 2 , , n are weight vectors with β ρ 0 , ρ = 1 n β ρ = 1 and the ρ t h biggest weighted value is ε η ( ρ ) * ε η ( ρ ) * = n β ρ ε η ( ρ ) , ρ N consequently by total order ε η ( 1 ) * ε η ( 2 ) * ε η ( n ) * . In addition, the associated weights are ω = ( ω 1 , ω 2 , , ω n ) with ω ρ 0 , Σ ρ = 1 n ω ρ = 1 .
Definition 14.
For any collection of SFNs, ε ρ = P ξ ρ r ˇ γ , I ξ ρ r ˇ γ , N ξ ρ r ˇ γ ρ = 1 , 2 , , n in ℜ. The structure of spherical weighted geometric (SFWG) operator is
S F W G ε 1 , ε 2 , , ε n = ρ = 1 n ε ρ β ρ ,
where β ρ ρ = 1 , 2 , , n are weight vectors with β ρ 0 and ρ = 1 n β ρ = 1 .
Definition 15.
For any collection of SFNs, ε ρ = P ξ ρ r ˇ γ , I ξ ρ r ˇ γ , N ξ ρ r ˇ γ ρ = 1 , 2 , , n in ℜ. The structure of the spherical order weighted geometric (SFOWG) operator is
S F O W G ε 1 , ε 2 , , ε n = ρ = 1 n ε η ( ρ ) β ρ ,
where β ρ ρ = 1 , 2 , , n are weight vectors with β ρ 0 , ρ = 1 n β ρ = 1 and the ρ t h biggest weighted value is ε η ( ρ ) consequently by total order ε η ( 1 ) ε η ( 2 ) ε η ( n ) .
Definition 16.
For any collection of SFNs, ε ρ = P ξ ρ r ˇ γ , I ξ ρ r ˇ γ , N ξ ρ r ˇ γ ρ = 1 , 2 , , n in ℜ. The structure of spherical hybrid weighted geometric (SFHWG) operator is
S F H W G ε 1 , ε 2 , , ε n = ρ = 1 n ε η ( ρ ) * β ρ ,
where β ρ ρ = 1 , 2 , , n are weight vectors with β ρ 0 , ρ = 1 n β ρ = 1 and the ρ t h biggest weighted value is ε η ( ρ ) * ε η ( ρ ) * = n β ρ ε η ( ρ ) , ρ N consequently by total order ε η ( 1 ) * ε η ( 2 ) * ε η ( n ) * . In addition, associated weights are ω = ( ω 1 , ω 2 , , ω n ) with ω ρ 0 , Σ ρ = 1 n ω ρ = 1 .

3. Entropy

Basically, we familiarize the concept of entropy, when probability measures the discrimination of criteria being imposed on multi-attribute decision-making problems. Non-probabilistic entropy firstly approximated by De Luca and Termini [46] also presented some necessities to find intuitive comprehension of the degree of fuzziness. Many researchers are getting interest in this field and have done a lot of work such as Scmidt and Kacprzyk [47] proposing some axioms for distance between intuitionistic fuzzy sets and non-probabilistic entropy measure for them. In this section, we recall the concept of Shannon entropy, fuzzy entropy, entropy for Pythagorean fyzzy numbers and propose the entropy for spherical fuzzy numbers.
Definition 17
([48]). Let δ η ρ ρ 1 , 2 , , n be the set of n-complete probability distributions. Shannon entropy for δ η ρ ρ 1 , 2 , , n probability distribution is defined as
E s δ = ρ = 1 n δ η ρ log δ η ρ .
Definition 18
([49]). Let F be any fuzzy set in ℜ, fuzzy entropy for the set F, we mean a structure
F δ = 1 n ρ = 1 n P η ρ log P η ρ + 1 P η ρ log 1 P η ρ .
Definition 19
([49]). Let F be any fuzzy set in ℜ, and, for Pythagorean fuzzy entropy for the set F, we mean a structure
P y q = 1 + 1 n ρ = 1 n P i log P i + N i log N i q = 1 n 1 + 1 n ρ = 1 n P i log P i + N i log N i .
Definition 20.
Let F be any fuzzy set in ℜ, spherical fuzzy entropy for the set F, and we mean a structure
γ q = 1 + 1 n ρ = 1 n P i log P i + I i log I i + N i log N i q = 1 n 1 + 1 n ρ = 1 n P i log P i + I i log I i + N i log N i .

4. Spherical Fuzzy Logarithmic Operational Laws

Motivated by the novel concept of spherical fuzzy set, we introduced some novel logarithmic operational laws for SFNs. As real number system o g σ 0 is meaningless and o g σ 1 is not defined therefore, in our study, we take nonempty spherical fuzzy sets and σ 1 , where σ is any real number.
Definition 21.
For any SFN, ε ρ = P ξ ρ r ˇ γ , I ξ ρ r ˇ γ , N ξ ρ r ˇ γ in ℜ. The logarithmic spherical fuzzy number is defined as
o g σ ε ρ = 1 o g σ P ξ ρ r ˇ γ 2 , o g σ 1 I ξ ρ 2 r ˇ γ , o g σ 1 N ξ ρ 2 r ˇ γ | r ˇ γ
in which P σ : Θ , I σ : Θ and N σ : Θ indicate that the positive, neutral and negative grades in ℜ, Θ = 0 , 1 are the unit intervals. In addition, the following condition satisfies by P σ , I σ and N σ is 0 P σ 2 r ˇ γ + I σ 2 r ˇ γ + N σ 2 r ˇ γ 1 for all r ˇ γ . Therefore, the membership grade is
1 o g σ P ξ ρ r ˇ γ 2 : Θ , such that 0 1 o g σ P ξ ρ r ˇ γ 2 1 , r ˇ γ ,
the neutral grade is
o g σ 1 I ξ ρ 2 r ˇ γ : Θ , such that 0 o g σ 1 I ξ ρ 2 r ˇ γ 1 , r ˇ γ ,
and the negative grade is
o g σ 1 N ξ ρ 2 r ˇ γ : Θ , such that 0 o g σ 1 N ξ ρ 2 r ˇ γ 1 , r ˇ γ .
Therefore,
o g σ ε ρ = 1 o g σ P ξ ρ r ˇ γ 2 , o g σ 1 I ξ ρ 2 r ˇ γ , o g σ 1 N ξ ρ 2 r ˇ γ | r ˇ γ 0 < σ min P ξ ρ , 1 I ξ ρ 2 , 1 N ξ ρ 2 1 , σ 1
is SPN.
Definition 22.
For any SFN, ε ρ = P ξ ρ r ˇ γ , I ξ ρ r ˇ γ , N ξ ρ r ˇ γ in ℜ. If
o g σ ε ρ = 1 o g σ P ξ ρ r ˇ γ 2 , o g σ 1 I ξ ρ 2 r ˇ γ , o g σ 1 N ξ ρ 2 r ˇ γ 0 < σ min P ξ ρ , 1 I ξ ρ 2 , 1 N ξ ρ 2 < 1 , 1 o g 1 σ P ξ ρ r ˇ γ 2 , o g 1 σ 1 I ξ ρ 2 r ˇ γ , o g 1 σ 1 N ξ ρ 2 r ˇ γ 0 < 1 σ min P ξ ρ , 1 I ξ ρ 2 , 1 N ξ ρ 2 < 1 , σ 1 ,
then the function o g σ ε ρ is known to be a logarithmic operator for a spherical fuzzy set, and its value is called logarithmic SFN (L-SFN). Here, we take o g σ 0 = 0 , σ > 0 , σ 1 .
Theorem 1.
For any SFN, ε ρ = P ξ ρ r ˇ γ , I ξ ρ r ˇ γ , N ξ ρ r ˇ γ in ℜ, then o g σ ε ρ is also a spherical fuzzy number.
Proof. 
Since any SFN ε ρ = P ξ ρ r ˇ γ , I ξ ρ r ˇ γ , N ξ ρ r ˇ γ in , which means that P σ : Θ , I σ : Θ and N σ : Θ indicate that the positive, neutral and negative grades in , Θ = 0 , 1 are the unit intervals. In addition, the following condition satisfied by P σ , I σ and N σ is 0 P σ 2 r ˇ γ + I σ 2 r ˇ γ + N σ 2 r ˇ γ 1 . The following two cases happen.
Case-1 When 0 < σ min P ξ ρ , 1 I ξ ρ 2 , 1 N ξ ρ 2 < 1 , σ 1 and since o g σ ε ρ is a decreasing function w.r.t σ . Thus, 0 o g σ P ξ ρ , o g σ 1 I ξ ρ 2 , o g σ 1 N ξ ρ 2 1 and hence 0 1 o g σ P ξ ρ r ˇ γ 2 1 , 0 o g σ 1 I ξ ρ 2 r ˇ γ 1 , 0 o g σ 1 N ξ ρ 2 r ˇ γ 1 and 0 1 o g σ P ξ ρ r ˇ γ 2 + o g σ 1 I ξ ρ 2 r ˇ γ + o g σ 1 N ξ ρ 2 r ˇ γ 1 . Therefore, o g σ ε ρ is SFN.
Case-2 When σ > 1 , 0 < 1 σ < 1 and 1 σ min P ξ ρ , 1 I ξ ρ 2 , 1 N ξ ρ 2 ; similar to the above, we can find that o g σ ε ρ is SFN. Thus, the procedure is eliminated here. □
Example 1.
Suppose that, for any SFN, ε ρ = 0.8 , 0.5 , 0.3 in ℜ with σ = 0.4 , then
o g σ ε ρ = 1 o g 0 . 4 0.8 2 , o g 0.4 1 0.5 2 , o g 0.4 1 0.3 2 = 0.969 , 0.156 , 0.051 .
In addition, if σ = 8 , then it follows:
o g 1 σ ε ρ = 1 o g 1 8 0.8 2 , o g 1 8 1 0.5 2 , o g 1 8 1 0.3 2 = 0.994 , 0.069 , 0.022 .
Now, we give some discussion on the basic properties of the L-SFN.
Theorem 2.
For any SFN, ε ρ = P ξ ρ r ˇ γ , I ξ ρ r ˇ γ , N ξ ρ r ˇ γ in ℜ. If 0 < σ min P ξ ρ , 1 I ξ ρ 2 , 1 N ξ ρ 2 < 1 , σ 1 then
(1) σ o g σ ε ρ = ε ρ ;
(2) o g σ σ ε ρ = ε ρ .
Proof. 
(1) According to Definitions 7 and 22, we obtain
σ o g σ ε ρ = σ 1 1 o g σ ρ ξ ρ 2 2 , 1 σ 2 o g σ 1 I ξ ρ 2 , 1 σ 2 o g σ 1 N ξ ρ 2 = σ 1 1 o g σ ρ ξ ρ 2 , 1 1 I ξ ρ 2 , 1 1 N ξ ρ 2 = σ o g σ ρ ξ ρ , I ξ ρ , N ξ ρ = ρ ξ ρ , I ξ ρ , N ξ ρ = ε ρ .
(2) According to Definition 22, we obtain
o g σ σ ε ρ = o g σ σ 1 ρ ξ ρ 2 , 1 σ 2 I ξ ρ , 1 σ 2 N ξ ρ = 1 o g σ σ 1 ρ ξ ρ 2 2 , o g σ 1 1 σ 2 I ξ ρ 2 , o g σ 1 1 σ 2 N ξ ρ 2 = 1 1 ρ ξ ρ 2 , o g σ 1 1 σ 2 I ξ ρ , o g σ 1 1 σ 2 N ξ ρ = ρ ξ ρ , I ξ ρ , N ξ ρ = ε ρ .
Definition 23.
For any two L-SFNs, o g σ ε ρ = 1 o g σ P ξ ρ r ˇ γ 2 , o g σ 1 I ξ ρ 2 r ˇ γ , o g σ 1 N ξ ρ 2 r ˇ γ and o g σ ε q = 1 o g σ P ξ q r ˇ γ 2 , o g σ 1 I ξ q 2 r ˇ γ , o g σ 1 N ξ q 2 r ˇ γ in ℜ and β 0 , then the logarithmic operations of L-SFNs are proposed:
(1) o g σ ε ρ o g σ ε q = 1 o g σ P ξ ρ r ˇ γ 2 · o g σ P ξ q r ˇ γ 2 , o g σ 1 I ξ ρ 2 r ˇ γ · o g σ 1 I ξ q 2 r ˇ γ , o g σ 1 N ξ ρ 2 r ˇ γ · o g σ 1 N ξ q 2 r ˇ γ ;
(2) β · o g σ ε ρ = 1 o g σ P ξ ρ r ˇ γ 2 β , o g σ 1 I ξ ρ 2 r ˇ γ β , o g σ 1 N ξ ρ 2 r ˇ γ β ;
(3) o g σ ε ρ o g σ ε q = 1 o g σ P ξ ρ r ˇ γ 2 · 1 o g σ P ξ q r ˇ γ 2 , 1 1 o g σ 1 I ξ ρ 2 r ˇ γ 2 · 1 o g σ 1 I ξ q 2 r ˇ γ 2 , 1 1 o g σ 1 N ξ ρ 2 r ˇ γ 2 · 1 o g σ 1 N ξ q 2 r ˇ γ 2 ;
(4) o g σ ε ρ β = 1 o g σ P ξ ρ r ˇ γ 2 β , 1 1 o g σ 1 I ξ ρ 2 r ˇ γ 2 β , 1 1 o g σ 1 I ξ ρ 2 r ˇ γ 2 β .
Theorem 3.
For any two L-SFNs, o g σ ε ρ = 1 o g σ P ξ ρ r ˇ γ 2 , o g σ 1 I ξ ρ 2 r ˇ γ , o g σ 1 N ξ ρ 2 r ˇ γ ρ = 1 , 2 in ℜ, with 0 < σ min P ξ ρ , 1 I ξ ρ 2 , 1 N ξ ρ 2 < 1 , σ 1 . Then,
(1) o g σ ε 1 o g σ ε 2 = o g σ ε 2 o g σ ε 1 ,
(2) o g σ ε 1 o g σ ε 2 = o g σ ε 2 o g σ ε 1 .
Proof. 
This is straightforward from Definition 23, so the procedure is eliminated here. □
Theorem 4.
For any two L-SFNs, o g σ ε ρ = 1 o g σ P ξ ρ r ˇ γ 2 , o g σ 1 I ξ ρ 2 r ˇ γ , o g σ 1 N ξ ρ 2 r ˇ γ ρ = 1 , 2 , 3 in ℜ, with 0 < σ min P ξ ρ , 1 I ξ ρ 2 , 1 N ξ ρ 2 < 1 , σ 1 . Then,
(1) o g σ ε 1 o g σ ε 2 o g σ ε 3 = o g σ ε 1 o g σ ε 2 o g σ ε 3 ,
(2) o g σ ε 1 o g σ ε 2 o g σ ε 3 = o g σ ε 1 o g σ ε 2 o g σ ε 3 .
Proof. 
This is straightforward from Definition 23, so the procedure is eliminated here. □
Theorem 5.
For any two L-SFNs, o g σ ε ρ = 1 o g σ P ξ ρ r ˇ γ 2 , o g σ 1 I ξ ρ 2 r ˇ γ , o g σ 1 N ξ ρ 2 r ˇ γ ρ = 1 , 2 in ℜ, with 0 < σ min P ξ ρ , 1 I ξ ρ 2 , 1 N ξ ρ 2 < 1 , σ 1 , β , β 1 , β 2 > 0 be any real numbers. Then,
(1) β o g σ ε 1 o g σ ε 2 = β o g σ ε 1 β o g σ ε 2 ;
(2) o g σ ε 1 o g σ ε 2 β = o g σ ε 1 β o g σ ε 2 β ;
(3) β 1 o g σ ε 1 β 2 o g σ ε 1 = β 1 + β 2 o g σ ε 1 ;
(4) o g σ ε 1 β 1 o g σ ε 1 β 2 = o g σ ε 1 β 1 + β 2 ;
(5) o g σ ε 1 β 1 β 2 = o g σ ε 1 β 1 β 2 .
Proof. 
(1) Since, from Definition 23, we have
o g σ ε 1 o g σ ε 2 = 1 o g σ P ξ 1 2 · o g σ P ξ 2 2 , o g σ 1 I ξ 1 2 · o g σ 1 I ξ 2 2 , o g σ 1 N ξ 1 2 · o g σ 1 N ξ 2 2 ,
for any real number β > 0 , we obtain
β o g σ ε 1 o g σ ε 2 = 1 o g σ P ξ 1 2 · o g σ P ξ 2 2 β , o g σ 1 I ξ 1 2 · o g σ 1 I ξ 2 2 β , o g σ 1 N ξ 1 2 · o g σ 1 N ξ 2 2 β = 1 o g σ P ξ 1 2 β , o g σ 1 I ξ 1 2 β , o g σ 1 N ξ 1 2 β 1 o g σ P ξ 2 2 β , o g σ 1 I ξ 2 2 β , o g σ 1 N ξ 2 2 β = β o g σ ε 1 β o g σ ε 2 .
(2) Since, from Definition 23, we have
o g σ ε 1 o g σ ε 2 = 1 o g σ P ξ 1 2 · 1 o g σ P ξ 2 2 , 1 1 o g σ 1 I ξ 1 2 2 · 1 o g σ 1 I ξ 2 2 2 , 1 1 o g σ 1 N ξ 1 2 2 · 1 o g σ 1 N ξ 2 2 2 ,
for any real number β > 0 , we obtain
o g σ ε 1 o g σ ε 2 β = 1 o g σ P ξ 1 2 β · 1 o g σ P ξ 2 2 β 1 1 o g σ 1 I ξ 1 2 2 β · 1 o g σ 1 I ξ 2 2 2 β 1 1 o g σ 1 N ξ 1 2 2 β · 1 o g σ 1 N ξ 2 2 2 β = o g σ ε 1 β o g σ ε 2 β ;
(3) and (4) are similarly as above, so the procedure is eliminated here.
(5) Since, from Definition 23, we have
o g σ ε 1 β 1 β 2 = 1 o g σ P ξ 1 2 β 1 1 1 o g σ 1 I ξ 1 2 2 β 1 1 1 o g σ 1 N ξ 1 2 2 β 1 β 2 = 1 o g σ P ξ 1 2 β 1 β 2 1 1 o g σ 1 I ξ 1 2 2 β 1 β 2 1 1 o g σ 1 N ξ 1 2 2 β 1 β 2 = o g σ ε 1 β 1 β 2 ,
this is therefore proved. □
Definition 24.
For any L-SFN, o g σ ε ρ = 1 o g σ P ξ ρ r ˇ γ 2 , o g σ 1 I ξ ρ 2 r ˇ γ , o g σ 1 N ξ ρ 2 r ˇ γ in ℜ. Then, score and accuracy values are defined as
(1) S ˜ ( o g σ ε ρ ) = 1 o g σ P ξ ρ r ˇ γ 2 o g σ 1 I ξ ρ 2 r ˇ γ 2 o g σ 1 N ξ ρ 2 r ˇ γ 2 ,
(2) A ˜ ( o g σ ε ρ ) = 1 o g σ P ξ ρ r ˇ γ 2 + o g σ 1 N ξ ρ 2 r ˇ γ 2 .
The score and accuracy values defined above suggest which L-SFN is greater than other L-SFNs. The comparison technique is defined in the next definition.
Definition 25.
For any L-SFN, o g σ ε ρ = 1 o g σ P ξ ρ r ˇ γ 2 , o g σ 1 I ξ ρ 2 r ˇ γ , o g σ 1 N ξ ρ 2 r ˇ γ ρ = 1 , 2 in ℜ. Then, the comparison technique is proposed as
(1) If S ˜ ( o g σ ε 1 ) < S ˜ ( o g σ ε 2 ) , then o g σ ε 1 < o g σ ε 2 ,
(2) If S ˜ ( o g σ ε 1 ) > S ˜ ( o g σ ε 2 ) , then o g σ ε 1 > o g σ ε 2 ,
(3) If S ˜ ( o g σ ε 1 ) = S ˜ ( o g σ ε 2 ) , then
(a) A ˜ ( o g σ ε 1 ) < A ˜ ( o g σ ε 2 ) , then o g σ ε 1 < o g σ ε 2 ,
(b) A ˜ ( o g σ ε 1 ) > A ˜ ( o g σ ε 2 ) , then o g σ ε 1 > o g σ ε 2 ,
(c) A ˜ ( o g σ ε 1 ) = A ˜ ( o g σ ε 2 ) , then o g σ ε 1 o g σ ε 2 .

5. Logarithmic Aggregation Operators for L-SFNs

Now, we propose novel spherical fuzzy logarithmic aggregation operators for L-SFNs based on defined spherical fuzzy logarithmic operations laws as follows:

5.1. Logarithmic Averaging Operators

Definition 26.
For any collection of SFNs, ε ρ = P ξ ρ r ˇ γ , I ξ ρ r ˇ γ , N ξ ρ r ˇ γ ρ = 1 , 2 , , n in ℜ, with 0 < σ ρ min P ξ ρ , 1 I ξ ρ 2 , 1 N ξ ρ 2 < 1 , σ 1 . The structure of logarithmic spherical weighted averaging (L-SFWA) operator is
L S F W A ε 1 , ε 2 , , ε n = ρ = 1 n β ρ o g σ ρ ε ρ ,
where β ρ ρ = 1 , 2 , , n are weight vectors with β ρ 0 and ρ = 1 n β ρ = 1 .
Theorem 6.
For any collection of SFNs, ε ρ = P ξ ρ r ˇ γ , I ξ ρ r ˇ γ , N ξ ρ r ˇ γ ρ = 1 , 2 , , n in ℜ, with 0 < σ ρ min P ξ ρ , 1 I ξ ρ 2 , 1 N ξ ρ 2 < 1 , σ 1 . Then, by using logarithmic operations and Definition 26, L S F W A is defined as
L S F W A ε 1 , ε 2 , , ε n , = 1 ρ = 1 n o g σ ρ P ξ ρ 2 β ρ , ρ = 1 n o g σ ρ 1 I ξ ρ 2 β ρ , ρ = 1 n o g σ ρ 1 N ξ ρ 2 β ρ 0 < σ ρ min P ξ ρ , 1 I ξ ρ 2 , 1 N ξ ρ 2 < 1 , 1 ρ = 1 n o g 1 σ ρ P ξ ρ 2 β ρ , ρ = 1 n o g 1 σ ρ 1 I ξ ρ 2 β ρ , ρ = 1 n o g 1 σ ρ 1 N ξ ρ 2 β ρ 0 < 1 σ ρ min P ξ ρ , 1 I ξ ρ 2 , 1 N ξ ρ 2 < 1 , σ 1 ,
where β ρ ρ = 1 , 2 , , n are weight vectors with β ρ 0 and ρ = 1 n β ρ = 1 .
Proof. 
Using mathematical induction to prove Theorem 6, we therefore proceed as follows:
(a) For n = 2 , since
β 1 o g σ 1 ε 1 = 1 o g σ 1 P ξ 1 2 β 1 , o g σ 1 1 I ξ 1 2 β 1 , o g σ 1 1 N ξ 1 2 β 1
and
β 2 o g σ 2 ε 2 = 1 o g σ 2 P ξ 2 2 β 2 , o g σ 2 1 I ξ 2 2 β 2 , o g σ 2 1 N ξ 2 2 β 2 .
Then,
L S F W A ε 1 , ε 2 = β 1 o g σ 1 ε 1 β 2 o g σ 2 ε 2 = 1 o g σ 1 P ξ 1 2 β 1 , o g σ 1 1 I ξ 1 2 β 1 , o g σ 1 1 N ξ 1 2 β 1 1 o g σ 2 P ξ 2 2 β 2 , o g σ 2 1 I ξ 2 2 β 2 , o g σ 2 1 N ξ 2 2 β 2 = 1 o g σ 1 P ξ 1 2 β 1 · o g σ 2 P ξ 2 2 β 2 , o g σ 1 1 I ξ 1 2 β 1 · o g σ 2 1 I ξ 2 2 β 2 , o g σ 1 1 N ξ 1 2 β 1 · o g σ 2 1 N ξ 2 2 β 2 = 1 ρ = 1 2 o g σ ρ P ξ ρ 2 β ρ , ρ = 1 n o g σ ρ 1 I ξ ρ 2 β ρ , ρ = 1 n o g σ ρ 1 N ξ ρ 2 β ρ .
(b) Now, Theorem 6 is true for n = k ,
L S F W A ε 1 , ε 2 , , ε k = 1 ρ = 1 k o g σ ρ P ξ ρ 2 β ρ , ρ = 1 k o g σ ρ 1 I ξ ρ 2 β ρ , ρ = 1 k o g σ ρ 1 N ξ ρ 2 β ρ .
(c) Now, we prove that Theorem 6 for n = k + 1 , which is
L S F W A ε 1 , ε 2 , , ε k , ε k + 1 = ρ = 1 k β ρ o g σ ρ ε ρ + β k + 1 o g σ k + 1 ε k + 1
L S F W A ε 1 , ε 2 , , ε k , ε k + 1 = 1 ρ = 1 k o g σ ρ P ξ ρ 2 β ρ , ρ = 1 k o g σ ρ 1 I ξ ρ 2 β ρ , ρ = 1 k o g σ ρ 1 N ξ ρ 2 β ρ 1 o g σ k + 1 P ξ k + 1 2 β k + 1 , o g σ k + 1 1 I ξ k + 1 2 β k + 1 , o g σ k + 1 1 N ξ k + 1 2 β k + 1 = 1 ρ = 1 k + 1 o g σ ρ P ξ ρ 2 β ρ , ρ = 1 k + 1 o g σ ρ 1 I ξ ρ 2 β ρ , ρ = 1 k + 1 o g σ ρ 1 N ξ ρ 2 β ρ .
Thus, Theorem 6 is true for n = z + 1 . Hence, it is satisfied for all n. Therefore,
L S F W A ε 1 , ε 2 , , ε n = 1 ρ = 1 n o g σ ρ P ξ ρ 2 β ρ , ρ = 1 n o g σ ρ 1 I ξ ρ 2 β ρ , ρ = 1 n o g σ ρ 1 N ξ ρ 2 β ρ .
In a similar way, if 0 < 1 σ ρ min ρ ξ ρ , 1 I ξ ρ 2 , 1 N ξ ρ 2 < 1 , σ 1 , we can also obtain
L S F W A ε 1 , ε 2 , , ε n = 1 ρ = 1 n o g 1 σ ρ P ξ ρ 2 β ρ , ρ = 1 n o g 1 σ ρ 1 I ξ ρ 2 β ρ , ρ = 1 n o g 1 σ ρ 1 N ξ ρ 2 β ρ ,
which completes the proof. □
Remark 1.
If σ 1 = σ 2 = σ 3 = = σ n = σ , that is 0 < σ min P ξ ρ , 1 I ξ ρ 2 , 1 N ξ ρ 2 < 1 , σ 1 , then the L S F W A operator is reduced as follows:
L S F W A ε 1 , ε 2 , , ε n = 1 ρ = 1 n o g σ P ξ ρ 2 β ρ , ρ = 1 n o g σ 1 I ξ ρ 2 β ρ , ρ = 1 n o g σ 1 N ξ ρ 2 β ρ .
Properties: The L S F W A operator satisfies some properties that are listed below:
(1) Idempotency: For any collection of SFNs, ε ρ = P ξ ρ r ˇ γ , I ξ ρ r ˇ γ , N ξ ρ r ˇ γ ρ = 1 , 2 , , n in . Then, if the collection of SFNs ε ρ = P ξ ρ r ˇ γ , I ξ ρ r ˇ γ , N ξ ρ r ˇ γ ρ = 1 , 2 , , n is identical,
L S F W A ε 1 , ε 2 , , ε n = ε .
(2) Boundedness: For any collection of SFNs, ε ρ = P ξ ρ r ˇ γ , I ξ ρ r ˇ γ , N ξ ρ r ˇ γ ρ = 1 , 2 , , n in . ε ρ = min ρ ρ ξ ρ , max ρ I ξ ρ , max ρ N ξ ρ and ε ρ + = max ρ P ξ ρ , min ρ I ξ ρ , min ρ N ξ ρ ρ = 1 , 2 , , n in , therefore
ε ρ L S F W A ε 1 , ε 2 , , ε n ε ρ + .
(3) Monotonically: For any collection of SFNs, ε ρ = P ξ ρ r ˇ γ , I ξ ρ r ˇ γ , N ξ ρ r ˇ γ ρ = 1 , 2 , , n in .If ε ρ ε ρ * for ρ = 1 , 2 , , n , then
L S F W A ε 1 , ε 2 , , ε n L S F W A ε 1 * , ε 2 * , , ε n * .
Definition 27.
For any collection of SFNs, ε ρ = P ξ ρ r ˇ γ , I ξ ρ r ˇ γ , N ξ ρ r ˇ γ ρ = 1 , 2 , , n in ℜ, with 0 < σ ρ min P ξ ρ , 1 I ξ ρ 2 , 1 N ξ ρ 2 < 1 , σ 1 . The structure of the logarithmic spherical ordered weighted averaging (L-SFOWA) operator is
L S F O W A ε 1 , ε 2 , , ε n = ρ = 1 n β ρ o g σ ρ ε η ρ ,
where β ρ ρ = 1 , 2 , , n are weight vectors with β ρ 0 and ρ = 1 n β ρ = 1 and the ρ t h biggest weighted value is ε η ( ρ ) consequently by total order ε η ( 1 ) ε η ( 2 ) ε η ( n ) .
Theorem 7.
For any collection of SFNs, ε ρ = P ξ ρ r ˇ γ , I ξ ρ r ˇ γ , N ξ ρ r ˇ γ ρ = 1 , 2 , , n in ℜ, with 0 < σ ρ min P ξ ρ , 1 I ξ ρ 2 , 1 N ξ ρ 2 < 1 , σ 1 . Then, by using logarithmic operations and Definition 27, L S F O W A is defined as
L S F O W A ε 1 , ε 2 , , ε n = 1 ρ = 1 n o g σ ρ P ξ η ρ 2 β ρ , ρ = 1 n o g σ ρ 1 I ξ η ρ 2 β ρ , ρ = 1 n o g σ ρ 1 N ξ η ρ 2 β ρ 0 < σ ρ min P ξ ρ , 1 I ξ ρ 2 , 1 N ξ ρ 2 < 1 , 1 ρ = 1 n o g 1 σ ρ P ξ η ρ 2 β ρ , ρ = 1 n o g 1 σ ρ 1 I ξ η ρ 2 β ρ , ρ = 1 n o g 1 σ ρ 1 N ξ η ρ 2 β ρ 0 < 1 σ ρ min P ξ ρ , 1 I ξ ρ 2 , 1 N ξ ρ 2 < 1 , σ 1 ,
where β ρ ρ = 1 , 2 , , n are weight vectors with β ρ 0 and ρ = 1 n β ρ = 1 and the ρ t h biggest weighted value is ε η ( ρ ) consequently by total order ε η ( 1 ) ε η ( 2 ) ε η ( n ) .
Proof. 
The proof is similar to Theorem 6. Thus, the procedure is eliminated here. □
Remark 2.
If σ 1 = σ 2 = σ 3 = = σ n = σ , that is, 0 < σ min ρ ξ ρ , 1 I ξ ρ 2 , 1 N ξ ρ 2 < 1 , σ 1 , then the L S F O W A operator is reduced as follows:
L S F O W A ε 1 , ε 2 , , ε n = 1 ρ = 1 n o g σ P ξ η ρ 2 β ρ , ρ = 1 n o g σ 1 I ξ η ρ 2 β ρ , ρ = 1 n o g σ 1 N ξ η ρ 2 β ρ .
Properties: The L S F O W A operator satisfies some properties that are listed below:
(1) Idempotency: For any collection of SFNs, ε ρ = P ξ ρ r ˇ γ , I ξ ρ r ˇ γ , N ξ ρ r ˇ γ ρ = 1 , 2 , , n in .Then, if a collection of SFNs ε ρ = P ξ ρ r ˇ γ , I ξ ρ r ˇ γ , N ξ ρ r ˇ γ ρ = 1 , 2 , , n is identical, that is,
L S F O W A ε 1 , ε 2 , , ε n = ε .
(2) Boundedness: For any collection of SFNs, ε ρ = P ξ ρ r ˇ γ , I ξ ρ r ˇ γ , N ξ ρ r ˇ γ ρ = 1 , 2 , , n in . ε ρ = min ρ P ξ ρ , max ρ I ξ ρ , max ρ N ξ ρ and ε ρ + = max ρ P ξ ρ , min ρ I ξ ρ , min ρ N ξ ρ ρ = 1 , 2 , , n in ; therefore,
ε ρ L S F O W A ε 1 , ε 2 , , ε n ε ρ + .
(3) Monotonically: For any collection of SFNs, ε ρ = P ξ ρ r ˇ γ , I ξ ρ r ˇ γ , N ξ ρ r ˇ γ ρ = 1 , 2 , , n in . If ε ρ ε ρ * for ρ = 1 , 2 , , n , then
L S F O W A ε 1 , ε 2 , , ε n L S F O W A ε 1 * , ε 2 * , , ε n * .
Definition 28.
For any collection of SFNs, ε ρ = P ξ ρ r ˇ γ , I ξ ρ r ˇ γ , N ξ ρ r ˇ γ ρ = 1 , 2 , , n in ℜ, with 0 < σ ρ min P ξ ρ , 1 I ξ ρ 2 , 1 N ξ ρ 2 < 1 , σ 1 . The structure of a logarithmic spherical hybrid weighted averaging (L-SFHWA) operator is
L S F H W A ε 1 , ε 2 , , ε n = ρ = 1 n β ρ o g σ ρ ε η ρ * ,
where β ρ ρ = 1 , 2 , , n are weight vectors with β ρ 0 and ρ = 1 n β ρ = 1 and the ρ t h biggest weighted value is ε η ( ρ ) * ε η ( ρ ) * = n β ρ ε η ( ρ ) , ρ N consequently by total order ε η ( 1 ) * ε η ( 2 ) * ε η ( n ) * . In addition, associated weights are ω = ( ω 1 , ω 2 , , ω n ) with ω ρ 0 , Σ ρ = 1 n ω ρ = 1 .
Theorem 8.
For any collection of SFNs, ε ρ = P ξ ρ r ˇ γ , I ξ ρ r ˇ γ , N ξ ρ r ˇ γ ρ = 1 , 2 , , n in ℜ, with 0 < σ ρ min P ξ ρ , 1 I ξ ρ 2 , 1 N ξ ρ 2 < 1 , σ 1 . Then, by using logarithmic operations and Definition 28, L S F H W A is defined as
L S F H W A ε 1 , ε 2 , , ε n , = 1 ρ = 1 n o g σ ρ P ξ η ρ * 2 β ρ , ρ = 1 n o g σ ρ 1 I ξ η ρ * 2 β ρ , ρ = 1 n o g σ ρ 1 N ξ η ρ * 2 β ρ 0 < σ ρ min P ξ ρ , 1 I ξ ρ 2 , 1 N ξ ρ 2 < 1 , 1 ρ = 1 n o g 1 σ ρ P ξ η ρ * 2 β ρ , ρ = 1 n o g 1 σ ρ 1 I ξ η ρ * 2 β ρ , ρ = 1 n o g 1 σ ρ 1 N ξ η ρ * 2 β ρ 0 < 1 σ ρ min P ξ ρ , 1 I ξ ρ 2 , 1 N ξ ρ 2 < 1 , σ 1 ,
where β ρ ρ = 1 , 2 , , n are weight vectors with β ρ 0 and ρ = 1 n β ρ = 1 and the ρ t h biggest weighted value is ε η ( ρ ) * ε η ( ρ ) * = n β ρ ε η ( ρ ) , ρ N consequently by total order ε η ( 1 ) * ε η ( 2 ) * ε η ( n ) * . In addition, associated weights are ω = ( ω 1 , ω 2 , , ω n ) with ω ρ 0 , Σ ρ = 1 n ω ρ = 1 .
Proof. 
This proof issimilar to Theorem 6, so the procedure is eliminated here. □
Remark 3.
If σ 1 = σ 2 = σ 3 = = σ n = σ , that is, 0 < σ min P ξ ρ , 1 I ξ ρ 2 , 1 N ξ ρ 2 < 1 , σ 1 , then the L S F H W A operator reduces to
L S F H W A ε 1 , ε 2 , , ε n = 1 ρ = 1 n o g σ P ξ η ρ * 2 β ρ , ρ = 1 n o g σ 1 I ξ η ρ * 2 β ρ , ρ = 1 n o g σ 1 N ξ η ρ * 2 β ρ .
Properties: The L S F H W A operator satisfies some properties that are listed below:
(1) Idempotency: For any collection of SFNs, ε ρ = P ξ ρ r ˇ γ , I ξ ρ r ˇ γ , N ξ ρ r ˇ γ ρ = 1 , 2 , , n in . Then, if a collection of SFNs ε ρ = P ξ ρ r ˇ γ , I ξ ρ r ˇ γ , N ξ ρ r ˇ γ ρ = 1 , 2 , , n are identical, that is,
L S F H W A ε 1 , ε 2 , , ε n = ε .
(2) Boundedness: For any collection of SFNs, ε ρ = P ξ ρ r ˇ γ , I ξ ρ r ˇ γ , N ξ ρ r ˇ γ ρ = 1 , 2 , , n in . ε ρ = min ρ P ξ ρ , max ρ I ξ ρ , max ρ N ξ ρ and ε ρ + = max ρ P ξ ρ , min ρ I ξ ρ , min ρ N ξ ρ ρ = 1 , 2 , , n in ; therefore,
ε ρ L S F H W A ε 1 , ε 2 , , ε n ε ρ + .
(3) Monotonically: For any collection of SFNs, ε ρ = P ξ ρ r ˇ γ , I ξ ρ r ˇ γ , N ξ ρ r ˇ γ ρ = 1 , 2 , , n in .If ε ρ ε ρ * for ρ = 1 , 2 , , n , then
L S F H W A ε 1 , ε 2 , , ε n L S F H W A ε 1 * , ε 2 * , , ε n * .

5.2. Logarithmic Geometric Operators

Definition 29.
For any collection of SFNs, ε ρ = P ξ ρ r ˇ γ , I ξ ρ r ˇ γ , N ξ ρ r ˇ γ ρ = 1 , 2 , , n in ℜ, with 0 < σ ρ min P ξ ρ , 1 I ξ ρ 2 , 1 N ξ ρ 2 < 1 , σ 1 . The structure of logarithmic spherical weighted geometric (L-SFWG) operator is
L S F W G ε 1 , ε 2 , , ε n = ρ = 1 n o g σ ρ ε ρ β ρ ,
where β ρ ρ = 1 , 2 , , n are weight vectors with β ρ 0 and ρ = 1 n β ρ = 1 .
Theorem 9.
For any collection of SFNs, ε ρ = P ξ ρ r ˇ γ , I ξ ρ r ˇ γ , N ξ ρ r ˇ γ ρ = 1 , 2 , , n in ℜ, with 0 < σ ρ min P ξ ρ , 1 I ξ ρ 2 , 1 N ξ ρ 2 < 1 , σ 1 . Then, by using logarithmic operations and Definition 29, L S F W G is defined as
L S F W G ε 1 , ε 2 , , ε n = ρ = 1 n 1 o g σ ρ P ξ ρ 2 β ρ 1 ρ = 1 n 1 o g σ ρ 1 I ξ ρ 2 2 β ρ 1 ρ = 1 n 1 o g σ ρ 1 N ξ ρ 2 2 β ρ 0 < σ ρ min P ξ ρ , 1 I ξ ρ 2 , 1 N ξ ρ 2 < 1 , ρ = 1 n 1 o g 1 σ ρ P ξ ρ 2 β ρ 1 ρ = 1 n 1 o g 1 σ ρ 1 I ξ ρ 2 2 β ρ 1 ρ = 1 n 1 o g 1 σ ρ 1 N ξ ρ 2 2 β ρ 0 < 1 σ ρ min P ξ ρ , 1 I ξ ρ 2 , 1 N ξ ρ 2 < 1 , σ 1 ,
where β ρ ρ = 1 , 2 , , n are weight vectors with β ρ 0 and ρ = 1 n β ρ = 1 .
Proof. 
Using mathematical induction to prove Theorem 9, we proceed as follows:
(a) For n = 2 , since
o g σ 1 ε 1 β 1 = 1 o g σ 1 P ξ 1 2 β 1 1 1 o g σ 1 1 I ξ 1 2 2 β 1 1 1 o g σ 1 1 N ξ 1 2 2 β 1
and
o g σ 2 ε 2 β 2 = 1 o g σ 2 P ξ 2 2 β 2 1 1 o g σ 2 1 I ξ 2 2 2 β 2 1 1 o g σ 2 1 N ξ 2 2 2 β 2 ,
then
L S F W G ε 1 , ε 2 = o g σ 1 ε 1 β 1 o g σ 2 ε 2 β 2 = 1 o g σ 1 P ξ 1 2 β 1 1 1 o g σ 1 1 I ξ 1 2 2 β 1 1 1 o g σ 1 1 N ξ 1 2 2 β 1 1 o g σ 2 P ξ 2 2 β 2 1 1 o g σ 2 1 I ξ 2 2 2 β 2 1 1 o g σ 2 1 N ξ 2 2 2 β 2 = 1 o g σ 1 P ξ 1 2 β 1 · 1 o g σ 2 P ξ 2 2 β 2 1 1 o g σ 1 1 I ξ 1 2 2 β 1 · 1 o g σ 2 1 I ξ 2 2 2 β 2 1 1 o g σ 1 1 N ξ 1 2 2 β 1 · 1 o g σ 2 1 N ξ 2 2 2 β 2 = ρ = 1 2 1 o g σ ρ P ξ ρ 2 β ρ 1 ρ = 1 2 1 o g σ ρ 1 I ξ ρ 2 2 β ρ 1 ρ = 1 2 1 o g σ ρ 1 N ξ ρ 2 2 β ρ .
(b) Now, Theorem 9 is true for n = k ,
L S F W G ε 1 , ε 2 , , ε k = ρ = 1 k 1 o g σ ρ P ξ ρ 2 β ρ 1 ρ = 1 k 1 o g σ ρ 1 I ξ ρ 2 2 β ρ 1 ρ = 1 k 1 o g σ ρ 1 N ξ ρ 2 2 β ρ .
(c) Now, we prove that Theorem 9 for n = k + 1 , that is,
L S F W G ε 1 , ε 2 , , ε k , ε k + 1 = ρ = 1 k o g σ ρ ε ρ β ρ o g σ k + 1 ε k + 1 β k + 1
L S F W G ε 1 , ε 2 , , ε k , ε k + 1 = ρ = 1 k 1 o g σ ρ P ξ ρ 2 β ρ 1 ρ = 1 k 1 o g σ ρ 1 I ξ ρ 2 2 β ρ 1 ρ = 1 k 1 o g σ ρ 1 N ξ ρ 2 2 β ρ 1 o g σ k + 1 P ξ k + 1 2 β k + 1 1 1 o g σ k + 1 1 I ξ k + 1 2 2 β k + 1 1 1 o g σ k + 1 1 N ξ k + 1 2 2 β k + 1 = ρ = 1 k + 1 1 o g σ ρ ρ ξ ρ 2 β ρ 1 ρ = 1 k + 1 1 o g σ ρ 1 I ξ ρ 2 2 β ρ 1 ρ = 1 k + 1 1 o g σ ρ 1 N ξ ρ 2 2 β ρ .
Thus, Theorem 9 is true for n = z + 1 . Hence, it is satisfied for all n. Therefore,
L S F W G ε 1 , ε 2 , , ε n = ρ = 1 n 1 o g σ ρ P ξ ρ 2 β ρ 1 ρ = 1 n 1 o g σ ρ 1 I ξ ρ 2 2 β ρ 1 ρ = 1 n 1 o g σ ρ 1 N ξ ρ 2 2 β ρ .
In a similar way, if 0 < 1 σ ρ min ρ ξ ρ , 1 I ξ ρ 2 , 1 N ξ ρ 2 < 1 , σ 1 , we can also obtain
L S F W G ε 1 , ε 2 , , ε n = ρ = 1 n 1 o g 1 σ ρ P ξ ρ 2 β ρ 1 ρ = 1 n 1 o g 1 σ ρ 1 I ξ ρ 2 2 β ρ 1 ρ = 1 n 1 o g 1 σ ρ 1 N ξ ρ 2 2 β ρ ,
which completes the proof. □
Remark 4.
If σ 1 = σ 2 = σ 3 = = σ n = σ , that is, 0 < σ min P ξ ρ , 1 I ξ ρ 2 , 1 N ξ ρ 2 < 1 , σ 1 , then the L S F W G operator reduces to
L S F W G ε 1 , ε 2 , , ε n = ρ = 1 n 1 o g σ P ξ ρ 2 β ρ 1 ρ = 1 n 1 o g σ 1 I ξ ρ 2 2 β ρ 1 ρ = 1 n 1 o g σ 1 N ξ ρ 2 2 β ρ .
Properties: The L S F W G operator satisfies some properties that are listed below:
(1) Idempotency: For any collection of SFNs, ε ρ = P ξ ρ r ˇ γ , I ξ ρ r ˇ γ , N ξ ρ r ˇ γ ρ = 1 , 2 , , n in .Then, if a collection of SFNs ε ρ = P ξ ρ r ˇ γ , I ξ ρ r ˇ γ , N ξ ρ r ˇ γ ρ = 1 , 2 , , n are identical, that is,
L S F W G ε 1 , ε 2 , , ε n = ε .
(2) Boundedness: For any collection of SFNs, ε ρ = P ξ ρ r ˇ γ , I ξ ρ r ˇ γ , N ξ ρ r ˇ γ ρ = 1 , 2 , , n in . ε ρ = min ρ ρ ξ ρ , max ρ I ξ ρ , max ρ N ξ ρ and ε ρ + = max ρ P ξ ρ , min ρ I ξ ρ , min ρ N ξ ρ ρ = 1 , 2 , , n in , therefore
ε ρ L S F W G ε 1 , ε 2 , , ε n ε ρ + .
(3) Monotonically: For any collection of SFNs, ε ρ = P ξ ρ r ˇ γ , I ξ ρ r ˇ γ , N ξ ρ r ˇ γ ρ = 1 , 2 , , n in .If ε ρ ε ρ * for ρ = 1 , 2 , , n , then
L S F W G ε 1 , ε 2 , , ε n L S F W G ε 1 * , ε 2 * , , ε n * .
Definition 30.
For any collection of SFNs, ε ρ = P ξ ρ r ˇ γ , I ξ ρ r ˇ γ , N ξ ρ r ˇ γ ρ = 1 , 2 , , n in ℜ, with 0 < σ ρ min P ξ ρ , 1 I ξ ρ 2 , 1 N ξ ρ 2 < 1 , σ 1 . The structure of logarithmic spherical ordered weighted geometric (L-SFOWG) operator is
L S F O W G ε 1 , ε 2 , , ε n = ρ = 1 n o g σ ρ ε η ρ β ρ ,
where β ρ ρ = 1 , 2 , , n are weight vectors with β ρ 0 and ρ = 1 n β ρ = 1 and the ρ t h biggest weighted value is ε η ( ρ ) consequently by total order ε η ( 1 ) ε η ( 2 ) ε η ( n ) .
Theorem 10.
For any collection of SFNs, ε ρ = P ξ ρ r ˇ γ , I ξ ρ r ˇ γ , N ξ ρ r ˇ γ ρ = 1 , 2 , , n in ℜ, with 0 < σ ρ min P ξ ρ , 1 I ξ ρ 2 , 1 N ξ ρ 2 < 1 , σ 1 . Then, by using logarithmic operations and Definition 30, L S F O W G defined as
L S F O W G ε 1 , ε 2 , , ε n = ρ = 1 n 1 o g σ ρ P ξ η ρ 2 β ρ 1 ρ = 1 n 1 o g σ ρ 1 I ξ η ρ 2 2 β ρ 1 ρ = 1 n 1 o g σ ρ 1 N ξ η ρ 2 2 β ρ 0 < σ ρ min P ξ ρ , 1 I ξ ρ 2 , 1 N ξ ρ 2 < 1 , ρ = 1 n 1 o g 1 σ ρ P ξ η ρ 2 β ρ 1 ρ = 1 n 1 o g 1 σ ρ 1 I ξ η ρ 2 2 β ρ 1 ρ = 1 n 1 o g 1 σ ρ 1 N ξ η ρ 2 2 β ρ 0 < 1 σ ρ min P ξ ρ , 1 I ξ ρ 2 , 1 N ξ ρ 2 < 1 , σ 1 ,
where β ρ ρ = 1 , 2 , , n are weight vectors with β ρ 0 and ρ = 1 n β ρ = 1 and the ρ t h biggest weighted value is ε η ( ρ ) consequently by total order ε η ( 1 ) ε η ( 2 ) ε η ( n ) .
Proof. 
This proof is similar to Theorem 9, so the procedure is eliminated here.□
Remark 5.
If σ 1 = σ 2 = σ 3 = = σ n = σ , that is, 0 < σ min P ξ ρ , 1 I ξ ρ 2 , 1 N ξ ρ 2 < 1 , σ 1 , then L S F O W G operator reduces to
L S F O W G ε 1 , ε 2 , , ε n = ρ = 1 n 1 o g σ P ξ η ρ 2 β ρ 1 ρ = 1 n 1 o g σ 1 I ξ η ρ 2 2 β ρ 1 ρ = 1 n 1 o g σ 1 N ξ η ρ 2 2 β ρ .
Properties: The L S F O W G operator satisfies some properties that are listed below:
(1) Idempotency: For any collection of SFNs, ε ρ = P ξ ρ r ˇ γ , I ξ ρ r ˇ γ , N ξ ρ r ˇ γ ρ = 1 , 2 , , n in .Then, if the collection of SFNs ε ρ = P ξ ρ r ˇ γ , I ξ ρ r ˇ γ , N ξ ρ r ˇ γ ρ = 1 , 2 , , n is identical, that is,
L S F O W G ε 1 , ε 2 , , ε n = ε .
(2) Boundedness: For any collection of SFNs, ε ρ = P ξ ρ r ˇ γ , I ξ ρ r ˇ γ , N ξ ρ r ˇ γ ρ = 1 , 2 , , n in . ε ρ = min ρ P ξ ρ , max ρ I ξ ρ , max ρ N ξ ρ and ε ρ + = max ρ P ξ ρ , min ρ I ξ ρ , min ρ N ξ ρ ρ = 1 , 2 , , n in , therefore
ε ρ L S F O W G ε 1 , ε 2 , , ε n ε ρ + .
(3) Monotonically: For any collection of SFNs, ε ρ = P ξ ρ r ˇ γ , I ξ ρ r ˇ γ , N ξ ρ r ˇ γ ρ = 1 , 2 , , n in . If ε ρ ε ρ * for ρ = 1 , 2 , , n , then
L S F O W G ε 1 , ε 2 , , ε n L S F O W G ε 1 * , ε 2 * , , ε n * .
Definition 31.
For any collection of SFNs, ε ρ = P ξ ρ r ˇ γ , I ξ ρ r ˇ γ , N ξ ρ r ˇ γ ρ = 1 , 2 , , n in ℜ, with 0 < σ ρ min P ξ ρ , 1 I ξ ρ 2 , 1 N ξ ρ 2 < 1 , σ 1 . The structure of logarithmic spherical hybrid weighted geometric (L-SFHWG) operator is
L S F H W G ε 1 , ε 2 , , ε n = ρ = 1 n o g σ ρ ε η ρ * β ρ ,
where β ρ ρ = 1 , 2 , , n are weight vectors with β ρ 0 and ρ = 1 n β ρ = 1 and the ρ t h biggest weighted value is ε η ( ρ ) * ε η ( ρ ) * = n β ρ ε η ( ρ ) , ρ N consequently by total order ε η ( 1 ) * ε η ( 2 ) * ε η ( n ) * . In addition, associated weights are ω = ( ω 1 , ω 2 , , ω n ) with ω ρ 0 , Σ ρ = 1 n ω ρ = 1 .
Theorem 11.
For any collection of SFNs, ε ρ = P ξ ρ r ˇ γ , I ξ ρ r ˇ γ , N ξ ρ r ˇ γ ρ = 1 , 2 , , n in ℜ, with 0 < σ ρ min ρ ξ ρ , 1 I ξ ρ 2 , 1 N ξ ρ 2 < 1 , σ 1 . Then, by using logarithmic operations and Definition 31, L S F H W G is defined as
L S F H W G ε 1 , ε 2 , , ε n = ρ = 1 n 1 o g σ ρ P ξ η ρ * 2 β ρ 1 ρ = 1 n 1 o g σ ρ 1 I ξ η ρ * 2 2 β ρ 1 ρ = 1 n 1 o g σ ρ 1 N ξ η ρ * 2 2 β ρ 0 < σ ρ min P ξ ρ , 1 I ξ ρ 2 , 1 N ξ ρ 2 < 1 , ρ = 1 n 1 o g 1 σ ρ P ξ η ρ * 2 β ρ 1 ρ = 1 n 1 o g 1 σ ρ 1 I ξ η ρ * 2 2 β ρ 1 ρ = 1 n 1 o g 1 σ ρ 1 N ξ η ρ * 2 2 β ρ 0 < 1 σ ρ min P ξ ρ , 1 I ξ ρ 2 , 1 N ξ ρ 2 < 1 , σ 1 ,
where β ρ ρ = 1 , 2 , , n are weight vectors with β ρ 0 and ρ = 1 n β ρ = 1 and the ρ t h biggest weighted value is ε η ( ρ ) * ε η ( ρ ) * = n β ρ ε η ( ρ ) , ρ N consequently by total order ε η ( 1 ) * ε η ( 2 ) * ε η ( n ) * . In addition, the associated weights are ω = ( ω 1 , ω 2 , , ω n ) with ω ρ 0 , Σ ρ = 1 n ω ρ = 1 .
Proof. 
This proof is similar to Theorem 9. Thus, the procedure is eliminated here. □
Remark 6.
If σ 1 = σ 2 = σ 3 = = σ n = σ , that is, 0 < σ min P ξ ρ , 1 I ξ ρ 2 , 1 N ξ ρ 2 < 1 , σ 1 ; then, L S F H W G operator reduces to
L S F H W G ε 1 , ε 2 , , ε n = ρ = 1 n 1 o g σ P ξ η ρ * 2 β ρ 1 ρ = 1 n 1 o g σ 1 I ξ η ρ * 2 2 β ρ 1 ρ = 1 n 1 o g σ 1 N ξ η ρ * 2 2 β ρ .
Properties: The L S F H W G operator satisfies some properties that are listed below:
(1) Idempotency: For any collection of SFNs, ε ρ = P ξ ρ r ˇ γ , I ξ ρ r ˇ γ , N ξ ρ r ˇ γ ρ = 1 , 2 , , n in . Then, if collection of SFNs ε ρ = P ξ ρ r ˇ γ , I ξ ρ r ˇ γ , N ξ ρ r ˇ γ ρ = 1 , 2 , , n are identical, that is,
L S F H W G ε 1 , ε 2 , , ε n = ε .
(2) Boundedness: For any collection of SFNs, ε ρ = P ξ ρ r ˇ γ , I ξ ρ r ˇ γ , N ξ ρ r ˇ γ ρ = 1 , 2 , , n in . ε ρ = min ρ P ξ ρ , max ρ I ξ ρ , max ρ N ξ ρ and ε ρ + = max ρ ρ ξ ρ , min ρ I ξ ρ , min ρ N ξ ρ ρ = 1 , 2 , , n in , therefore
ε ρ L S F H W G ε 1 , ε 2 , , ε n ε ρ + .
(3) Monotonically: For any collection of SFNs, ε ρ = P ξ ρ r ˇ γ , I ξ ρ r ˇ γ , N ξ ρ r ˇ γ ρ = 1 , 2 , , n in . If ε ρ ε ρ * for ρ = 1 , 2 , , n , then
L S F H W G ε 1 , ε 2 , , ε n L S F H W G ε 1 * , ε 2 * , , ε n * .

6. Proposed Technique for Solving Decision-Making Problems

In this section, we propose a new approach to decision-making based on the spherical fuzzy set. This approach will use data information provided by the decision problem only and does not need any additional information provided by decision makers, in order to avoid the effect of subjective information influencing the decision results. In the following, we will introduce a spherical fuzzy set decision-making matrix as indicated below.
Step 1:
Let H = ( h 1 , h 2 , , h m ) be a distinct set of m probable alternatives and Y = ( y 1 , y 2 , , y n ) be a finite set of n criteria, where h i indicates the i t h alternatives and y j indicates the j t h criteria. Let D = ( d 1 , d 2 , , d t ) be a finite set of t experts, where d k indicates the kth expert. The expert d k supplies her appraisal of an alternative h i on an attribute y j as a SFNs ( i = 1 , 2 , , m ; j = 1 , 2 , , n ) . The experts’ information is represented by the spherical fuzzy set decision-making matrix D s = E i ρ s m × n . Assume that β ρ ( ρ = 1 , 2 , , m ) is a weight vector of the attribute y j such that 0 β ρ 1 , ρ = 1 n β ρ = 1 and ψ = ( ψ 1 , ψ 2 , , ψ m ) is the weight vector of the decision makers d k such that ψ k 1 , k = 1 n ψ k = 1 .
When we construct the spherical fuzzy decision-making matrices, D s = E i ρ s m × n for decisions. Basically, criteria have two types: one is benefit criteria and the other one is cost criteria. If the spherical fuzzy decision matrices have cost type criteria matrices, D s = E i ρ s m × n can be converted into the normalized spherical fuzzy decision matrices, r ˇ s = r ˇ i ρ s m × n , where r ˇ i p s = E i ρ s , for benefit criteria A p E ¯ i ρ s , for cos t criteria A p , j = 1 , 2 , , n , and E ¯ i ρ s is the complement of E i ρ s . If all the criteria have the same type, then there is no need for normalization.
Taking the decision information from the given matrix r ˇ k and using the S F W A / S F W G operator, the individual total spherical fuzzy preference value r ˇ i k of the alternative h i is derived as follows:
r ˇ i k = L S F W A ( ε i 1 k , ε i 2 k , , ε i n k ) , ( i = 1 , 2 , , m ; k = 1 , 2 , , t ) ,
where β = ( β 1 , β 2 , , β n ) T is the weight vector of the attribute.
Step 2:
In this step, we find the collective spherical information using a spherical fuzzy weighted averaging aggregation operator.
Step 3:
In this step, we find the weights of each of the criteria by using the spherical fuzzy entropy:
γ q = 1 + 1 n ρ = 1 n P i log P i + I i log I i + N i log N i q = 1 n 1 + 1 n ρ = 1 n P i log P i + I i log I i + N i log N i .
Step 4:
In this step, we calculate the aggregated information using all the logarithmic aggregation operators of spherical fuzzy sets.
Step 5:
We find the score value S ˜ ( o g σ ε ρ ) and the accuracy value A ˜ ( o g σ ε ρ ) of the cumulative overall preference value h i ( i = 1 , 2 , , m ) .
Step 6:
By the definition, rank the alternatives h i ( i = 1 , 2 , , m ) and choose the best alternative that has the maximum score value.
The Algorithmic Steps are shown in Figure 4.

6.1. Numerical Example

Assume that there is a committee that selects five applicable emerging technology enterprises H g ( g = 1 , 2 , 3 , 4 , 5 ) , which are given as follows:
(1) Augmented Reality ( H 1 ) ,
(2) Personalized Medicine H 2 ,
(3) Artificial Intelligence H 3 ,
(4) Gene Drive H 4 ,
(5) Quantum Computing H 5
To assess the possible rising technology enterprises according to the four attributes, which are
(1) Advancement D 1 ,
(2) market risk D 2 ,
(3) financial investments D 3 and
(4) progress of science and technology D 4 .
To avoid the conflict between them, the decision makers gives the weight β = ( 0.314 , 0.355 , 0.331 ) T . Construct the spherical fuzzy set decision making matrices as shown in Table 1, Table 2 and Table 3:
Since D 1 , D 3 are benefit type criteria and D 2 , D 4 is cost type criteria, we need to have normalized the decision matrices. Normalized decision matrices are shown in Table 4, Table 5 and Table 6:
Step 2: Use the S F W A operator to aggregate all the individual normalized spherical fuzzy decision matrices. The aggregated spherical fuzzy decision matrix is shown in Table 7.
Step 3: The entropy of each attribute can be calculated by the following equation:
γ q = 1 + 1 n ρ = 1 n P i log P i + I i log I i + N i log N i q = 1 n 1 + 1 n ρ = 1 n P i log P i + I i log I i + N i log N i
and the calculated weights are
W = w 1 = 0.256 , w 2 = 0.248 , w 3 = 0.245 , w 4 = 0.251 .
Step 4: Now, we apply all the proposed logarithmic aggregation operators to collective spherical fuzzy information to find the aggregated information as follows:
Case-1: Using logarithmic spherical fuzzy weighted averaging aggregation operator, we obtained
Entropy 21 00628 i001
Case-2: Using a logarithmic spherical fuzzy ordered weighted averaging aggregation operator, we obtained
Entropy 21 00628 i002
Case-3: Using a logarithmic spherical fuzzy hybrid weighted averaging aggregation operator, we obtained
Entropy 21 00628 i003
Case-4: Using a logarithmic spherical fuzzy weighted geometric aggregation operator, we obtained
Entropy 21 00628 i004
Case-5: Using a logarithmic spherical fuzzy ordered weighted geometric aggregation operator, we obtained
Entropy 21 00628 i005
Case-6: Using a logarithmic spherical fuzzy hybrid weighted geometric aggregation operator, we obtained
Entropy 21 00628 i006
Step 5: We find the score value S ˜ ( o g σ ε ρ ) and the accuracy value A ˜ ( o g σ ε ρ ) of the cumulative overall preference value h i ( i = 1 , 2 , 3 , 4 , 5 ) .
Case-1: Score of aggregated information for the L-SFWA Operator, and we obtained
Entropy 21 00628 i007
Case-2: Score of aggregated information for the L-SFOWA Operator, and we obtained
Entropy 21 00628 i008
Case-3: Score of aggregated information for the L-SFHWA Operator, and we obtained
Entropy 21 00628 i009
Case-4: Score of aggregated information for the L-SFWG Operator, and we obtained
Entropy 21 00628 i010
Case-5: Score of aggregated information for the L-SFOWG Operator, and we obtained
Entropy 21 00628 i011
Case-6: Score of aggregated inf ormation for the L-SFHWG Operator, and we obtained
Entropy 21 00628 i012
Step 6: We find the best (suitable) alternative that has the maximum score value from set of alternatives h i ( i = 1 , 2 , 3 , 4 , 5 ) . Overall preference value and ranking of the alternatives are summarized in Table 8.
The ranking of the alternatives are shown in the Figure 5.

6.2. Sensitivity Analysis and Comparison Discussion

In this section, we give the comparison analysis on how our proposed logarithmic aggregation operators are effective and reliable to aggregate the spherical fuzzy information. Ashraf [40,41] proposed the spherical aggregation operators to aggregate the spherical fuzzy informatio; in this part of our study, we give a comparison between proposed and novel logarithmic spherical fuzzy aggregation operators. We take the spherical fuzzy information from [40] as follows:
Entropy 21 00628 i013
Now, we utilized a logarithmic spherical fuzzy weighted averaging operator to choose the best alternative as follows:
Entropy 21 00628 i014
The ranking of the alternatives using Ashraf [40] information is shown in the Figure 6.
The bast alternative is H 2 . The obtained result utilizing a logarithmic spherical fuzzy weighted averaging operator is the same as results shown by Ashraf [40]. Hence, this study proposed the novel logarithmic aggregation operators to aggregate the spherical fuzzy information. This study gives a more reliable technique to aggregate and to deal with uncertainties in decision-making problems using spherical fuzzy sets. Utilizing proposed spherical fuzzy logarithmic aggregation operators, we find the best alternative from a set of alternatives given by the decision maker. Hence, the proposed MCGDM technique based on spherical fuzzy logarithmic aggregation operators gives another technique to find the best alternative as an application in decision support systems.

7. Conclusions

In this paper, we have revealed a novel logarithmic operation of SFSs with the real base number σ . Additionally, we have analyzed their properties and relationships. In view of these logarithmic operations, we built up the weighted averaging and geometric aggregation operators named L-SFWA, L-SFOWA, L-SFHWA, L-SFWG, L-SFOWG and L-SFHWG. A spherical fuzzy MCDM problem with interactive criteria, an approach based on the proposed operators, was proposed. Finally, this method was applied to MCDM problems. From the decision results displayed in numerical examples, we can find that our created approach can overcome the drawbacks of existing algebraic aggregation operators. In the succeeding work, we shall combine the proposed operator with some novel fuzzy sets, such as type-2 fuzzy sets, neutrosophic sets, and so on. In addition, we may investigate our created approach in the field of different areas, such as personnel evaluation, medical artificial intelligence, energy management and supplier selection evaluation. In addition, we can develop more decision-making approaches like GRA, TODAM, TOPSIS, VIKOR and so on to deal with uncertainties in the form of spherical fuzzy information.

Author Contributions

Conceptualization, S.A. (Shahzaib Ashraf) and S.A. (Saleem Abdullah); methodology, S.A. (Shahzaib Ashraf); software, S.A. (Shahzaib Ashraf); validation, S.A. (Shahzaib Ashraf), S.A. (Saleem Abdullah) and Y.J.; formal analysis, S.A. (Saleem Abdullah) and Y.J.; investigation, S.A. (Shahzaib Ashraf); writing—original draft preparation, S.A.; writing—review and editing, S.A. (Shahzaib Ashraf); visualization, Y.J.; supervision, S.A. (Saleem Abdullah); funding acquisition, Y.J.

Funding

This paper is supported by Major Humanities and Social Sciences Research Projects in Zhejiang Universities (No. 2018QN058), the China Postdoctoral Science Foundation (No. 2018QN058), the Zhejiang Province Natural Science Foundation (No. LY18G010007) and the National Natural Science Foundation of China (No. 71761027).

Acknowledgments

The authors would like to thank the editor in chief, associate editor and the anonymous referees for detailed and valuable comments that helped to improve this manuscript.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Zadeh, L.A. Fuzzy sets. Inf. Control 1965, 8, 338–353. [Google Scholar] [CrossRef] [Green Version]
  2. Bellmann, R.E.; Zadeh, L.A. Decision making in a fuzzy environment. Manag. Sci. 1970, 17, 141–164. [Google Scholar] [CrossRef]
  3. Kandel, A.; Schneider, M. Fuzzy sets and their applications to artificial intelligence. Adv. Comput. 1989, 28, 69–105. [Google Scholar]
  4. Adlassnig, K.P. Fuzzy set theory in medical diagnosis. IEEE Trans. Syst. Man Cybern. 1986, 16, 260–265. [Google Scholar] [CrossRef]
  5. Dubois, D.J. Fuzzy Sets and Systems: Theory and Applications; Academic Press: New York, NY, USA, 1980. [Google Scholar]
  6. Atanassov, K.T. Intuitionistic fuzzy sets. Fuzzy Sets Syst. 1986, 20, 87–96. [Google Scholar] [CrossRef]
  7. Xu, Z. Intuitionistic fuzzy aggregation operators. IEEE Trans. Fuzzy Syst. 2007, 15, 1179–1187. [Google Scholar]
  8. Xu, Z.; Yager, R.R. Some geometric aggregation operators based on intuitionistic fuzzy sets. Int. J. Gen. Syst. 2006, 35, 417–433. [Google Scholar] [CrossRef]
  9. Verma, R. Generalized Bonferroni mean operator for fuzzy number intuitionistic fuzzy sets and its application to multiattribute decision-making. Int. J. Intell. Syst. 2015, 30, 499–519. [Google Scholar] [CrossRef]
  10. Verma, R.; Sharma, B.D. A new measure of inaccuracy with its application to multi-criteria decision-making under intuitionistic fuzzy environment. J. Intell. Fuzzy Syst. 2014, 27, 1811–1824. [Google Scholar]
  11. Deschrijver, G.; Cornelis, C.; Kerre, E.E. On the representation of intuitionistic fuzzy t-norms and t-conorms. IEEE Trans. Fuzzy Syst. 2004, 12, 45–61. [Google Scholar] [CrossRef]
  12. Yager, R.R. Pythagorean fuzzy subsets. In Proceedings of the Joint IFSA World Congress and NAFIPS Annual Meeting, Edmonton, AB, Canada, 24–28 June 2013; pp. 57–61. [Google Scholar]
  13. 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]
  14. Yang, Y.; Ding, H.; Chen, Z.S.; Li, Y.L. A note on extension of TOPSIS to multiple criteria decision-making with Pythagorean fuzzy sets. Int. J. Intell. Syst. 2016, 31, 68–72. [Google Scholar] [CrossRef]
  15. Yager, R.R.; Abbasov, A.M. Pythagorean membership grades, complex numbers, and decision-making. Int. J. Intell. Syst. 2013, 28, 436–452. [Google Scholar] [CrossRef]
  16. Peng, X.; Yang, Y. Some results for Pythagorean fuzzy sets. Int. J. Intell. Syst. 2015, 30, 1133–1160. [Google Scholar] [CrossRef]
  17. Garg, H. A new generalized Pythagorean fuzzy information aggregation using Einstein operations and its application to decision making. Int. J. Intell. Syst. 2016, 31, 886–920. [Google Scholar] [CrossRef]
  18. Gou, X.; Xu, Z.; Ren, P. The properties of continuous Pythagorean fuzzy information. Int. J. Intell. Syst. 2016, 31, 401–424. [Google Scholar] [CrossRef]
  19. Zhang, X. Multicriteria Pythagorean fuzzy decision analysis: A hierarchical QUALIFLEX approach with the closeness index-based ranking methods. Inf. Sci. 2016, 330, 104–124. [Google Scholar] [CrossRef]
  20. Zeng, S.; Chen, J.; Li, X. A hybrid method for Pythagorean fuzzy multiple-criteria decision-making. Int. J. Inf. Technol. Decis. Mak. 2016, 15, 403–422. [Google Scholar] [CrossRef]
  21. Zeng, S. Pythagorean fuzzy multi-attribute group decision-making with probabilistic information and OWA approach. Int. J. Intell. Syst. 2017, 32, 1136–1150. [Google Scholar] [CrossRef]
  22. Yager, R.R. Weighted triangular norms using generating functions. Int. J. Intell. Syst. 2004, 19, 217–231. [Google Scholar] [CrossRef]
  23. 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]
  24. Garg, H. New logarithmic operational laws and their aggregation operators for Pythagorean fuzzy set and their applications. Int. J. Intell. Syst. 2019, 34, 82–106. [Google Scholar] [CrossRef]
  25. Cuong, B.C. Picture Fuzzy Sets—First Results. Part 1, Seminar Neuro-Fuzzy Systems with Applications; Technical Report; Institute of Mathematics: Hanoi, Vietnam, 2013. [Google Scholar]
  26. Son, L.H. Generalized picture distance measure and applications to picture fuzzy clustering. Appl. Soft Comput. 2016, 46, 284–295. [Google Scholar] [CrossRef]
  27. Ashraf, S.; Mahmood, T.; Abdullah, S.; Khan, Q. Different approaches to multi-criteria group decision-making problems for picture fuzzy environment. Bull. Brazil. Math. Soc. New Ser. 2019, 50, 373–397. [Google Scholar] [CrossRef]
  28. Garg, H. Some picture fuzzy aggregation operators and their applications to multicriteria decision-making. Arab. J. Sci. Eng. 2017, 42, 5275–5290. [Google Scholar] [CrossRef]
  29. Phong, P.H.; Cuong, B.C. Multi-criteria Group Decision Making with Picture Linguistic Numbers. Vnu J. Sci. Comput. Sci. Commun. Eng. 2017, 32, 39–53. [Google Scholar]
  30. Wang, C.; Zhou, X.; Tu, H.; Tao, S. Some geometric aggregation operators based on picture fuzzy sets and their application in multiple attribute decision-making. Ital. J. Pure Appl. Math 2017, 37, 477–492. [Google Scholar]
  31. Wei, G. Picture fuzzy hamacher aggregation operators and their application to multiple attribute decision-making. Fund. Inform. 2018, 37, 271–320. [Google Scholar] [CrossRef]
  32. Cuong, B.C. Picture Fuzzy Sets—First Results. Part 2, Seminar Neuro-Fuzzy Systems with Applications; Technical Report; Institute of Mathematics: Hanoi, Vietnam, 2013. [Google Scholar]
  33. Si, A.; Das, S.; Kar, S. An approach to rank picture fuzzy numbers for decision-making problems. Decis. Mak. Appl. Manag. Eng. 2019. [Google Scholar] [CrossRef]
  34. Ashraf, S.; Abdullah, S.; Mahmood, T. Spherical fuzzy Dombi aggregation operators and their application in group decision-making problems. J. Ambient Intell. Hum. Comput. 2019, 1–19. [Google Scholar] [CrossRef]
  35. Ashraf, S.; Mehmood, T.; Abdullah, S.; Khan, Q. Picture Fuzzy Linguistic Sets and Their Applications for Multi-Attribute Group. Nucleus 2018, 55, 66–73. [Google Scholar]
  36. Ashraf, S.; Abdullah, S.; Smarandache, F. Logarithmic Hybrid Aggregation Operators Based on Single Valued Neutrosophic Sets and Their Applications in Decision Support Systems. Symmetry 2019, 11, 364. [Google Scholar] [CrossRef]
  37. Pamucar, D.; Badi, I.; Korica, S.; Obradovic, R. A novel approach for the selection of power generation technology using an linguistic neutrosophic combinative distance-based assessment (CODAS) method: A case study in Libya. Energies 2018, 11, 2489. [Google Scholar]
  38. Liu, F.; Aiwu, G.; Lukovac, V.; Vukic, M. A multicriteria model for the selection of the transport service provider: A single valued neutrosophic DEMATEL multicriteria model. Decis. Mak. Appl. Manag. Eng. 2018, 1, 121–130. [Google Scholar] [CrossRef]
  39. Pamučar, D.; Sremac, S.; Stević, Ž.; Ćirović, G.; Tomić, D. New multi-criteria LNN WASPAS model for evaluating the work of advisors in the transport of hazardous goods. Neural Comput. Appl. 2019, 1–24. [Google Scholar] [CrossRef]
  40. Ashraf, S.; Abdullah, S. Spherical aggregation operators and their application in multiattribute group decision-making. Int. J. Intell. Syst. 2019, 34, 493–523. [Google Scholar] [CrossRef]
  41. Ashraf, S.; Abdullah, S.; Mahmood, T.; Ghani, F.; Mahmood, T. Spherical fuzzy sets and their applications in multi-attribute decision-making problems. J. Intell. Fuzzy Syst. 2019, 36, 2829–2844. [Google Scholar] [CrossRef]
  42. Ashraf, S.; Abdullah, S.; Mahmood, T. GRA method based on spherical linguistic fuzzy Choquet integral environment and its application in multiattribute decisionmaking problems. Math. Sci. 2018, 12, 263–275. [Google Scholar] [CrossRef]
  43. Zeng, S.; Hussain, A.; Mahmood, T.; Irfan Ali, M.; Ashraf, S.; Munir, M. Covering-Based Spherical Fuzzy Rough Set Model Hybrid with TOPSIS for Multi-Attribute Decision-Making. Symmetry 2019, 11, 547. [Google Scholar] [CrossRef]
  44. Rafiq, M.; Ashraf, S.; Abdullah, S.; Mahmood, T.; Muhammad, S. The cosine similarity measures of spherical fuzzy sets and their applications in decision-making. J. Intell. Fuzzy Syst. 2019, 1–15, Preprint. [Google Scholar] [CrossRef]
  45. Khan, A.A.; Ashraf, S.; Abdullah, S.; Qiyas, M.; Luo, J.; Khan, S.U. Pythagorean Fuzzy Dombi Aggregation Operators and Their Application in Decision Support System. Symmetry 2019, 11, 383. [Google Scholar] [CrossRef]
  46. De Luca, A.; Termini, S. A definition of a nonprobabilistic entropy in the setting of fuzzy sets theory. Inf. Control 1972, 20, 301–312. [Google Scholar] [CrossRef] [Green Version]
  47. Szmidt, E.; Kacprzyk, J. Entropy for intuitionistic fuzzy sets. Fuzzy Sets Syst. 2001, 118, 467–477. [Google Scholar] [CrossRef]
  48. Shannon, C.E. A mathematical theory of communication. Bell Syst. Tech. J. 1948, 27, 379–423. [Google Scholar] [CrossRef]
  49. Chen, T.Y.; Li, C.H. Determining objective weights with intuitionistic fuzzy entropy measures: A comparative analysis. Inf. Sci. 2010, 180, 4207–4222. [Google Scholar] [CrossRef]
Figure 1. Basic Norms Operations.
Figure 1. Basic Norms Operations.
Entropy 21 00628 g001
Figure 2. T-norm with its Generators.
Figure 2. T-norm with its Generators.
Entropy 21 00628 g002
Figure 3. T-conorm with its Generators.
Figure 3. T-conorm with its Generators.
Entropy 21 00628 g003
Figure 4. Algorithmic Steps.
Figure 4. Algorithmic Steps.
Entropy 21 00628 g004
Figure 5. Ranking of Alternatives.
Figure 5. Ranking of Alternatives.
Entropy 21 00628 g005
Figure 6. Comparison Ranking.
Figure 6. Comparison Ranking.
Entropy 21 00628 g006
Table 1. Emerging technology Eenterprises F 1 .
Table 1. Emerging technology Eenterprises F 1 .
D 1 D 2 D 3 D 4
H 1 0.84 , 0.34 , 0.40 0.43 , 0.39 , 0.78 0.67 , 0.50 , 0.30 0.31 , 0.21 , 0.71
H 2 0.60 , 0.11 , 0.53 0.23 , 0.35 , 0.59 0.72 , 0.31 , 0.41 0.11 , 0.25 , 0.82
H 3 0.79 , 0.19 , 0.39 0.11 , 0.21 , 0.91 0.71 , 0.41 , 0.13 0.34 , 0.25 , 0.51
H 4 0.63 , 0.51 , 0.13 0.49 , 0.33 , 0.42 0.61 , 0.43 , 0.45 0.49 , 0.37 , 0.59
H 5 0.57 , 0.36 , 0.29 0.50 , 0.15 , 0.60 0.70 , 0.32 , 0.40 0.33 , 0.44 , 0.65 .
Table 2. Emerging technology enterprises F 2 .
Table 2. Emerging technology enterprises F 2 .
D 1 D 2 D 3 D 4
H 1 0.61 , 0.15 , 0.53 0.16 , 0.35 , 0.62 0.61 , 0.35 , 0.47 0.55 , 0.17 , 0.74
H 2 0.66 , 0.11 , 0.51 0.43 , 0.23 , 0.77 0.93 , 0.08 , 0.09 0.02 , 0.06 , 0.99
H 3 0.88 , 0.09 , 0.07 0.05 , 0.06 , 0.89 0.56 , 0.17 , 0.44 0.43 , 0.13 , 0.61
H 4 0.59 , 0.32 , 0.34 0.24 , 0.48 , 0.51 0.68 , 0.53 , 0.39 0.34 , 0.21 , 0.61
H 5 0.71 , 0.31 , 0.24 0.35 , 0.41 , 0.69 0.73 , 0.44 , 0.21 0.22 , 0.49 , 0.74
Table 3. Emerging technology enterprises F 3 .
Table 3. Emerging technology enterprises F 3 .
D 1 D 2 D 3 D 4
H 1 0.85 , 0.25.0.15 0.14 , 0.23 , 0.88 0.78 , 0.38 , 0.18 0.29 , 0.39 , 0.83
H 2 0.94 , 0.04 , 0.07 0.39 , 0.19 , 0.61 0.63 , 0.18 , 0.35 0.48 , 0.49 , 0.56
H 3 0.73 , 0.13 , 0.46 0.19 , 0.39 , 0.88 0.87 , 0.35 , 0.18 0.41 , 0.13 , 0.81
H 4 0.82 , 0.12 , 0.43 0.55 , 0.21 , 0.63 0.53 , 0.33 , 0.47 0.46 , 0.23 , 0.51
H 5 0.61 , 0.33 , 0.29 0.28 , 0.41 , 0.63 0.74 , 0.34 , 0.14 0.37 , 0.32 , 0.65
Table 4. Emerging technology enterprises r ˇ 1 .
Table 4. Emerging technology enterprises r ˇ 1 .
D 1 D 2 D 3 D 4
H 1 0.84 , 0.34 , 0.40 0.78 , 0.39 , 0.43 0.67 , 0.50 , 0.30 0.71 , 0.21 , 0.31
H 2 0.60 , 0.11 , 0.53 0.59 , 0.35 , 0.23 0.72 , 0.31 , 0.41 0.82 , 0.25 , 0.11
H 3 0.79 , 0.19 , 0.39 0.91 , 0.21 , 0.11 0.71 , 0.41 , 0.13 0.51 , 0.25 , 0.34
H 4 0.63 , 0.51 , 0.13 0.42 , 0.33 , 0.49 0.61 , 0.43 , 0.45 0.59 , 0.37 , 0.49
H 5 0.57 , 0.36 , 0.29 0.60 , 0.15 , 0.50 0.70 , 0.32 , 0.40 0.65 , 0.44 , 0.33
Table 5. Emerging technology enterprises r ˇ 2 .
Table 5. Emerging technology enterprises r ˇ 2 .
D 1 D 2 D 3 D 4
H 1 0.61 , 0.15 , 0.53 0.62 , 0.35 , 0.16 0.61 , 0.35 , 0.47 0.74 , 0.17 , 0.55
H 2 0.66 , 0.11 , 0.51 0.77 , 0.23 , 0.43 0.93 , 0.08 , 0.09 0.99 , 0.06 , 0.02
H 3 0.88 , 0.09 , 0.07 0.89 , 0.06 , 0.05 0.56 , 0.17 , 0.44 0.61 , 0.13 , 0.43
H 4 0.59 , 0.32 , 0.34 0.51 , 0.48 , 0.24 0.68 , 0.53 , 0.39 0.61 , 0.21 , 0.34
H 5 0.71 , 0.31 , 0.24 0.69 , 0.41 , 0.35 0.73 , 0.44 , 0.21 0.74 , 0.49 , 0.22
Table 6. Emerging technology enterprises r ˇ 3 .
Table 6. Emerging technology enterprises r ˇ 3 .
D 1 D 2 D 3 D 4
H 1 0.85 , 0.25.0.15 0.88 , 0.23 , 0.14 0.78 , 0.38 , 0.18 0.83 , 0.39 , 0.29
H 2 0.94 , 0.04 , 0.07 0.61 , 0.19 , 0.39 0.63 , 0.18 , 0.35 0.56 , 0.49 , 0.48
H 3 0.73 , 0.13 , 0.46 0.88 , 0.39 , 0.19 0.87 , 0.35 , 0.18 0.81 , 0.13 , 0.41
H 4 0.82 , 0.12 , 0.43 0.63 , 0.21 , 0.55 0.53 , 0.33 , 0.47 0.51 , 0.23 , 0.46
H 5 0.61 , 0.33 , 0.29 0.63 , 0.41 , 0.28 0.74 , 0.34 , 0.14 0.65 , 0.32 , 0.37
Table 7. Collective spherical fuzzy decision information matrix r ˇ .
Table 7. Collective spherical fuzzy decision information matrix r ˇ .
D 1 D 2 D 3 D 4
H 1 0.788 , 0.229 , 0.319 0.785 , 0.315 , 0.208 0.696 , 0.402 , 0.297 0.767 , 0.239 , 0.371
H 2 0.807 , 0.078 , 0.279 0.674 , 0.246 , 0.342 0.818 , 0.160 , 0.227 0.919 , 0.188 , 0.097
H 3 0.814 , 0.128 , 0.223 0.893 , 0.165 , 0.099 0.748 , 0.284 , 0.223 0.677 , 0.159 , 0.393
H 4 0.702 , 0.267 , 0.271 0.533 , 0.324 , 0.395 0.615 , 0.424 , 0.433 0.573 , 0.258 , 0.421
H 5 0.639 , 0.331 , 0.271 0.644 , 0.298 , 0.363 0.724 , 0.365 , 0.224 0.685 , 0.411 , 0.296
Table 8. Overall preference value and ranking of the alternatives for σ = 0.5 > 0 .
Table 8. Overall preference value and ranking of the alternatives for σ = 0.5 > 0 .
S ˜ ( o g σ H 1 ) S ˜ ( o g σ H 2 ) S ˜ ( o g σ H 3 ) S ˜ ( o g σ H 4 ) S ˜ ( o g σ H 5 ) Ranking
L-SFWA0.9853560.9965150.9933450.7371700.920198 H 2 > H 3 > H 1 > H 5 > H 4
L-SFOWA0.9852360.9965580.9934790.7372330.921374 H 2 > H 3 > H 1 > H 5 > H 4
L-SFHWA0.9998170.9999980.9998630.9130670.996664 H 2 > H 3 > H 1 > H 5 > H 4
L-SFWG0.9826450.9885810.9843830.5455590.910307 H 2 > H 3 > H 1 > H 5 > H 4
L-SFOWG0.9824610.9885190.9844770.5445630.911435 H 2 > H 1 > H 3 > H 5 > H 4
L-SFHWG0.9999140.9999970.9996570.916890.999278 H 2 > H 1 > H 3 > H 5 > H 4

Share and Cite

MDPI and ACS Style

Jin, Y.; Ashraf, S.; Abdullah, S. Spherical Fuzzy Logarithmic Aggregation Operators Based on Entropy and Their Application in Decision Support Systems. Entropy 2019, 21, 628. https://doi.org/10.3390/e21070628

AMA Style

Jin Y, Ashraf S, Abdullah S. Spherical Fuzzy Logarithmic Aggregation Operators Based on Entropy and Their Application in Decision Support Systems. Entropy. 2019; 21(7):628. https://doi.org/10.3390/e21070628

Chicago/Turabian Style

Jin, Yun, Shahzaib Ashraf, and Saleem Abdullah. 2019. "Spherical Fuzzy Logarithmic Aggregation Operators Based on Entropy and Their Application in Decision Support Systems" Entropy 21, no. 7: 628. https://doi.org/10.3390/e21070628

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