Next Article in Journal
Design of Sampling Plan Using Regression Estimator under Indeterminacy
Next Article in Special Issue
A Fuzzy Logic Based Intelligent System for Measuring Customer Loyalty and Decision Making
Previous Article in Journal
Cubic Intuitionistic q-Ideals of BCI-Algebras
Previous Article in Special Issue
Fuzzy Attribute Expansion Method for Multiple Attribute Decision-Making with Partial Attribute Values and Weights Unknown and Its Applications
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Another View of Aggregation Operators on Group-Based Generalized Intuitionistic Fuzzy Soft Sets: Multi-Attribute Decision Making Methods

1
School of Mathematics and Information Sciences, Guangzhou University, Guangzhou 510000, China
2
Department of Mathematics, Islamabad Model College for Girls F-6/2, Islamabad 44000, Pakistan
3
Department of Mathematics and Big Data Foshan University, Foshan 528000, and Guangzhou Vocational College of Science and Technology, Guangzhou 510550, China
4
Department of Mathematics, Faculty of Sciences, Çankırı Karatekin University, 18100 Çankırı, Turkey
5
School of Mathematics and Statistics, Hanshan Normal University, Chaozhou 521041, China
*
Authors to whom correspondence should be addressed.
Symmetry 2018, 10(12), 753; https://doi.org/10.3390/sym10120753
Submission received: 5 November 2018 / Revised: 15 November 2018 / Accepted: 26 November 2018 / Published: 14 December 2018
(This article belongs to the Special Issue Fuzzy Techniques for Decision Making 2018)

Abstract

:
In this paper, the existing definition of the group-based generalized intuitionistic fuzzy soft set is clarified and redefined by merging intuitionistic fuzzy soft set over the set of alternatives and a group of intuitionistic fuzzy sets on parameters. In this prospect, two new subsets of the group-based generalized intuitionistic fuzzy soft set are proposed and several operations are contemplated. The two new aggregation operators called generalized group-based weighted averaging and generalized group-based weighted geometric operator are introduced. The related properties of proposed operators are discussed. The recent research is emerging on multi-attribute decision making methods based on soft sets, intuitionistic fuzzy soft sets, and generalized intuitionistic fuzzy soft sets. An algorithm is structured and two case studies of multi-attribute decision makings are considered using proposed operators. Further, we provide the comparison and advantages of the proposed method, which give superiorities over recent major existing methods.

1. Introduction

The concept of fuzzy soft sets was popularized by Maji et al. [1], in the combination of fuzzy sets (Zadeh [2]) and soft sets (Molodtsov [3], Maji [4] and Ali [5]). To analyze the real-life problems, different types of uncertainties have been evaluated with fuzzy soft sets [6] and it has wide range of applications to deal with parameterizations and granularity. By virtue of robustness of fuzzy soft set theory in dealing with uncertain data, many researchers serve to integrate it with inductive learning techniques for better results. In recent past, fuzzy sets, soft sets and fuzzy soft sets are applied to evaluate vagueness in decision makings [7,8,9,10,11,12,13,14,15,16,17,18], algebraic structures [19,20], medical diagnosis [21] and differential equations [22]. Some hybrid models of fuzzy soft sets have been introduced and applied in several fields [23,24].
In 1986, Atanassov proposed the intuitionistic fuzzy set (IFS) [25], which appears as an inclusion of non-compatibility value with fuzzy set [2]. Every value of IFS is referred to a compatibility, a non-compatibility and a hesitancy, which assign it more dynamics in dealing with imprecise information. The initial aggregation instruments [26,27] on IFSs were introduced by Atanassov and Xu, and then applied in a various fields. The geometric [28], and arithmetic aggregation operators [27] have been studied in diverse fields and especially in multi-attribute decision making (MADM) problems in financial management, medical diagnosis, business and engineering designs [29,30,31,32].
IFSs with soft sets, that is, intuitionistic fuzzy soft sets (IFSSs) [33], are very instrumental and more realistic tools for uncertainty than fuzzy soft sets. As the dual-memberships structure of IFS allow marking hesitancy factors, the use of IFSSs in inductive learning techniques accounts for the degree of imprecision by assigning grades of compatibility and non-compatibility. In an inclusive way, several decision-making problems have been considered using IFSSs; some attempts are hybrid with intervals [34], multi-attributes [35] and nonlinear-programming [36]. Garg et al. [37,38] popularized aggregation operators on IFSSs and considered related decision-making methods. Several strategies are used to overcome the challenges of granularity and vagueness. Despite there being the applicability of IFSSs in diverse fields, an opinion of an expert who implicitly exercises his assessments on parameters of an IFSS is needed. On this motivation, Agarwal et al [39], who popularized generalized intuitionistic fuzzy soft set (GIFSS) by including assessment of a moderator on parameters, thus validating and supporting the information. Thus, the accumulation of generalized parameter can reduce possibility of errors which are occur due to imprecise data.
Although the definition of GIFSS in [39] is useful to tackle imprecise data, some difficulties appear in several notions [40,41]. Altogether, the assertions in [39] have been pointed out and a novel definition of GIFSS was established by Feng et al. [42]. They presented several operations and developed related multi-attribute decision-making methods by introducing operators on GIFSSs. On this prospect, a practical application of GIFSS for design concept evaluation was proposed by Hayat et al. [43]. Even though GIFSSs are applicable in diverse fields, sometimes assessments of more than one prospectors are needed in various problems. Thus, we consider the problem of validation of the notion of group-based GIFSS (GGIFSS) [44,45], and introduce a novel definition of GGIFSS, which is the generalization of the notion of GIFSS in [42]. Further, some basic properties are validated and aggregation instruments are proposed to determine the industrial applicability of GGIFSSs. Usually, an accurate aggregation process recommends the nature of MCDM model, which aggregates interdependent information and behaves in a linear manner. The prospect of proposing group-based generalized weighted averaging and geometric operators (hereafter, GBGWA and GBGWG) is to contemplate the information together with the influence of mathematical operations on GGIFSSs. The advantages of the given framework are to contemplate the prospector’s demands or experts’ judgments in an incorporated way such that establishing more operators constitutes the design concept of the evaluation mechanism of GGIFSSs.The results presented in this paper can be studied in several fields, such as electrical engineering, industrial designs, and construction engineering, as estimation of risk factors in risk management is a complex tasks.
The paper is organized as follows. Section 2 introduce basic concepts and notations. Section 3 clarify and redefine the notion of GGIFSS. Section 4 give operations on GGIFSSs, and introduce GBGWA(GBGWG) operators and related properties. Section 5 put forward the aggregation instruments of GGIFSSs into algorithm and discuss two different case studies. We present the comparison and benefits of method in Section 6. Advantages and superiorities are given in Section 7. Section 8 provide the conclusions of the paper.

2. Preliminaries

In this section, we present the basic definitions of fuzzy sets, IFSs, soft sets and GIFSS which would be useful for subsequent discussions. Throughout the paper, X is the universe.
A fuzzy set t ˜ in X is usually identified as its membership function t ˜ : X [ 0 , 1 ] [2], each x X , where the membership grade t ˜ ( x ) indicates the degree to which the element x belongs to the fuzzy set t ˜ . Here, we denote by F ( X ) the collection of all fuzzy sets in X. The subsets intersection, union and complement of fuzzy sets follow from Zadeh [2].
In 1999, Molodtsov [3] introduced the parameterization concept soft set theory, which is different from many traditional tools for dealing with uncertainties, such as fuzzy set theory [2], rough set theory [46], IFSs [25], and hesitant fuzzy sets. The main advantage of soft set theory is that it can be freely applied to characterized parameters, sentence, words and numbers. The natural manner of parameterization of this theory was augmented by the works of Maji et al. [4] and Ali et al. [5], among others.
Definition 1.
[3] Let E be the set of parameters, A E . A pair ( S , A ) is called a soft set over X, where S is a mapping given by S : A P ( X ) . P ( X ) is the set of all power sets of X.
The set of all soft sets over X, with respect to subsets of E, is denoted by SASS E ( X ) .

2.1. Intuitionistic Fuzzy Sets

In the fuzzy set, only one compatibility degree exists, whereas intellectual insight in many cases suggests that non-compatibility degrees should be paired with compatibility degree. Atanassov [25] introduced the concept of IFS, which is an intellectual intuition to judge the uncertainty over the objects. Atanassov gave the definition of the IFS as follows:
Definition 2.
[25] An intuitionistic fuzzy set ( I F S ) in a universe X is defined as
A = { x , t ˜ A ( x ) , f ˜ A ( x ) x X } ,
where the functions t ˜ , f ˜ : X [ 0 , 1 ] define, respectively, a membership function and a non-membership function of the element x X to the set A . Moreover, it is required that
0 t ˜ A ( x ) + f ˜ A ( x ) 1 .
The function π A = 1 ( t ˜ A ( x ) + f ˜ A ( x ) ) is called the degree of hesitancy of x to A . The collection of all IFSs in X is denoted by I F S ( X ) .
Let A , B I F S ( X ) . Then,
A B = { x , max { t ˜ A ( x ) , t ˜ B ( x ) } , min { f ˜ A ( x ) , f ˜ B ( x ) } x X } ,
A B = { x , min { t ˜ A ( x ) , t ˜ B ( x ) } , max { f ˜ A ( x ) , f ˜ B ( x ) } x X } ,
A B t ˜ A ( x ) t ˜ B ( x )   and   f ˜ A ( x ) f ˜ B ( x ) x X .
Deschrijver and Kerre [47] defined that IFSs can be considered as L-fuzzy sets with respect to the complete lattice ( V * , V * ) , where V * = { μ 1 , μ 2 [ 0 , 1 ] 2 μ 1 + μ 2 1 } , and the corresponding partial order V * is defined as μ 1 , μ 2 V * ν 1 , ν 2 ( μ 1 ν 1 ) ( μ 2 ν 2 ) for all μ 1 , μ 2 , ν 1 , ν 2 V * . Any ordered pair μ 1 , μ 2 V * is called an intuitionistic fuzzy value (IFV) or intuitionistic fuzzy number (IFN).
Let V * be the set of IFVs of IFS A , such that t ˜ A , f ˜ A V * . Chen and Tan [48] presented score function, which was updated by Feng et al. [42] as follows:
Definition 3.
[42] Let t ˜ A , f ˜ A V * be an IFV in a universe X. Then, expectation score function is a mapping δ : V * [ 0 , 1 ] , defined as follows:
δ A = t ˜ A f ˜ A + 1 2
where δ A is called the decision value of t ˜ A , f ˜ A in A . In addition, fuzzy set δ A is called the utility fuzzy set derived from the IFS A .
Definition 4.
[28] Let V 1 = t ˜ A , f ˜ A , V 2 = t ˜ A , f ˜ A V * be two IFVs in a universe X. Then we have,
(i)
V 1 V 2 = t ˜ A + t ˜ A t ˜ A t ˜ A , f ˜ A f ˜ A .
(ii)
V 1 V 2 = t ˜ A t ˜ A , f ˜ A + f ˜ A f ˜ A f ˜ A .
(iii)
ϵ V 1 = 1 ( 1 t ˜ A ) ϵ , ( f ˜ A ) ϵ , where ϵ is a positive real number.
More operations and properties of IFVs (or IF numbers (IFNs)) can be seen in [27,28,42]. Let c 1 , c 2 , , c m be the IFVs and ϕ = ( ϕ 1 , ϕ 2 , , ϕ m ) be the correlated weighted normalized vector, then, from Yager [28] and Xu [27], we denote and symbolize the following operators:
IFWA ( c 1 , c 2 , , c m ) = ϕ 1 c 1 ϕ 2 c 3 , , ϕ m c m = 1 i m ( 1 t ˜ c i ) ϕ i , i m f ˜ c i ϕ i ,
IFWG ( c 1 , c 2 , , c m ) = c 1 ϕ 1 c 3 ϕ 3 , , c m ϕ m = i m t ˜ c i ϕ i , 1 i m ( 1 f ˜ c i ) ϕ i .
IFWA and IFWG are the IF weighted averaging and geometric operators, respectively.

2.2. Intuitionistic Fuzzy Soft Sets and Generalized Intuitionistic Fuzzy Soft Sets

In this section, we present some basic notions in the theory of IFSS and GIFSS. The notion of IFSS is given as follows:
Definition 5.
[33] Let ( X , E ) be a soft universe and A E . A pair F = ( S ˜ , A ) is called intuitionistic fuzzy soft set (IFSS) over X, where S ˜ is a mapping defined by S ˜ : A I F S ( X ) .
Formally, S ˜ : A I F S ( X ) is referred to as the approximate function of the IFSS ( S ˜ , A ) . It is easy to see that IFSSs extend both Atanassov’s IFSs and Molodtsov’s soft sets. The set of all IFSSs over X, with respect to subsets of E, is denoted by IFSS E ( X ) . Next, the two new subsets of a IFSS are presented as follows:
Definition 6.
[42] Let F = ( S ˜ , A ) and G = ( T ˜ , B ) be IFSSs over X and A , B E . Then, G is anintuitionistic fuzzy soft F-subsetof F , denoted by G ˜ F F , if
(i)
B A .
(ii)
T ˜ ( a ) S ˜ ( a ) a B .
Definition 7.
[42] Let F = ( S ˜ , A ) and G = ( T ˜ , B ) be IFSSs over X and A , B E . Then, G is an intuitionistic fuzzy soft M-subsetof F , denoted by G ˜ M F , if
(i)
B A .
(ii)
T ˜ ( a ) = S ˜ ( a ) a B .
The related whole IFSS is denoted as X ˜ A ( 1 , 0 ) , where all IFVs are ( 1 , 0 ) , and related null IFSS is denoted as I ˜ A ( 0 , 1 ) , where all IFVs are ( 0 , 1 ) . The other definitions of union, intersection and complements of IFSSs follow [33,42]. It is required in many cases that an extra input of moderator with IFSS could be useful. The definition of GIFSS was given by Agarwal et al. [39] as follows:
Definition 8.
[39] Let ( X , E ) be a soft universe and A E . A generalized intuitionistic fuzzy soft set (GIFSS), F α over the soft universe ( X , E ) is defined as a mapping F α : A I F S S ( X ) × I F , I F S S ( X ) the collection of all intuitionistic fuzzy subsets of X and the generalization parameter, α : A I F = ( t α , f α ) , where I F is an IFS. The GIFSS is of the form F α ( e i ) = ( S ˜ ( e i ) , α ( e i ) ) .
The model of GIFSS is very fruitful in decision making, especially the input of an extra opinion of an expert works incentively. However, in Definition 8, I F S S ( X ) × I F is not a meaningful Cartesian product and generalized parameter α ˜ is not well-defined. A more well-defined and flexible form of GIFSS was defined by Feng et al. [42]. They pointed out several assertions in [39], certified several notions and discussed GIFFSs theoretically. The definition of GIFSS is given as follows:
Definition 9.
[42] Let ( X , E ) be a soft universe and A E . A triple F ˜ = ( S ˜ , A , α ˜ ) is called generalized intuitionistic fuzzy soft set (GIFSS) over X if ( S ˜ , A ) is an IFSS over X and α ˜ is an IFS in A .
This representation of GIFSS can be more significant to handle problems in which uncertain and unclear information are prevalent, and it enhances the accuracy and flexibility of results with opinions of experts as an IFS on the set of parameters. The two different types of subsets of GIFSS and several operations on GIFSSs are specified and categorized in [42]. Hayat et al. [43] presentes another form of GIFSSs and related notions.

