Next Article in Journal
Bernoulli’s Problem for the Infinity-Laplacian Near a Set with Positive Reach
Next Article in Special Issue
Simple Additive Weighting Method Equipped with Fuzzy Ranking of Evaluated Alternatives
Previous Article in Journal
A Common Fixed-Point Theorem for Iterative Contraction of Seghal Type
Previous Article in Special Issue
Use of the PVM Method Computed in Vector Space of Increments in Decision Aiding Related to Urban Development
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Novel m—Polar Fuzzy Linguistic ELECTRE-I Method for Group Decision-Making

1
Department of Mathematics, University of the Punjab, New Campus, Lahore 54590, Pakistan
2
Department of Mathematics, COMSATS University Islamabad, Lahore Campus, Lahore 54590, Pakistan
*
Author to whom correspondence should be addressed.
Symmetry 2019, 11(4), 471; https://doi.org/10.3390/sym11040471
Submission received: 14 March 2019 / Revised: 26 March 2019 / Accepted: 29 March 2019 / Published: 2 April 2019
(This article belongs to the Special Issue Multi-Criteria Decision Aid methods in fuzzy decision problems)

Abstract

:
Linguistic variables play a vital role in several qualitative decision environments, in which decision-makers assume several feasible linguistic values or criteria instead of a single term for an alternative or variable. The motivation for the use of words or sentences instead of numbers is that linguistic classification and characterizations are generally less precise than numerical ones. In this research article, we encourage the fuzzy linguistic approach and introduce the novel concept known as m-polar fuzzy linguistic variable (mFLV) to increase the affluence of linguistic variables based on m-polar fuzzy (mF) approach. An mF set is an effective concept for interpreting uncertainty and fuzziness. The concept of mFLV is more versatile and sensible for dealing with real-life problems, when data comes from qualitative and multipolar information. We also introduce an mF linguistic ELECTRE-I approach to solve multiple-criteria decision-making (MCDM) and multiple-criteria group decision-making (MCGDM) problems, where the evaluation of the alternatives under suitable linguistic values are determined by the decision-makers. Furthermore, we validate the efficiency of our proposed technique by applying it to real-life examples, such as the salary analysis of companies and by selecting a corrupt country. Finally, we develop an algorithm of our proposed approach, present its flow chart, and generate computer programming code.

1. Introduction

Problems related to uncertain situations generally exist in multiple-criteria decision-making (MCDM) and multiple-criteria group decision-making (MCGDM), which are precisely appealing because of the difficult state of affairs of modeling and uncertainties. Several theories have been developed to overcome MCDM problems such as probability; however, in several directions, uncertainty is not probabilistic in description but relatively vague or imprecise. Thus, other theories, such as fuzzy set theory and fuzzy logic [1,2] have been prosperously applied to handle immature, imprecise, and vague information. Usually, to hold such a vagueness and imprecision, where two or more fundamentals of imprecision occur simultaneously, the modeling tools of ordinary fuzzy sets are limited. To overcome these limited approaches, several extensions and generalizations of fuzzy sets have been introduced, including hesitant fuzzy sets (HFSs) [3], bipolar fuzzy sets (BFSs) [4] and m-polar fuzzy sets (mF sets) [5].
In 2014, mF set theory was introduced by Chen et al. [5], which is the generalization of bipolar fuzzy sets. An mF set on a set X is a mapping μ : X [ 0 , 1 ] m . The concept behind it is that the multipolar information occurs because data of real-world problems are sometimes from multiple characters and agents. The membership value in mF sets is more understanding in obtaining uncertainty of data. The mF sets concede higher graphical representation of vague data, which promotes significantly better investigation in similarity measures, incompleteness and data relationships. Akram [6] introduced several notions based on mF sets and mF graphs including certain metrics in m-polar fuzzy graphs, certain types of irregular m-polar fuzzy graphs, and m-polar fuzzy hypergraphs.
The preceding fuzzy tools are suitable for problems that are defined only in quantitative situations, but generally, uncertainty is due to vagueness in a sense that is adopted by decision-makers in problems whose description is relatively qualitative. For such a situation, the fuzzy linguistic approach introduced by Zadeh [7,8,9] provided favorable outputs in many areas and applications [10]. In abandoning accuracy in the face of intense complexity, it is common to analyze the purpose of what might be called linguistic variables, i.e., a variable whose values are not numbers but words or sentences in artificial or natural language. The motivation for the use of words or sentences instead of numbers is that the linguistic classification and characterizations are generally less precise than numerical ones and have interesting uses in group decision analysis [11,12,13,14,15]. The linguistic approach is very significant in the context of personalized individual semantics in CWW [16,17]. Liu and Su [18] introduced the extended TOPSIS based on trapezoid fuzzy linguistic variables. Selvachandran and Salleh [19] proposed the concept of intuitionistic fuzzy linguistic variables and intuitionistic fuzzy hedges.
In the review of the fuzzy linguistic approach, including the distinct linguistic generalizations and extensions, it is shown that the design of linguistic information has actually been limited up till now, because mainly it is based on the concentration of very simple and single terms that should encircle and direct the information arranged by the decision-makers, respecting a linguistic variable. In recent years, several researchers, including Liao et al. [20] discussed the distance and similarity measures for hesitant fuzzy linguistic term sets and their application in MCDM. Later, Riera et al. [21] introduced some interesting properties of the fuzzy linguistic model based on discrete fuzzy numbers to manage hesitant fuzzy linguistic information. A term set is constituted by the completeness of values of a linguistic variable, which in assumption could have an infinite number of elements. Nonetheless, in distinct settings and directions, decision-makers who have suggestions regarding the problems defined under uncertainty cannot efficiently suggest a single term as an interpretation of their ability; they are determining the several terms at the same time or looking for a more complex linguistic term that is not usually defined in the linguistic term set. Therefore, Rodrguez et al. [22] worked with a view to overcome such limitations, taking into account the idea under the concept of HFS, to deal with several values in a membership function in a quantitative setting.
Elimination and choice translating reality (ELECTRE) is one of the MCDM methods, used in situations in which the decision-maker wants to include different criteria, and there may be a robust collection associated with the nature of evaluation surrounded by several standards. The ELECTRE approach was first introduced by Benayoun et al. [23]. Govindan et al. [24] studied the ELECTRE and made a comprehensive literature review on methodologies and applications. They focused on papers dealing with applications or developments of ELECTRE and ELECTRE-based methods. The modified concept of ELECTRE known as ELECTRE-I was introduced by Roy [25]. Furthermore, this approach was expended in a variety of alternative variants. For the multiple attribute decision-making methods, applications and widely used versions of ELECTRE-I, readers are referred to [26]. In the literature, most of these methods have been combined with fuzzy set theory by many researchers. Sevkli [27] compared crisp and fuzzy ELECTRE methods for supplier selection problems. For the selection of academic staff, Rouyendegh and Erkan [28] used the concept of fuzzy ELECTRE. Vahdani et al. [29] presented the comparison of fuzzy ELECTRE method with intuitionistic fuzzy ELECTRE method. Hatami-Marbini et al. [30] applied the method of fuzzy group ELECTRE for the interpretation of haphazard waste reprocessing of plants. Devi and Yadav [31] proposed intuitionistic fuzzy ELECTRE to choose the proper location of plants under group decision-making environments. Zandi and Roghanian [32] introduced a novel fuzzy ELECTRE method based on VIKOR method. Kheirkhah and Dehghani [33] applied the fuzzy group ELECTRE method to the evaluation of quality of public transportation facilities. Vahdani and Hadipour [34] presented the technique of interval-valued fuzzy ELECTRE. Hatami-Marbini and Tavana [35] expanded the method of ELECTRE-I and introduced the method of fuzzy ELECTRE-I with numerical examples to illustrate the effectiveness of their proposed method. Asghari et al. [36] used fuzzy ELECTRE-I method for the analysis of mobile payment models. Furthermore, fuzzy ELECTRE-I technique was applied in evaluating catering firm alternatives by Aytac et al. [37] and an environmental effect evaluation method based on fuzzy ELECTRE-I was composed by Kaya and Kahraman [38]. For handling MCDM problems Wu and Chen [39] developed the concept of intuitionistic fuzzy ELECTRE-I method. Chen and Xu [40] proposed a novel MCDM technique by combining HFSs with ELECTRE-II method. Lupo [41] calculated the service quality of three international airports using ELECTRE-III approach. ELECTRE methods have played a very significant role in the group of outranking methods. These methods enable us to use incomplete knowledge. For other notations, decision-making techniques and applications, readers are referred to [42,43,44,45,46,47,48,49,50,51,52,53].
Decision-making [54] can be examined as a conclusion of some intellectual and psychological processes that lead to the selection of an alternative among several options. Typical decision-making problems are described as selecting a place to visit, deciding which candidate is suitable for election, or choosing the best car to buy. It is worth noting that decision-making is a distinctive human ability, which is not naturally guided and based on obvious or absolute assumptions. It does not demand specific and complete analysis of information about the set of feasible alternatives. This fact motivated several researchers to apply fuzzy set theory to discuss vagueness and uncertainty in decision processes [55,56]. In recent years, many researchers have proposed very interesting methodologies [57,58] applied MCDM evaluations such as Antucheviciene et al. [59] to solve civil engineering problems by means of fuzzy and stochastic MCDM methods, which promoted complex decision support systems to help decision-makers reach a solution.
All previously proposed methods are unable to deal with the situation where given data is in the form of sentences and words with m different numeric and fuzzy values with its crisp domain. To handle this kind of information, we introduce the novel concept of the m-polar fuzzy linguistic variable (mFLV) and develop the MCDM method for decision-making problems, because all the traditional methods are ineffectual for studying this type of imprecise behavior of linguistic computations and assessments. We apply the theory of mFLV to ELECTRE-I method to introduce the mF linguistic ELECTRE-I technique for MCDM and MCGDM. The proposed technique is useful, when given data is in the form of sentences and words with m different numeric and fuzzy values within its crisp domain. Unlike classical ELECTRE techniques, precise information is not used in analysis of alternatives and criteria. An mF linguistic ELECTRE-I approach is used to get more accurate and consistent results when we must eliminate the choices and to deal with the systems with more than one agreement. The proposed approach is more flexible as compared to various other extensions of ELECTRE-I, because in this method a variable and its linguistic values are considered to be fixed criteria for the ranking and evaluation of alternatives. All linguistic values are further classified by m different numeric and fuzzy values, which provide more accurate and compatible results as compared to other extensions of ELECTRE-I. This approach is valid for resolving decision-making problems in our daily life. The organization of this research article is as follows.
In Section 2, we review some basic concepts and propose the concept of an mFLV with its practical example. In Section 3, we present an mF linguistic ELECTRE-I approach for MCDM. In Section 4, we present an mF linguistic ELECTRE-I approach for MCGDM. We applied our mF linguistic ELECTRE-I approaches to real-life examples. We also present our proposed methods as an algorithm and generate computer programming code. In Section 6, we present a conclusion.