3. Group-Based Generalized Intuitionistic Fuzzy Soft Sets

In this section, we clarifiy and reformulate the definition of GGIFSS presented in [44]. First, we recall the definition of GGIFSS that is given in [44];
Definition 10.
[44] A group-based generalized intuitionistic fuzzy soft sets (GGIFSS), F G , over the soft universe ( X , E ) is defined as F G : E I F S ( X ) × I F for all υ E ; we have F G ( υ ) = ( F ( υ ) , G ϱ ( υ ) ) , where F ( υ ) I F S ( X ) and G ϱ ( υ ) I F . Here, G = ( ϱ 1 , ϱ 2 , , ϱ p ) are intuitionistic fuzzy subset of set of the parameter E and G ϱ ( υ ) denotes the opinion of experts on the elements of X in F ( υ ) .
Remark 1.
The above definition of GGIFSS is very effective in many cases, due to its constructive scenario for decision making. However, this definition has some difficulties and dissensions on group of extra input of moderators, as well as on the mapping. Specifically, we identify the following:
(i)
On the point that G ϱ ( υ ) is an IFS, stated in Definition 10, but G ϱ ( υ ) is a group of IFSs. I F S ( X ) × I F is not a meaningful product. In this way, mapping F G : E I F S ( X ) × I F is not well-defined.
(ii)
As the Definition 10 is stated on group of extra opinions, which is an intuitionistic fuzzy subset of set of the parameter E, therefore G ϱ ( υ ) is not defined in a precise way.
(iii)
The extra inputs can be seen as another IFVs based data of alternatives.
To clarify the problems mentioned in Remark 1, we reformulate the notion of GGIFSS as follows:
Definition 11.
Let ( X , E ) be a soft universe and A E . A triple F ˜ g ˜ = ( S ˜ , A , g ˜ ) is called group-based generalized intuitionistic fuzzy soft set (GGIFSS) over X, if ( S ˜ , A ) is an elementary IFSS (EIFSS) over X and g ˜ = { α ˜ 1 , α ˜ 2 , , α ˜ p } where α ˜ 1 , α ˜ 2 , , α ˜ p are the parameterized IFSs (PIFSs) of A .
In other words, g ˜ is a group of PIFSs considered by “p” number of experts/moderators.
Keeping the prospects of decision making in the mind, ( S ˜ , A ) is basic IFS and g ˜ is a group of parameterized intuitionistic fuzzy sets (GPIFSs). The set of all GGIFSS over X obtained on E is denoted by GGIFSS E ( X ) . Further, the set of all GGIFSS over X obtained on subset A E is denoted by GGIFSS A ( X ) .
Example 1.
Let X = { κ 1 , κ 2 , , κ 6 } be the universe set, consisting six cellphones, under consideration and E = { υ 1 , υ 2 , υ 3 , υ 4 } where υ ı ( ı = 1 , 2 , 3 , 4 ) , respectively, stand for “high battery timing”, “low operating cost”, “high quality of voice call” and “stylish look”. Consider a set of attributes B = { υ 1 , υ 3 , υ 4 } E chosen by an observer M , which are anticipated to be most fruitful for judgment of cellphones. For M , the evaluation of alternatives with rating values corresponding each parameters can be defined as EIFSS,
S ˜ ( υ 1 ) = { κ 1 0.6 , 0.4 , κ 2 0 , 0.3 , κ 3 0.2 , 0.2 , κ 4 0 , 1 , κ 5 0.1 , 0.6 , κ 6 0.6 , 0.2 }
S ˜ ( υ 3 ) = { κ 1 0.6 , 0.2 , κ 2 0.7 , 0.3 , κ 3 0.3 , 0.6 , κ 4 0.4 , 0.1 , κ 5 0.4 , 0.2 , κ 6 0.3 , 0.3 }
S ˜ ( υ 4 ) = { κ 1 0.9 , 0 , κ 2 0.5 , 0.1 , κ 3 0.5 , 0.1 , κ 4 0.2 , 0.5 , κ 5 0.5 , 0.2 , κ 6 0.6 , 0.1 }
Consider three moderators d 1 , d 2 , d 3 for assessment of rating value, such that the opinion of each moderator on each parameter of M is analyzed and based on opinions, PIFSs α ˜ d 1 , α ˜ d 2 and α ˜ d 3 are defined on A as
g ˜ = α ˜ d 1 = { ( υ 1 , 0 . 6 , 0 . 2 ) , ( υ 3 , 0 . 3 , 0 . 4 ) , ( υ 4 , 0 . 2 , 0 . 2 ) } , α ˜ d 2 = { ( υ 1 , 0 . 3 , 0 . 4 ) , ( υ 3 , 0 . 2 , 0 . 4 ) , ( υ 4 , 0 . 3 , 0 . 5 ) } , α ˜ d 3 = { ( υ 1 , 0 . 3 , 0 . 4 ) , ( υ 3 , 0 . 5 , 0 . 4 ) , ( υ 4 , 0 . 4 , 0 . 1 ) } .
Then, the GGIFSS is represented in Table 1.
If p = 1 , then F ˜ g ˜ = ( S ˜ , A , g ˜ ) operates as GIFSS. In general, F ˜ g ˜ can be sighted as a common form of generalized parameters with the information on IFSSs.

4. Operations on GGIFSSs and Aggregation Operators

In this section, several new operations on GGIFSSs and their examples are presented. As in Remark 1, it is pointed out that the group of extra assessments of experts in [36] is not defined in a precise way. In this scenario, we define two different subsets of a GGIFSS; for this purpose, a notion on group of generalized parameters of two GGIFSSs is defined as follows:
Definition 12.
Let ( X , E ) be a soft universe and A , B E . Suppose that F ˜ g ˜ = ( S ˜ , A , g ˜ 1 ) and G ˜ g ˜ = ( T ˜ , B , g ˜ 2 ) are two GGIFSSs over X, where A B , g ˜ 1 = { α ˜ d 1 , α ˜ d 2 , , α ˜ d p } and g ˜ 2 = { β ˜ d 1 , β ˜ d 2 , , β ˜ d p } and d 1 , d 2 , , d p are “p” number of senior experts/members. If g ˜ 1 is the group intuitionistic fuzzy subset of g ˜ 2 , then it is denoted and defined by g ˜ 1 g ˜ 2 if and only if t ˜ α ˜ d 1 ( υ i ) t ˜ β ˜ d 1 ( υ i ) , f ˜ α ˜ d 1 ( υ i ) f ˜ β ˜ d 1 ( υ i ) , t ˜ α ˜ d 2 ( υ i ) t ˜ β ˜ d 2 ( υ i ) , f ˜ α ˜ d 2 ( υ i ) f ˜ β ˜ d 2 ( υ i ) , …, t ˜ α ˜ d p ( υ i ) t ˜ β ˜ d p ( υ i ) , f ˜ α ˜ d p ( υ i ) f ˜ β ˜ d p ( υ i ) , ∀ i = 1 , 2 , , m and υ i A .
Based on Definition 12, the following two different kinds of group-based generalized intuitionistic fuzzy soft subsets can be presented.
Definition 13.
Let F ˜ g ˜ = ( S ˜ , A , g ˜ 1 ) and G ˜ g ˜ = ( T ˜ , B , g ˜ 2 ) be two GGIFSSs over X and A , B E . Then, F ˜ g ˜ is a group-based generalized intuitionistic fuzzy soft F-subsetof G ˜ g ˜ , denoted by F ˜ g ˜ ˜ F G ˜ g ˜ , if
(i)
( S ˜ , A ) ˜ F ( T ˜ , B ) .
(ii)
g ˜ 1 g ˜ 2 .
Now, an example is given to clarify group-based generalized intuitionistic fuzzy soft F-subset of a GGIFSS.
Example 2.
Let X = { κ 1 , κ 2 , , κ 6 } be the universe set, consisting six robots under consideration and E = { υ 1 , υ 2 , υ 3 , υ 4 } where υ ı , respectively, stand for “high capacity”, “low degree of freedom”, “high memory capacity” and “high repeatability”. Consider two sets of parameters A = { υ 1 , υ 4 } E , and B = { υ 1 , υ 3 , υ 4 } E chosen by observers M 1 and M 2 , respectively, which are anticipated to be most fruitful for evaluation of robots. For M 1 and M 2 , evaluation of alternatives with their ratting values corresponding each parameters can be defined, respectively, as EIFSSs,
S ˜ ( υ 1 ) = { κ 1 0.6 , 0.3 , κ 2 0 , 0.3 , κ 3 0.2 , 0.2 , κ 4 0 , 1 , κ 5 0.1 , 0.6 , κ 6 0.6 , 0.2 }
S ˜ ( υ 4 ) = { κ 1 0.9 , 0 , κ 2 0.5 , 0.1 , κ 3 0.5 , 0.1 , κ 4 0.3 , 0.5 , κ 5 0.5 , 0.2 , κ 6 0.6 , 0.1 }
and
T ˜ ( υ 1 ) = { κ 1 0.6 , 0.4 , κ 2 0.1 , 0.5 , κ 3 0.3 , 0.2 , κ 4 0 , 1 , κ 5 0.2 , 0.7 , κ 6 0.7 , 0.3 }
T ˜ ( υ 3 ) = { κ 1 0.6 , 0.2 , κ 2 0.7 , 0.3 , κ 3 0.3 , 0.6 , κ 4 0.4 , 0.1 , κ 5 0.4 , 0.2 , κ 6 0.3 , 0.3 }
T ˜ ( υ 4 ) = { κ 1 0.9 , 0.1 , κ 2 0.6 , 0.2 , κ 3 0.5 , 0.2 , κ 4 0.3 , 0.5 , κ 5 0.6 , 0.3 , κ 6 0.6 , 0.1 }
Consider three moderator, d 1 from engineering department, d 2 from production department and d 3 from quality inspection department; their additional opinions for assessments of each observer are analyzed and, based on their opinions, PIFSs on M 1 : α ˜ d 1 , α ˜ d 2 , α ˜ d 3 and IFSs of M 2 : β ˜ d 1 , β ˜ d 2 , β ˜ d 3 are defined.
g ˜ 1 = α ˜ d 1 = { ( υ 1 , 0.3 , 0.2 ) , ( υ 4 , 0.3 , 0.4 ) } , α ˜ d 2 = { ( υ 1 , 0.3 , 0.4 ) , ( υ 4 , 0.2 , 0.4 ) } , α ˜ d 3 = { ( υ 1 , 0.3 , 0.4 ) , ( υ 4 , 0.5 , 0.4 ) } ,
g ˜ 2 = β ˜ d 1 = { ( υ 1 , 0.6 , 0.2 ) , ( υ 3 , 0.4 , 0.5 ) , ( υ 4 , 0.4 , 0.4 ) } , β ˜ d 2 = { ( υ 1 , 0.3 , 0.2 ) , ( υ 3 , 0.4 , 0.2 ) , ( υ 4 , 0.4 , 0.3 ) } , β ˜ d 3 = { ( υ 1 , 0.4 , 0.2 ) , ( υ 3 , 0.4 , 0.4 ) , ( υ 4 , 0.4 , 0.2 ) } .
Then, the GGIFSSs F ˜ g ˜ and G ˜ g ˜ are tabulated in Table 2 and Table 3, respectively.
One can easily check that ( S ˜ , A ) ˜ F ( T ˜ , B ) and g ˜ 1 g ˜ 2 . Thus, F ˜ g ˜ = ( S ˜ , A , g ˜ 1 ) is group-based generalized intuitionistic fuzzy soft F-subset of G ˜ g ˜ = ( T ˜ , B , g ˜ 2 ) .
Definition 14.
Let F ˜ g ˜ = ( S ˜ , A , g ˜ 1 ) and G ˜ g ˜ = ( T ˜ , B , g ˜ 2 ) be two GGIFSSs over X and A , B E . Then, F ˜ g ˜ is a group-based generalized intuitionistic fuzzy soft M-subsetof G ˜ g ˜ , denoted by F ˜ g ˜ ˜ M G ˜ g ˜ , if
(i)
( S ˜ , A ) ˜ M ( T ˜ , B ) .
(ii)
g ˜ 1 g ˜ 2 .
The complement of a GGIFSS is given as follows:
Definition 15.
Let G ˜ g ˜ = ( T ˜ , A , g ˜ ) be GGIFSS over X. The complement of G ˜ g ˜ is defined as the GGIFSS G ˜ g ˜ c = ( T ˜ c , A , g ˜ c ) where ( G ˜ c , A ) is the complement of the EIFSS ( G ˜ , A ) and g ˜ c = { α ˜ c d 1 , α ˜ d 2 c , , α ˜ d p c } is the complement of g ˜ = { α ˜ d 1 , α ˜ d 2 , , α ˜ d p } .
Now, an example is given to clarify complement of a GGIFSS.
Example 3.
Consider GGIFSS G ˜ g ˜ = ( T ˜ , A , g ˜ ) defined in Example 1. Then, complement of G ˜ g ˜ is defined in Table 4.
Next, the definitions of extended union, extended intersection, restricted union and restricted intersection are provided below.
Definition 16.
Let F ˜ g ˜ = ( S ˜ , A , g ˜ 1 ) and G ˜ g ˜ = ( T ˜ , B , g ˜ 2 ) be two GGIFSSs over X, A , B E , C = A B and g ˜ 1 = { α ˜ d 1 , α ˜ d 2 , , α ˜ d p } , g ˜ 2 = { β ˜ d 1 , β ˜ d 2 , , β ˜ d p } . The extended union of F ˜ g ˜ and G ˜ g ˜ is defined as the GGIFSS
( H ˜ , C , g ˜ ) = ( S ˜ , A , g ˜ 1 ) ˜ E ( T ˜ , B , g ˜ 2 )
such that
(i)
( H ˜ , C ) = ( S ˜ , A ) E ( T ˜ , B ) .
(ii)
For each moderator d k , γ ˜ d k ( k = 1 , 2 , , p ) can be defined υ C ,
t ˜ γ ˜ d k ( υ ) = t ˜ α ˜ d k ( υ ) , if υ A \ B , t ˜ β ˜ d k ( υ ) , if υ B \ A , max { t ˜ α ˜ d k ( υ ) , t ˜ β ˜ d k ( υ ) } , if υ A B ;
and
f ˜ γ ˜ d k ( υ ) = f ˜ α ˜ d k ( υ ) , if υ A \ B , f ˜ β ˜ d k ( υ ) , if υ B \ A , min { f ˜ α ˜ d k ( υ ) , f ˜ β ˜ d k ( υ ) } , if υ A B .
Definition 17.
Let F ˜ g ˜ = ( S ˜ , A , g ˜ 1 ) and G ˜ g ˜ = ( T ˜ , B , g ˜ 2 ) be two GGIFSSs over X, where A , B E , C = A B and g ˜ 1 = { α ˜ d 1 , α ˜ d 2 , , α ˜ d p } , g ˜ 2 = { β ˜ d 1 , β ˜ d 2 , , β ˜ d p } . The extended intersection of F ˜ g ˜ and G ˜ g ˜ is defined as the GGIFSS
( R ˜ , C , g ˜ ) = ( S ˜ , A , g ˜ 1 ) ˜ E ( T ˜ , B , g ˜ 2 )
such that
(i)
( R ˜ , C ) = ( S ˜ , A ) E ( T ˜ , B ) .
(ii)
For each moderator d k , γ ˜ d k ( k = 1 , 2 , , p ) can be defined υ A B ,
t ˜ γ ˜ d k ( υ ) = t ˜ α ˜ d k ( υ ) , if υ A \ B , t ˜ β ˜ d k ( υ ) , if υ B \ A , min { t ˜ α ˜ d k ( υ ) , t ˜ β ˜ d k ( υ ) } , if υ A B ;
and
f ˜ γ ˜ d k ( υ ) = f ˜ α ˜ d k ( υ ) , if υ A \ B , f ˜ β ˜ d k ( υ ) , if υ B \ A , max { f ˜ α ˜ d k ( υ ) , f ˜ β ˜ d k ( υ ) } , if υ A B .
Definition 18.
Let F ˜ g ˜ = ( S ˜ , A , g ˜ 1 ) and G ˜ g ˜ = ( T ˜ , B , g ˜ 2 ) be two GGIFSSs over X, where A , B E , C = A B and g ˜ 1 = { α ˜ d 1 , α ˜ d 2 , , α ˜ d p } , g ˜ 2 = { β ˜ d 1 , β ˜ d 2 , , β ˜ d p } . The restricted union of F ˜ g ˜ and G ˜ g ˜ is defined as the GGIFSS
( R ˜ , C , g ) = ( S ˜ , A , g ˜ 1 ) ˜ r ( T ˜ , B , g ˜ 2 )
such that
(i)
( R ˜ , C ) = ( S ˜ , A ) r ( T ˜ , B ) ;
(ii)
For each moderator d k , γ ˜ d k ( k = 1 , 2 , , p ) can be defined υ C ,
t ˜ γ ˜ d k ( υ ) = max { t ˜ α ˜ d k ( υ ) , t ˜ β ˜ d k ( υ ) } , for all υ A B ;
and
f ˜ γ ˜ d k ( υ ) = min { f ˜ α ˜ d k ( υ ) , f ˜ β ˜ d k ( υ ) } , for all υ A B .
Definition 19.
Let F ˜ g ˜ = ( S ˜ , A , g ˜ 1 ) and G ˜ g ˜ = ( T ˜ , B , g ˜ 2 ) be two GGIFSSs over X, where A , B E , C = A B and g ˜ 1 = { α ˜ d 1 , α ˜ d 2 , , α ˜ d p } , g ˜ 2 = { β ˜ d 1 , β ˜ d 2 , , β ˜ d p } . The restricted intersection of F ˜ g ˜ and G ˜ g ˜ is defined as the GGIFSS
( R ˜ , C , g ) = ( S ˜ , A , g ˜ 1 ) ˜ r ( T ˜ , B , g ˜ 2 )
such that
(i)
( R ˜ , C ) = ( S ˜ , A ) r ( T ˜ , B ) .
(ii)
For each moderator d k , γ ˜ d k ( k = 1 , 2 , , p ) can be defined υ C ,
t ˜ γ ˜ d k ( υ ) = min { t ˜ α ˜ d k ( υ ) , t ˜ β ˜ d k ( υ ) } , for all υ A B ;
and
f ˜ γ ˜ d k ( υ ) = max { f ˜ α ˜ d k ( υ ) , f ˜ β ˜ d k ( υ ) } , for all υ A B .
The definition of null GGIFSS and whole GGIFSS are specified below.
Definition 20.
Let G ˜ g ˜ = ( S ˜ , A , g ˜ ) be a GGIFSS over X, where A E , and g ˜ = { α ˜ d 1 , α ˜ d 2 , , α ˜ d p } . Then, G ˜ g ˜ is called the group-based generalized relative null intuitionistic fuzzy soft set, denoted by N ˜ g ˜ A , if
(1)
( S ˜ , A ) = I ˜ A ( 0 , 1 ) .
(2)
For each moderator d k , t ˜ α ˜ d k ( υ ) = 0 and f ˜ α ˜ d k ( υ ) = 1 for all υ A .
Definition 21.
Let G ˜ g ˜ = ( S ˜ , A , g ˜ ) be a GGIFSS over X, where A E and g ˜ = { α ˜ d 1 , α ˜ d 2 , , α ˜ d p } . Then, G ˜ g ˜ is called the group-based generalized relative whole intuitionistic fuzzy soft set, denoted by W ˜ g ˜ A , if
(1)
( S ˜ , A ) = X ˜ A ( 1 , 0 ) .
(2)
For each moderator d k , t ˜ α ˜ d k ( υ ) = 1 and f ˜ α ˜ d k ( υ ) = 0 for all υ A .
Proposition 1.
Let G ˜ g ˜ = ( S ˜ , A , g ˜ ) be a GGIFSS over X, where A E and g ˜ = { α ˜ d 1 , α ˜ d 2 , , α ˜ d p } . Then,
(i)
G ˜ g ˜ ˜ E G ˜ g ˜ = G ˜ g ˜ ˜ r G ˜ g ˜ = G ˜ g ˜ .
(ii)
G ˜ g ˜ ˜ E G ˜ g ˜ = G ˜ g ˜ ˜ r G ˜ g ˜ = G ˜ g ˜ .
(iii)
G ˜ g ˜ ˜ E N ˜ g ˜ A = G ˜ g ˜ ˜ r N ˜ g ˜ A = G ˜ g ˜ .
(iv)
G ˜ g ˜ ˜ E N ˜ g ˜ A = G ˜ g ˜ ˜ r N ˜ g ˜ A = N ˜ g ˜ A .
(v)
G ˜ g ˜ ˜ E W ˜ g ˜ A = G ˜ ˜ r W ˜ A = W ˜ A .
(vi)
G ˜ g ˜ ˜ E W ˜ g ˜ A = G ˜ g ˜ ˜ r W ˜ g ˜ A = G ˜ g ˜ .
Now, we introduce group-based generalized weighted averaging (GBGWA) and group-based generalized weighted geometric (GBGWG) operators on GGIFSSs. On these operators, we contemplate and discussed some properties as well. The definition of GBGWA operator is specified below.
Definition 22.
GBGWA; Let F ˜ g ˜ = ( S ˜ , A , g ˜ ) be a GGIFSS over X, where g ˜ = { α ˜ d 1 , α ˜ d 2 , , α ˜ d p } be the group of PIFSs. Assume that w = ( w 1 , w 2 , , w m ) T is the normalized weight vector for A , such that w i > 0 and i = 1 m w i = 1 . Let I F V ˜ ( κ j ) = { c j 1 , c j 2 , , c j m } ( j = 1 to n ) be the set of IFVs in EIFSS ( S ˜ , A ) for all κ j X . For each senior moderator/prospector, α ˜ d k ( υ ) = { t ˜ α ˜ d k ( υ ) , f ˜ α ˜ d k ( υ ) υ A } ( k = 1 to p ) be the PIFS, it can be represented as IF k = { a k 1 , a k 2 , , a k m } ( k = 1 to p ) and ϖ = ( ϖ 1 , ϖ 2 , , ϖ p ) T is the set of weights for moderators, such that ϖ k > 0 and k = 1 p ϖ k = 1 . Define GBGWA: Γ s m Γ s , IFWA: Γ m Γ , where
GBGWA ( c j 1 , c j 2 , , c j m ) = IFWA k ( IFWA i ( a 11 , a 12 , , a 1 m ) IFWA i ( c j 1 , c j 2 , , c j m ) ) , ( IFWA i ( a 21 , a 22 , , a 2 m ) IFWA i ( c j 1 , c j 2 , , c j m ) ) , , ( IFWA i ( a p 1 , a p 2 , , a p m ) IFWA i ( c j 1 , c j 2 , , c j m ) )
where GBGWA is known as GGIFSS weighted averaging operator, then the set of all GBGWAs is denoted L = { 1 , 2 , , n } . In addition, IFWA k and IFWA i are IFWA operators on set of moderators/prospectors and set of parameters, respectively. Note that Γ s m and Γ are families of GGIFSS and IFSs, respectively.
Lemma 1.
Let F ˜ g ˜ = ( S ˜ , A , g ˜ ) be a GGIFSS over X, where g ˜ = { α ˜ d 1 , α ˜ d 2 , , α ˜ d p } be the group of IFSs. If p = 1 , then F ˜ g ˜ is a GIFSS and GBGWA is given as follows:
GBGWA ( c j 1 , c j 2 , , c j m ) = IFWA i ( a 11 , a 12 , , a 1 m ) IFWA i ( c j 1 , c j 2 , , c j m ) .
Theorem 1.
If c j i = t ˜ j i , f ˜ j i and a k i = t ˜ k i , f ˜ k i ( i = 1 , 2 , , m , j = 1 , 2 , , n , k = 1 , 2 , , p ) , be the IFVs, then the accumulated value by GBGWA operator is given by GBGWA ( c j 1 , c j 2 , , c j m ) = 1 k = 1 p ( 1 ( 1 i = 1 m ( 1 t ˜ a k i ) ) · ( 1 i = 1 m ( 1 t ˜ c j i ) ) ) , k = 1 p ( 1 ( 1 i = 1 m f ˜ a k i ) ( 1 i = 1 m f ˜ c j i ) ) .
Proof. 
Let p = 1 and m = 2 . Firstly, we apply mathematical induction on m, we have GBGWA ( c j 1 , c j 2 ) = IFWA k ( IFWA ( a 11 , a 12 ) IFWA ( c j 1 , c j 2 ) ) = ( IFWA ( a 11 , a 12 ) IFWA ( c j 1 , c j 2 ) ) = 1 ( 1 t ˜ a 11 ) w 1 · ( 1 t ˜ a 12 ) w 2 , f ˜ a 11 w 1 · f ˜ a 12 w 2 1 ( 1 t ˜ c j 1 ) w 1 · ( 1 t ˜ c j 2 ) w 2 , f ˜ c j 1 w 1 · f ˜ c j 2 w 2
= ( 1 ( 1 t ˜ a 11 ) w 1 · ( 1 t ˜ a 12 ) w 2 ) · ( 1 ( 1 t ˜ c j 1 ) w 1 · ( 1 t ˜ c j 2 ) w 2 ) , f ˜ a 11 w 1 · f ˜ a 12 w 2 + f ˜ c j 1 w 1 . f ˜ c j 2 w 2 f ˜ a 11 w 1 . f ˜ a 12 w 2 . f ˜ c j 1 w 1 · f ˜ c j 2 w 2 = ( 1 i = 1 2 ( 1 t ˜ a 1 i ) w i ) · ( 1 i = 1 2 ( 1 t ˜ c j i ) w i ) , i = 1 2 f ˜ a 1 i w i + i = 1 2 f ˜ c j i w i i = 1 2 f ˜ a 1 i w i . i = 1 2 f ˜ c j i w i .
Thus, theorem is true for m = 2 ; assuming that the result is true for m = s , that is, GBGWA ( c j 1 , c j 2 , , c j s ) = ( 1 i = 1 s ( 1 t ˜ a 1 i ) · ( 1 i = 1 s ( 1 t ˜ c j i ) ) ) , 1 ( ( 1 i = 1 s f ˜ a 1 i ) ( 1 i = 1 s f ˜ c j i ) ) . then, for m = s + 1 , GBGWA ( c j 1 , c j 2 , , c j ( s + 1 ) ) = ( 1 i = 1 s + 1 ( 1 t ˜ a 1 i ) · ( 1 i = 1 s + 1 ( 1 t ˜ c j i ) ) ) , 1 ( ( 1 i = 1 s + 1 f ˜ a 1 i ) ( 1 i = 1 s + 1 f ˜ c j i ) ) . Thus, by mathematical induction, Theorem 1 holds for all positive integer m. Similarly, we can prove this theorem for k = 2 , 3 , , p . □
Example 4.
Consider Example 1, where I F V ˜ ( κ 1 ) = { c 11 , c 12 , c 13 } = { 0.6 , 0.4 , 0.6 , 0.2 , 0.9 , 0 } is a family of IFVs in second row of Table 1. The three IFSs of moderator’s assessments are
IF 1 = { a 11 , a 12 , a 13 } = { 0.6 , 0.2 , 0.3 , 0.4 , 0.2 , 0.2 }
IF 2 = { a 21 , a 22 , a 23 } = { 0.3 , 0.4 , 0.2 , 0.4 , 0.3 , 0.5 }
IF 3 = { a 31 , a 32 , a 33 } = { 0.3 , 0.4 , 0.5 , 0.4 , 0.4 , 0.1 } ,
respectively. Let w = { w 1 / 0.29 , w 2 / 0.35 , w 3 / 0.36 } be the weighted vector over E and ϖ = { ϖ 1 / 0.25 , ϖ 2 / 0.40 , ϖ 3 / 0.35 } be the weighted vector for three senior experts. Now, the GBGWA is given below.
1 = GBGWA ( c 11 , c 12 , c 13 ) = IFWA k ( IFWA i ( a 11 , a 12 , a 13 ) IFWA i ( c 11 , c 12 , c 13 ) ) , ( IFWA i ( a 21 , a 22 , a 23 ) IFWA i ( c 11 , c 12 , c 13 ) ) , ( IFWA i ( a 31 , a 32 , a 33 ) IFWA i ( c 11 , c 12 , c 13 ) )
Next, calculate, IFWA i ( c 11 , c 12 , c 13 ) = IFWA i ( 0.6 , 0.4 , 0.6 , 0.2 , 0.9 , 0.0 ) = 0.7572 , 0.0000 , IFWA i ( a 11 , a 12 , a 13 ) = IFWA i ( 0.6 , 0.2 , 0.3 , 0.4 , 0.2 , 0.2 ) = 0.3755 , 0.2549 , IFWA i ( a 21 , a 22 , a 23 ) = IFWA i ( 0.3 , 0.4 , 0.2 , 0.4 , 0.3 , 0.5 ) = 0.2665 , 0.4334 , IFWA i ( a 31 , a 32 , a 33 ) = IFWA i ( 0.3 , 0.4 , 0.5 , 0.4 , 0.4 , 0.1 ) = 0.4113 , 0.2428 .
Then,
1 = GBGWA ( 0.6 , 0.4 , 0.6 , 0.2 , 0.9 , 0 ) = IFWA k ( 0.2843 , 0.2549 , 0.2018 , 0.4334 , 0.3114 , 0.2428 ) = 0.7441 , 0.3099 .
Similarly, we can calculate 2 , 3 , 4 , 5 and 6 .
Property 23.
Idempotency;If c j i = c j and a k i = a k = a for all i, then GBGWA ( c j 1 , c j 2 , , c j m ) = ( a c j ) .
Proof. 
Since c j i = c j j , that is, t ˜ c j i = t ˜ c j and f ˜ c j i = f ˜ c j . Therefore, for p = 2 , a 1 i = a and a 2 i = a , this implies that t ˜ a 1 i = t ˜ a , f ˜ a 1 i = f ˜ a and t ˜ a 2 i = t ˜ a , f ˜ a 2 i = f ˜ a . Then,
GBGWA ( c j 1 , c j 2 , , c j m ) = IFWA k ( 1 i = 1 m ( 1 t ˜ a 1 i ) w i ) · ( 1 i = 1 m ( 1 t ˜ c j i ) w i ) , i = 1 m f ˜ a 1 i w i + i = 1 m f ˜ c j i w i i = 1 m f ˜ a 1 i w i . i = 1 m f ˜ c j i w i , ( 1 i = 1 m ( 1 t ˜ a 2 i ) w i ) · ( 1 i = 1 m ( 1 t ˜ c j i ) w i ) , i = 1 m f ˜ a 2 i w i + i = 1 m f ˜ c j i w i i = 1 m f ˜ a 2 i w i . i = 1 m f ˜ c j i w i
= IFWA k ( 1 ( 1 t ˜ a ) i = 1 m w i ) · ( 1 ( 1 t ˜ c j ) i = 1 m w i ) , f ˜ a i = 1 m w i + f ˜ c j i = 1 m w i f ˜ a i = 1 m w i . f ˜ c j i = 1 m w i , ( 1 ( 1 t ˜ a ) i = 1 m w i ) · ( 1 ( 1 t ˜ c j ) i = 1 m w i ) , f ˜ a i = 1 m w i + f ˜ c j i = 1 m w i f ˜ a i = 1 m w i . f ˜ c j i = 1 m w i
= IFWA k ( 1 ( 1 t ˜ a ) ) · ( 1 ( 1 t ˜ c j ) ) , f ˜ a + f ˜ c j f ˜ a . f ˜ c j , ( 1 ( 1 t ˜ a ) ) · ( 1 ( 1 t ˜ c j ) ) , f ˜ a + f ˜ c j f ˜ a . f ˜ c j
= IFWA k t ˜ a . t ˜ c j , f ˜ a + f ˜ c j f ˜ a . f ˜ c j , t ˜ a . t ˜ c j , f ˜ a + f ˜ c j f ˜ a . f ˜ c j
= 1 ( 1 t ˜ a . t ˜ c j ) ϖ 1 · ( 1 t ˜ a . t ˜ c j ) ϖ 2 , ( f ˜ a + f ˜ c j f ˜ a . f ˜ c j ) ϖ 1 . ( f ˜ a + f ˜ c j f ˜ a . f ˜ c j ) ϖ 2
= 1 ( 1 t ˜ a . t ˜ c j ) k = 1 2 ϖ k , ( f ˜ a + f ˜ c j f ˜ a . f ˜ c j ) k = 1 2 ϖ k
= 1 ( 1 t ˜ a . t ˜ c j ) , ( f ˜ a + f ˜ c j f ˜ a . f ˜ c j )
= a c j
Now, using operation laws between IFVs, assume that results hold for p = p , that is,
GBGWA ( c j 1 , c j 2 , , c j m ) = ( a c j ) .
Then, for p = p + 1 ,
GBGWA ( c j 1 , c j 2 , , c j m ) = ( a c j ) .
Thus, by mathematical induction, Theorem 23 holds for all positive integer p. □
Property 24.
Boundedness;If c j + = t ˜ ( a k i c j i ) max , f ˜ ( a k i c j i ) min and c j = t ˜ ( a k i c j i ) min , f ˜ ( a k i c j i ) max , then c j GBGWA ( c j i , c j 2 , , c j m ) c j + .
Proof. 
Let c j i = t ˜ c j i , f ˜ c j i and a k i = t ˜ a k i , f ˜ a k i be IFVs, for all i , j , k . Then, a k i c j i = t ˜ a k i · t ˜ c j i , 1 ( 1 f ˜ a k i ) ( 1 f ˜ c j i ) and denote t ˜ ( a k i c j i ) max = t ˜ a k i max · t ˜ c j i max , t ˜ ( a k i c j i ) min = t ˜ a k i min · t ˜ c j i min , f ˜ ( a k i c j i ) max = 1 ( 1 f ˜ a k i max ) · ( 1 f ˜ c j i max ) , f ˜ ( a k i c j i ) min = 1 ( 1 f ˜ a k i min ) · ( 1 f ˜ c j i min ) .
Now, t ˜ c j i min t ˜ c j i t ˜ c j i max ( 1 t ˜ c j i max ) ( 1 t ˜ c j i ) ( 1 t ˜ c j i min ) ( 1 t ˜ c j i max ) i = 1 m w i i = 1 m ( 1 t ˜ c j i ) ( 1 t ˜ c j i min ) i = 1 m w i 1 ( 1 t ˜ c j i min ) 1 i = 1 m ( 1 t ˜ c j i ) 1 ( 1 t ˜ c j i max ) t ˜ c j i min 1 i = 1 m ( 1 t ˜ c j i ) t ˜ c j i max . Similarly, we obtain t ˜ a k i min 1 i = 1 m ( 1 t ˜ a k i ) t ˜ a k i max .
Therefore, t ˜ a k i min · t ˜ c j i min ( 1 i = 1 m ( 1 t ˜ a k i ) ) ( 1 i = 1 m ( 1 t ˜ c j i ) ) t ˜ a k i max · t ˜ c j i max t ˜ ( a k i c j i ) min ( 1 i = 1 m ( 1 t ˜ a k i ) ) ( 1 i = 1 m ( 1 t ˜ c j i ) ) t ˜ ( a k i c j i ) max 1 t ˜ ( a k i c j i ) max 1 ( 1 i = 1 m ( 1 t ˜ a k i ) ) · ( 1 i = 1 m ( 1 t ˜ c j i ) ) 1 t ˜ ( a k i c j i ) min ( 1 t ˜ ( a k i c j i ) max ) k = 1 p ϖ k k = 1 p ( 1 ( 1 i = 1 m ( 1 t ˜ a k i ) ) · ( 1 i = 1 m ( 1 t ˜ c j i ) ) ) ( 1 t ˜ ( a k i c j i ) min ) k = 1 p ϖ k 1 ( 1 t ˜ ( a k i c j i ) min ) 1 k = 1 p ( 1 ( 1 i = 1 m ( 1 t ˜ a k i ) ) · ( 1 i = 1 m ( 1 t ˜ c j i ) ) ) 1 ( 1 t ˜ ( a k i c j i ) max )
t ˜ ( a k i c j i ) min 1 k = 1 p ( 1 ( ( 1 i = 1 m ( 1 t ˜ a k i ) ) · ( 1 i = 1 m ( 1 t ˜ c j i ) ) ) ) t ˜ ( a k i c j i ) max
In addition, f ˜ c j i min f ˜ c j i f ˜ c j i max f ˜ c j i min i = 1 m f ˜ c j i f ˜ c j i max 1 f ˜ c j i max 1 i = 1 m f ˜ c j i 1 f ˜ c j i min . Similarly, we obtain 1 f ˜ a k i max 1 i = 1 m f ˜ a k i 1 f ˜ a k i min .
Therefore, 1 ( 1 f ˜ a k i min ) ( 1 f ˜ c j i min ) 1 ( 1 i = 1 m f ˜ a k i ) ( 1 i = 1 m f ˜ c j i ) 1 ( 1 f ˜ a k i max ) ( 1 f ˜ c j i max ) f ˜ ( a k i c j i ) min 1 ( 1 i = 1 m f ˜ a k i ) ( 1 i = 1 m f ˜ c j i ) f ˜ ( a k i c j i ) max ( f ˜ ( a k i c j i ) min ) k = 1 p ϖ k k = 1 p ( 1 ( 1 i = 1 m f ˜ a k i ) ( 1 i = 1 m f ˜ c j i ) ) ( f ˜ ( a k i c j i ) max ) k = 1 p ϖ k
f ˜ ( a k i c j i ) min k = 1 p ( 1 ( 1 i = 1 m f ˜ a k i ) ( 1 i = 1 m f ˜ c j i ) ) f ˜ ( a k i c j i ) max .
If GBGWA ( c j 1 , c j 2 , , c j m ) = t ˜ ρ , f ˜ ρ , therefore from Equations (6) and (7), we have t ˜ ( a k i c j i ) min t ˜ ρ t ˜ ( a k i c j i ) max and f ˜ ( a k i c j i ) min f ˜ ρ f ˜ ( a k i c j i ) max . Further using score function δ ( GBGWA ( c j 1 , c j 2 , , c j m ) ) = t ˜ ρ f ˜ ρ t ˜ ( a k i c j i ) max t ˜ ( a k i c j i ) min = δ ( c j + ) , δ ( GBGWA ( c j 1 , c j 2 , , c j m ) = t ˜ ρ f ˜ ρ t ˜ ( a k i c j i ) min t ˜ ( a k i c j i ) max = δ ( c j ) . Hence, by order relation c j GBGWA ( c j 1 , c j 2 , , c j m ) c j + . □
Property 25.
Monotonicity;If c j i and c j i are two IFVs such that c j i c j i , then GBGWA ( c j 1 , c j 2 , , c j m ) GBGWA ( c j 1 , c j 2 , , c j m ) .
Proof. 
It follows from Theorem 24, thus it is omitted from here. □
Proposition 2.
Let G ˜ g ˜ = ( S ˜ , A , g ˜ ) be a GGIFSS over X. Then,
(i)
If the assessments of each moderator/prospector on A , are IF k = { 1 , 0 , 1 , 0 , , 1 , 0 } , k = 1 , 2 , , p , then GBGWA ( c j 1 , c j 2 , , c j m ) = IFWA i ( c j 1 , c j 2 , , c j m ) .
(ii)
If the assessments of each moderator/prospector on A , are IF k = { 0 , 1 , 0 , 1 , , 0 , 1 } , k = 1 , 2 , , p , then GBGWA ( c j 1 , c j 2 , , c j m ) = 0 , 1 ,
(iii)
If ( S ˜ , A ) = X ˜ A ( 1 , 0 ) , then
GBGWA ( c j 1 , c j 2 , , c j m ) = IFWA k IFWA i ( a 11 , a 12 , , a 1 m ) , IFWA i ( a 21 , a 22 , , a 2 m ) , , IFWA i ( a p 1 , a p 2 , , a p m ) .
(iv)
If ( S ˜ , A ) = I ˜ A ( 0 , 1 ) , then GBGWA ( c j 1 , c j 2 , , c j m ) = 0 , 1 .
Proof. 
It is straightforward, thus it is omitted from here. □
Now, the definition of GBGWG operator is specified as follows:
Definition 26.
GBGWG;Let F ˜ g ˜ = ( S ˜ , A , g ˜ ) be a GGIFSS over X, where g ˜ = { α ˜ d 1 , α ˜ d 2 , , α ˜ d p } be the group of PIFSs. Assume that w = ( w 1 , w 2 , , w m ) T be the normalized weight vector for A , such that w i > 0 and i = 1 m w i = 1 . Let I F V ˜ ( κ j ) = { c j 1 , c j 2 , , c j m } ( j = 1 to n ) be the set of IFVs in EIFSS ( S ˜ , A ) for all κ j X . For each senior moderator/prospector, α ˜ d k ( υ ) = { t ˜ α ˜ d k ( υ ) , f ˜ α ˜ d k ( υ ) υ A } ( k = 1 to p ) be the PIFS, it can be represented as IF k = { a k 1 , a k 2 , , a k m } ( k = 1 to p ) and ϖ = ( ϖ 1 , ϖ 2 , , ϖ p ) T is the set of weights for moderators, such that ϖ k > 0 and k = 1 p ϖ k = 1 . Define GBGWG: Γ s m Γ s , IFWG: Γ m Γ , where
GBGWG ( c j 1 , c j 2 , , c j m ) = IFWG k ( IFWG i ( a 11 , a 12 , , a 1 m ) IFWG i ( c j 1 , c j 2 , , c j m ) ) , ( IFWG i ( a 21 , a 22 , , a 2 m ) IFWG i ( c j 1 , c j 2 , , c j m ) ) , , ( IFWG i ( a p 1 , a p 2 , , a p m ) IFWG i ( c j 1 , c j 2 , , c j m ) )
where GBGWG is known as GGIFSS weighted geometric operator, then the set of all GBGWGs is denoted L = { 1 , 2 , , n } . In addition, IFWA k and IFWA i are IFWG operators on set of senior moderators/prospectors and set of parameters, respectively. Note that Γ s m and Γ are families of GGIFSS and IFSs, respectively.
Lemma 2.
Let F ˜ g ˜ = ( S ˜ , A , g ˜ ) be a GGIFSS over X, where g ˜ = { α ˜ d 1 , α ˜ d 2 , , α ˜ d p } be the group of IFSs. If p = 1 , then F ˜ g ˜ is a GIFSS and GBGWG is specified below.
GBGWG ( c j 1 , c j 2 , , c j m ) = IFWG i ( a 11 , a 12 , , a 1 m ) IFWG i ( c j 1 , c j 2 , , c j m ) ) .
Theorem 2.
If c i j = ( t ˜ j i , f ˜ j i ) and a k i = ( t ˜ k i , f ˜ k i ) ( i = 1 , 2 , , m , j = 1 , 2 , , n , k = 1 , 2 , , p ) , be an IFV, then the aggregated value by GBGWG operator is given by GBGWG ( c j 1 , c j 2 , , c j m ) = k = 1 p ( 1 ( 1 i = 1 m t ˜ a k i ) ( 1 i = 1 m t ˜ c j i ) ) , 1 k = 1 p ( 1 ( 1 i = 1 m ( 1 f ˜ a k i ) ) · ( 1 i = 1 m ( 1 f ˜ c j i ) ) ) .
Proof. 
It follows from Theorem 1, thus it is omitted from here. □
In addition, the properties of idempotent, bounding and monotonicity for GBGWGs can be stated and proved in a similar manner as for GBGWAs.
Proposition 3.
Let G ˜ g ˜ = ( S ˜ , A , g ˜ ) be a GGIFSS over X. Then,
(i)
If the assessments of each moderator on A , are IF k = { 1 , 0 , 1 , 0 , , 1 , 0 } , k = 1 , 2 , , p , then GBGWG ( c j 1 , c j 2 , , c j m ) = IFWG i ( c j 1 , c j 2 , , c j m ) .
(ii)
If the assessments of each moderator on A , are IF k = { 0 , 1 , 0 , 1 , , 0 , 1 } , k = 1 , 2 , , p , then GBGWG ( c j 1 , c j 2 , , c j m ) = 0 , 1 .
(iii)
If ( S ˜ , A ) = X ˜ A ( 1 , 0 ) , then
GBGWG ( c j 1 , c j 2 , , c j m ) = IFWG k IFWG i ( a 11 , a 12 , , a 1 m ) , IFWG i ( a 21 , a 22 , , a 2 m ) , , IFWG i ( a p 1 , a p 2 , , a p m ) .
(iv)
If ( S ˜ , A ) = I ˜ A ( 0 , 1 ) , then GBGWG ( c j 1 , c j 2 , , c j m ) = 0 , 1 .
Proof. 
It is straightforward, thus is omitted here. □
As aggregation operators are used to create MCDM frameworks, based on proposed GBGWA or GBGWG operators, some multi-criteria decision making methods are discussed in next section.