2. m —Polar Fuzzy Linguistic Variable

In this section, we review some basic concepts and propose the concept of an mFLV with its practical example.
Definition 1
([5]). An mF set on a universe X is a function R = ( p 1 R ( r ) , p 2 R ( r ) , , p m R ( r ) ) : X [ 0 , 1 ] m , where the i-th projection mapping is defined as p i R : [ 0 , 1 ] m [ 0 , 1 ] . 0 = ( 0 , 0 , , 0 ) is the smallest element in [ 0 , 1 ] m and 1 = ( 1 , 1 , , 1 ) is the largest element in [ 0 , 1 ] m .
Definition 2
([7]). Linguistic variables are variables whose values are words or sentences in a natural or artificial language. If these words are described by fuzzy sets that are defined over a universal set, then the variables are called fuzzy linguistic variables.
Definition 3
([7,12]). A linguistic term set is defined by means of an ordered structure providing the term set that is distributed on a scale at which a total order has been defined. For example, a set S of seven terms could be written as follows:
S = { s o = n o t h i n g , s 1 = v e r y l o w , s 2 = l o w , s 3 = m e d i u m , s 4 = h i g h , s 5 = v e r y h i g h , s 6 = p e r f e c t } .
An m-polar fuzzy linguistic variable is a variable that considers words in natural language(s) as its values. The values of such a variable are characterized by mF sets that are defined in a universe that contains the variable.
Definition 4.
An m-polar fuzzy linguistic variable (mFLV) is characterized by a 4 tuple ( L v , V , P d , M ) such that
  • L v is the name of an mFLV,
  • V is the set of linguistic values of L v ,
  • P d = [ 0 , ] is the physical domain in which an mFLV takes its crisp values,
  • M is the semantic rule that relates every linguistic value in V to mF set.
We call the linguistic variable an mFLV, because its linguistic values are further classified by m different characteristics. However, P d is the physical domain in which an mFLV takes its crisp values and this domain can be arranged in parts for linguistic values according to given requirements. Finally, semantic rule M is described, which is actually a rule that differs the mFLV from previously defined linguistic variables. This rule relates the linguistic values ( V l s | l = 1 , 2 , , k ) of mFLV with mF set, which shows that when each linguistic value is further classified by m different characteristics, the degree of linguistic values is defined by
d l i = p i d l ( V l ) [ 0 , 1 ] , where i = 1 , 2 , , m .
It clearly shows m different characterizations of each linguistic value. The contribution of mFLV in real life is shown in Example 1.
Example 1.
Let “temperature" be a linguistic variable and V = { H o t , W a r m , C o o l , C o l d } be the set of its linguistic values. The physical domain for linguistic variable is P d = [0 C, 50 C], which is the set of real non-negative numbers, and each linguistic value has different range of physical domain given as follows
  • For cold temperature, physical domain is 0 C to 10 C,
  • For cool temperature, physical domain is 10 C to 20 C,
  • For warm temperature, physical domain is 20 C to 30 C,
  • For hot temperature, physical domain is 30 C to 50 C.
We call this linguistic variable a 3 polar fuzzy linguistic variable (3FLV), because we describe a semantic rule M that relates each linguistic value in set V with a 3 polar fuzzy set (3F set). According to the 3F set, each linguistic value is characterized as
  • p 1 d l ( V l ) serves as “heat energy”,
  • p 2 d l ( V l ) serves as “air pressure",
  • p 3 d l ( V l ) serves as “water vapors",
where l = 1 , 2 , 3 . Thus, we have
L v = { H o t , ( 0.90 , 0.71 , 0.20 ) , W a r m , ( 0.79 , 0.61 , 0.29 ) , C o o l , ( 0.45 , 0.39 , 0.69 ) , C o l d , ( 0.12 , 0.19 , 0.89 ) } .
In terms of the variable (temperature), four different linguistic values are discussed in Example 1, and each linguistic value is further classified by three different criteria or properties on which linguistic value shows its dependence. It shows the 3F restrictions on the values of a base variable. These 3F restrictions clearly show that each linguistic value totally depends on heat energy, air pressure, and water vapors. Thus, we call temperature a 3F linguistic variable by Definition 4.

3. m F Linguistic ELECTRE-I Approach for MCDM

In this section, we introduce an mF linguistic ELECTRE-I approach for MCDM problems, which is based on the concept of mFLV. We also apply this approach to real-life examples in Section 3.1, to show its importance and feasibility. In this approach, we choose L v an mFLV and A = { a 1 , a 2 , , a n } the set of mFLV of different alternatives. According to this mFLV, we take { V l | l = 1 , 2 , , k } the set of linguistic values. These linguistic values are classified by m different characteristics. The degree of each alternative ( a p A , p = 1 , 2 , , n ) over all the linguistic values V l s is given by mF set p = { ( a p , d p l i ) | i = 1 , 2 , m } , where d p l i = p i d p l ( a p , V l ) [ 0 , 1 ] and d p l i classify the different characteristics or properties of linguistic values. P d is the actual physical domain in which the mFLV takes its quantitative (crisp) values, i.e., P d = [ 0 , + ] . In this case, we take the most suitable m values from the physical domain of each linguistic value. A decision-maker is responsible for evaluating mFLV of n different alternatives under k different linguistic values.
(i). Suitable ratings of alternatives are assessed in terms of m different characteristics under the physical domain P d . Tabular representation of an mF linguistic decision matrix is given by Table 1.
(ii). Decision-maker has an authority to assign weights to each linguistic value of mFLV of alternatives according to his choice and the importance of each linguistic value. We discuss the case of mFLV so the decision-maker must assign the weights in terms of linguistic term set L = { L 1 = very low , L 2 = low , , L k = extremly high } . We suppose that the weights ( w l ( 0 , 1 ] ) assigned by the decision-maker satisfy the normalized condition. i.e., l = 1 k w l = 1 .
(iii). The weighted mF linguistic decision matrix is calculated as
W = [ ( e p l 1 , e p l 2 , , e p l m ) ] n × k ,
where
e p l 1 = w l d p l 1 , e p l 2 = w l d p l 2 , , e p l m = w l d p l m .
(iv). The mF linguistic concordance set is defined as
Y u v = { 1 l k | e u l e v l , u v ; u , v = 1 , 2 , , n } ,
where e p l = e p l 1 + e p l 2 + + e p l m .
(v). The mF linguistic discordance set is defined as
Z u v = { 1 l k | e u l e v l , u v ; u , v = 1 , 2 , , n } ,
where e p l = e p l 1 + e p l 2 + + e p l m .
(vi). The mF linguistic concordance indices are determined as
y u v = l Y u v w l ,
therefore, the mF linguistic concordance matrix is computed as
Y = y 12 y 13 y 1 n y 21 y 23 y 2 n y 31 y 32 y 3 n y n 1 y n 2 y n 3 .
(vii). The mF linguistic discordance indices are determined as
z u v = max l Z u v 1 m [ ( e u l 1 e v l 1 ) 2 + ( e u l 2 e v l 2 ) 2 + + ( e u l m e v l m ) 2 ] max l 1 m [ ( e u l 1 e v l 1 ) 2 + ( e u l 2 e v l 2 ) 2 + + ( e u l m e v l m ) 2 ] ,
therefore, the mF linguistic discordance matrix is be computed as
Z = z 12 z 13 z 1 n z 21 z 23 z 2 n z 31 z 32 z 3 n z n 1 z n 2 z n 3 .
(viii). For the rankings of alternatives, we compute threshold values known as mF linguistic concordance and discordance levels. The mF linguistic concordance and discordance levels are the average of mF linguistic concordance and discordance indices.
y ¯ = 1 n ( n 1 ) u = 1 u v n v = 1 u v n y u v ,
z ¯ = 1 n ( n 1 ) u = 1 u v n v = 1 u v n z u v .
(ix). The mF linguistic concordance dominance matrix according to its mF linguistic concordance level is computed as
R = r 12 r 13 r 1 n r 21 r 23 r 2 n r 31 r 32 r 3 n r n 1 r n 2 r n 3 ,
where,
r u v = 1 , y u v y ¯ ; 0 , y u v < y ¯ .
(x). The mF linguistic discordance dominance matrix according to its mF linguistic discordance level is computed as
S = s 12 s 13 s 1 n s 21 s 23 s 2 n s 31 s 32 s 3 n s n 1 s n 2 s n 3 ,
where,
s u v = 1 , z u v < z ¯ ; 0 , z u v z ¯ .
(xi). The aggregated mF linguistic dominance matrix is computed as
T = t 12 t 13 t 1 n t 21 t 23 t 2 n t 31 t 32 t 3 n t n 1 t n 2 t n 3 ,
where, t u v is defined as
t u v = r u v s u v .
(xii). Finally, rank the alternatives according to the outranking values of matrix T. For each pair of alternatives there exist a directed edge from alternative a u to a v if and only if t u v = 1 . Thus, the following three cases arise.
  • There exists a unique directed edge from a u to a v , which shows a u is preferred over a v .
  • There exists directed edges from a u to a v and a v to a u , which shows a u and a v are indifferent.
  • There does not exist any edge between a u and a v , which shows a u and a v are not comparable.

3.1. Salary Analysis of Companies

Salary analysis of companies is considered to be one of the scales to compare the economic condition of companies, and it is not an easy task, especially when a decision-maker has to evaluate them. We propose the mF linguistic ELECTRE-I method for MCDM, in which salary is a linguistic variable and S = { S c 1 , S c 2 , S c 3 , S c 4 , S c 5 } is the set of salary packages of five different well-known companies. V = { Low , Moderate , Good , Very good } is taken as the set of linguistic values of salary. The decision-maker must evaluate the companies on the basis of the linguistic values of their salary package and he has to design a physical domain in which the salary package takes its quantitative values, i.e., P d = [ 10 k , 100 k ] . The physical domain for linguistic values of salary package is given as follows:
  • For low salary, physical domain is below 30 k ,
  • For moderate salary, physical domain is 30 k 50 k ,
  • For good salary, physical domain is 50 k 70 k ,
  • For very good salary, physical domain is above 70 k .
Physical domain of each linguistic value shows the range of salary given by decision-maker. The degree of salary of each company, over all the linguistic values is given by 4F set p = { ( S c p , d p l i ) | i = 1 , 2 , 3 , 4 } ,  where
  • d p l 1 = p 1 d p l ( a p , V l ) serves for career,
  • d p l 2 = p 2 d p l ( a p , V l ) serves for labor market,
  • d p l 3 = p 3 d p l ( a p , V l ) serves for experience,
  • d p l 4 = p 4 d p l ( a p , V l ) serves for credential,