5. Multi-Attribute Decision Making under GGIFSSs Environment

In this section, firstly we present our approach comprising of an algorithm by virtue of GGIFSSs, and GBGWA or GBGWG operators. Then, we conduct two illustrations on proposed method as in the case studies: (1) candidates evaluation for an insurance company; and (2) cinema selection for the customers.

5.1. Proposed Method

As stated above, the properties of boundedness and monotonicity are valid for proposed operators. Therefore, a comparison can be made among two or more GBGWA(GBGWG) operators. Let ς be the number of committees established comprising specialists, which are intended to classify each alternative κ j ( j = 1 , 2 , , n ) , while making in account with the imperative attributes υ i ( i = 1 , 2 , , m ) , and by provision of their respective grades in terms of IFSSs. Consider d 1 , d 2 , , d p be the members/experts(directors or officers), who are in-charge of constituted committees. Thereafter, the subjective information (in the form of IFSSs) from committees is collected. The senior experts will examine it and give their judgements as a group of IFSs. Then, the information of each committee comprised the GGIFSS, and there will be ς number of GGIFSSs. The extended union on GGIFSSs is computed, denoted as G ˜ g ˜ and expressed in a table. Here, two types of criteria occur in the G ˜ g ˜ , namely, benefit and cost criteria. To consolidate the criteria, the G ˜ g ˜ must be normalized through the following equation:
r j i = t ˜ A ( υ i ) , f ˜ A ( υ i ) , if υ i is a benefit criterion , f ˜ A ( υ i ) , t ˜ A ( υ i ) , if υ i is a cos t criterion ,
such that the normalized GGIFSS is denoted by G ˜ g ˜ = ( T ˜ , E , g ˜ ) , where ( T ˜ , E ) is the normalization of ( T ˜ , E ) and g ˜ is the normalization of g ˜ . Finally, GBGWA or GBGWG can be used to aggregate the data from G ˜ g ˜ and each j or j can be correlated through score function. Therefore, we propose our methodology as an algorithm as follows.
Algorithm 1 Multi-attribute decision making on GGIFSSs
Input: A set of alternatives
Output: The felicitous alternative for a problem
1:Let X = { κ 1 , κ 2 , , κ n } be the set of alternatives and E = A 1 A 2 , , A ς = { υ 1 , υ 2 , , υ m } be the set of attributes. Constitute a mechanism of the specialists’ judgements on attributes in the form of IFVs and establish IFSSs on each committee of specialists.
2:Obtain ς number of GGIFSSs, F ˜ g ˜ 1 = ( S ˜ 1 , A 1 , g ˜ 1 ) , F ˜ g ˜ 2 = ( S ˜ 2 , A 2 , g ˜ 2 ) , …, F ˜ g ˜ ς = ( S ˜ ς , A ς , g ˜ ς ) over X, which are handled by ς number of committees of experts and specialists. Each group g ˜ 1 , g ˜ 2 , , g ˜ ς of IFSs is constituted by p number of senior members/moderators for available information on each A i ( i = 1 , 2 , , ς ) , respectively.
3:Compute extended union G ˜ g ˜ = ( ˜ E ) i = 1 ς F ˜ g ˜ i of GGIFSSs. Represent G ˜ g ˜ in a table.
4:Normalized the data in G ˜ g ˜ using Equation (3), and represent G ˜ g ˜ in a table.
5:Calculate GBGWA j ( j = 1 , 2 , , n ) or GBGWG j ( j = 1 , 2 , , n ) operators on GGIFFS G ˜ g ˜ . There will be n operators.
6:Obtain score function on each operator j or j using Definition 3.
7:Rank the alternatives on score function; the best choice is obtained on a maximum score.
This algorithm is depicted as a flowchart in Figure 1. The Algorithm 1 can be formulated to select the best product or alternative for p number of customers. In this way, the extra inputs incorporate as the demands of customers in GGIFSS, and the Algorithm 1 will conduct on a GGIFSS, F ˜ g ˜ = ( S ˜ , E , g ˜ ) , from Step 4. To operate above methodology, we establish two case studies as below.

5.2. Case Study: Candidate Selection Problem

In this case study, an example for evaluation of candidates is used to illustrate the applicability of the proposed method. An insurance company HG in Guangzhou, China is engaged for insurance of products, charging insurance premium, consultation on insurance, financial and other services for individuals and enterprises. Every year, this company recruits new staff for the post of insurance sales agents and consultants. To maintain the excellence and high admire reputation, the company consults with experts for their assessments and opinions to recruit the candidates. Furthermore, the insurance business department and human resources department are actively engaged in recruitment process.
Let X = { κ 1 , κ 2 , κ 3 , κ 4 , κ 5 } be the set of five candidates whom can be placed for the position of insurance sales consultant. A group of three senior members (directors, officers, etc.) d 1 , d 2 and d 3 setup a committee of specialists and experts to appoint a felicitous candidate for this position. The set of criteria for committee to select the candidate is E = { υ 1 , υ 2 , υ 3 , υ 4 , υ 5 , υ 6 , υ 7 } , where
  • υ 1 : english level;
  • υ 2 : relevant problem solving skills;
  • υ 3 : relevant working experience;
  • υ 4 : communication skills;
  • υ 5 : finance and insurance professional;
  • υ 6 : score obtained in a college degree; and
  • υ 7 : interpersonal skills.
On the set parameters, the weight vector is given and denoted by w = ( w 1 / 0.12 , w 2 / 0.13 , w 3 / 0.15 , w 4 / 0.15 , w 5 / 0.17 , w 6 / 0.11 , w 7 / 0.17 ) T such that i = 1 7 w i = 1 . The three senior members arrange specialists into two groups; the first group consists of the specialists of insurance business management and the second group consists of the specialists of human resource management. The set of parameters A = { υ 2 , υ 3 , υ 5 } is assigned for first group and the set of parameters B = { υ 1 , υ 4 , υ 6 , υ 7 } is assigned for second group. These two groups give their judgments as IFSSs ( S ˜ 1 , A ) and ( S ˜ 2 , B ) , respectively. Then, the group of senior members examine the data of IFSSs and then provide the two groups of IFSs, g 1 = { α ˜ d 1 , α ˜ d 2 , α ˜ d 3 } and g 2 = { β ˜ d 1 , β ˜ d 2 , β ˜ d 3 } to complete the GGIFSSs, F ˜ g ˜ 1 = ( S ˜ 1 , A , g ˜ 1 ) and F ˜ g ˜ 2 = ( S ˜ 2 , B , g ˜ 2 ) , as shown in Table 5 and Table 6, respectively.
To evaluate most felicitous candidate on provided information in Table 5 and Table 6, the extended intersection of F ˜ g ˜ 1 and F ˜ g ˜ 2 is contemplated as follows:
G ˜ g ˜ = F ˜ g ˜ 1 ˜ E F ˜ g ˜ 2 = ( T ˜ , E , g ˜ ) = ( S ˜ 1 , A , g ˜ 1 ) ˜ E ( S ˜ 2 , B , g ˜ 2 )
and shown in Table 7.
As the all criterion are benefit type, the normalized GGIFSS, G ˜ g ˜ , is not needed. The weight vector for three senior members is given by ϖ = ( ϖ 1 / 0.33 , ϖ 2 / 0.34 , ϖ 3 / 0.33 ) T such that k = 1 3 ϖ k = 1 . The GBGWA operator is used on integrated data in Table 7, and given as follows:
1 = GGWA ( c 11 , c 12 , , c 17 ) = IFWA k ( 0.390932 , 0.353894 , 0.260704 , 0.518795 , 0.325209 , 0.489552 ) = 0.327079 , 0.448601
2 = GGWA ( c 21 , c 22 , , c 27 ) = IFWA k ( 0.355421 , 0.494395 , 0.237022 , 0.623437 , 0.295668 , 0.600553 ) = 0.297119 , 0.570421
3 = GGWA ( c 31 , c 32 , , c 37 ) = IFWA k ( 0.390064 , 0.455207 , 0.260125 , 0.594251 , 0.324487 , 0.569593 ) = 0.326346 , 0.536655
4 = GGWA ( c 41 , c 42 , , c 47 ) = IFWA k ( 0.374141 , 0.435074 , 0.249507 , 0.579256 , 0.311241 , 0.553687 ) = 0.312904 , 0.519253
5 = GGWA ( c 51 , c 52 , , c 57 ) = IFWA k ( 0.422383 , 0.383619 , 0.281678 , 0.540934 , 0.351372 , 0.513036 ) = 0.353679 , 0.474575
Now, the score functions are calculated on above five operators and given as in the following: δ ( 1 ) = 0.439239 , δ ( 2 ) = 0.363349 , δ ( 3 ) = 0.394845 , δ ( 4 ) = 0.396825 , and δ ( 5 ) = 0.439552 . The descending order is acquired as κ 5 > κ 1 > κ 4 > κ 3 > κ 2 ; thus, κ 5 is the felicitous candidate for the position because δ ( 5 ) = 0.439552 is the maximum score.
Next, a case study in a different scenario is given as follows.

5.3. Case Study: Alternative Evaluation on Customer Demands

Nowadays, the markets possess immense competition for the quality of service, besides the demands of customers are increased and widened in the different prospects. The service industries are booming and upgrading by entertainment, catering, tourism, and auction. Indeed, there is a fierce competition among the service industries, but currently film industry is in the most competitive position as customers always classify and compare cinemas on different parameters, such as convenience, environment, quality of service, upcoming movies, and expenses.
Let X = { κ 1 , κ 2 , κ 3 , κ 4 } be the set of four cinemas. The set of attributes E = { υ 1 , υ 2 , υ 3 , υ 4 , υ 5 } , where
  • υ 1 : quality of service;
  • υ 2 : quality of expected films;
  • υ 3 : environment in cinema;
  • υ 4 : price reasonability; and
  • υ 5 : convenience and luxuriousness.