where p = 1 , 2 , , 5 , and l = 1 , 2 , 3 , 4 . The 4F set shows the further classifications or properties on which linguistic values depend.
(i). Tabular representation of 4F linguistic decision matrix is given by Table 2. It shows the different ratings of linguistic values assigned by a decision-maker, in which he assigns ratings according to his choice.
(ii). The normalized weights assigned to each linguistic value of 4FLV by decision-maker are given as follows:
w l = ( 0.15 , 0.19 , 0.27 , 0.39 ) .
(iii). The weighted 4F linguistic decision matrix is calculated in Table 3.
(iv). A 4F concordance set is calculated in Table 4.
(v). A 4F discordance set is calculated in Table 5.
(vi). A 4F linguistic concordance matrix is calculated as follows:
Y = 0.81 0.66 0.81 0.81 0.19 0.58 0.81 0.66 0.34 0.61 0.81 0.81 0.19 0.46 0.19 0.27 0.19 0.34 0.19 0.73 .
(vii). A 4F linguistic discordance matrix is calculated as follows:
Z = 0.3189 0.6639 0.6488 0.8293 1 1 1 0.6890 1 0.7222 0.5451 0.4451 1 1 1 1 1 1 1 0.9791 .
(viii). A 4F linguistic concordance level y ¯ = 0.5230 , and 4F linguistic discordance level z ¯ = 0.8421 are calculated.
(ix). A 4F linguistic concordance dominance matrix is calculated as follows:
R = 1 1 1 1 0 1 1 1 0 1 1 1 0 0 0 0 0 0 0 1 .
(x). A 4F linguistic discordance dominance matrix is calculated as follows:
S = 1 1 1 1 0 0 0 1 0 1 1 1 0 0 0 0 0 0 0 0 .
(xi). An aggregated 4F linguistic dominance matrix is calculated as follows:
T = 1 1 1 1 0 0 0 1 0 1 1 1 0 0 0 0 0 0 0 0 .
(xii). Finally, to rank the companies according to the outranking values of aggregated 4F linguistic dominance matrix T, we draw a directed graph for each pair of companies as shown in Figure 1.
From directed graph of companies as shown in Figure 1 the following cases arise.
  • There exists directed edges from S c 1 to S c 2 , S c 3 , S c 4 and S c 5 which show S c 1 is preferred over all other companies according to its salary package.
  • Similarly, S c 1 is preferred over S c 5 .
  • Similarly, S c 3 is preferred over S c 2 , S c 4 and S c 5 .
  • There does not exist any edge from S c 4 to any other company, which shows S c 4 is incomparable to others.
  • Similarly, S c 5 is incomparable to others.
Hence, S c 1 is the most dominated company as compared to others and has highest ranking according to its salary package.
We show the comparison of companies and summarize the whole procedure in Table 6.

4. m F Linguistic ELECTRE-I Approach for MCGDM

In this section, we introduce an mF linguistic ELECTRE-I approach for MCGDM problems, which is based on the concept of mFLV. We also apply this approach to real-life examples in Section 4.1, to show its importance and feasibility. In this approach, a group of r decision-makers ( D g , g = 1 , 2 , , r ) is responsible for evaluating mFLV of n different alternatives ( a p A , p = 1 , 2 , , n ) under k different linguistic values of L v ( V l , l = 1 , 2 , , k ). In the same sense as we used in MCDM, the degree of each alternative over all the linguistic values V l s is given by an mF set p = { ( a p , d p l g i ) | i = 1 , 2 , m } , where d p l g i = p i d p l g ( a p , V l ) [ 0 , 1 ] and d p l i classify the different properties or criteria of linguistic values according to each decision-maker.  
( i ) . In this case, a group of r decision-makers is responsible for evaluating mFLV of n different alternatives, and the suitable ratings of alternatives are according to all decision-makers that are assessed in terms of m different characteristics under the physical domain P d . Tabular representation of m F linguistic decision matrix under group of r decision-makers is given by Table 7, which describes the ratings given by each decision-maker.
Table 7 shows the different ratings of linguistic values assigned by a group of r decision-makers, in which each decision-maker assigns ratings according to his choice. The final m F linguistic decision matrix under group of decision-makers is the aggregated m F linguistic decision matrix that is the average ratings of all decision-makers. Aggregated ratings are calculated as follows:
d p l 1 = 1 r g = 1 r d p l g 1 , d p l 2 = 1 r g = 1 r d p l g 2 , , d p l m = 1 r g = 1 r d p l g m .
p = 1 , 2 , , n   and   l = 1 , 2 , , k .
For final decisions and ratings, aggregated m F linguistic decision matrix is calculated in Table 8 by using above-average ratings.
( ii ) . Decision-makers have an authority to assign weights to each linguistic value of alternatives according to their choice and the importance of each linguistic value, but we are discussing the case of mFLV so decision-makers have to assign the weights in terms of the linguistic term set L = { L 1 = extremely low , L 2 = medium , , L k = very high } . We suppose that the weights assigned by the decision-makers are
W g = ( w 1 g , w 2 g , , w k g ) ( 0 , 1 ] , g = 1 , 2 , , r .
Weights assigned by the decision-makers satisfy the normalized condition. i.e.,
l = 1 k w l g = 1 , g = 1 , 2 , , r .
Aggregated weights according to decision-makers are W = ( w 1 , w 2 , , w k ) , where,
w l = 1 r g = 1 r w l g , l = 1 , 2 , , k .
( iii ) . The weighted aggregated m F linguistic decision matrix W = [ ( e p l 1 , e p l 2 , , e p l m ) ] n × k under group decision-making is calculated as
e p l 1 = w l d p l 1 , e p l 2 = w l d p l 2 , , e p l m = w l d p l m .
Steps ( iv ) to ( xii ) are same as described in Section 3.

4.1. Selection of Corrupted Country

Usually, corruption is considered to be criminal activity or dishonesty initiated by a person or organization associated with the situation of authority, often to attain unauthorized benefits. Corruption may comprise several activities including misappropriation, extortion, and bribery, though it may also involve practices that are enforced in several countries. Corruption can appear on variant scales. It ranges from poor level of consideration between a small number of people—“petty corruption”—to the corruption that influences the government on a large scale—“grand corruption”—and corruption that is so common it is part of the everyday conformation of society, carrying corruption as one of the evidences of organized crime. Crime and corruption are regional, sociological junctures which occur with usual constancy in all countries on a global scale in fluctuating proportions and degrees. Increasingly, several tools and intimators have been developed that can rate several forms of corruption with growing accuracy.
  • Petty corruption
Petty corruption appears at a lower scale and occurs at the practical end of civil services when a civil authoritative person accommodates civil people. For example, in several small places such as police stations, registration offices, state licensing boards, and several other government and private sectors, it indicates the daily fault of power by low- and mid-level public officials in their interactions with frequent civilians, who are trying to approach basic services or goods in public places such as schools, police departments, hospitals, and other agencies.
  • Grand corruption
Grand corruption occurs at the highest scale of government in a way that depends on the expressive overthrow of the legal, political, and economic systems. Such a type of corruption is usually found in countries with dictatorial or authoritarian governments but also in those without sufficient policing of corruption.
  • Systemic corruption
Systemic corruption or endemic corruption is primarily due to the weaknesses of an institution, organization, or management. It can be differentiated with agents or individual officials, who perform corruptly within the system. Factors that encourage systemic corruption include elective powers, lack of transparency, conflicting stimulus, monopolistic powers, low pay, and a culture of immunity. Measuring the corruption at country level is a very difficult phenomenon for anti-corruption agencies because it is willfully hidden, and therefore it is almost impossible to evaluate it directly. Corruption inside a rustic government undermines the solidity of its establishments and tends to cause popular unrest. To overcome this difficulty and to measure the corruption at country level, we use mF linguistic ELECTRE-I approach for MCGDM, in which corruption is the linguistic variable and C = { C 1 , C 2 , C 3 , C 4 , C 5 , C 6 , C 7 } is the set of seven countries in which corruption must be measured. Let V = { petty corruption , grand corruption , systemic corruption } be the set of linguistic values of corruption. Anti-corruption agencies and media sources work as decision-makers; they have to evaluate the countries on the basis of the linguistic values of corruption and design a physical domain in which corruption takes its quantitative values, i.e., P d = [ 10 % , 100 % ] . The physical domain for linguistic values of corruption is given as follows:
  • For petty corruption, physical domain is 40 % 60 % ,
  • For grand corruption, physical domain is 50 % 80 % ,
  • For systemic corruption, physical domain is 30 % 70 % .
Physical domain of each linguistic value shows the scale of corruption given by group of decision-makers. The degree of corruption of each country over all the linguistic values are given by 4F set p = { ( C p , d p l i ) | i = 1 , 2 , 3 , 4 } , where
  • d p l 1 = p 1 d p l ( a p , V l ) serves for personal greed,
  • d p l 2 = p 2 d p l ( a p , V l ) serves for cultural environment,
  • d p l 3 = p 3 d p l ( a p , V l ) serves for Institutional scale,
  • d p l 4 = p 4 d p l ( a p , V l ) serves for organizational level,