A committee of experts and specialists from a cinema management organization give the judgment for cinemas on provided attributes as an IFSSs ( S ˜ , E ) (Table 8).
Now, the two customers d 1 and d 2 desire to choose a most suitable cinema to watch movies; their demands comprise IFSs,
α ˜ d 1 = { υ 1 / 0.4 , 0.6 , υ 2 / 0.5 , 0.3 , υ 3 / 0.5 , 0.4 , υ 4 / 0.4 , 0.6 , υ 5 / 0.4 , 0.4 } ,
α ˜ d 2 = { υ 1 / 0.5 , 0.4 , υ 2 / 0.4 , 0.5 , υ 3 / 0.5 , 0.3 , υ 4 / 0.5 , 0.4 , υ 5 / 0.4 , 0.2 } .
The attribute υ 4 belongs to cost criteria, therefore corresponding IFVs can be normalized using Equation (10). Let g ˜ = { α ˜ d 1 , α ˜ d 2 } and the normalization of g ˜ is expressed as g ˜ = { α ˜ d 1 , α ˜ d 2 } . Thereafter, Table 8 can be normalized. Then, the information can be extended into GGIFSS F ˜ g ˜ = ( S ˜ , E , g ˜ ) , and specified in Table 9.
Let w = ( w 1 / 0.18 , w 2 / 0.19 , w 3 / 0.21 , w 4 / 0.22 , w 5 / 0.2 ) T be the weight vector for attributes and ϖ = ( ϖ 1 / 0.52 , ϖ 2 / 0.48 ) T be the weight vector for customers. The GBGWA operator is used on integrated data in Table 9, and given as follows:
1 = GGWA ( c 11 , c 21 , , c 15 ) = IFWA k ( 0.220934 , 0.635540 , 0.199004 , 0.605904 ) = 0.210483 , 0.621138
2 = GGWA ( c 21 , c 22 , , c 52 ) = IFWA k ( 0.265324 , 0.619281 , 0.238988 , 0.588324 ) = 0.252798 , 0.604223
3 = GGWA ( c 31 , c 32 , , c 35 ) = IFWA k ( 0.209414 , 0.678382 , 0.188627 , 0.652231 ) = 0.199503 , 0.665701
4 = GGWA ( c 41 , c 42 , , c 45 ) = IFWA k ( 0.223041 , 0.608588 , 0.200901 , 0.576761 ) = 0.212491 , 0.593098
5 = GGWA ( c 51 , c 52 , , c 55 ) = IFWA k ( 0.227867 , 0.654431 , 0.205248 , 0.626332 ) = 0.217091 , 0.640789
Now, the score functions are calculated on above five operators and given as in the following: δ ( 1 ) = 0.294672 , δ ( 2 ) = 0.324287 , δ ( 3 ) = 0.266901 , δ ( 4 ) = 0.309696 , and δ ( 5 ) = 0.288151 . One can check that κ 2 is the suitable cinema for both customers as δ ( 2 ) = 0.324287 is the maximum score.
Now, based on our results, comparisons with other methods are given in next section.

6. Comparisons and Discussions

In this section, we compare our framework and results with existing methodologies. At first, we make a comparison of our method with the framework presented in [44]. Then, we discuss the advantages of proposed technique.

6.1. Comparisons with the Method of Garg

Garg et al. [44] defined geometric and averaging operators on the GGIFSSs and then provided an algorithm for decision making methodology. Let X = { κ 1 , κ 2 , , κ n } be the set of alternatives and E = { υ 1 , υ 2 , , υ m } be the set of criteria. To evaluate κ j ( j = 1 , , n ) as a optimal choice, IFSS on E are given and assessments of moderators are given as an IFSs G ϱ ( e ) , where G = ( ϱ 1 , ϱ 2 , , ϱ p ) and G ϱ ( e ) denotes the opinion of experts on the elements of X by virtue of IFSS on E. We recall the algorithm contemplated in [44] and given as follows:
Algorithm 2 Grag’s Algorithm for faculty appointment
1:Make a framework of the specialists’ judgment related to each possible choice (alternatives) in the form IFVs and then construct their corresponding decision matrix [ h ] n × m .
2:Get the generalization matrix [ G ϱ ] n × 1 by using the perceptions of the senior members/experts’ committee on each κ j ( j = 1 , 2 , , n ) .
3:Construct the new matrix [ h G ] n × ( m + 1 ) by placing [ G ϱ ] n × 1 in [ h ] n × m with respect to κ j ( j = 1 , 2 , , n ) .
4:Apply operators with respect to κ j , and the results are denoted by r j , j = 1 , 2 , , n .
5:Rank the κ j ( j = 1 , 2 , , n ) in descending order on their score values r j ( j = 1 , 2 , , n ) .
Under the approach established in [44], we provide some key points and compare Algorithm 1, with Algorithm 2:
(i)
In Algorithm 2, the generalized parameter matrix is obtained by incorporating preferences of experts on alternatives. In other words, information from moderator on alternatives is given; nevertheless, extra input can be sighted as another information over IFSS, and both information types (IFSS and extra inputs) deal with alternatives. Conversely, in Algorithm 1, clear and well-defined GGIFSSs are taken into account by incorporating IFSS and IFSs.
(ii)
Operation of extended union is used in Algorithm 1 on two GGIFSSs, while, in Algorithm 2, there are some difficulties in defining an operation of extended union on two or more GGIFSSs.
(iii)
It seems that GGWA or GGWG operators in Algorithm 2 are applied contrarily on two different information types, however, in Algorithm 1, an integrated manner is adopted to compile results through GBGWA or GBGWG.
(iv)
In Algorithm 1, the generalized parameters can be applied as the demands of customers, and thus an integrated framework can be employed in industries. However, Algorithm 2 lacks creating such frameworks.

6.2. Comparisons with the Results of GIFSSs

The obtained results on the case studies in Section 5.2 and Section 5.3 are compared with the outcomes that are achieved on GIFSSs as given below.
(i)
As discussed earlier, GGIFSS with only single generalized parameter is known as GIFSS. Then, Algorithm 1 can be separated for each senior moderator/customer in the case studies in Section 5.2 and Section 5.3.
1. Using the Lemma 1 and Algorithm 1, we obtained the results separately for each senior experts/members in the case study in Section 5.2. If only Senior Member 1 is taken into account during selection process, then δ ( 1 ) = 0.5185 , δ ( 2 ) = 0.4305 , δ ( 3 ) = 0.4674 , δ ( 4 ) = 0.4695 , and δ ( 5 ) = 0.5194 . The descending order is acquired as κ 5 > κ 1 > κ 4 > κ 3 > κ 2 ; thus, κ 5 is the felicitous candidate for the position.
If only Senior Member 2 is taken into account during selection process in the case study in Section 5.2, then δ ( 1 ) = 0.3709 , δ ( 2 ) = 0.3068 , δ ( 3 ) = 0.3329 , δ ( 4 ) = 0.3351 , and δ ( 5 ) = 0.3704 . The descending order is acquired as κ 1 > κ 5 > κ 3 > κ 4 > κ 2 ; thus, κ 1 is the felicitous candidate for the position.
If only Senior Member 3 is taken into account during selection process in the case study in Section 5.2, then δ ( 1 ) = 0.4178 , δ ( 2 ) = 0.3475 , δ ( 3 ) = 0.3774 , δ ( 4 ) = 0.3788 , and δ ( 5 ) = 0.4192 . The descending order is acquired as κ 5 > κ 1 > κ 4 > κ 2 > κ 3 ; thus, κ 1 is the felicitous candidate for the position.
It can be observed from above discussion that κ 5 is the most suitable candidate as per individual opinions of Senior Members 1 and 3. Similarly, κ 1 is the most felicitous candidate on individual opinion of Senior Member 2, while κ 5 is on second place in descending order. Thus, in general, κ 5 is the most suitable candidate.
2. Using the Lemma 1 and Algorithm 1, we obtained the results separately for each customer for the case study in Section 5.3. If it is required to select cinema only for Customer 1, then δ ( 1 ) = 0.2927 , δ ( 2 ) = 0.3230 , δ ( 3 ) = 0.2655 , δ ( 4 ) = 0.3072 , and δ ( 5 ) = 0.2867 . The order is acquired as κ 2 > κ 4 > κ 1 > κ 5 > κ 3 ; thus, κ 2 is the best cinema for Customer 1.
If it is required to select cinema only for the Customer 2, then δ ( 1 ) = 0.2965 , δ ( 2 ) = 0.3253 , δ ( 3 ) = 0.2682 , δ ( 4 ) = 0.3121 , and δ ( 5 ) = 0.2894 . The order is acquired as κ 2 > κ 4 > κ 1 > κ 5 > κ 3 ; thus, κ 2 is the best cinema for Customer 2.
Thus, in general, κ 2 is the most suitable for both customers.
(ii)
Feng et al. [42] introduced a framework of decision makings on GIFSSs. We correlate proposed results with their method as below. We acquired the results separately for each customer for the case study in Section 5.3. If it is required to select cinema only for Customer 1, then δ ( Z J ( κ 1 ) ) = 0.5344 , δ ( Z J ( κ 2 ) ) = 0.5928 , δ ( Z J ( κ 3 ) ) = 0.4857 , δ ( Z J ( κ 1 ) ) = 0.5549 , and δ ( Z J ( κ 1 ) ) = 0.5251 . The descending order acquired as κ 2 > κ 4 > κ 1 > κ 5 > κ 3 ; thus, κ 2 is the best cinema for Customer 1. If it is require to select cinema only for Customer 2, then δ ( Z J ( κ 1 ) ) = 0.5311 , δ ( Z J ( κ 2 ) ) = 0.5961 , δ ( Z J ( κ 3 ) ) = 0.4894 , δ ( Z J ( κ 1 ) ) = 0.5568 , and δ ( Z J ( κ 1 ) ) = 0.5262 . The descending order acquired as κ 2 > κ 4 > κ 1 > κ 5 > κ 3 ; thus, κ 2 is the best cinema for Customer 2.
(iii)
A framework for the best concept selection in design process has been computed in [43], where GIFSSs are utilized to acquire integrated information on customers demands and design concepts. To meet their objectives, they introduced an algorithm, which we updated as follows:
Algorithm 3 Updated form of Algorithm in [43]
1:The demands of p number of customers are represented as IFSs α ˜ 1 , α ˜ 2 , , α ˜ p .
2:Represent IFSS ( S ˜ , E ) over set of all possible choices X.
3:Represent GIFSSs for each customer F ˜ k = ( S ˜ , E , α ˜ k ) ( k = 1 , , p ) .
4:Compute i n t A N D p r o d u c t operation on F ˜ 1 , F ˜ 2 , , F ˜ p , obtain GIFSS F ˜ and show it in tabular form.
5:Derive the utility fuzzy set Δ F ˜ from the GIFSS F ˜ .
6:Output κ j as the optimal decision if Δ F ˜ ( κ j ) = max { Δ F ˜ ( κ j ) κ j X } .
7:If j has more than one values then any one of κ j may be chosen.
The case study in Section 5.3 can be contemplated through Algorithm 3. On this prospect, GGIFSS given in Table 9 can be separated into two GIFSSs. After adopting all steps of Algorithm 3, Δ ( κ 1 ) = 0.2252 , Δ ( κ 2 ) = 0.2678 , Δ ( κ 3 ) = 0.2112 , Δ ( κ 4 ) = 0.2419 , and Δ ( κ 5 ) = 0.2261 . The descending order is acquired as κ 2 > κ 4 > κ 5 > κ 1 > κ 3 ; thus, κ 2 is the best cinema for both customers.
The superiorities and advantages of our method are given in next section.

7. Superiority of Proposed Method

In this section, we give some counter-examples to show the superiority of proposed method over recent approaches [42,43,44].
Example 5.
Assume a decision making problem by letting the two alternatives κ 1 and κ 2 , which have to be evaluated by the committee of specialists over set of parameters E = { υ 1 , υ 2 , υ 3 } . The committee of specialists provide the judgments in the form of IFSS, given in Table 10;
Here, we apply the approach provided by Feng et al. [42], by letting an extra input β ˜ = { 0.4 , 0.2 , 0.5 , 0.3 , 0.6 , 0.4 } of a moderator. Then, the GIFSS is consolidated as in Table 11;
The score function on IFVs in β ˜ are 0.6 , 0.6 , and 0.6 and the weights are 0.33 , 0.33 , and 0.33 , respectively. It can be seen that, when we convert extra input into weights in initial stages of decision making, the importance of membership and non-membership diminish. Using the method of Feng et al. [42], we get δ ( Z J ( κ 1 ) ) = 0.503 > δ ( Z J ( κ 2 ) ) = 0.498 such that κ 1 > κ 2 . Let w = { w 1 / 0.32 , w 2 / 0.33 , w 3 / 0.35 } be the weighted vector over E. Then, by proposed method, δ ( 1 ) = 0.310 < δ ( 2 ) = 0.314 such that κ 1 < κ 2 . Therefore, the conversation of extra input into weighted vector in early process of decision making diminish the importance of membership and non-membership. Thus, proposed approach is better then the method of Feng et al. [42].
Example 6.
Assume that κ 1 , κ 2 and κ 3 are three products and E = { υ 1 , υ 2 , υ 3 } is the set of parameters. The dependencies of products on criteria are provided in IFSS ( S ˜ , E ) and given in Table 12.
Here, we consider the methodology of Hayat et al. [43]. To select best product for two customers d 1 , d 2 , their demands are investigated as β ˜ d 1 = { 0.3 , 0.5 , 0.4 , 0.4 , 0.6 , 0.2 } , β ˜ d 2 = { 0.3 , 0.6 , 0.3 , 0.4 , 0.5 , 0.4 } , respectively. Then, the GIFSSs for d 1 and d 2 are given in Table 13 and Table 14, respectively.
In [43], A N D operation is computed on two GIFSSs for product for two customers. One can check that
S ˜ ( υ 1 ) S ˜ ( υ 2 ) = S ˜ ( υ 1 ) with t ˜ β ˜ d 1 ( υ 1 ) t ˜ β ˜ d 2 ( υ 2 ) = t ˜ β ˜ d 1 ( υ 1 ) , f ˜ β ˜ d 1 ( υ 1 ) f ˜ β ˜ d 2 ( υ 2 ) = f ˜ β ˜ d 1 ( υ 1 )
S ˜ ( υ 1 ) S ˜ ( υ 3 ) = S ˜ ( υ 1 ) with t ˜ β ˜ d 1 ( υ 1 ) t ˜ β ˜ d 2 ( υ 3 ) = t ˜ β ˜ d 1 ( υ 1 ) , f ˜ β ˜ d 1 ( υ 1 ) f ˜ β ˜ d 2 ( υ 3 ) = f ˜ β ˜ d 1 ( υ 1 )
S ˜ ( υ 2 ) S ˜ ( υ 3 ) = S ˜ ( υ 2 ) with t ˜ β ˜ d 1 ( υ 2 ) t ˜ β ˜ d 2 ( υ 3 ) = t ˜ β ˜ d 1 ( υ 2 ) , f ˜ β ˜ d 1 ( υ 2 ) f ˜ β ˜ d 2 ( υ 3 ) = f ˜ β ˜ d 1 ( υ 2 ) .
It can be seen that, using A N D operation, the importance of IFVs for υ 2 and υ 3 are diminished in Equations (11) and (12). The importance of IFVs for υ 3 are diminished in Equation (13). Thus, such an approach is not valid in the initial stages of decision making; therefore, for this prospect, the proposed approach is better then Hayat et al. [43].
In [44], GWA is computed on two information; one from a committee of experts (in form of IFSS) and other from group of senior persons. The extra inputs can be seen as a so-called IFSS of a group of senior persons over alternatives. Consider Example 5, where IFSS from a committee of experts is given in Table 10. The extra input is given in Table 15, and can be seen as a so-called IFSS on alternatives. In the prospect of Garg et al. [44], the extra opinions of the two senior experts d 1 , d 2 can be merged with IFSS in Table 10.
Clearly, the combination of two data ((i) IFSS and (ii) IFVs of experts) based matrix is analyzed as GGIFSS in [44]. In another way, if it might be recognized that the group of extra inputs of senior experts is a summarization of the data (IFSS obtained from a committee of specialists), then the results can be obtained from Table 15, thus why would we contemplate two data based matrix over alternatives? Nevertheless, there exist some serious difficulties in [44]. Noteworthily, the proposed results are superior in certain aspects and a well-defined manner is considered.