where p = 1 , 2 , , 7 , and l = 1 , 2 , 3 . The 4F set shows the further criteria or properties on which linguistic values depend.
(i). Tabular representation of 4F linguistic group decision matrix is given by Table 9. It shows the different ratings of linguistic values assigned by a group of two decision-makers, in which each decision-maker assigns ratings according to his choice.
For final decision and ratings, aggregated 4F linguistic decision matrix is calculated in Table 10.
(ii). To measure the corruption at country level, anti-corruption agencies and media sources are considered as decision-makers and the weights assigned by decision-makers are given by Table 11.
(iii). The weighted aggregated 4F linguistic group decision matrix is calculated in Table 12.
(iv). A 4F linguistic concordance set is calculated in Table 13.
(v). A 4F linguistic discordance set is calculated in Table 14.
(vi). A 4F linguistic concordance matrix is calculated as follows:
Y = 0 0.3627 0 0.6917 0.3627 0.3627 1 1 1 1 1 1 0.6373 0 0.6373 0.3290 0.6917 0.6710 1 0 0.3627 0.6917 0.3627 0.6710 0.3083 0 0.6710 0.3083 0.6710 0.6710 0.6373 0 1 0.6373 0.3290 0.6710 0.6373 0.3290 0.3290 0.3290 0.3290 0.3290 .
(vii). A 4F linguistic discordance matrix is calculated as follows:
Z = 1 1 1 0.8900 1 1 0 0 0 0 0 0.3813 0.5221 1 0.644 0.5009 1 0.2448 0 1 1 1 1 0.7079 1 1 1 0.6792 0.9193 1 0.7328 1 0.8089 0.5182 1 0.9071 0.5693 1 1 1 0.8811 1 .
(viii). A 4F linguistic concordance level y ¯ = 0.5243 , and 4F linguistic discordance level z ¯ = 0.7359 are calculated.
(ix). A 4F linguistic concordance dominance matrix is calculated as follows:
R = 0 0 0 1 0 0 1 1 1 1 1 1 1 0 1 0 1 1 1 0 0 1 0 1 0 0 1 0 1 1 1 0 1 1 0 1 1 0 0 0 0 0 .
(x). A 4F linguistic discordance dominance matrix is calculated as follows:
S = 0 0 0 0 0 0 1 1 1 1 1 1 1 0 1 1 0 1 1 0 0 0 0 1 0 0 0 1 0 0 1 0 0 1 0 0 1 0 0 0 0 0 .
(xi). An aggregated 4F linguistic dominance matrix is calculated as follows:
T = 0 0 0 0 0 0 1 1 1 1 1 1 1 0 1 0 0 1 1 0 0 0 0 1 0 0 0 0 0 0 1 0 0 1 0 0 1 0 0 0 0 0 .
(xii). Finally, to rank the companies according to the outranking values of aggregated 4F linguistic dominance matrix T, we draw a directed graph for each pair of countries as shown in Figure 2.
From directed graph of countries as shown in Figure 2 the following cases arise.
  • There does not exist any edge from C 1 to any other country, which shows C 1 is incomparable to others.
  • There exists directed edges from C 2 to C 1 , C 3 , C 4 , C 5 , C 6 and C 7 which show C 2 is preferred over all other countries.
  • Similarly, C 3 is preferred over C 1 , C 4 and C 7 .
  • Similarly, C 4 is preferred over C 1 and C 7 .
  • There does not exist any edge from C 5 to any other country, which shows S C 5 is incomparable to others.
  • C 6 is preferred over C 1 and C 4 .
  • Similarly, C 7 is preferred over C 1 .
Hence, the country C 2 is most dominated as compared to others. Hence C 2 is the most corrupted country.
We show the comparison of countries and summarize the whole procedure in Table 15.
We present our proposed method of decision-making in an Algorithm 1 and show its flow chart in Figure 3.
Algorithm 1: The algorithm of proposed approach for MCGDM.
Step 1.
Input
n, no. of alternatives against linguistic variable.
k, no. of linguistic values.
m, no. of membership values.
g, no. of decision-makers.
D g , mF linguistic decision matrices according to decision-makers.
w l g , weights according to decision-makers.
Step 2.
Compute an aggregated mF linguistic decision matrix D.
Step 3.
Compute aggregated weights W .
Step 4.
Compute the weighted aggregated mF linguistic decision matrix W.
Step 5.
Compute mF linguistic concordance set Y u v .
Step 6.
Compute mF linguistic discordance set Z u v .
Step 7.
Compute mF linguistic concordance indices y u v and concordance matrix Y.
Step 8.
Compute mF linguistic discordance indices z u v and discordance matrix Z.
Step 9.
Compute mF linguistic concordance and discordance levels y ¯ and z ¯ .
Step 10.
Compute mF linguistic concordance dominance matrix R.
Step 11.
Compute mF linguistic discordance dominance matrix S.
Step 12.
Compute aggregated mF linguistic dominance matrix T.
Step 13.
Output
The most dominating alternative with maximum value of T.

5. Discussion of Proposed Approach

In this section, we discuss the novelty of our purposed concept and its decision-making methods.
  • Linguistic variables are considered to be the generalizations of numerical variables and take the concept of words in natural languages as values and associate human knowledge into various systems in an organized, efficient and productive manner. In many applications of decision-making, where the situations totally depend upon uncertainty and imprecision, fuzzy linguistic variables are used extensively. All previously defined concepts related to linguistic variables are insufficient for explaining the situation, when the given data is in the form of sentences and words with m different numeric and fuzzy values within its crisp domain. It is actually the generalization of fuzzy linguistic variables, because in the proposed concept the linguistic values are further characterized into m different numeric and fuzzy values.
  • ELECTRE-I method is preferred over all other MCDM methods, because it is a binary outranking method in which the alternatives can be compared without consideration of their fine preference. It is more reliable as it does not depend on expert personal opinions, and alternatives can be eliminated that are dominated by other alternatives to a specified degree.
  • The comparison of mF linguistic variable and mF linguistic ELECTRE-I method with fuzzy linguistic approaches and decision-making methods given in the literature is described by an example of salary analysis of companies given in Section 3.1. In this example, we consider salary as a linguistic variable and define its linguistic values such as low, moderate, good, and very good; we call it 4F linguistic variable because we categorize these linguistic values in a further four different fuzzy values such as career, labor market, experience, and credential. Previous knowledge tells us about the linguistic values of a linguistic variable, but it is unable to deal the criteria on which linguistic values depend. An mF linguistic variable covers all the aspects on which salary is based and an mF linguistic ELECTRE-I approach can deal with such a complex situation and provides flexible decision results.

6. Conclusions

ELECTRE has been considered to be one of the MCDM techniques, based on the outranking relations, which has induced a new preference relation called incomparability used to handle situations in which the decision-makers are unable to compare two alternatives. Traditional methods are deemed ineffectual for studying the imprecise behavior of linguistic computations and assessments, because it has become difficult to collect data about linguistic assessments in terms of numeric and fuzzy values. To deal with such a complexity, we have proposed the concept of mFLV, which can deal with the situation when we have data in terms of linguistic assessments and m different numeric or fuzzy values as well. We also have developed an mF linguistic ELECTRE-I approach to deal with MCDM and MCGDM problems, which are used to handle complex situations of mFLV and compile the outranking relations of alternatives to choose and compare the best alternatives, among others. The mF linguistic ELECTRE-I method is used to get more authentic and consistent results, when we must eliminate the choices and to deal with the systems with more than one arrangement. Moreover, the proposed method is considered more efficient than previously existing methods, when the alternatives are eliminated that are dominated by other alternatives to a specified degree with linguistic values. However, the proposed approach is unable to determine and describe the weights assigned by decision-makers, although the weights considered in this approach are normalized but arbitrary. Finally, we have applied our technique to real-life problems, developed an algorithm, presented its flow chart, and generated computer programming code. In the future, we plan to extend our research study to MCDM and MCGDM methods such as PROMETHEE, AHP, and other versions of ELECTRE based on mFLV.

Author Contributions

A.A., M.A., I.A. and K.N. conceived of the presented concept. A.A. and M.A. developed the theory and performed the computations. I.A. and K.N. verified the analytical methods.

Funding

Third author is thankful to Higher Education Commission, Pakistan for its partial support.

Acknowledgments

The authors are grateful to the Editor of the Journal and anonymous referees for their detailed and valuable comments.

Conflicts of Interest

The authors declare that they have no conflict of interest regarding the publication of this research article.

Appendix A