Advantages of Proposed Method

Based on correlative and comparative research, the following benefits of present framework are acquired and emphasized:
(i)
The case study indicated in [44] is implemented on two IFVs based matrix but not for the GGIFSSs. The extra inputs are located as in IFVs type weights on alternatives and operators presumed to be collected on the two different IFVs based data. In this prospect, the proposed approach is based on well-defined GGIFSSs.
(ii)
In [42], an extra input turns into the weighted vector in initial stages of decision making after calculation of score functions but it is not integrated with the information of experts to achieve better results. In the proposed method, extra inputs are taken into account in an accurate way using GBGWA or GBGWG.
(iii)
In [43], the A N D operation is used on several GIFSSs. In many cases, A N D or O R operations on IFVs provide instantaneous results but do not give comprehensively aggregated results.
(iv)
The judgements/demands of senior prospectors/customers in GGIFSSs as managed with proposed operators are useful to rank the alternatives. The proposed framework can be correlated with the shortening of any number of existing senior prospectors/customers.

8. Conclusions

It has been noticed that the definition of GGIFSS, given by Garg et al. [44], did not provide supplementary information in a precise manner. Under this prospect, we have reformulated the existing definition of GGIFSS by establishing a novel notion of GGIFSS and related operation are also refined. We have aggregated GBGWA and GBGWG operators on GGIFSSs, which are employed to aggregate our techniques. Then, we formulated the framework of decision makings in an algorithm and two case studies have been handled by virtue of proposed methodology. We have given the advantages and comparison with existing techniques and correlated the results which are achieved on GIFSSs. The advantages of given framework are to contemplate the prospector‘s demands or expert‘s judgments in an incorporated way such that establishing more operators can be constituted the design concept evaluation mechanism on GGIFSSs. In this way, the results presented in this paper can be studied in several fields, such as electrical engineering, industrial designs, construction engineering, as estimation of risk factors in risk management is a complex tasks thus such problem can be considered.

Author Contributions

K.H. develops the idea and writes the paper. K.H.; methodology, K.H.; writing—original draft preparation. M.I.A., B.-Y.C., F.K. X.P.Y. review and edit the paper.

Funding

This paper is supported by the High Level Construction Fund of Guangzhou University China. Also this work was supported by the Natural Science Foundation (61877014), Natural Science Foundation of Guangdong Province (2017A030307020, 2016A030307037, 2016A030313552), the Guangdong Provincial Government to Guangdong International Student Scholarship (yuejiao [2014] 187), Guangzhou Vocational College of Science and Technology (no. 2016TD03) and the Foundation of Hanshan Normal University (QD20171001, LQ201702).

Acknowledgments

The authors would like to thank all the reviewers for their valuable comments.

Conflicts of Interest

The authors declare no conflict of interest.

Abbreviations

The following abbreviations are used in this manuscript:
GGIFSSsGroup-based generalized intuitionistic fuzzy soft sets
GIFSSsGeneralized intuitionistic fuzzy soft sets
GBGWAGroup-based generalized weighted averaging operators
GBGWGGroup-based generalized weighted geometric operators
IFSsIntuitionistic fuzzy sets

References

  1. Maji, P.K.; Biswas, R.; Roy, A.R. Fuzzy soft sets. J. Fuzzy Math. 2001, 9, 589–602. [Google Scholar]
  2. Zadeh, L.A. Fuzzy Sets. Inf. Control 1965, 8, 338–353. [Google Scholar] [CrossRef]
  3. Molodtsov, D. Soft set theory-first results. Comput. Math. Appl. 1999, 37, 19–31. [Google Scholar] [CrossRef]
  4. Maji, P.K.; Biswas, R.; Roy, A.R. Soft set theory. Comput. Math. Appl. 2003, 45, 555–562. [Google Scholar] [CrossRef] [Green Version]
  5. Ali, M.I.; Feng, F.; Liu, X.; Min, W.K.; Shabir, M. On some new operations in soft set theory. Comput. Math. Appl. 2009, 57, 1547–1553. [Google Scholar] [CrossRef] [Green Version]
  6. Roy, A.R.; Maji, P.K. A fuzzy soft set theoretic approach to decision making problems. J. Comput. Appl. Math. 2007, 203, 412–418. [Google Scholar] [CrossRef]
  7. Alcantud, J.C.R.; Mathew, T.J. Separable fuzzy soft sets and decision making with positive and negative attributes. Appl. Soft Comput. 2017, 59, 586–595. [Google Scholar] [CrossRef]
  8. Alcantud, J.C.R.; Torra, V. Decomposition theorems and extension principles for hesitant fuzzy sets. Inf. Fusion 2018, 41, 48–56. [Google Scholar] [CrossRef]
  9. Khameneh, A.Z.; Kılıçman, A. Parameter reduction of fuzzy soft sets: An adjustable approach based on the three-way decision. Int. J. Fuzzy Syst. 2018, 20, 928–942. [Google Scholar] [CrossRef]
  10. Hassan, N.; Sayed, O.R.; Khalil, A.M.; Ghany, M.A. Fuzzy soft expert system in prediction of coronary artery disease. Int. J. Fuzzy Syst. 2017, 19, 1546–1559. [Google Scholar] [CrossRef]
  11. Hayat, K.; Ali, M.I.; Cao, B.Y.; Karaaslan, F.; Qin, Z. Characterizations of certain types of type-2 soft graphs. Discrete Dyn. Nat. Soc. 2018, 2018, 8535703. [Google Scholar] [CrossRef]
  12. Hayat, K.; Ali, M.I.; Cao, B.; Karaaslan, F. New results on type-2 soft sets. J. Math. Stat. 2018, 484, 47. [Google Scholar] [CrossRef]
  13. Hayat, K.; Ali, M.I.; Cao, B.-Y.; Yang, X.-P. A new type-2 soft set: Type-2 soft graphs and their applications. Adv. Fuzzy Sys. 2017. [Google Scholar] [CrossRef]
  14. Kumar, A.; Kumar, D.; Jarial, S.K. A hybrid clustering method based on improved artificial bee colony and fuzzy C-means algorithm. Int. J. Artif. Intell. 2017, 15, 24–44. [Google Scholar]
  15. Liu, Y.; Qin, K.; Martınez, L. Improving decision making approaches based on fuzzy soft sets and rough soft sets. Appl. Soft Comput. 2018, 65, 320–332. [Google Scholar] [CrossRef]
  16. Medina, J.; Ojeda-Aciego, M. Multi-adjoint t-concept lattices. Inf. Sci. 2010, 180, 712–725. [Google Scholar] [CrossRef]
  17. Pozna, C.; Minculete, N.; Precup, R.E.; Koczy, L.T.; Ballagi, A. Signatures: Definitions, operators and applications to fuzzy modelling. Fuzzy Sets Syst. 2012, 201, 86–104. [Google Scholar] [CrossRef]
  18. Qinrong, F.; Fenfen, W. A discernibility matrix approach to fuzzy soft sets based decision making problems. J. Intell. Fuzzy Syst. 2018, 22, 59–74. [Google Scholar]
  19. Vildan, C.; Halis, A. A topological view on L-fuzzy soft sets: Connectedness degree. J. Intell. Fuzzy Syst. 2018, 34, 1975–1983. [Google Scholar]
  20. Vimala, J.; Arockia, J.R.; Anusuya, I.V.S. A study on fuzzy soft cardinality in lattice ordered fuzzy soft group and its application in decision making problems. J. Intell. Fuzzy. Syst. 2018, 34, 1535–1542. [Google Scholar] [CrossRef]
  21. Xiao, F. A hybrid fuzzy soft sets decision making method in medical diagnosis. IEEE Acess 2018, 6, 25300–25312. [Google Scholar] [CrossRef]
  22. Beg, I.; Rashid, T.; Jamil, R.N. Human attitude analysis based on fuzzy soft differential equations with Bonferroni mean. Comput. Appl. Math. 2018, 37, 2632–2647. [Google Scholar] [CrossRef]
  23. Ma, X.; Zhan, J.; Ali, M.I. Applications of a kind of novel Z-soft fuzzy rough ideals to hemirings. J. Intell. Fuzzy Syst. 2017, 32, 2071–2080. [Google Scholar] [CrossRef]
  24. Sun, B.; Ma, W. Soft fuzzy rough sets and its application in decision making. Artif. Intell. Rev. 2014, 41, 67–80. [Google Scholar] [CrossRef]
  25. Atanassov, K. Intuitionistic fuzzy sets. Fuzzy Sets Syst. 1986, 20, 87–96. [Google Scholar] [CrossRef]
  26. Atanassov, K. Intuitionistic Fuzzy Sets, Theory, and Applications; Series in Fuzziness and Soft Computing; Phisica-Verlag: Heidelberg, Germany, 1999. [Google Scholar]
  27. Xu, Z. Intuitionistic fuzzy aggregation operators. IEEE Trans. Fuzzy Syst. 2007, 15, 1179–1187. [Google Scholar]
  28. 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]
  29. Jemal, H.; Kechaou, Z.; Ayed, M.B. Enhanced decision support systems in intensive care unit based on intuitionistic fuzzy sets. Adv. Fuzzy Syst. 2017, 2017, 7371634. [Google Scholar] [CrossRef]
  30. Mukherjee, S. Selection of alternative fuels for sustainable urban transportation under multi-criteria intuitionistic fuzzy environment. Fuzzy Inf. Eng. 2017, 9, 117–135. [Google Scholar] [CrossRef]
  31. Ren, H.P.; Chen, H.H.; Fei, W.; Li, D.F. A MAGDM method considering the amount and reliability information of interval-valued intuitionistic fuzzy sets. Int. J. Fuzzy Syst. 2017, 19, 15–25. [Google Scholar] [CrossRef]
  32. Yun, S.M.; Lee, S.J. Intuitionistic fuzzy topologies induced by intuitionistic fuzzy approximation spaces. Int. J. Fuzzy Syst. 2017, 9, 285–291. [Google Scholar] [CrossRef]
  33. Maji, P.K.; Biswas, R.; Roy, A.R. Intuitionistic fuzzy soft sets. J. Fuzzy Math. 2001, 9, 677–692. [Google Scholar]
  34. Deli, I.; Karataş, S. Interval valued intuitionistic fuzzy parameterized soft set theory and its decision making. J. Intell. Fuzzy Syst. 2016, 30, 2073–2082. [Google Scholar] [CrossRef]
  35. Akram, M.; Shahzadi, S. Novel intuitionistic fuzzy soft multiple-attribute decision-making methods. Neural Comput. Appl. 2018, 29, 435–447. [Google Scholar] [CrossRef]
  36. Garg, H.; Arora, R. A nonlinear-programming methodology for multi-attribute decision-making problem with interval-valued intuitionistic fuzzy soft sets information. Appl. Intell. 2018, 48, 2031–2046. [Google Scholar] [CrossRef]
  37. Garg, H.; Arora, R. Bonferroni mean aggregation operators under intuitionistic fuzzy soft set environment and their applications to decision-making. J. Oper. Res. Soc. 2018, 1–4. [Google Scholar] [CrossRef]
  38. Garg, H.; Arora, R. Novel scaled prioritized intuitionistic fuzzy soft interaction averaging aggregation operators and their application to multi criteria decision making. Eng. Appl. Artif. Intell. 2018, 71, 100–112. [Google Scholar] [CrossRef]
  39. Agarwal, M.; Biswas, K.K.; Hanmandlu, M. Generalized intuitionistic fuzzy soft sets with applications in decision-making. Appl. Soft Comput. 2013, 13, 3552–3566. [Google Scholar] [CrossRef]
  40. Khalil, A.M. Commentary on Generalized intuitionistic fuzzy soft sets with applications in decision-making. Appl. Soft Comput. 2015, 37, 519–520. [Google Scholar] [CrossRef]
  41. Yang, Y.; Wang, Y.; Zhang, Y.; Zhang, D. Commentary on generalized intuitionistic fuzzy soft sets with applications in decision-making [Appl. Soft Comput. 37 (2015) 519–520]. Appl. Soft Comput. 2016, 40, 427–428. [Google Scholar] [CrossRef]
  42. Feng, F.; Fujita, H.; Ali, M.I.; Yager, R.R.; Liu, X. Another View on generalized Intuitionistic Fuzzy Soft Sets and Related Multiattribute Decision Making Methods. IEEE Trans. Fuzzy Syst. 2018. [Google Scholar] [CrossRef]
  43. Hayat, K.; Ali, M.I.; Alcantud, J.C.R.; Cao, B.Y.; Tariq, K.U. Best concept selection in design process: An application of generalized intuitionistic fuzzy soft sets. J. Intell. Fuzzy Syst. 2018. [Google Scholar] [CrossRef]
  44. Garg, H.; Arora, R. Generalized and group-based generalized intuitionistic fuzzy soft sets with applications in decision-making. Appl. Intell. 2018, 48, 343–356. [Google Scholar] [CrossRef]
  45. Selvachandran, G.; Maji, P.K.; Faisal, R.Q.; Salleh, A.R. Distance and distance induced intuitionistic entropy of generalized intuitionistic fuzzy soft sets. Appl. Intell. 2017, 47, 132–147. [Google Scholar] [CrossRef]
  46. Pawlak, Z. Rough sets. Int. J. Comput. Inf. Sci. 1982, 11, 341–356. [Google Scholar] [CrossRef]
  47. Deschrijver, G.; Kerre, E. On the relationship between some extensions of fuzzy set theory. Fuzzy Sets Syst. 2003, 133, 227–235. [Google Scholar] [CrossRef]
  48. Chen, S.M.; Tan, J.M. Handling multicriteria fuzzy decision-making problems based on vague set theory. Fuzzy Sets Syst. 1994, 67, 163–172. [Google Scholar] [CrossRef]