We show the computer programming code of Algorithm 1 in Table A1 by using MATLAB R2014a.
Table A1. MATLAB computer programming code of proposed approach for MCDM and MCGDM.
Table A1. MATLAB computer programming code of proposed approach for MCDM and MCGDM.
MATLAB Computer Programming Code
1.          clc
2.          n=input(‘no.  of  alternatives  against  linguistic  variable’);
3.          k=input(‘no.of  linguistic  values’);
4.          m=input(‘no.  of  membership  values’);
5.          g=input(‘no.  of  decision    maker’);
6.          Rr=(1:n);Cr=1:m∗k;Cw=1:k;A_g=zeros(n,m∗k);w_g=zeros(1,k);
7.            for  i=1:g
8.                    D=  input(‘enter  the  m-polar  fuzzy  linguistic  decision  matrix  nxkxm’);
9.          A_g(Rr,Cr)=A_g(Rr,Cr)+D;w=input(‘enter  the  weights’)w_g(1,Cw)=w_g(1,Cw)+w;
10.      end
11.    A_g=A_g/g
12.    w=w_g/g
13.    W=zeros(n,m∗k);Sm=zeros(n,k);Y_uv=zeros(n,n∗k);  Z_uv=zeros(n,n∗k);
14.    Y=zeros(n,n);  Z=zeros(n  ^  2,m∗k);
15.      for  p=1:n
16.              l=1;
17.                for  q=1:m∗k
18.                        W(p,q)=A_g(p,q).∗w(1,l);
19.                          if  mod(q,m)==0
20.                                  l=l+1;
21.                          end
22.                end
23.      end
24.    W
25.      for  p=1:n
26.              l=1;
27.              for  j=1:m∗k
28.                      Sm(p,l)=Sm(p,l)+W(p,j);
29.                        if  mod(j,m)==0
30.                                  l=l+1;
31.                        end
32.              end
33.      end
34.    Q=Sm’
35.    Q=Q(:)’;
36.      for  p=1:n
37.              for  j=1:k∗n
38.                      l=mod(j,k);
39.                        if  l==0
40.                                  l=k;
41.                        end
42.                        if  Sm(p,l)≥  Q(1,j)
43.                                  Y_uv(p,j)=1;
44.                        end
45.                        if  Sm(p,l)≤  Q(1,j)
46.                                  Z_uv(p,j)=1;
47.                        end
48.              end
49.      end
50.    fprintf(‘\n  concordance  Set  Y_uv  =\n’)
51.      for  u=1:n
52.            v=0;
53.              for  j=1:k∗n
54.                        if  mod(j,k)==1
55.                                  v=v+1;
56.                        end
57.                      l=mod(j,k);
58.                        if  l==0
59.                                  l=k;
60.                        end
61.                        if  u==v
62.                                    if  l==1
63.                                          fprintf(‘            -                          ’)
64.                                    end
65.                        elseif  u  =v
66.                                    if  l==1
67.                                          fprintf(‘        {            ’)
68.                                          c=0;
69.                                    end
70.                                    if  Y_uv(u,j)==1;
71.                                          c=c+1;
72.                                          fprintf(‘%d,’,l)
73.                                    end
74.                                    if  l==k  &  c==0
75.                                          fprintf(‘  ,’,l)
76.                                    end
77.                                    if  l==k
78.                                          fprintf(‘\b}                          ’)
79.                                    end
80.                        end
81.              end
82.            fprintf(‘\n’)
83.      end
84.        fprintf(‘\n  discordance  Set  Z_uv  =\n’)                                                                                                                                                            
85.          for  u=1:n
86.                      v=0;
87.                        for  j=1:k∗n
88.                                    if  mod(j,k)==1
89.                                          v=v+1;
90.                                    end
91.                                  l=mod(j,k);
92.                                    if  l==0
93.                                          l=k;
94.                                    end
95.                                    if  u==v
96.                                        if  l==1
97.                                            fprintf(‘        -                          ’)
98.                                        end
99.                                    elseif  u∼=v
100.                                      if  l==1
101.                                          fprintf(‘      {                          ’)
102.                                          c=0;
103.                                      end
104.                                      if  Z_uv(u,j)==1;
105.                                          c=c+1;
106.                                          fprintf(‘      %d,’    ,l      )
107.                                      end
108.                                      if  l==k  &  c==0
109.                                          fprintf(‘      ,’    ,l      )
110.                                      end
111.                                      if  l==k
112.                                          fprintf(‘\b}                          ’)
113.                                  end
114.                      end
115.        end
116.      fprintf(‘\n                ’)
117.    end
118.    for  u=1:n
119.            v=0;
120.              for  j=1:k∗n
121.                          if  mod(j,k)==1
122.                                  v=v+1;
123.                          end
124.                        l=mod(j,k);
125.                          if  l==0
126.                                  l=k;
127.                          end
128.                          if  u  =v
129.                                    if  Y_uv(u,j)==1
130.                                            Y(u,v)=Y(u,v)+w(1,l);
131.                                    end
132.                          end
133.                end
134.      end
135.    fprintf(‘\nY=\n’)
136.      for  u=1:n
137.                for  v=1:n
138.                          if  u==v
139.                                  fprintf(‘          -                          ’)
140.                          else
141.                                  fprintf(‘%.4f                          ’,Y(u,v))
142.                          end
143.                end
144.              fprintf(‘\n                      ’)
145.      end
146.    v=0;r=0;        l=1:m∗k;  B=zeros(n,n∗k);r=0;D=zeros(n,n);Z=zeros(n,n);
147.      for  u=1:n
148.                for  q=1:n
149.                        v=v+1;
150.                        z(v,l)=(W(u,l)-W(q,l)).  ^  2;
151.                end
152.      end
153.    A=zeros(n  ^  2,k);r=0;  s=0;      C=zeros(n  ^  2,1);D=zeros(n,n);Z1=zeros(n,n);                                          
154.      for  i=1:n  ^  2
155.              q=0;
156.                for  j=1:m∗k
157.                          if  mod(j,m)==1
158.                                  q=q+1;
159.                          end
160.                        A(i,q)=A(i,q)+z(i,j);
161.                end
162.              A(i,:)=sqrt(A(i,:)/m);
163.              C(i,1)=max(A(i,:));
164.                if  mod(i,n)==1
165.                        r=r+1;
166.                end
167.                for  j=1:k
168.                        s=s+1;
169.                        B(r,s)=A(i,j);
170.                end
171.              t=mod(i,n);
172.                if  t==0
173.                        t=n;
174.                end
175.              Z1(r,t)=C(i,1);
176.                if  mod(i,n)==0
177.                        s=0;
178.                end
179.      end
181.      for  i=1:n
182.              q=0;
183.                for  j=1:k∗n
184.                          if  mod(j,k)==1
185.                                q=q+1;
186.                          end
187.                        l=mod(j,k);
188.                          if  l==0
189.                                  l=k;
190.                          end
191.                          if  Z_uv(i,j)==1
192.                                  D(i,q)=max(D(i,q),B(i,j));
193.                          end
194.                end
195.      end
196.      for  u=1:n
197.                for  v=1:n
198.                          if  u  =v
199.                                  Z(u,v)=D(u,v)/Z1(u,v);
200.                          end
201.                end
202.      end
203.    fprintf(‘\nZ=\n’)
204.      for  u=1:n
205.                for  v=1:n
206.                          if  u==v
207.                                  fprintf(‘        -                            ’)
208.                          else
209.                                  fprintf(‘%.4f                          ’,Z(u,v))
210.                          end
211.                end
212.              fprintf(‘            \n            ’)
213.      end
214.    a=sum(Y);                b=sum(a);        a1=sum(Z);    b1=sum(a1);    R=zeros(n,n);S=zeros(n,n);        
215.    y_bar=b/(n∗(n-1))
216.    z_bar=b1/(n∗(n-1))
217.      for  u=1:n
218.                for  v=1:n
219.                          if  u  =v
220.                                    if  Y(u,v)≥  y_bar
221.                                            R(u,v)=1;
222.                                    end
223.                                    if  Z(u,v)<  z_bar
224.                                            S(u,v)=1;
225.                                    end
226.                          end
227.                end
228.      end
229.    fprintf(‘\nR=\n’)
230.      for  u=1:n
231.                for  v=1:n
232.                          if  u==v
233.                                  fprintf(‘-                          ’)
234.                          else
235.                                  fprintf(‘%d                          ’,R(u,v))                                                                                                                                                
236.                          end
237.                end
238.              fprintf(‘      \n            ’)
239.      end
240.    fprintf(‘\nS=\n’)
241.      for  u=1:n
242.                for  v=1:n
243.                          if  u==v
244.                                  fprintf(‘-                          ’)
245.                          else
246.                                  fprintf(‘%d                          ’,S(u,v))
247.                          end
248.                end
249.              fprintf(‘\n                        ’)
250.      end
251.    T=R.∗S;  fprintf(‘\nT=\n’)
252.      for  u=1:n
253.                for  v=1:n
254.                          if  u==v
255.                                  fprintf(‘-                          ’)
256.                          else
257.                                  fprintf(‘%d                          ’,T(u,v))
258.                          end
259.                end
260.              fprintf(‘      \n            ’)
261.      end
262.    G=digraphs(T)
263.    plot(G)