Figure 1. A flowchart for our algorithm.
Figure 1. A flowchart for our algorithm.
Symmetry 10 00753 g001
Table 1. Tabular representation of the GGIFSS, F ˜ g ˜ = ( S ˜ , A , g ˜ ) .
Table 1. Tabular representation of the GGIFSS, F ˜ g ˜ = ( S ˜ , A , g ˜ ) .
X A υ 1 υ 3 υ 4
κ 1 0.6 , 0.4 0.6 , 0.2 0.9 , 0
κ 2 0 , 0.3 0.7 , 0.3 0.5 , 0.1
κ 3 0.2 , 0.2 0.3 , 0.6 0.5 , 0.1
κ 4 0 , 1 0.4 , 0.1 0.2 , 0.5
κ 5 0.1 , 0.6 0.4 , 0.2 0.5 , 0.2
κ 6 0.6 , 0.2 0.3 , 0.3 0.6 , 0.1
α ˜ d 1 0.6 , 0.2 0.3 , 0.4 0.2 , 0.2
α ˜ d 2 0.3 , 0.4 0.2 , 0.4 0.3 , 0.5
α ˜ d 3 0.3 , 0.4 0.5 , 0.4 0.4 , 0.1
Table 2. Tabular representation of the GGIFSS F ˜ g ˜ = ( S ˜ , A , g ˜ 1 ) .
Table 2. Tabular representation of the GGIFSS F ˜ g ˜ = ( S ˜ , A , g ˜ 1 ) .
X A υ 1 υ 4
κ 1 0.6 , 0.3 0.9 , 0
κ 2 0 , 0.3 0.5 , 0.1
κ 3 0.2 , 0.2 0.5 , 0.1
κ 4 0 , 1 0.3 , 0.5
κ 5 0.1 , 0.6 0.5 , 0.2
κ 6 0.6 , 0.2 0.6 , 0.1
α ˜ d 1 0.3 , 0.2 0.3 , 0.4
α ˜ d 2 0.3 , 0.4 0.2 , 0.4
α ˜ d 3 0.3 , 0.4 0.5 , 0.4
Table 3. Tabular representation of the GGIFSS, G ˜ g ˜ = ( T ˜ , B , g ˜ 2 ) .
Table 3. Tabular representation of the GGIFSS, G ˜ g ˜ = ( T ˜ , B , g ˜ 2 ) .
X B υ 1 υ 3 υ 4
κ 1 0.6 , 0.2 0.6 , 0.2 0.9 , 0
κ 2 0.1 , 0.1 0.7 , 0.3 0.6 , 0.1
κ 3 0.3 , 0.2 0.3 , 0.6 0.5 , 0
κ 4 0 , 1 0.4 , 0.1 0.4 , 0.5
κ 5 0.2 , 0.3 0.4 , 0.2 0.6 , 0.1
κ 6 0.7 , 0.2 0.3 , 0.3 0.8 , 0.1
β ˜ d 1 0.6 , 0.2 0.4 , 0.5 0.3 , 0.4
β ˜ d 2 0.3 , 0.2 0.4 , 0.2 0.3 , 0.3
β ˜ d 3 0.4 , 0.2 0.4 , 0.4 0.5 , 0.2
Table 4. Tabular representation of the GGIFSS G ˜ g ˜ c = ( T ˜ c , A , g ˜ c ) .
Table 4. Tabular representation of the GGIFSS G ˜ g ˜ c = ( T ˜ c , A , g ˜ c ) .
X A υ 1 υ 3 υ 4
κ 1 0.4 , 0.6 0.2 , 0.6 0 , 0.9
κ 2 0.3 , 0 0.3 , 0.7 0.1 , 0.5
κ 3 0.2 , 0.2 0.6 , 0.3 0.1 , 0.5
κ 4 1 , 0 0.1 , 0.4 0.5 , 0.2
κ 5 0.6 , 0.1 0.2 , 0.4 0.2 , 0.5
κ 6 0.2 , 0.6 0.3 , 0.3 0.1 , 0.6
α ˜ d 1 c 0.2 , 0.6 0.4 , 0.3 0.2 , 0.2
α ˜ d 2 c 0.4 , 0.3 0.4 , 0.2 0.5 , 0.3
α ˜ d 3 c 0.4 , 0.3 0.4 , 0.5 0.1 , 0.4
Table 5. Tabular representation of the GGIFSS F ˜ g ˜ 1 = ( S ˜ 1 , A , g ˜ 1 ) .
Table 5. Tabular representation of the GGIFSS F ˜ g ˜ 1 = ( S ˜ 1 , A , g ˜ 1 ) .
X A υ 2 υ 3 υ 5
κ 1 0.7 , 0.1 0.7 , 0.1 0.6 , 0.1
κ 2 0.5 , 0.3 0.6 , 0.3 0.6 , 0.4
κ 3 0.5 , 0.4 0.5 , 0.4 0.9 , 0.1
κ 4 0.3 , 0.4 0.7 , 0.2 0.7 , 0.2
κ 5 0.6 , 0.4 0.6 , 0.4 0.8 , 0.1
α ˜ d 1 0.5 , 0.2 0.5 , 0.4 0.7 , 0.2
α ˜ d 2 0.4 , 0.4 0.4 , 0.6 0.3 , 0.5
α ˜ d 3 0.6 , 0.4 0.3 , 0.5 0.5 , 0.5
Table 6. Tabular representation of the GGIFSS F ˜ g ˜ 2 = ( S ˜ 2 , B , g ˜ 2 ) .
Table 6. Tabular representation of the GGIFSS F ˜ g ˜ 2 = ( S ˜ 2 , B , g ˜ 2 ) .
X B υ 1 υ 4 υ 6 υ 7
κ 1 0.5 , 0.5 0.6 , 0.1 0.6 , 0.4 0.7 , 0.1
κ 2 0.5 , 0.4 0.3 , 0.4 0.5 , 0.4 0.8 , 0.2
κ 3 0.4 , 0.4 0.7 , 0.2 0.6 , 0.3 0.4 , 0.4
κ 4 0.5 , 0.2 0.7 , 0.3 0.7 , 0.2 0.5 , 0.3
κ 5 0.7 , 0.2 0.8 , 0.1 0.6 , 0.3 0.6 , 0.1
β ˜ d 1 0.4 , 0.3 0.7 , 0.3 0.6 , 0.2 0.7 , 0.2
β ˜ d 2 0.6 , 0.4 0.3 , 0.4 0.3 , 0.6 0.5 , 0.3
β ˜ d 3 0.5 , 0.5 0.4 , 0.5 0.4 , 0.4 0.7 , 0.2
Table 7. Tabular representation of the GGIFSS F ˜ g ˜ 1 ˜ E . F ˜ g ˜ 2 .
Table 7. Tabular representation of the GGIFSS F ˜ g ˜ 1 ˜ E . F ˜ g ˜ 2 .
X E υ 1 υ 2 υ 3 υ 4 υ 5 υ 6 υ 7
κ 1 0.5 , 0.5 0.7 , 0.1 0.7 , 0.1 0.6 , 0.1 0.6 , 0.1 0.6 , 0.4 0.7 , 0.1
κ 2 0.5 , 0.4 0.5 , 0.3 0.6 , 0.3 0.3 , 0.4 0.6 , 0.4 0.5 , 0.4 0.8 , 0.2
κ 3 0.4 , 0.4 0.5 , 0.4 0.5 , 0.4 0.7 , 0.2 0.9 , 0.1 0.6 , 0.3 0.4 , 0.4
κ 4 0.5 , 0.2 0.3 , 0.4 0.7 , 0.2 0.7 , 0.3 0.7 , 0.2 0.7 , 0.2 0.5 , 0.3
κ 5 0.7 , 0.2 0.6 , 0.4 0.6 , 0.4 0.8 , 0.1 0.8 , 0.1 0.6 , 0.3 0.6 , 0.1
γ ˜ d 1 0.4 , 0.3 0.5 , 0.2 0.5 , 0.4 0.7 , 0.3 0.7 , 0.2 0.6 , 0.2 0.7 , 0.2
γ ˜ d 2 0.6 , 0.4 0.4 , 0.4 0.4 , 0.6 0.3 , 0.4 0.3 , 0.5 0.3 , 0.6 0.5 , 0.3
γ ˜ d 3 0.5 , 0.5 0.6 , 0.4 0.3 , 0.5 0.4 , 0.5 0.5 , 0.5 0.4 , 0.4 0.7 , 0.2
Table 8. Tabular representation of the IFSS, ( S ˜ , E ) .
Table 8. Tabular representation of the IFSS, ( S ˜ , E ) .
X E υ 1 υ 2 υ 3 υ 4 υ 5
κ 1 0.4 , 0.5 0.5 , 0.5 0.6 , 0.4 0.3 , 0.4 0.3 , 0.3
κ 2 0.6 , 0.4 0.6 , 0.3 0.5 , 0.4 0.4 , 0.4 0.6 , 0.3
κ 3 0.3 , 0.4 0.4 , 0.4 0.5 , 0.4 0.6 , 0.4 0.5 , 0.5
κ 4 0.5 , 0.3 0.3 , 0.3 0.3 , 0.4 0.4 , 0.6 0.5 , 0.3
κ 5 0.6 , 0.4 0.5 , 0.3 0.5 , 0.5 0.5 , 0.4 0.3 , 0.4
Table 9. Tabular representation of the GGIFSS, ( S ˜ , E , g ˜ ) .
Table 9. Tabular representation of the GGIFSS, ( S ˜ , E , g ˜ ) .
X E υ 1 υ 2 υ 3 υ 4 υ 5
κ 1 0.4 , 0.5 0.5 , 0.5 0.6 , 0.4 0.4 , 0.3 0.3 , 0.3
κ 2 0.6 , 0.4 0.6 , 0.3 0.5 , 0.4 0.4 , 0.4 0.6 , 0.3
κ 3 0.3 , 0.4 0.4 , 0.4 0.5 , 0.4 0.4 , 0.6 0.5 , 0.5
κ 4 0.5 , 0.3 0.3 , 0.3 0.3 , 0.4 0.6 , 0.4 0.5 , 0.3
κ 5 0.6 , 0.4 0.5 , 0.3 0.5 , 0.5 0.4 , 0.5 0.3 , 0.4
α ˜ d 1 0.4 , 0.6 0.5 , 0.3 0.5 , 0.4 0.6 , 0.4 0.4 , 0.4
α ˜ d 2 0.5 , 0.4 0.4 , 0.5 0.5 , 0.3 0.4 , 0.5 0.4 , 0.2
Table 10. Tabular representation of the IFSS, ( S ˜ , E ) .
Table 10. Tabular representation of the IFSS, ( S ˜ , E ) .
X E υ 1 υ 2 υ 3
κ 1 0.5 , 0.5 0.4 , 0.6 0.6 , 0.4
κ 2 0.3 , 0.7 0.5 , 0.4 0.5 , 0.3
Table 11. Tabular representation of the IFSS, ( S ˜ , E , β ˜ ) .
Table 11. Tabular representation of the IFSS, ( S ˜ , E , β ˜ ) .
X E υ 1 υ 2 υ 3
κ 1 0.5 , 0.5 0.4 , 0.6 0.6 , 0.4
κ 2 0.3 , 0.7 0.5 , 0.4 0.5 , 0.3
β ˜ 0.4 , 0.2 0.6 , 0.4 0.5 , 0.3
Table 12. Tabular representation of the IFSS, ( S ˜ , E ) .
Table 12. Tabular representation of the IFSS, ( S ˜ , E ) .
X E υ 1 υ 2 υ 3
κ 1 0.3 , 0.5 0.5 , 0.3 0.6 , 0.2
κ 2 0.2 , 0.6 0.3 , 0.4 0.6 , 0.4
κ 3 0.4 , 0.4 0.4 , 0.3 0.5 , 0.3
Table 13. GIFSS ( S ˜ , E , β ˜ d 1 ) .
Table 13. GIFSS ( S ˜ , E , β ˜ d 1 ) .
X E υ 1 υ 2 υ 3
κ 1 0.3 , 0.5 0.5 , 0.3 0.6 , 0.2
κ 2 0.2 , 0.6 0.3 , 0.4 0.6 , 0.4
κ 3 0.4 , 0.4 0.4 , 0.3 0.5 , 0.3
β ˜ d 1 0.3 , 0.5 0.4 , 0.4 0.6 , 0.2
Table 14. GIFSS ( S ˜ , E , β ˜ d 2 ) .
Table 14. GIFSS ( S ˜ , E , β ˜ d 2 ) .
X E υ 1 υ 2 υ 3
κ 1 0.3 , 0.5 0.5 , 0.3 0.6 , 0.2
κ 2 0.2 , 0.6 0.3 , 0.4 0.6 , 0.4
κ 3 0.4 , 0.4 0.4 , 0.3 0.5 , 0.3
β ˜ d 2 0.3 , 0.6 0.3 , 0.4 0.5 , 0.4
Table 15. Opinions of experts on alternatives.
Table 15. Opinions of experts on alternatives.
X experts d 1 d 2
κ 1 0.4 , 0.5 0.4 , 0.4
κ 2 0.3 , 0.3 0.2 , 0.4

Share and Cite

MDPI and ACS Style

Hayat, K.; Ali, M.I.; Cao, B.-Y.; Karaaslan, F.; Yang, X.-P. Another View of Aggregation Operators on Group-Based Generalized Intuitionistic Fuzzy Soft Sets: Multi-Attribute Decision Making Methods. Symmetry 2018, 10, 753. https://doi.org/10.3390/sym10120753

AMA Style

Hayat K, Ali MI, Cao B-Y, Karaaslan F, Yang X-P. Another View of Aggregation Operators on Group-Based Generalized Intuitionistic Fuzzy Soft Sets: Multi-Attribute Decision Making Methods. Symmetry. 2018; 10(12):753. https://doi.org/10.3390/sym10120753

Chicago/Turabian Style

Hayat, Khizar, Muhammad Irfan Ali, Bing-Yuan Cao, Faruk Karaaslan, and Xiao-Peng Yang. 2018. "Another View of Aggregation Operators on Group-Based Generalized Intuitionistic Fuzzy Soft Sets: Multi-Attribute Decision Making Methods" Symmetry 10, no. 12: 753. https://doi.org/10.3390/sym10120753

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