References

  1. Dubois, D.; Prade, H. Fuzzy Sets and Systems: Theory and Applications; Kluwer: New York, NY, USA, 1980. [Google Scholar]
  2. Zadeh, L.A. Fuzzy sets. Inf Control 1965, 8, 338–353. [Google Scholar] [CrossRef]
  3. Torra, V.; Narukawa, Y. On hesitant fuzzy sets and decisions. IEEE Int. Conf. Fuzzy Syst. 2009, 1–3, 1378–1382. [Google Scholar]
  4. Zhang, W.-R. Bipolar fuzzy sets and relations: A computational framework forcognitive modeling and multiagent decision analysis. Proc. IEEE Conf. 1994, 305–309. [Google Scholar] [CrossRef]
  5. Chen, J.; Li, S.; Ma, S.; Wang, X. m—Polar fuzzy sets: An extension of bipolar fuzzy sets. Sci. World J. 2014, 2014, 416530. [Google Scholar] [CrossRef]
  6. Akram, M. m—Polar fuzzy graphs-theory, methods & applications. Stud. Fuzziness Soft Comput. 2019, 371, 1–284. [Google Scholar]
  7. Zadeh, L.A. The concept of a linguistic variable and its application to approximate reasoning, part I. Inf. Sci. 1975, 8, 199–249. [Google Scholar] [CrossRef]
  8. Zadeh, L.A. The concept of a linguistic variable and its application to approximate reasoning, part II. Inf. Sci. 1975, 8, 301–357. [Google Scholar] [CrossRef]
  9. Zadeh, L.A. The concept of a linguistic variable and its application to approximate reasoning, part III. Inf. Sci. 1975, 9, 43–80. [Google Scholar] [CrossRef]
  10. RodrA-guez, R.M.; MartA-nez, L.; Herrera, F. A group decision-making model dealing with comparative linguistic expressions based on hesitant fuzzy linguistic term sets. Inf. Sci. 2013, 241, 28–42. [Google Scholar] [CrossRef]
  11. Herrera, F.; Herrera-Viedma, E. Linguistic decision analysis: Steps for solving decision problems under linguistic information. Fuzzy Sets Syst. 2000, 115, 67–82. [Google Scholar] [CrossRef]
  12. Herrera, F.; Herrera-Viedma, E.; Martinez, L. A fusion approach for managing multi-granularity linguistic term sets in decision making. Fuzzy Sets Syst. 2000, 114, 43–58. [Google Scholar] [CrossRef]
  13. Meng, F.; Chen, X.; Zhang, Q. Multi-attribute decision analysis under a linguistic hesitant fuzzy environment. Inf. Sci. 2014, 267, 287–305. [Google Scholar] [CrossRef]
  14. Ren, F.; Kong, M.; Pei, Z. A new hesitant fuzzy linguistic TOPSIS method for group multi-criteria linguistic decision-making. Symmetry 2017, 9, 289. [Google Scholar] [CrossRef]
  15. Wang, R.C.; Chuu, S.J. Group decision-making using a fuzzy linguistic approach for evaluating the flexibility in a manufacturing system. Eur. J. Oper. Res. 2004, 154, 563–572. [Google Scholar] [CrossRef]
  16. Herrera, F.; Alonso, S.; Chiclana, F.; Herrera-Viedma, E. Computing with words in decision-making: Foundations, trends and prospects. Fuzzy Opt. Decis. Mak. 2009, 8, 337–364. [Google Scholar] [CrossRef]
  17. Mendel, J.M.; Zadeh, L.A.; Trillas, E.; Yager, R.; Lawry, J.; Hagras, H.; Guadarrama, S. What computing with words means to me [discussion forum]. IEEE Comput. Intell. Mag. 2010, 5, 20–26. [Google Scholar] [CrossRef]
  18. Liu, P.D.; Su, Y. The extended TOPSIS based on trapezoid fuzzy linguistic variables. J. Converg. Inf. Technol. 2010, 5, 38–53. [Google Scholar]
  19. Selvachandran, G.; Salleh, A.R. Intuitionistic fuzzy linguistic variables and intuitionistic fuzzy hedges. Far East J. Math. Sci. 2014, 95, 221–233. [Google Scholar]
  20. Liao, H.C.; Xu, Z.S.; Zeng, X.J. Distance and similarity measures for hesitant fuzzy linguistic term sets and their application in multi-criteria decision-making. Inf. Sci. 2014, 271, 125–142. [Google Scholar] [CrossRef]
  21. Riera, J.V.; Massanet, S.; Herrera-Viedma, E.; Torrens, J. Some interesting properties of the fuzzy linguistic model based on discrete fuzzy numbers to manage hesitant fuzzy linguistic information. Appl. Soft Comput. 2015, 36, 383–391. [Google Scholar] [CrossRef]
  22. RodrA-guez, R.M.; MartA-nez, L.; Herrera, F. Hesitant fuzzy linguistic term sets for decision-making. IEEE Trans. Fuzzy Syst. 2012, 20, 109–119. [Google Scholar] [CrossRef]
  23. Benayoun, R.; Roy, B.; Sussman, N. Manual de reference du programme electre. Note Synth. Form. 1966, 25, 79. [Google Scholar]
  24. Govindan, K.; Jepsen, M.B. ELECTRE: A comprehensive literature review on methodologies and applications. Eur. J. Oper. Res. 2016, 250, 1–29. [Google Scholar] [CrossRef]
  25. Roy, B. Classement et choix en presence de points de vue multiples. Revue Franiaise d Informatique et de Recherche Operationnelle 1968, 2, 57–75. [Google Scholar] [CrossRef]
  26. Tzeng, G.H.; Huang, J.J. Multiple Attribute Decision Making: Methods and Applications; Chapman and Hall/CRC: Boca Raton, FL, USA, 2011. [Google Scholar]
  27. Sevkli, M. An application of the fuzzy ELECTRE method for supplier selection. Int. J. Prod. Res. 2010, 48, 3393–3405. [Google Scholar] [CrossRef]
  28. Rouyendegh, B.D.; Erkan, T.E. An Application of the Fuzzy ELECTRE Method for Academic Staff Selection. Hum. Factors Ergon. Manuf. Serv. Ind. 2013, 23, 107–115. [Google Scholar] [CrossRef]
  29. Vahdani, B.; Mousavi, S.M.; Tavakkoli-Moghaddam, R.; Hashemi, H. A new design of the elimination and choice translating reality method for multi-criteria group decision-making in an intuitionistic fuzzy environment. Appl. Math. Model. 2013, 37, 1781–1799. [Google Scholar] [CrossRef]
  30. Hatami-Marbini, A.; Tavana, M.; Moradi, M.; Kangi, F. A fuzzy group ELECTRE method for safety and health assessment in hazardous waste recycling facilities. Saf. Sci. 2013, 51, 414–426. [Google Scholar] [CrossRef]
  31. Devi, K.; Yadav, S.P. A multicriteria intuitionistic fuzzy group decision making for plant location selection with ELECTRE method. Int. J. Adv. Manuf. Technol. 2013, 66, 1219–1229. [Google Scholar] [CrossRef]
  32. Zandi, A.; Roghanian, E. Extension of fuzzy ELECTRE based on VIKOR method. Comput. Ind. Eng. 2013, 66, 258–263. [Google Scholar] [CrossRef]
  33. Kheirkhah, A.S.; Dehghani, A. The group fuzzy ELECTRE method to evaluate the quality of public transportation service. Int. J. Eng. Math. Comput. Sci. 2013, 1. [Google Scholar]
  34. Vahdani, B.; Hadipour, H. Extension of the ELECTRE method based on interval-valued fuzzy sets. Soft Comput. 2011, 15, 569–579. [Google Scholar] [CrossRef]
  35. Hatami-Marbini, A.; Tavana, M. An extension of the ELECTRE-I method for group decision-making under a fuzzy environment. Omega 2011, 39, 373–386. [Google Scholar] [CrossRef]
  36. Asghari, F.; Amidian, A.A.; Muhammadi, J.; Rabiee, H. A fuzzy ELECTRE approach for evaluating mobile payment business models. In Proceedings of the 2010 International Conference on Management of e-Commerce and e-Government, Chengdu, China, 23–24 October 2010; pp. 351–355. [Google Scholar]
  37. Aytac, E.; Tus-Isk, A.; Kundaki, N. Fuzzy ELECTRE-I method for evaluating catering firm alternatives. Edge Acad. Rev. 2011, 11, 125–134. [Google Scholar]
  38. Kaya, T.; Kahraman, C. An integrated fuzzy AHP-ELECTRE methodology for environmental impact assessment. Expert Syst. Appl. 2011, 38, 8553–8562. [Google Scholar] [CrossRef]
  39. Wu, M.-C.; Chen, T.-Y. The ELECTRE multicriteria analysis approach based on Atanssovs intuitionistic fuzzy sets. Expert Syst. Appl. 2011, 38, 12318–12327. [Google Scholar] [CrossRef]
  40. Chen, N.; Xu, Z. Hesitant fuzzy ELECTRE-II approach: A new way to handle multi-criteria decision-making problems. Inf. Sci. 2015, 292, 175–197. [Google Scholar] [CrossRef]
  41. Lupo, T. Fuzzy ServPerf model combined with ELECTRE-III to comparatively evaluate service quality of international airports in Sicily. J. Air Transp. Manag. 2015, 42, 249–259. [Google Scholar] [CrossRef]
  42. Akram, M.; Adeel, A. TOPSIS approach for MAGDM based on interval-valued hesitant fuzzy N-soft environment. Int. J. Fuzzy Syst. 2018, 1–17. [Google Scholar] [CrossRef]
  43. Akram, M.; Adeel, A. Novel hybrid decision-making methods based on mF rough information. Granul. Comput. 2018, 1–17. [Google Scholar] [CrossRef]
  44. Akram, M.; Adeel, A.; Alcantud, J.C.R. Group decision-making methods based on hesitant N-soft sets. Expert Syst. Appl. 2019, 115, 95–105. [Google Scholar] [CrossRef]
  45. Akram, M.; Ali, G.; Alshehri, N.O. A new multi-attribute decision-making method based on m-polar fuzzy soft rough sets. Symmetry 2017, 9, 271. [Google Scholar] [CrossRef]
  46. Alghamdi, M.A.; Alshehria, N.O.; Akram, M. Multi-criteria decision-making methods in bipolar fuzzy environment. Int. J. Fuzzy Syst. 2018, 20, 2057–2064. [Google Scholar] [CrossRef]
  47. Chen, S.M.; Lee, L.W. Fuzzy multiple attributes group decision-making based on the ranking values and the arithmetic operations of interval type-2 fuzzy sets. Expert Syst. Appl. 2010, 37, 824–833. [Google Scholar] [CrossRef]
  48. Chen, N.; Xu, Z.; Xia, M. The ELECTRE-I multi-criteria decision-making method based on hesitant fuzzy sets. Int. J. Inf. Technol. Decis. Mak. 2015, 14, 621–657. [Google Scholar] [CrossRef]
  49. Li, X.; Zhang, X. Single-valued neutrosophic hesitant fuzzy choquet aggregation operators for multi-attribute decision-making. Symmetry 2018, 10, 50. [Google Scholar] [CrossRef]
  50. Liu, P.; Teng, F. Some muirhead mean operators for probabilistic linguistic term sets and their applications to multiple attribute decision-making. Appl. Soft Comput. 2018, 68, 396–431. [Google Scholar] [CrossRef]
  51. Montazer, G.A.; Saremi, H.Q.; Ramezani, M. Design a new mixed expert decision aiding system using fuzzy ELECTRE-III method for vendor selection. Expert Syst. Appl. 2009, 36, 10837–10847. [Google Scholar] [CrossRef]
  52. Rouyendegh, B.D.; Erol, S. Selecting the best project using the fuzzy ELECTRE method. Math. Prob. Eng. 2012, 790142. [Google Scholar] [CrossRef]
  53. Yang, H.; Wang, X.; Qin, K. New similarity and entropy measures of interval neutrosophic sets with applications in multi-attribute decision-making. Symmetry 2019, 11, 370. [Google Scholar] [CrossRef]
  54. Evangelos, T. Multi-Criteria Decision-Making Methods: A Comparative Study; Kluwer Academic Publishers: Dordrecht, The Netherlands, 2000. [Google Scholar]
  55. Kahraman, C.; Ertay, T.; Buyukozkan, G. A fuzzy optimization model for QFD planning process using analytic network approach. Eur. J. Oper. Res. 2006, 171, 390–411. [Google Scholar] [CrossRef]
  56. Shahrestani, M.; Yao, R.; Cook, G.K. A fuzzy multiple attribute decision making tool for HVAC&R systems selection with considering the future probabilistic climate changes and electricity decarbonisation plans in the UK. Energy Buil. 2018, 159, 398–418. [Google Scholar]
  57. Wang, J.J.; Jing, Y.Y.; Zhang, C.F. Weighting methodologies in multi-criteria evaluations of combined heat and power systems. Int. J. Energy Res. 2009, 33, 1023–1039. [Google Scholar] [CrossRef]
  58. Wang, J.J.; Zhang, C.F.; Jing, Y.Y.; Zheng, G.Z. Using the fuzzy multi-criteria model to select the optimal cool storage system for air conditioning. Energy Build. 2008, 40, 2059–2066. [Google Scholar] [CrossRef]
  59. Antucheviciene, J.; Kala, Z.; Marzouk, M.; Vaidogas, E.R. Solving civil engineering problems by means of fuzzy and stochastic MCDM methods: Current state and future research. Math. Prob. Eng. 2015, 2015, 362579. [Google Scholar] [CrossRef]
Figure 1. Graphical representation of outranking relation of companies.
Figure 1. Graphical representation of outranking relation of companies.
Symmetry 11 00471 g001
Figure 2. Graphical representation of outranking relation of countries.
Figure 2. Graphical representation of outranking relation of countries.
Symmetry 11 00471 g002
Figure 3. mF linguistic ELECTRE-I approach for MCDM and MCGDM.
Figure 3. mF linguistic ELECTRE-I approach for MCDM and MCGDM.
Symmetry 11 00471 g003
Table 1. Tabular representation of mF linguistic decision matrix.
Table 1. Tabular representation of mF linguistic decision matrix.
m Polar FuzzyPhysical Domain
Linguistic P d 1 P d 2 P d k
Variable m Polar Fuzzy Linguistic Values
L v V 1 V 2 V k
a 1 ( d 11 1 , d 11 2 , , d 11 m ) ( d 12 1 , d 12 2 , , d 12 m ) ( d 1 k 1 , d 1 k 2 , , d 1 k m )
a 2 ( d 21 1 , d 21 2 , , d 21 m ) ( d 22 1 , d 22 2 , , d 22 m ) ( d 2 k 1 , d 2 k 2 , , d 2 k m )
a n ( d n 1 1 , d n 1 2 , , d n 1 m ) ( d n 2 1 , d n 2 2 , , d n 2 m ) ( d n k 1 , d n k 2 , , d n k m )
Table 2. Tabular representation of 4F linguistic decision matrix for Salary.
Table 2. Tabular representation of 4F linguistic decision matrix for Salary.
4 Polar FuzzyPhysical Domain
LinguisticBelow 30 k 30 k 50 k 50 k 70 k Above 70 k
Variable 4 Polar Fuzzy Linguistic Values
(Salary)LowModerateGoodVery Good
S c 1 (0.3,0.4,0.5,0.4)(0.4,0.6,0.6,0.3)(0.6,0.7,0.8,0.7)(0.8,0.9,0.8,1.0)
S c 2 (0.2,0.5,0.4,0.3)(0.5,0.5,0.6,0.4)(0.4,0.6,0.7,0.5)(0.7,0.8,1.0,0.9)
S c 3 (0.4,0.3,0.5,0.5)(0.6,0.5,0.4,0.5)(0.6,0.6,0.7,0.7)(0.6,0.8,0.9,0.9)
S c 4 (0.3,0.3,0.2,0.4)(0.7,0.4,0.6,0.5)(0.7,0.4,0.5,0.6)(0.7,0.7,0.8,0.8)
S c 5 (0.2,0.5,0.4,0.4)(0.6,0.5,0.4,0.7)(0.4,0.5,0.5,0.6)(0.6,0.7,0.8,1.0)
Table 3. Tabular representation of weighted 4F linguistic decision matrix for Salary.
Table 3. Tabular representation of weighted 4F linguistic decision matrix for Salary.
4 Polar FuzzyPhysical Domain
LinguisticBelow 30k30k–50k
Variable 4 Polar Fuzzy Linguistic Values
(Salary)Low (0.15)Moderate (0.19)
S c 1 (0.045,0.060,0.075,0.060)(0.076,0.114,0.114,0.057)
S c 2 (0.030,0.075,0.060,0.045)(0.095,0.095,0.114,0.076)
S c 3 (0.060,0.045,0.075,0.075)(0.114,0.095,0.076,0.095)
S c 4 (0.045,0.045,0.030,0.060)(0.133,0.076,0.114,0.095)
S c 5 (0.030,0.075,0.060,0.060)(0.114,0.095,0.076,0.133)
4 Polar FuzzyPhysical Domain
Linguistic50k–70kAbove 70k
Variable 4 Polar Fuzzy Linguistic Values
(Salary)Good (0.27)Very Good (0.39)
S c 1 (0.162,0.189,0.216,0.189)(0.312,0.351,0.312,0.390)
S c 2 (0.108,0.162,0.189,0.135)(0.273,0.312,0.390,0.351)
S c 3 (0.162,0.162,0.189,0.189)(0.234,0.312,0.351,0.351)
S c 4 (0.189,0.108,0.135,0.162)(0.273,0.273,0.312,0.312)
S c 5 (0.108,0.135,0.135,0.162)(0.234,0.273,0.312,0.390)
Table 4. Tabular representation of 4F linguistic concordance set.
Table 4. Tabular representation of 4F linguistic concordance set.
v12345
Y 1 v { 1 , 3 , 4 } { 3 , 4 } { 1 , 3 , 4 } { 1 , 3 , 4 }
Y 2 v { 2 } { 2 , 4 } { 1 , 3 , 4 } { 3 , 4 }
Y 3 v { 1 , 2 } { 1 , 2 , 3 } { 1 , 3 , 4 } { 1 , 3 , 4 }
Y 4 v { 2 } { 2 , 3 } { 2 } { 3 }
Y 5 v { 2 } { 1 , 2 } { 2 } { 1 , 2 , 4 }
Table 5. Tabular representation of 4F linguistic discordance set.
Table 5. Tabular representation of 4F linguistic discordance set.
v12345
Z 1 v { 2 } { 1 , 2 } { 2 } { 2 }
Z 2 v { 1 , 3 , 4 } { 1 , 2 , 3 } { 2 , 3 } { 1 , 2 }
Z 3 v { 3 , 4 } { 2 , 4 } { 2 } { 2 }
Z 4 v { 1 , 3 , 4 } { 1 , 3 , 4 } { 1 , 3 , 4 } { 1 , 2 , 4 }
Z 5 v { 1 , 3 , 4 } { 3 , 4 } { 1 , 3 , 4 } { 3 }
Table 6. Tabular representation of comparison of companies.
Table 6. Tabular representation of comparison of companies.
Comparison of Companies Y uv Z uv y uv z uv r uv s uv t uv Ranking
( S c 1 , S c 2 ) { 1 , 3 , 4 } { 2 } 0.81 0.3189 111 S c 1 S c 2
( S c 1 , S c 3 ) { 3 , 4 } { 1 , 2 } 0.66 0.6639 111 S c 1 S c 3
( S c 1 , S c 4 ) { 1 , 3 , 4 } { 2 } 0.81 0.6488 111 S c 1 S c 4
( S c 1 , S c 5 ) { 1 , 3 , 4 } { 2 } 0.81 0.8293 111 S c 1 S c 5
( S c 2 , S c 1 ) { 2 } { 1 , 3 , 4 } 0.19 1000Incomparable
( S c 2 , S c 3 ) { 2 , 4 } { 1 , 3 , 4 } 0.58 1100Incomparable
( S c 2 , S c 4 ) { 1 , 3 , 4 } { 1 , 3 , 4 } 0.81 1100Incomparable
( S c 2 , S c 5 ) { 3 , 4 } { 1 , 2 , 4 } 0.66 0.6890 111 S c 2 S c 5
( S c 3 , S c 1 ) { 1 , 2 } { 3 , 4 } 0.34 1000Incomparable
( S c 3 , S c 2 ) { 1 , 2 , 3 } { 2 , 4 } 0.61 0.7222 111 S c 3 S c 2
( S c 3 , S c 4 ) { 1 , 3 , 4 } { 2 } 0.81 0.5451 111 S c 3 S c 4
( S c 3 , S c 5 ) { 1 , 3 , 4 } { 2 } 0.81 0.4451 111 S c 3 S c 5
( S c 4 , S c 1 ) { 2 } { 1 , 3 , 4 } 0.19 1000Incomparable
( S c 4 , S c 2 ) { 2 , 3 } { 1 , 3 , 4 } 0.46 1000Incomparable
( S c 4 , S c 3 ) { 2 } { 1 , 3 , 4 } 0.19 1000Incomparable
( S c 4 , S c 5 ) { 3 } { 1 , 2 , 4 } 0.27 1000Incomparable
( S c 5 , S c 1 ) { 2 } { 1 , 3 , 4 } 0.19 1000Incomparable
( S c 5 , S c 2 ) { 1 , 2 } { 3 , 4 } 0.34 1000Incomparable
( S c 5 , S c 3 ) { 2 } { 1 , 3 , 4 } 0.19 1000Incomparable
( S c 5 , S c 4 ) { 1 , 2 , 4 } { 3 } 0.73 0.9791 100Incomparable
Table 7. Tabular representation of m F linguistic decision matrix under a group of decision-makers.
Table 7. Tabular representation of m F linguistic decision matrix under a group of decision-makers.
m Polar FuzzyPhysical Domain
DecisionLinguistic P d 1 P d 2 P d k
MakersVariable m Polar Fuzzy Linguistic Values
L v V 1 V 2 V k
a 1 ( d 11 g 1 , d 11 g 2 , , d 11 g m ) ( d 12 g 1 , d 12 g 2 , , d 12 g m ) ( d 1 k g 1 , d 1 k g 2 , , d 1 k g m )
D g a 2 ( d 21 g 1 , d 21 g 2 , , d 21 g m ) ( d 22 g 1 , d 22 g 2 , , d 22 g m ) ( d 2 k g 1 , d 2 k g 2 , , d 2 k g m )
a n ( d n 1 g 1 , d n 1 g 2 , , d n 1 g m ) ( d n 2 g 1 , d n 2 g 2 , , d n 2 g m ) ( d n k g 1 , d n k g 2 , , d n k g m )
Table 8. Tabular representation of aggregated m F linguistic decision matrix.
Table 8. Tabular representation of aggregated m F linguistic decision matrix.
m Polar FuzzyPhysical Domain
Linguistic P d 1 P d 2 P d k
Variable m Polar Fuzzy Linguistic Values and Weights
L v V 1 V 2 V k
w 1 w 2 w k
a 1 ( d 11 1 , d 11 2 , , d 11 m ) ( d 12 1 , d 12 2 , , d 12 m ) ( d 1 k 1 , d 1 k 2 , , d 1 k m )
a 2 ( d 21 1 , d 21 2 , , d 21 m ) ( d 22 1 , d 22 2 , , d 22 m ) ( d 2 k 1 , d 2 k 2 , , d 2 k m )
a n ( d n 1 1 , d n 1 2 , , d n 1 m ) ( d n 2 1 , d n 2 2 , , d n 2 m ) ( d n k 1 , d n k 2 , , d n k m )
Table 9. Tabular representation of 4F linguistic group decision matrix for corruption.
Table 9. Tabular representation of 4F linguistic group decision matrix for corruption.
4 Polar FuzzyPhysical Domain
DecisionLinguistic40%–60%50%–80%30%–70%
MakersVariable 4 Polar Fuzzy Linguistic Values
(Corruption)Petty CorruptionGrand CorruptionSystemic Corruption
Ratings according to anti-corruption agencies
C 1 (0.6,0.5,0.3,0.4)(0.5,0.6,0.7,0.8)(0.2,0.1,0.5,0.6)
C 2 (0.5,0.7,0.5,0.6)(0.4,0.6,0.8,0.9)(0.3,0.4,0.7,0.8)
C 3 (0.3,0.4,0.4,0.7)(0.6,0.5,0.7,0.8)(0.3,0.3,0.5,0.7)
D 1 C 4 (0.3,0.6,0.5,0.4)(0.7,0.6,0.8,0.7)(0.2,0.4,0.4,0.6)
C 5 (0.4,0.4,0.5,0.7)(0.4,0.5,0.8,0.8)(0.1,0.4,0.3,0.5)
C 6 (0.6,0.4,0.5,0.7)(0.6,0.7,0.5,0.7)(0.5,0.5,0.4,0.7)
C 7 (0.7,0.3,0.2,0.5)(0.4,0.5,0.6,0.8)(0.4,0.3,0.5,0.8)
Ratings according to media sources
C 1 (0.5,0.4,0.3,0.5)(0.6,0.6,0.8,0.6)(0.3,0.2,0.6,0.7)
C 2 (0.6,0.4,0.5,0.7)(0.8,0.7,0.7,0.8)(0.4,0.3,0.7,0.6)
C 3 (0.3,0.5,0.7,0.6)(0.4,0.5,0.6,0.8)(0.5,0.4,0.6,0.6)
D 2 C 4 (0.5,0.6,0.5,0.3)(0.5,0.7,0.6,0.8)(0.3,0.5,0.6,0.5)
C 5 (0.5,0.6,0.5,0.7)(0.7,0.4,0.7,0.7)(0.3,0.4,0.5,0.4)
C 6 (0.7,0.4,0.4,0.5)(0.6,0.6,0.6,0.6)(0.4,0.3,0.6,0.5)
C 7 (0.6,0.5,0.3,0.5)(0.5,0.7,0.7,0.6)(0.4,0.4,0.7,0.7)
Table 10. Tabular representation of aggregated 4F linguistic group decision matrix for corruption.
Table 10. Tabular representation of aggregated 4F linguistic group decision matrix for corruption.
4 Polar FuzzyPhysical Domain
Linguistic40%–60%50%–80%30%–70%
Variable 4 Polar Fuzzy Linguistic Values
(Corruption)Petty CorruptionGrand CorruptionSystemic Corruption
C 1 (0.55,0.45,0.3,0.45)(0.55,0.6,0.75,0.7)(0.25,0.15,0.55,0.65)
C 2 (0.55,0.55,0.5,0.65)(0.6,0.65,0.75,0.85)(0.35,0.35,0.7,0.7)
C 3 (0.3,0.45,0.55,0.65)(0.5,0.5,0.65,0.8)(0.4,0.35,0.55,0.65)
C 4 (0.4,0.6,0.5,0.35)(0.6,0.65,0.7,0.75)(0.25,0.45,0.5,0.55)
C 5 (0.45,0.5,0.5,0.7)(0.55,0.45,0.75,0.75)(0.2,0.4,0.4,0.45)
C 6 (0.65,0.4,0.45,0.6)(0.6,0.65,0.55,0.65)(0.45,0.4,0.5,0.6)
C 7 (0.65,0.4,0.25,0.5)(0.45,0.6,0.65,0.7)(0.4,0.35,0.6,0.75)
Table 11. Tabular representation of weights assigned by decision-makers.
Table 11. Tabular representation of weights assigned by decision-makers.
Decision 4 Polar Fuzzy Linguistic Values
MakersPetty CorruptionGrand CorruptionSystemic Corruption
D 1 0.32510.34530.3296
D 2 0.29150.38010.3284
D 0.30830.36270.3290
Table 12. Tabular representation of weighted aggregated 4F linguistic group decision matrix for corruption.
Table 12. Tabular representation of weighted aggregated 4F linguistic group decision matrix for corruption.
4 Polar FuzzyPhysical Domain
Linguistic40%–60%50%–80%30%–70%
Variable 4 Polar Fuzzy Linguistic Values
(Corruption)Petty CorruptionGrand CorruptionSystemic Corruption
C 1 (0.1696,0.1387,0.0925,0.1387)(0.1995,0.2176,0.2720,0.2539)(0.0823,0.0494,0.1810,0.2138)
C 2 (0.1696,0.1696,0.1542,0.2004)(0.2176,0.2358,0.2720,0.3083)(0.1152,0.1152,0.2303,0.2303)
C 3 (0.0925,0.1387,0.1696,0.2004)(0.1814,0.1814,0.2358,0.2902)(0.1316,0.1152,0.1810,0.2138)
C 4 (0.1233,0.1850,0.1542,0.1079)(0.2176,0.2358,0.2539,0.2720)(0.0823,0.1481,0.1645,0.1810)
C 5 (0.1387,0.1542,0.1542,0.2158)(0.1995,0.1632,0.2720,0.2720)(0.0658,0.1316,0.1316,0.1481)
C 6 (0.2004,0.1233,0.1387,0.1850)(0.2176,0.2358,0.1995,0.2358)(0.1481,0.1316,0.1645,0.1974)
C 7 (0.2004,0.1233,0.0771,0.1542)(0.1632,0.2176,0.2358,0.2539)(0.1316,0.1152,0.2139,0.2468)
Table 13. Tabular representation of 4F linguistic concordance set.
Table 13. Tabular representation of 4F linguistic concordance set.
v1234567
Y 1 v { } { 2 } { } { 2 , 3 } { 2 } { 2 }
Y 2 v { 1 , 2 , 3 } { 1 , 2 , 3 } { 1 , 2 , 3 } { 1 , 2 , 3 } { 1 , 2 , 3 } { 1 , 2 , 3 }
Y 3 v { 1 , 3 } { } { 1 , 3 } { 3 } { 2 , 3 } { 1 , 2 }
Y 4 v { 1 , 2 , 3 } { } { 2 } { 2 , 3 } { 2 } { 1 , 2 }
Y 5 v { 1 } { } { 1 , 2 } { 1 } { 1 , 2 } { 1 , 2 }
Y 6 v { 1 , 3 } { } { 1 , 2 , 3 } { 1 , 3 } { 3 } { 1 , 2 }
Y 7 v { 1 , 3 } { 3 } { 3 } { 3 } { 3 } { 3 }
Table 14. Tabular representation of 4F linguistic discordance set.
Table 14. Tabular representation of 4F linguistic discordance set.
v1234567
Z 1 v { 1 , 2 , 3 } { 1 , 3 } { 1 , 2 , 3 } { 1 } { 1 , 3 } { 1 , 3 }
Z 2 v { } { } { } { } { } { 3 }
Z 3 v { 2 } { 1 , 2 , 3 } { 2 } { 1 , 2 } { 1 , 2 , 3 } { 3 }
Z 4 v { } { 1 , 2 , 3 } { 1 , 3 } { 1 } { 1 , 3 } { 3 }
Z 5 v { 2 , 3 } { 1 , 2 , 3 } { 3 } { 2 , 3 } { 3 } { 3 }
Z 6 v { 2 } { 1 , 2 , 3 } { 2 , 3 } { 2 } { 1 , 2 } { 3 }
Z 7 v { 2 } { 1 , 2 , 3 } { 1 , 2 } { 1 , 2 } { 1 , 2 } { 1 , 2 }
Table 15. Tabular representation of comparison of countries.
Table 15. Tabular representation of comparison of countries.
Comparison of Countries Y uv Z uv y uv z uv r uv s uv t uv Ranking
( C 1 , C 2 ) { } { 1 , 2 , 3 } 01000Incomparable
( C 1 , C 3 ) { 2 } { 1 , 3 } 0.3627 1000Incomparable
( C 1 , C 4 ) { } { 1 , 2 , 3 } 01000Incomparable
( C 1 , C 5 ) { 2 , 3 } { 1 } 0.6917 1100Incomparable
( C 1 , C 6 ) { 2 } { 1 , 3 } 0.3627 1000Incomparable
( C 1 , C 7 ) { 2 } { 1 , 3 } 0.3627 1000Incomparable
( C 2 , C 1 ) { 1 , 2 , 3 } { } 10111 C 2 C 1
( C 2 , C 3 ) { 1 , 2 , 3 } { } 10111 C 2 C 3
( C 2 , C 4 ) { 1 , 2 , 3 } { } 10111 C 2 C 4
( C 2 , C 5 ) { 1 , 2 , 3 } { } 10111 C 2 C 5
( C 2 , C 6 ) { 1 , 2 , 3 } { } 10111 C 2 C 6
( C 2 , C 7 ) { 1 , 2 , 3 } { 3 } 1 0.3813 111 C 2 C 7
( C 3 , C 1 ) { 1 , 3 } { 2 } 0.6373 0.5221 111 C 3 C 1
( C 3 , C 2 ) { } { 1 , 2 , 3 } 01000Incomparable
( C 3 , C 4 ) { 1 , 3 } { 2 } 0.6373 0.6444 111 C 3 C 4
( C 3 , C 5 ) { 3 } { 1 , 2 } 0.3290 0.5009 010Incomparable
( C 3 , C 6 ) { 2 , 3 } { 1 , 2 , 3 } 0.6917 1100Incomparable
( C 3 , C 7 ) { 1 , 2 } { 3 } 0.6710 0.2448 111 C 3 C 7
( C 4 , C 1 ) { 1 , 2 , 3 } { } 10111 C 4 C 1
( C 4 , C 2 ) { } { 1 , 2 , 3 } 01000Incomparable
( C 4 , C 3 ) { 2 } { 1 , 3 } 0.3627 1000Incomparable
( C 4 , C 5 ) { 2 , 3 } { 1 } 0.6917 1100Incomparable
( C 4 , C 6 ) { 2 } { 1 , 3 } 0.3627 1000Incomparable
( C 4 , C 7 ) { 1 , 2 } { 3 } 0.6710 0.7079 111 C 4 C 7
( C 5 , C 1 ) { 1 } { 2 , 3 } 0.3083 1000Incomparable
( C 5 , C 2 ) { } { 1 , 2 , 3 } 01000Incomparable
( C 5 , C 3 ) { 1 , 2 } { 3 } 0.6710 1100Incomparable
( C 5 , C 4 ) { 1 } { 2 , 3 } 0.3083 0.6792 010Incomparable
( C 5 , C 6 ) { 1 , 2 } { 3 } 0.6710 0.9193 100Incomparable
( C 5 , C 7 ) { 1 , 2 } { 3 } 0.6710 1100Incomparable
( C 6 , C 1 ) { 1 , 3 } { 2 } 0.6373 0.7328 111 C 6 C 1
( C 6 , C 2 ) { } { 1 , 2 , 3 } 01000Incomparable
( C 6 , C 3 ) { 1 , 2 , 3 } { 2 , 3 } 1 0.8089 100Incomparable
( C 6 , C 4 ) { 1 , 3 } { 2 } 0.6373 0.5182 111 C 6 C 4
( C 6 , C 5 ) { 3 } { 1 , 2 } 0.3290 1000Incomparable
( C 6 , C 7 ) { 1 , 2 } { 3 } 0.6710 0.9071 100Incomparable
( C 7 , C 1 ) { 1 , 3 } { 2 } 0.6373 0.5693 111 C 7 C 1
( C 7 , C 2 ) { 3 } { 1 , 2 , 3 } 0.3290 1000Incomparable
( C 7 , C 3 ) { 3 } { 1 , 2 } 0.3290 1000Incomparable
( C 7 , C 4 ) { 3 } { 1 , 2 } 0.3290 1000Incomparable
( C 7 , C 5 ) { 3 } { 1 , 2 } 0.3290 0.8811 000Incomparable
( C 7 , C 6 ) { 3 } { 1 , 2 } 0.3290 1000Incomparable

Share and Cite

MDPI and ACS Style

Adeel, A.; Akram, M.; Ahmed, I.; Nazar, K. Novel m—Polar Fuzzy Linguistic ELECTRE-I Method for Group Decision-Making. Symmetry 2019, 11, 471. https://doi.org/10.3390/sym11040471

AMA Style

Adeel A, Akram M, Ahmed I, Nazar K. Novel m—Polar Fuzzy Linguistic ELECTRE-I Method for Group Decision-Making. Symmetry. 2019; 11(4):471. https://doi.org/10.3390/sym11040471

Chicago/Turabian Style

Adeel, Arooj, Muhammad Akram, Imran Ahmed, and Kashif Nazar. 2019. "Novel m—Polar Fuzzy Linguistic ELECTRE-I Method for Group Decision-Making" Symmetry 11, no. 4: 471. https://doi.org/10.3390/sym11040471

APA Style

Adeel, A., Akram, M., Ahmed, I., & Nazar, K. (2019). Novel m—Polar Fuzzy Linguistic ELECTRE-I Method for Group Decision-Making. Symmetry, 11(4), 471. https://doi.org/10.3390/sym11040471

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