International Journal of Computational Intelligence Systems

Volume 13, Issue 1, 2020, Pages 444 - 463

A Novel Pythagorean Fuzzy LINMAP-Based Compromising Approach for Multiple Criteria Group Decision-Making with Preference Over Alternatives

Authors
Jih-Chang Wang1, Ting-Yu Chen2, *
1Department of Information Management, Chang Gung University, No. 259, Wenhua 1st Road., Guishan District, Taoyuan City 33302, Taiwan
2Department of Industrial and Business Management, Chang Gung University, Graduate Institute of Business and Management, Chang Gung University, Department of Nursing, Linkou Chang Gung Memorial Hospital, No. 259, Wenhua 1st Road., Guishan District, Taoyuan City 33302, Taiwan
*Corresponding author. Email: tychen@mail.cgu.edu.tw
Corresponding Author
Ting-Yu Chen
Received 21 August 2019, Accepted 4 April 2020, Available Online 23 April 2020.
DOI
10.2991/ijcis.d.200408.001How to use a DOI?
Keywords
Compromising approach; Group decision-making; Pythagorean fuzzy set; LINMAP; Dominance measure
Abstract

This paper presents a new compromising approach to multiple criteria group decision-making (MCGDM) for the treatment of uncertainty which is based on Pythagorean fuzzy (PF) sets. The present work intends to propose a novel linear programming technique for multidimensional analysis of preference (LINMAP) by way of some useful concepts related to PF dominance relations, individual consistency and inconsistency levels, and individual fit measurements. The concept of PF scalar function-based dominance measures is defined to conduct intracriterion comparisons concerning uncertain evaluation information based on Pythagorean fuzziness; moreover, several valuable properties are also investigated to demonstrate its effectiveness. For the assessment of overall dominance of alternatives, this paper provides a synthetic index, named a comprehensive dominance measure, which is the aggregation of the weighted dominance measures by combining unknown weight information and PF dominance measures of various criteria. For each decision-maker, this paper employs the proposed measures to evaluate the individual levels of rank consistency and rank inconsistency regarding the obtained overall dominance relations and the decision-maker's preference comparisons over paired alternatives. In the framework of individual fit measurements, this paper constructs bi-objective mathematical programming models and then provides their corresponding parametric linear programming models for generating the best compromise alternative. Realistic applications with some comparative analyses concerning railway project investment are implemented to demonstrate the appropriateness and usefulness of the proposed methodology in addressing actual MCGDM problems.

Copyright
© 2020 The Authors. Published by Atlantis Press SARL.
Open Access
This is an open access article distributed under the CC BY-NC 4.0 license (http://creativecommons.org/licenses/by-nc/4.0/).

1. INTRODUCTION

Multiple criteria group decision-making (MCGDM) intends to prioritize a set of candidate alternatives based on a set of evaluative criteria regarding subjective preference and judgments of multiple decision-makers. The linear programming technique for multidimensional analysis of preference (LINMAP) initiated by Srinivasan and Shocker [1] provides an efficient decision-making tool to address MCGDM problems with preference information over alternatives and unknown weights of criteria [24]. When decision-makers provide preference relations between pairs of alternatives in the MCGDM process, the LINMAP methods can be effectively applied to resolve the objective weights of criteria and specify the best compromise choice by ranking alternatives. According to preference relations through pairwise comparisons over alternatives, a linear programming model that desires to accomplish the minimum inconsistency is established in the LINMAP procedure to determine the optimal weights of criteria objectively and generate the priority ranking results of alternatives [57].

However, the classical LINMAP methods cannot be directly employed to handle the decision-making problems involving fuzzy information because of the uncertainty contained in performance information or evaluation values of candidate alternatives in terms of criteria [810]. Accordingly, numerous studies have extended the classical LINMAP for conducting multiple criteria decision analysis in a variety of different fuzzy circumstances. For example, Wan and Li [11] emanated from LINMAP to construct an intuitionistic fuzzy programming method for handling heterogeneous MCGDM containing intuitionistic fuzzy truth degrees. Furthermore, Wan and Li [8] considered the hesitancy degrees about pairwise comparisons as interval-valued intuitionistic fuzzy sets to establish a fuzzy LINMAP-based method for conducting a heterogeneous decision analysis. Zhang et al. [12] utilized the LINMAP and Shapley values to develop an interval-valued intuitionistic fuzzy mathematical programming model to manage uncertain MCGDM problems. Moreover, Zhang et al. [13] established a mathematical programming-based approach to heterogeneous MCGDM involving aspirations and incomplete preference information. Zhang and Xu [10] applied the LINMAP structure to present an interval programming method for handling MCGDM problems with hesitant fuzzy ratings of alternatives and pairwise judgments between alternatives using interval numbers. Wan et al. [14] developed a hesitant fuzzy mathematical programming model to deal with hybrid MCGDM involving hesitant fuzzy truth degrees and incomplete criteria weight information. Xu et al. [15] combined hesitant fuzzy linguistic term sets with LINMAP to provide a hesitant fuzzy linguistic LINMAP method. Liu et al. [5] explored a double-hierarchy hesitant fuzzy linguistic mathematical programming technique for MCGDM. To multiple criteria decision analysis, Gou et al. [6] proposed a hesitant fuzzy linguistic possibility degree-based linear assignment method and made some comparisons with a hesitant fuzzy LINMAP. Song et al. [7] solved a decision-making problem with multi-stage uncertain risk on the grounds of interval grey numbers and an extended LINMAP method. Liao et al. [16] established a linear programming model to address decision-making issues, where the decision-maker's preferences over alternatives in connection with criteria are described as probabilistic linguistic term sets. With the assistance of LINMAP, Qin et al. [17] constructed some linear programming models to solve an MCGDM problem in interval type-2 fuzzy contexts. Haghighi et al. [3] developed a soft computing model involving interval type-2 fuzzy information by the agency of a linear assignment method and LINMAP.

Vagueness and impreciseness are unavoidable uncertainties in human evaluation processes [18]. The concept of Pythagorean fuzzy (PF) sets, initiated by Yager [1921] and Yager and Abbasov [22], is a powerful tool in handling real-world uncertainty because PF sets slacken the prerequisite in which the sum of membership and nonmembership degrees is less than or equal to one with the square sum is less than or equal to one [2325]. Accordingly, PF sets allow decision-makers to portray uncertain assessment data agilely and conveniently during the MCGDM process.

The LINMAP methodology has been successfully extended to diverse uncertain representations for conducting multiple criteria decision analysis or handling MCGDM issues under a variety of distinct fuzzy environments. Nonetheless, most of the current LINMAP-based techniques are not applicable to the decision environments under complex uncertainty of Pythagorean fuzziness. In this regard, Wan et al. [9] and Xue et al. [26] put forward new LINMAP-based techniques in PF uncertain circumstances. Wan et al. [9] utilized the information entropy to derive individual subjective criterion weight vectors for multiple decision-makers and synthesized them into a collective one via a cross-entropy optimization model. Subsequently, Wan et al. [9] constructed a PF mathematical programming model for addressing MCGDM problems based on the PF truth degree. Xue et al. [26] defined new PF entropy measures and exploited a PF LINMAP method for solving MCGDM problems. These two studies have made significant contributions to enrich the theory of PF sets and have been applied to diverse fields of green supplier selection of a smelting equipment [9] and the selection of railway project investment [26]. In contrast to abovementioned information entropy-based techniques, this paper adopts the perspective of PF representation to construct the core concept in the PF LINMAP framework. Different from Wan et al. [9] and Xue et al. [26], this paper intends to employ the concept of PF scalar functions from fuzzy rule bases and develop a novel PF LINMAP-based compromising approach to deal with MCGDM problems within PF decision environments.

It is worthwhile to mention that the concept of PF scalar functions presented by Yager [19,20] and Yager and Abbasov [22] can be utilized to facilitate comparisons among complicated PF information. Yager [20] and Yager and Abbasov [22] explored the relationship between complex numbers and Pythagorean membership grades; then they demonstrated that Pythagorean membership grades are regarded as a subclass of complex numbers called Π−i numbers. Moreover, they introduced a mapping, i.e., a PF scalar function, from the Π−i numbers to the unit intervals to enhance the usage of PF sets in the decision-making field. Liu and Zhang [27] further demonstrated several useful properties of PF scalar functions and obtained some partial orders on Π−i numbers based on such functions. Zeng et al. [28] introduced the following four commonly used approaches to comparing and ranking Pythagorean membership grades in PF sets: the approach via score functions [29], the approach via score functions and accuracy functions [30], the approach via closeness indices [31], and the approach via PF scalar functions [20]. Zeng et al. [28] investigated several comparative examples and indicated that the approach by virtue of PF scalar functions is more helpful than the other existing comparison approaches. Consistent with Zeng et al.'s findings, Li and Zeng [32] also validated the effectiveness and superiority of PF scalar functions in comparing complex PF information. Moreover, Li and Zeng [32] and Zeng et al. [28] mentioned that the PF scalar function can thoroughly consider the influence of the fundamental characteristics of PF information. On the grounds of the PF scalar function in terms of certain anchor points of reference, Chen [33] introduced the measurement of PF precedence indices and precedence-based preference functions and further established a new PF preference ranking organization method for enrichment evaluations (PROMETHEE). Chen demonstrated the usefulness and effectiveness of the PF scalar function because its based PF precedence index can simplify the data-processing procedure and avoid the loss of high-order uncertain information. The previous studies indicated the merits of PF scalar functions; it would be desirable to apply the PF scalar function-based method to address intricate decision-making problems. Nevertheless, the concept of PF scalar functions has not employed in the current LINMAP-based methods within PF decision environments. Considering the benefits of the PF scalar function in measuring the magnitudes of Pythagorean membership grades as well as the usefulness of comparisons of PF information, this paper utilizes the PF scalar functions to present PF scalar function-based dominance measures that form the PF LINMAP basis for building a strong foundation of valuable concepts related to PF dominance relations, individual consistency and inconsistency levels, and individual fit measurements.

The primary purpose of this paper is to exploit an innovative PF LINMAP-based compromising approach for coping with MCGDM problems within PF environment. More fundamentally, this paper fully utilizes the essential characteristics of PF sets and provides a PF scalar function-based approach for determining PF dominance relations and building a core structure of the PF LINMAP procedure. First, the idea of PF scalar functions is fully employed to construct two types of PF scalar function-based dominance measures with respective to displaced and fixed reference points. Next, Types I and II comprehensive dominance measures are established for the sake of determining PF dominance relations. Some essential and important properties of the proposed measures are investigated to validate the practical usefulness of the proposed measures in synthetic comparisons for PF information. This paper utilizes the PF scalar function-based approach to specify the overall dominance relations and contrasts the obtained results with the decision-makers' paired preference relations. Based on the outcomes, this paper identifies the individual levels of rank consistency and rank inconsistency for acquiring individual fit measurements, i.e., individual goodness of fit and individual poorness of fit. Based on Types I and II dominance measures, two bi-objective mathematical programming models are formulated with the intention of maximal total group comprehensive dominance measure and minimal the group poorness of fit. To improve the computation efficiency, the bi-objective models are transformed into single-objective parametric linear programming models for simplicity. Two algorithmic procedures of the developed PF LINMAP models are presented to address MCGDM problems in PF contexts. The optimal collective weights of criteria and the individual degrees of violation yielded by the proposed models can facilitate generating the overall priority ranking orders and identifying the best compromise alternative. To examine the feasibility and effectiveness of the developed PF LINMAP approaches in practice, this paper investigates an MCGDM problem involving the railway project investment and conducts some sensitivity analyses and comparative studies.

The significant contributions of this paper are highlighted as four aspects: (i) incorporation of PF scalar functions into the core procedure for enriching the LINMAP-based methodology; (ii) exploitation of useful concepts such as PF scalar function-based (comprehensive) dominance measures and fit measurements; (iii) development of an innovative PF LINMAP-based compromising approach for manipulating subjective preferences over alternatives; and (iv) construction of applicable and effective parametric optimization models to assist multiple decision-makers in tackling MCGDM problems.

The remainder of this article is organized as follows: Section 2 concisely presents several essential concepts related to PF sets, Pythagorean membership grades, and PF scalar functions. Section 3 formulates the MCGDM problem in the uncertain context based on PF sets. Section 4 exploits novel PF scalar function-based dominance measures and explores their useful properties. Next, this section provides comprehensive dominance measures for the sake of acquiring overall dominance of alternatives. Section 5 develops some useful concepts, such as individual levels of rank consistency and inconsistency, individual fit measurements, and group comprehensive dominance measures. Based on the proposed concepts, this section employs the PF scalar function-based approach to originate a novel PF LINMAP methodology via effective parametric optimization models. Section 6 presents a practical decision-making case concerning a railway investment issue to show the implementation procedure of the developed approaches. Section 7 conducts a sensitivity analysis and makes some comparative discussions to explore the influences of relevant parameters and to evaluate the usefulness and strengths of the developed models and techniques. Lastly, Section 8 delivers the conclusions.

2. PRELIMINARY

This section describes preliminary definitions and concepts of PF sets, such as Pythagorean membership grades and PF scalar functions, all of which are necessary for the subsequent study.

Yager [1921] and Yager and Abbasov [22] initiated a Pythagorean membership grade that belongs to a class of nonstandard membership grades. Furthermore, Li and Zeng [32] and Zeng et al. [28] revealed that a Pythagorean membership grade can be characterized by five parameters comprising the degrees of membership, nonmembership, and indeterminacy, the strength of commitment about membership, and the direction of commitment. Nonetheless, Chen [34] indicated that the degree of indeterminacy and the strength of commitment are dual concepts. Due to the duality of the two parameters, Chen [34,35] suggested the employment of the four parameters consisting of membership, nonmembership, strength, and direction for PF characterization. Zhang and Xu [29] presented a useful mathematical representation of PF sets. Motivated by Zhang and Xu's expressions [29], Chen [34,35] provided an effective definition and contributed a new operationally mathematical representation of PF sets involving Pythagorean membership grades.

Definition 1.

[20,29,34,35] Let X be a finite universe of discourse. A PF set P is represented by the collection of a Pythagorean membership grade p toward each element xX as follows:

P=x,p|xX.(1)

Here, p is characterized by a series of ordered parameters consisting of the degree of membership μP(x), the degree of nonmembership νP(x), the strength of commitment rP(x), and the direction of commitment dP(x). They are defined as follows:

p=μP(x),νP(x);rP(x),dP(x),(2)
where μP(x),νP(x),rP(x),dP(x):X0,1 and for each xX:
0μP(x)2+νP(x)21.(3)

Definition 2.

[1922] Let P be a PF set in the universal set X. Let p=(μP(x),νP(x);rP(x),dP(x)) represent a Pythagorean membership grade of an element xX belonging to the set P. Let θP(x) be described in radians in the range [0,π/2]. The parameters μP(x), νP(x), rP(x), and dP(x) are derived as follows:

μP(x)=rP(x)cosθP(x),(4)
νP(x)=rP(x)sinθP(x),(5)
rP(x)=μP(x)2+νP(x)2,(6)
dP(x)=π2θP(x)π,(7)
where μP(x),νP(x),rP(x),dP(x)[0,1].

Definition 3.

[29,34,35] Let p be a Pythagorean membership grade contained by a PF set P in the universal set X. The degree of indeterminacy τP(x):X[0,1] is given by

τP(x)=1μP(x)2νP(x)2,(8)

This equation supports the duality property of τP(x) and rP(x) by virtue of τP(x)2+rP(x)2=1.

For simplicity, let an ordered pair μP(x),νP(x) in two-dimensional Cartesian coordinates depict a geometrical illustration of the space of a Pythagorean membership grade p, as demonstrated in Figure 1. The horizontal axis of the two-dimensional plot in this figure denotes the membership degree μP(x), while the vertical axis denotes the nonmembership degree νP(x).

Figure 1

Geometrical interpretation concerning the space of a Pythagorean membership grade in Pythagorean fuzzy (PF) contexts.

It is noted that the larger the value of rP(x), the stronger the commitment regarding membership at point x to the PF set P and the lower the uncertainty. The Pythagorean membership grade p allows lack of commitment and uncertainty in assigning the degrees of membership and nonmembership. Specifically, the degree μP(x) represents the support for the membership of x in P; in contrast, the degree νP(x) represents the support against the membership of x in P. The direction of rP(x) is completely toward membership if dP(x)=1 and nonmembership if dP(x)=0, whereas intermediate values of dP(x) indicate partial support for membership and nonmembership.

In particular, when dP(x)=1 (i.e., a favorable direction of commitment), it is obtained that θP(x)=0 because (π2θP(x))/π=1. It follows that μP(x)=rP(x) and νP(x)=0 by reason of cos(θP(x))=1 and sin(θP(x))=0, respectively. When dP(x)=0.5 (i.e., a neutral direction of commitment), it is derived that θP(x)=π/4 and cos(θP(x))=sin(θP(x))=22, which render μP(x)=νP(x)=((rP(x))2/2)0.5. When dP(x)=0 (i.e., a unfavorable direction of commitment), it is acquired that θP(x)=π/2, cos(θP(x))=0, and sin(θP(x))=1, which yield μP(x)=0 and νP(x)=rP(x). Therefore, the closer dP(x) is to 1, the closer θP(x) is to 0, and the stronger the commitment rP(x) is to supporting the membership of x in the PF set P. On the contrary, the closer dP(x) is to 0, the closer θP(x) is to π/2, and the stronger the commitment rP(x) is to disapproving the membership of x in P.

It is worthwhile to mention that the membership degree μP(x) and nonmembership degree νP(x) are related via Pythagorean complements with respect to the strength of commitment rP(x) owing to the fact that (μP(x))2=(rP(x))2(νP(x))2 and (νP(x))2=(rP(x))2(μP(x))2. Next, let pc=(μPc(x),νPc(x);rPc(x),dPc(x)) denote the complement of a Pythagorean membership grade p. As depicted in Figure 1, one has μPc(x)=νP(x) and νPc(x)=μP(x) by cause of the Pythagorean complement between μP(x) and νP(x) in terms of rP(x). Moreover, it follows that rPc(x)=rP(x), dPc(x)=1dP(x), and θPc(x)=π/2θP(x). The complement pc of p is specified as below:

pc=νP(x),μP(x);rP(x),1dP(x).(9)

Yager [19,20] employed the Takagi–Sugeno approach to propose a scalar function from fuzzy rule bases. Chen [33] indicated that Yager's scalar function can provide a representative value associated with each PF information and possess several useful and desirable properties. Liu and Zhang [27] investigated essential properties of Yager's function and studied some partial orders on Π−i numbers.

Definition 4.

[19,20,33] Let p=(μP(x),νP(x);rP(x),dP(x)) denote a Pythagorean membership grade of an element xX to a PF set P. The PF scalar function V(p) of p is derived as follows:

V(p)=12+rP(x)122θP(x)π.(10)

Theorem 1.

For a PF set P, the PF scalar function V(p) of a Pythagorean membership grade p=(μP(x),νP(x);rP(x),dP(x)) with the radians θP(x) satisfies the following properties:

  • (T1.1) 0V(p)1;

  • (T1.2) V(p)=0 if and only if rP(x)=1 and θP(x)=π/2;

  • (T1.3) V(p)=1 if and only if rP(x)=1 and θP(x)=0;

  • (T1.4) V(p) decreases as θP(x) increases if rP(x)>0;

  • (T1.5) V(p) decreases as rP(x) increases if θP(x)>π/4;

  • (T1.6) V(p) increases as rP(x) increases if θP(x)<π/4;

  • (T1.7) V(p) is not a one-to-one mapping.

Proof.

The proofs have been given in Chen [33] and Liu and Zhang [27].

3. MCGDM PROBLEM UNDER PF UNCERTAINTY

This section intends to formulate an MCGDM problem under complex uncertainty of Pythagorean fizziness.

Consider an MCGDM problem based on PF sets. Let Z={z1,z2,,zm} represent a discrete set of m m2 candidate alternatives. Let C={c1,c2,,cn} be a finite set of n n2 evaluative criteria with the weight vector w=(w1,w2,,wn), such that the weight wj[0,1] for all j{1,2,,n} and j=1nwj=1. Because all of the n criteria belong to salient attributes during an MCGDM process, nonnegative boundary conditions should be imposed into the feasible ranges of the weights. Specifically, this paper designates that wjεj for all cjC, where εj is a sufficiently small nonnegative value. Note that the weight vector w is unknown and required to be resolved, in which the weight wj satisfies j=1nwj=1 and wjεj (εj [0, 1]) for all j{1,2,,n}. Let E={e1,e2,,eK} represent the set of decision-makers participated in the MCGDM process.

Let μijk and νijk indicates the degrees of satisfaction and dissatisfaction, respectively, of the decision-maker ekE for the alternative ziZ in connection with a criterion cjC. They are subject to 0μijk2+νijk21. The PF evaluative rating of zi in terms of cj provided by the decision-maker ek is represented as a Pythagorean membership grade pijk, in which μijk=rijkcosθijk, νijk=rijksin(θijk), rijk=μijk2+νijk20.5, and dijk=(π2θijk)/π for θijk[0,π/2]; pijk is expressed as follows:

pijk=μijk,νijk;rijk,dijk,(11)
where i{1,2,,m}, j{1,2,,n}, and k{1,2,,K}. Moreover, the degree of indeterminacy associated with each pijk is τijk=1μijk2νijk20.5.

Let Pk denote the decision-maker ek's PF decision matrix in an MCGDM problem within the PF environment; Pk is concisely expressed as follows:

        c1        c2           cnPk=pijkm×n=z1z2zmp11kp12kp1nkp21kp22kp2nkpm1kpm2kpmnk                c1                                                 c2=z1z2zmμ11k,ν11k;r11k,d11kμ12k,ν12k;r12k,d12kμ21k,ν21k;r21k,d21kμ22k,ν22k;r22k,d22kμm1k,νm1k;rm1k,dm1kμm2k,νm2k;rm2k,dm2k      cn            μ1nk,ν1nk;r1nk,d1nkμ2nk,ν2nk;r2nk,d2nkμmnk,νmnk;rmnk,dmnk.(12)

It is worth noting that the PF evaluative ratings can be conveniently acquired through the medium of applicable linguistic rating scales. Consider a nine-point rating scale as an example. Table 1 depicts some practical and beneficial approaches to evaluate the alternatives by use of nine-point linguistic scales. To be specific, Gündoǧdu [36] introduced a useful nine-point linguistic scale for facilitating the construction of the evaluation matrix based on PF sets and spherical fuzzy sets. Mete [37], Oz et al. [38], and Pérez-Domínguez et al. [39] employed an identical nine-point scale for expressing linguistic evaluations in PF settings. Rani et al. [40] introduced a nine-point linguistic scale for assisting decision-makers' judgments concerning the performance evaluations of alternatives in terms of criteria. Seker and Aydin [41] provided nine-point linguistic terms and their corresponding interval-valued PF numbers that can be used for the evaluation of alternatives with criteria. By applying a middle-point approach, these interval-valued PF numbers can be converted into Pythagorean membership grades, and the obtained results are shown in Table 1.

Source Linguistic Term PF Evaluative Rating
Gündoǧdu [36] Absolutely high (0.90, 0.10; 0.91, 0.93)
Very high (0.80, 0.20; 0.82, 0.84)
High (0.70, 0.30; 0.76, 0.74)
Slightly high (0.60, 0.40; 0.72, 0.63)
Fair (0.50, 0.50; 0.71, 0.50)
Slightly low (0.40, 0.60; 0.72, 0.37)
Low (0.30, 0.70; 0.76, 0.26)
Very low (0.20, 0.80; 0.82, 0.16)
Absolutely low (0.10, 0.90; 0.91, 0.07)
Mete [37]; Absolutely high (1.00, 0.10; 1.00, 0.94)
Oz et al. [38]; Very high (0.80, 0.44; 0.91, 0.68)
Pérez-Domínguez [39] High (0.70, 0.60; 0.92, 0.55)
Moderately high (0.60, 0.71; 0.93, 0.45)
Medium (0.50, 0.80; 0.94, 0.36)
Moderately low (0.40, 0.87; 0.96, 0.27)
Low (0.25, 0.92; 0.95, 0.17)
Very low (0.10, 0.97; 0.98, 0.07)
Absolutely low (0.10, 0.99; 1.00, 0.06)
Rani et al. [40] Absolutely high (0.98, 0.20; 1.00, 0.87)
Very high (0.87, 0.35; 0.94, 0.76)
High (0.70, 0.40; 0.81, 0.67)
Medium high (0.65, 0.45; 0.79, 0.61)
Average (0.50, 0.55; 0.74, 0.47)
Medium low (0.40, 0.70; 0.81, 0.33)
Low (0.36, 0.80; 0.88, 0.27)
Very low (0.25, 0.87; 0.91, 0.18)
Very very low (0.20, 0.98; 1.00, 0.13)
Seker and Absolutely good (0.81, 0.10; 0.82, 0.92)
Aydin [41] Very good (0.72, 0.19; 0.74, 0.84)
Good (0.63, 0.28; 0.69, 0.73)
Medium good (0.54, 0.37; 0.65, 0.62)
Fair (0.45, 0.45; 0.64, 0.50)
Medium bad (0.37, 0.54; 0.65, 0.38)
Bad (0.28, 0.63; 0.69, 0.27)
Very bad (0.19, 0.72; 0.74, 0.16)
Absolutely bad (0.10, 0.81; 0.82, 0.08)
Table 1

Pythagorean fuzzy (PF) evaluative ratings in relation to linguistic scales.

Decision-makers can express the linguistic evaluation values of alternatives toward each criterion. Afterward, these linguistic terms are transformed into PF evaluative ratings by the agency of the linguistic rating system in Table 1. Accordingly, the PF decision matrices from decision-makers can be determined using an appropriate linguistic rating system (e.g., the linguistic terms given in Table 1).

The decision-maker ek provides individual preference relations between the alternatives in the set Z with the preference set Ωk in which Ωk denotes a set of ordered pairs (ϕ,φ) and is defined as follows:

Ωk=(ϕ,φ)|zϕ_zφ,ϕ,φ{1,2,,m},(13)
for k{1,2,,K}, where the preference relation zϕ_zφ signifies that the alternative zϕ is noninferior to the alternative zφ. Namely, either zϕ is preferred to zφ or zϕ and zφ are evenly preferred for the decision-maker ek.

Theoretically, the preference set Ωk contains at most m(m1)/2 paired comparison judgments. Nonetheless, the decision-makers frequently express incomplete preference judgments toward two alternatives in real-world situations. That is, only partial preference relations are filled in by the decision-makers' subjective judgments. For instance, there are five candidate alternatives in Z, i.e., Z={z1,z2,,z5}. Suppose that the decision-maker ek provides his/her confirmed preference relations z3_z1, z2_z4, and z3_z4, i.e., Ωk = {(3, 1), (2, 4), (3, 4)}. In this case, there are only three paired comparison judgments in Ωk. Another issue may be faced with preference conflicts regarding some decision-makers' ordered pairs. For example, the preference relation (3, 5) (i.e., z3_z5) in the set Ω1 is filled in by the decision-maker e1's subjective judgments, while the inconsistent relation (5, 3) (i.e., z5_z3) in the set Ω2 is filled in by the decision-maker e2's subjective judgments. In this regard, this paper would like to propose an effective procedure in the PF LINMAP method for the sake of overcoming the difficulty about incomplete and inconsistent information.

To deal with partial preference relations based on human subjective judgments, this paper devises a scheme that comes as close as possible to meet most of the decision-makers' paired preference relations in developing the PF LINMAP methods. In particular, this paper defines a useful synthetic index, named a comprehensive dominance measure, to evaluate the overall dominance of competing alternatives. The obtained overall dominance relations are contrasted with paired preference relations in the preference sets Ωk for all k{1,2,,K}. No errors are attributed to the consistency between paired preference relations and overall dominance relations; whereas errors are to be minimized through the subsequent PF LINMAP models. Moreover, this paper presents new consistency and inconsistency measurements for handling incomplete and inconsistent information among the sets Ωk in the proposed PF LINMAP procedure.

4. DOMINANCE MEASURE VIA PF SCALAR FUNCTIONS

This section introduces different points of reference for PF information and establishes two types of PF scalar function-based dominance measures for facilitating intracriterion comparisons of PF evaluative ratings.

In general, different points of reference might have distinct influences on the contrast of various PF evaluative ratings, which would result in the change of the decision-makers' preference intensities. In this respect, this paper considers two types of reference points to define the PF scalar function-based dominance measures. First, the displaced reference points (i.e., the positive-ideal and negative-ideal reference points) under anchored judgments are utilized to construct the Type I dominance measure. Second, this paper regard the largest Pythagorean membership grade (1, 0; 1, 1) and the smallest grade (0, 1; 1, 0) as the fixed reference points for presenting the Type II dominance measure.

Definition 5.

(Displaced reference points) For each decision-maker ek's PF decision matrix Pk=[pijk]m×n, the positive-ideal reference point p*jk and the negative-ideal reference point p#jk in connection with each criterion cjC are derived as follows:

p*jk=μ*jk,ν*jk;r*jk,d*jk=(maxi=1mμijk)2+(maxi=1mμijk)2maxi=1mμijk,mini=1mνijk;maxi=1mμijk2+mini=1mνijk2,π2θ*jkπ,(14)
p#jk=μ#jk,ν#jk;r#jk,d#jk=(maxi=1mμijk)2+(maxi=1mμijk)2mini=1mμijk,maxi=1mνijk;mini=1mμijk2+maxi=1mνijk2,π2θ#jkπ,(15)
where θjk=cos1(μjk/rjk)=sin1(νjk/rjk) and θ#jk=cos1(μ#jk/r#jk)=sin1(ν#jk/r#jk).

Definition 6.

(Fixed reference points) For each decision-maker ek, the largest fixed reference point p+jk and the smallest fixed reference point pjk in connection with each criterion cjC are given by

p+jk=μ+jk,ν+jk;r+jk,d+jk=(1,0;1;1),(16)
pjk=μjk,νjk;rjk,djk=(0,1;1,0),(17)
where θ+jk=cos1(1/1)=sin1(0/1)=0 and θjk=cos1(0/1)=sin1(1/1)=1.5708.

Based on Definition 2, the radians θijk associated with a PF evaluative rating pijk can be acquired by θijk=(π/2)(1dijk). Accordingly, the PF scalar function V(pijk) can be determined as follows:

V(pijk)=12+rijkdijk12.(18)

Theorem 2.

The PF scalar function V(pijk) meets the following properties:

  • (T2.1) 0V(pijk)1;

  • (T2.2) V(pijk)=0 if and only if rijk=1 and dijk=0;

  • (T2.3) V(pijk)=0.5 if and only if either rijk=0 or dijk=0.5;

  • (T2.4) V(pijk)=1 if and only if rijk=dijk=1;

  • (T2.5) V(pijk) increases as dijk increases if rijk>0;

  • (T2.6) V(pijk) increases as rijk increases if dijk>0.5;

  • (T2.7) V(pijk) decreases as rijk increases if dijk<0.5.

Proof.

(T2.1) is obvious from (T1.1). For the necessity of (T2.2), if V(pijk)=0, the condition rijk(dijk0.5)=0.5 must be fulfilled. This indicates that rijk=1 and dijk=0 because rijk,dijk[0,1]. For the sufficiency of (T2.2), if rijk=1 and dijk=0, then V(pijk)=0. Thus, (T2.2) is correct. For the necessity of (T2.3), if V(pijk)=0.5, then rijk(dijk0.5)=0 must hold, which follows that either rijk=0 or dijk=0.5. For the sufficiency of (T2.3), either rijk=0 or dijk=0.5 will result in V(pijk)=0.5, i.e., (T2.3) is valid. For the necessity of (T2.4), if V(pijk)=1, the condition rijk(dijk0.5)=0.5 must be satisfied, which implies that rijk=dijk=1. For the sufficiency of (T2.4), it is easy to see V(pijk)=1 if rijk=dijk=1. Thus, (T2.4) is valid. For (T2.5), the partial derivative of V(pijk) with respect to dijk is obtained as follows:

Vpijkdijk=0.5+rijkdijk0.5dijk=rijk.

Note that rijk[0,1]. It can be concluded that V(pijk) increases as dijk increases from 0 to 1 if rijk>0. For (T2.6) and (T2.7), the partial derivative of V(pijk) with respect to rijk is derived as follows:

V(pijk)rijk=0.5+rijkdijk0.5rijk=dijk0.5,
where dijk[0,1]. It is easy to see that V(pijk)/rijk>0 and V(pijk)/rijk<0 in the cases of dijk>0.5 and dijk<0.5, respectively. Thus, V(pijk) increases as rijk increases if dijk>0.5. In contrast, V(pijk) decreases as rijk increases if dijk<0.5. Therefore, (T2.6) and (T2.7) are valid. This completes the proof.

Definition 7.

Regarding a PF evaluative rating pijk, the PF scalar function-based dominance measure when anchoring p*jk and p#jk, denoted by Type I, is defined as follows:

MI(pijk)=|V(pijk)V(p#jk)||V(pijk)V(p*jk)|+|V(pijk)V(p#jk)|.(19)

The PF scalar function-based dominance measure of pijk when anchoring p+jk and pjk, denoted by Type II, is defined as follows:

MII(pijk)=|V(pijk)V(pjk)||V(pijk)V(p+jk)|+|V(pijk)V(pjk)|.(20)

Theorem 3.

The Type I dominance measure MI(pijk) corresponding to a PF evaluative rating pijk meets the following properties:

  • (T3.1) 0MI(pijk)1;

  • (T3.2) If pijk=p#jk, then MI(pijk)=0;

  • (T3.3) If pijk=p*jk, then MI(pijk)=1.

Proof.

For (T3.1), it is known that the PF scalar functions 0V(pijk),V(p*jk),V(p#jk)1 from (T1.1). Thus, it can be verified 0MI(pijk)1. For (T3.2), the condition pijk=p#jk leads to |V(pijk)V(p#jk)|=0, which indicates that MI(pijk)=0. For (T3.3), the condition pijk=p*jk leads to |V(pijk)V(p*jk)|=0. It follows that MI(pijk)=|V(pijk)V(p#jk)|/|V(pijk)V(p#jk)|=1. This completes the proof.

Theorem 4.

The Type II dominance measure MII(pijk) corresponding to a PF evaluative rating pijk meets the following properties:

  • (T4.1) 0MII(pijk)1;

  • (T4.2) If pijk=pjk, then MII(pijk)=0;

  • (T4.3) If pijk=p+jk, then MII(pijk)=1.

Proof.

The proofs of (T4.1)–(T4.3) are similar to those of (T3.1)–(T3.3), respectively.

Theorem 5.

The PF scalar function-based dominance measures MI(pijk) and MII(pijk) of a PF evaluative rating pijk can be determined as follows:

MI(pijk)=V(pijk)V(p#jk)V(p*jk)V(p#jk),(21)
MII(pijk)=V(pijk).(22)

Proof.

From Definition 5, it is easily observed that μijkμ#jk and νijkν#jk because μ#jk=mini=1mμijk and ν#jk=maxi=1mνijk, respectively. The directions of commitments dijk and d#jk indicate on a scale from 0 to 1 how fully the strengths rijk and r#jk, respectively, are pointing toward membership. Hence, it can be inferred that dijkd#jk, which implies that V(pijk)V(p#jk) based on (T2.5). Analogously, one has μijkμ*jk and νijkν*jk based on μ*jk=maxi=1mμijk and ν*jk=mini=1mνijk, respectively. It follows that V(pijk)V(p*jk). Thus, Eq. (19) becomes

MI(pijk)=V(pijk)V(p#jk)V(p*jk)V(pijk)+V(pijk)V(p#jk)=V(pijk)V(p#jk)V(p*jk)V(p#jk),
which indicates that Eq. (21) is correct. Next, it can be easily obtained that Vpjk=0 and Vp+jk=1 because pjk=(0,1;1,0) and p+jk=(1,0;1;1), respectively. Thus, one has MII(pijk)e)=|V(pijk)0|/(|V(pijk)1|+|V(pijk)0|)=V(pijk), i.e., Eq. (22) is correct. This completes the proof.

Theorem 6.

For two PF evaluative ratings pijk and pijk in terms of a specific criterion cjC, if pijkpijk (i.e., μijkμijk and νijkνijk), then MI(pijk)MI(pijk) and MII(pijk)MII(pijk).

Proof.

According to a natural quasi-ordering on the space of Pythagorean membership grades [20,31], pijkpijk if and only if μijkμijk and νijkνijk. Meanwhile, the directions of commitments dijk and dijk represent how the strengths rijk and rijk, respectively, are pointing toward membership, which follows that dijkdijk. Hence, it can be inferred that V(pijk)V(pijk) based on (T2.5). For the decision-maker ek, the displaced reference points are the same for the alternatives in the set Z, More concretely, the V(p#jk) values are identical for the alternatives zi and zi because zi and zi have the same negative-ideal reference point p#jk. Analogously, the V(p*jk) values are identical for zi and zi because of the same positive-ideal reference point p*jk. Moreover, it is known that V(pijk)V(p#jk)V(pijk)V(p#jk) because V(pijk)V(pijk). Therefore, it can be proven that MI(pijk)MI(pijk) and MII(pijk)MII(pijk). This completes the proof.

As demonstrated in Theorems 36, the PF scalar function-based dominance measures MI(pijk) and MII(pijk) possess several important and useful properties. Accordingly, they can be thoroughly employed to identify the PF dominance relationships about PF evaluative ratings because of the practical usefulness in intracriterion comparisons. To further assess the overall dominance of alternatives, this paper incorporates the criterion weights into Types I and II dominance measures to propose a synthetic index, named a comprehensive dominance measure.

Definition 8.

Let w=(w1,w2,,wn) be the weight vector of n criteria. Based on Types I and II dominance measures MI(pijk) and MII(pijk), the comprehensive dominance measures of the alternative ziZ for the decision-maker ekE are defined as follows:

iI,k=j=1nwjMI(pijk),(23)
i II,k=j=1nwjMII(pijk).(24)

Theorem 7.

The Type I comprehensive dominance measure iI,k meets the following properties:

  • (T7.1) 0iI,k1;

  • (T7.2) If pijk=p#jk for all j{1,2,,n}, then iI,k=0;

  • (T7.3) If pijk=p*jk for all j{1,2,,n}, then iI,k=1;

  • (T7.4) If pijkpijk for all j{1,2,,n}, then iI,kiI,k.

Proof.

For (T7.1), it is obvious that 0iI,k1 according to the normalization conditions of criterion weights (i.e., 0wj1 for all j{1,2,,n} and j=1nwj=1) and the property in (T3.1) (i.e., 0MI(pijk)1). For (T7.2), based on (T3.2), it is known that MI(pijk)=0 because of the premise condition pijk=p#jk for all j. It indicates that i I,k=0. For (T7.3), one can easily conclude that i I,k=1 because MI(pijk)=1 from (T3.3) according to the condition pijk=p*jk for all j. For (T7.4), by applying Theorem 6, the premise condition pijkpijk indicates that MI(pijk)MI(pijk). Thus, it can be inferred that i I,ki I,k because wjMI(pijk)wjMI(pijk) for all j. This completes the proof.

Theorem 8.

The Type II comprehensive dominance measure iII,k satisfies the following properties:

  • (T8.1) iII,k=j=1nwjV(pijk);

  • (T8.2) 0iII,k1;

  • (T8.3) If pijk=pjk for all j{1,2,,n}, then iII,k=0;

  • (T8.4) If pijk=p+jk for all j{1,2,,n}, then iII,k=1;

  • (T8.5) If pijkpijk for all j{1,2,,n}, then iII,kiII,k.

Proof.

(T8.1) can be easily checked based on Theorem 5. The proofs of (T8.2)–(T8.5) are analogous to those of (T7.1)–(T7.4), respectively.

5. PROPOSED PF LINMAP METHODOLOGY

This section utilizes the PF scalar function-based appoach to bring forward a novel PF LINMAP methodology. Moreover, two effective algorithmic procedures based on Types I and II dominance measures are also provided to facilitate solving MCGDM problems in PF contexts.

The proposed comprehensive dominance measures can be utilized to specify the overall dominance relations among candidate alternatives. Recall that the preference set Ωk is composed of the stated ordered pairs that represent the subjective preference relations between alternatives provided by the decision-maker ek. Based on the PF scalar function-based approach, this paper determines the overall dominance relations yielded by Type I or Type II comprehensive dominance measures. These results are contrasted with preference information provided by all decision-makers. More concretely, no error can be attributed to the paired preference relation between alternatives zϕ and zφ for the ordered pair (ϕ,φ)Ωk if ϕ I,kφ I,k and ϕ II,kφ II,k based on Types I and II dominance measures, respectively, whereas errors can be found if ϕ I,k<φ I,k or ϕ II,k<φ II,k.

It is noteworthy that the decision-makers may indicate partial preference relations for the alternatives. Moreover, preference conflicts may exist among the decision-makers' subjective judgments. Accordingly, the comparison results between the stated subjective preferences and the overall dominance relations are somewhat conflicting. This paper employs the proposed comprehensive dominance measures to define the individual levels of rank consistency and rank inconsistency regarding the obtained overall dominance relations and the decision-maker's paired comparison judgments about alternatives. Based on the Type I comprehensive dominance measure, the individual level of rank consistency between the preorders of the alternatives zϕ and zφ for the ordered pair (ϕ,φ)Ωk (k{1,2,,K}) is determined as follows:

ϕ I,kφ I,k+=ϕ I,kφ I,kif   ϕ I,kφ I,k,0if   ϕ I,k<φ I,k,=max0,ϕ I,kφ I,k.(25)

Moreover, based on the Type II comprehensive dominance measure, the individual level of rank consistency for each (ϕ,φ)Ωk is defined as follows:

ϕ II,kφ II,k+=ϕ II,kφ II,kif   ϕ II,kφ II,k,0if   ϕ II,k<φ II,k,=max0,ϕ II,kφ II,k.(26)

Note that (ϕ I,kφ I,k)+0 and (ϕ II,kφ II,k)+0.

In contrast, this paper utilizes the Type I comprehensive dominance measure to define the individual level of rank inconsistency between the preorders of zϕ and zφ for each (ϕ,φ)Ωk as follows:

ϕ I,kφ I,k=φ I,kϕ I,kif   ϕ I,k<φ I,k,0if   ϕ I,kφ I,k,=max0,φ I,kϕ I,k.(27)

Additionally, based on the Type II comprehensive dominance measure, the individual level of rank inconsistency for each (ϕ,φ)Ωk is defined as follows:

ϕ II,kφ II,k=φ II,kϕ II,kif   ϕ II,k<φ II,k,0if   ϕ II,kφ II,k,=max0,φ II,kϕ II,k.(28)

Note that (ϕ I,kφ I,k)0 and (ϕ II,kφ II,k)0. Furthermore, it is easily proved that

ϕ I,kφ I,k+ϕ I,kφ I,k=ϕ I,kφ I,k,(29)
ϕ II,kφ II,k+ϕ II,kφ II,k=ϕ II,kφ II,k.(30)

Next, this paper defines individual fit measurements for each decision-maker. This paper ascertains goodness of fit by integrating individual levels of rank consistency for all ordered pairs. Moreover, this paper figures out poorness of fit by combining individual levels of rank inconsistency. More specifically, for each decision-maker ekE, this paper aggregates the individual levels of rank consistency (ϕ I,kφ I,k)+ for all (ϕ,φ)Ωk to identify the Type I individual goodness of fit GI,k; moreover, the individual levels (ϕ II,kφ II,k)+ are aggregated to identify the Type II individual goodness of fit GII,k, as follows:

GI,k=(ϕ,φ)Ωkϕ I,kφ I,k+,(31)
GII,k=(ϕ,φ)Ωkϕ II,kφ II,k+.(32)

It is worthy to note that GI,k0 and GII,k0 because (ϕ I,kφ I,k)+0 and (ϕ II,kφ II,k)+0, respectively.

In the same way, this paper sums the individual levels of rank inconsistency (ϕ I,kφ I,k) for all (ϕ,φ)Ωk to determine the Type I individual poorness of fit BI,k; additionally, the individual levels (ϕ II,kφ II,k) are summed to acquire the Type II individual poorness of fit BII,k, as follows:

BI,k=(ϕ,φ)Ωkϕ I,kφ I,k,(33)
BII,k=(ϕ,φ)Ωkϕ II,kφ II,k.(34)

Because (ϕ I,kφ I,k)0 and (ϕ II,kφ II,k)0, one can obtain that BI,k0 and BII,k0, respectively.

In general, the decision-makers are conceived to prefer an alternative that has the highest group comprehensive dominance measure. Accordingly, it is reasonable to designate the total sum of group comprehensive dominance measures as a maximal objective. In particular, the total group comprehensive dominance measure is defined as the total sum of i I,k (or i II,k) for all ziZ and ekE. On the other side, a lower individual poorness of fit BI,k (or BII,k) represents a small extent of violation associated with the preference set Ωk. To determine a set of collective criterion weights for which the total group comprehensive dominance measure k=1ki=1mi I,k (or k=1ki=1mi II,k) is maximal and the group poorness of fit k=1kBI,k (or k=1kBII,k) is minimal, this paper constructs a bi-objective mathematical programming model as the basic model in the PF LINMAP approach.

In addition, it is reasonable to presume that the decision-maker ek would like to acquire a solution with a higher individual goodness of fit GI,k (or GII,k) and a lower individual poorness of fit BI,k (or BII,k). This implies that the condition of GI,kBI,k (or GII,kBII,k) should be incorporated into the basic optimization model. Let k be a nonnegative number that is used to represent the lowest acceptable level concerning the deviation between GI,k (or GII,k) and BI,k (or BII,k). More concretely, the individual goodness of fit GI,k (or GII,k) is not smaller than individual poorness of fit BI,k (or BII,k) by k for each decision-maker ek. That is, the basic optimization model should be formulated under the consideration of GI,kBI,kk (or GII,kBII,kk).

Based on Type I dominance measures, to maximize the total group comprehensive dominance measure k=1ki=1mi I,k and to minimize the group poorness of fit k=1kBI,k, the following bi-objective mathematical programming model is established:

  Model 1(I).maxk=1Ki=1mi I,kmink=1KBI,ks.t.   GI,kBI,kk   for all k,j=1nwj=1,wjεj   for all j.(35)

Based on Type II dominance measures, the bi-objective (i.e., maximizing the k=1ki=1mi II,k value and minimizing the k=1kBII,k value) mathematical programming model is constructed as follows:

  Model 1(II).maxk=1Ki=1mi II,kmink=1KBII,ks.t.  GII,kBII,kk   for all k,j=1nwj=1,wjεj   for all j.(36)

It is worth mentioning that the relative importance among multiple decision-makers can be appropriately reflected by means of the lowest acceptable level concerning the deviation between individual goodness of fit and individual poorness of fit. For example, if the importance of the decision-maker ek is higher than the other decision-makers, a relatively high k value can be designated for convenience. Namely, there is no need to determine the importance weights of multiple decision-makers, which can facilitate the implementation efficiency of the developed PF LINMAP techniques.

Let Γϕφ I,k and Γϕφ II,k denote the individual degrees of violation with respect to the ordered pair (ϕ,φ)Ωk based on Types I and II dominance measures, respectively. They are derived using the maximal value of 0 and φ I,kϕ I,k (or φ II,kϕ II,k) for each (ϕ,φ), as follows:

Γϕφ I,k=max0,φ I,kϕ I,k=max0,j=1nMI(pφjk)MI(pϕjk)wj,(37)
Γϕφ II,k=max0,φ II,kϕ II,k=max0,j=1nMII(pφjk)MII(pϕjk)wj.(38)

It is easy to see that the following conditions hold: Γϕφ I,k0, Γϕφ I,kj=1n(MI(pφjk)MI(pϕjk))wj, Γϕφ II,k0, and Γϕφ II,kj=1n(MII(pφjk)MII(pϕjk))wj for all (ϕ,φ)Ωk. It can be obtained that

j=1nMI(pϕjk)MI(pφjk)wj+Γϕφ I,k0,(39)
j=1nMII(pϕjk)MII(pφjk)wj+Γϕφ II,k0.(40)

Furthermore, the group poorness of fit k=1kBI,k and k=1kBII,k can be expressed as follows:

k=1KBI,k=k=1K(ϕ,φ)Ωkmax0,φ I,kϕ I,k=k=1K(ϕ,φ)ΩkΓϕφ I,k,,(41)
k=1KBII,k=k=1K(ϕ,φ)Ωkmax0,φ II,kϕ II,k=k=1K(ϕ,φ)ΩkΓϕφ II,k.,(42)

The differences GI,kBI,k and GII,kBII,k become

GI,kBI,k=(ϕ,φ)Ωkϕ I,kφ I,k+ϕ I,kφ I,k=(ϕ,φ)Ωkj=1nMI(pϕjk)MI(pφjk)wj,(43)
GII,kBII,k=(ϕ,φ)Ωkϕ II,kφ II,k+ϕ II,kφ II,k=(ϕ,φ)Ωkj=1nMII(pϕjk)MII(pφjk)wj.(44)

From Definition 8, one has i I,k=j=1nMI(pijk)wj and i II,k=j=1nMII(pijk)wj Based on the above results, the basic Models 1(I) and 1(II) can be equivalently represented via the following bi-objective optimization models:

Model 2(I).maxk=1Ki=1mi I,k=k=1Ki=1mj=1nMI(pijk)wjmink=1KBI,k=k=1K(ϕ,φ)ΩkΓϕφ I,k          s.t.  (ϕ,φ)Ωkj=1nMI(pϕjk)MI(pφjk)wjk  for all k,j=1nMI(pϕjk)MI(pφjk)wj+Γϕφ I,k0and  Γϕφ I,k0  for  (ϕ,φ)Ωk,j=1nwj=1,wjεj for all j;(45)
Model 2(II).maxk=1Ki=1mi II,k=k=1Ki=1mj=1nMII(pijk)wjmink=1KBII,k=k=1K(ϕ,φ)ΩkΓϕφ II,k(46)
s.t.  (ϕ,φ)Ωkj=1nMII(pϕjk)MII(pφjk)wjk  for all k,j=1nMII(pϕjk)MII(pφjk)wj+Γϕφ II,k0and  Γϕφ II,k0  for  (ϕ,φ)Ωk,j=1nwj=1,wjεj  for all j.

The bi-objective models in Models 2(I) and 2(II) can be further transformed into simple linear programming models for enhancing implementation efficiency. The minimal objectives k=1kBI,k in Model 2(I) and k=1kBII,k in Model 2(II) are equivalent to the maximal objectives k=1kBI,k and k=1kBII,k, respectively. It follows that mink=1k(ϕ,φ)ΩΓϕφ I,k=maxk=1k(ϕ,φ)ΩΓϕφ I,k and min{k=1K(ϕ,φ)ΩΓϕφII,k}=max{k=1K(ϕ,φ)ΩΓϕφII,k}. Let a parameter η represent the weight in connection with the objective of “total group comprehensive dominance”; let 1η represent the weight in connection with the objective of “group poorness of fit,” in which η[0,1]. The use of the parameter η can effectively coordinate the two objectives in Models 2(I) and 2(II) and transform bi-objective models into single-objective linear programming models. Based on Types I and II dominance measures, the proposed PF LINMAP methodology can be represented by the following parametric linear programming models:

Type I PF LINMAP Model.  maxηk=1Ki=1mj=1nMI(pijk)wj1ηk=1K(ϕ,φ)ΩkΓϕφ I,ks.t.(ϕ,φ)Ωkj=1nMI(pϕjk)MI(pφjk)wjk  for all k,j=1nMI(pϕjk)MI(pφjk)wj+Γϕφ I,k0and  Γϕφ I,k0  for  (ϕ,φ)Ωk,j=1nwj=1,  wjεj  for all j;(47)
Type II PF LINMAP Model.  maxηk=1Ki=1mj=1nMII(pijk)wj1ηk=1K(ϕ,φ)ΩkΓϕφ II,ks.t.(ϕ,φ)Ωkj=1nMII(pϕjk)MII(pφjk)wjk  for all k,j=1nMII(pϕjk)MII(pφjk)wj+Γϕφ II,k0and  Γϕφ II,k0  for  (ϕ,φ)Ωk,j=1nwj=1,  wjεj  for all j.(48)

The optimal solutions of the collective weight w¯j=(w¯1,w¯2,,w¯n) for each criterion cjC and the individual violation Γ¯ϕφ I,k (or Γ¯ϕφ II,k) for each ordered pair (ϕ,φ)Ωk can be determined by solving the Type I or Type II PF LINMAP models. The corresponding group comprehensive dominance measure of the alternative ziZ is calculated as below:

k=1K¯i I,k=k=1Kj=1nw¯jMIpijk,(49)
k=1K¯i II,k=k=1Kj=1nw¯jMIIpijk.(50)

Lastly, the overall priority ranking results of candidate alternatives is acquired in conformity with the decreasing order of the values of k=1k¯i I,k (or k=1k¯i II,k). Moreover, the best compromise solution is ranked the best by virtue of the values of k=1k¯i I,k (or k=1k¯i II,k) among all ziZ.

Based on Types I and II dominance measures, the algorithmic procedures of the proposed PF LINMAP methodology can be summarized as follows:

Algorithm I: Type I PF LINMAP method

  • Step I.1: Formulate an MCGDM problem involving the set of alternatives Z={z1,z2,,zm}, the set of criteria C={c1,c2,,cn}, and the set of decision-makers E={e1,e2,,eK}.

  • Step I.2: Request each decision-maker ek to provide the paired preference relations over alternatives to form the preference set Ωk={(ϕ,φ)|zϕzφ,ϕ,φ{1,2,,m}}.

  • Step I.3: Establish the PF evaluative rating pijk of each alternative ziZ in regard to criterion cjC for the decision-maker ekE. Form the PF decision matrix Pk=[pijk]m×n.

  • Step I.4: Identify the displaced reference points, i.e., the positive-ideal reference point p*jk and the negative-ideal reference point p#jk, with respect to each criterion cj based on the Pk.

  • Step I.5: Derive the PF scalar function V(pijk) for each pijk in Pk. Calculate the PF scalar functions V(p*jk) and V(p#jk) for each cjC and ekE.

  • Step I.6: Compute the PF scalar function-based dominance measure when anchoring p*jk and p#jk, i.e., Type I dominance measure MI(pijk), of each pijk in Pk.

  • Step I.7: Set the parameter values. Specify the lowest acceptable level k for all k and the nonnegative boundary condition εj for all j, where k0 and εj[0,1]. Assign the relative importance η of the “total group comprehensive dominance” objective over the “group poorness of fit” objective, where η[0,1].

  • Step I.8: Denote w=(w1,w2,,wn) as the weight vector of the n criteria such that j=1nwj=1 and wjεj for all j. Let Γϕφ I,k denote the individual degrees of violation with respect to the ordered pair (ϕ,φ)Ωk.

  • Step I.9: Construct the linear programming problem using the Type I PF LINMAP model to resolve the optimal collective weight w¯j and the individual violation Γ¯ϕφ I,k.

  • Step I.10: Obtain the optimal group comprehensive dominance measure k=1k¯i I,k for each zi. Identify the overall priority ranking orders of the m alternatives and the best compromise solution in line with the k=1k¯i I,k values.

6. PRACTICAL APPLICATION

This section employs the PF LINMAP techniques to address an MCGDM problem concerning railway project investment introduced by Xue et al. [26] to validate the practicability and effectiveness of the developed methodology in realistic situations.

Algorithm II: Type II PF LINMAP method

  • Steps II.1–II.3: see Steps I.1–I.3 of Algorithm I.

  • Step II.4: Calculate the PF scalar function V(pijk) for each pijk to acquire the PF scalar function-based dominance measure when anchoring p+jk and pjk, i.e., Type II dominance measure MII(pijk), of each pijk in Pk.

  • Step II.5: See Step I.7 of Algorithm I.

  • Step II.6: Denote w=(w1,w2,,wn) as the weight vector of the n criteria such that j=1nwj=1 and wjεj for all j. Let Γϕφ II,k denote the individual degrees of violation with respect to the ordered pair (ϕ,φ)Ωk.

  • Step II.7: Construct the linear programming problem using the Type II PF LINMAP model to resolve the optimal collective weight w¯j and the individual violation Γ¯ϕφ II,k.

  • Step II.8: Obtain the optimal group comprehensive dominance measure k=1k¯i II,k for each zi. Identify the overall priority ranking orders of the m alternatives and the best compromise solution in line with the k=1k¯i II,k values.

Xue et al. [26] utilized PF entropy measures to develop a novel PF LINMAP method and applied it to manage an MCGDM problem regarding the railway project selection in China's Belt and Road Initiative (BRI). Till now, BRI involves infrastructure development and investments in countries and international organizations in Asia, Europe, Africa, the Middle East, and the Americas. Consider the importance of railway projects in the infrastructure investment of BRI, Xue et al. took Germany (z1), Russia (z2), Singapore (z3), and Malaysia (z4) as the candidate alternatives in the set Z, because these countries have intentions to cooperate with the railway project. Moreover, Xue et al. explored an indicator system involving financial and noneconomic evaluations. Their proposed indicator system involves six aspects consisting of financial internal rate of return (c1), net present value (c2), investment recovery period (c3), debt ratio and current ratio (c4), repayment period of loan (c5), and public benefit and diplomatic influence (c6). The six aspects were regarded as the evaluative criteria in the set C. Three experts participated in a group decision-making process in this case. On the basis of the above, in Steps I.1 and II.1, the MCGDM problem under study was formulated with Z={z1,z2,z3,z4}, C={c1,c2,,c6}, and E={e1,e2,e3}, in which m = 4, n = 6, and K = 3.

First, this paper employed the proposed Algorithm I (i.e., Type I PF LINMAP method) to solve the above MCGDM problem. In Step I.2, in reference to the investigated data in Xue et al. [26], the three decision-makers provided some paired preference relations over alternatives. The decision-makers' preference sets were constructed as follows: Ω1 = {(3, 2), (4, 1), (3, 1)}, Ω2 = {(2, 1), (4, 3), (2, 4), (3, 1)}, and Ω3 = {(3, 1), (3, 4), (2, 3), (2, 4)}.

In Step I.3, the three decision-makers evaluated the four alternatives based on the six criteria; they provided the results of the degree of satisfaction μijk and the degree of dissatisfaction νijk of alternative ziZ with respect to criterion cjC, as shown in Xue et al. [26]. For mathematical representation using Pythagorean membership grades, this paper computed the values of rijk, dijk, and θijk to establish the PF evaluative rating pijk=μijk,νijk;rijk,dijk in Eq. (11) for each ekE. The data of PF evaluative ratings for the decision-makers e1, e2, and e3 are shown in Tables 24, respectively, including the values of μijk, νijk, rijk, and dijk in pijk, as well as the radians θijk. Applying Eq. (12), the three PF decision matrices P1=[pij1]4×6, P2=[pij2]4×6, and P3=[pij3]4×6 can be established based on the data (i.e., μijk, νijk, rijk, and dijk) in Tables 24, respectively.

zi cj μij1 νij1 rij1 dij1 θij1 Vpij1
z1 c1 0.70 0.60 0.9220 0.5489 0.7086 0.5451
c2 0.80 0.60 1.0000 0.5903 0.6435 0.5903
c3 0.50 0.50 0.7071 0.5000 0.7854 0.5000
c4 0.40 0.70 0.8062 0.3305 1.0517 0.3633
c5 0.90 0.40 0.9849 0.7338 0.4182 0.7302
c6 0.40 0.90 0.9849 0.2662 1.1526 0.2698
z2 c1 0.90 0.40 0.9849 0.7338 0.4182 0.7302
c2 0.80 0.60 1.0000 0.5903 0.6435 0.5903
c3 0.70 0.70 0.9899 0.5000 0.7854 0.5000
c4 0.90 0.30 0.9487 0.7952 0.3218 0.7800
c5 0.80 0.20 0.8246 0.8440 0.2450 0.7837
c6 0.90 0.40 0.9849 0.7338 0.4182 0.7302
z3 c1 0.70 0.50 0.8602 0.6051 0.6202 0.5904
c2 0.40 0.30 0.5000 0.5903 0.6435 0.5452
c3 0.90 0.10 0.9055 0.9296 0.1107 0.8890
c4 0.80 0.20 0.8246 0.8440 0.2450 0.7837
c5 0.70 0.40 0.8062 0.6695 0.5191 0.6367
c6 0.60 0.60 0.8485 0.5000 0.7854 0.5000
z4 c1 0.90 0.30 0.9487 0.7952 0.3218 0.7800
c2 0.70 0.20 0.7280 0.8228 0.2783 0.7350
c3 0.40 0.30 0.5000 0.5903 0.6435 0.5452
c4 0.90 0.40 0.9849 0.7338 0.4182 0.7302
c5 0.50 0.40 0.6403 0.5704 0.6747 0.5451
c6 0.60 0.70 0.9220 0.4511 0.8622 0.4549
Table 2

Relevant data associated with the decision-maker e1.

zi cj μij2 νij2 rij2 dij2 θij2 Vpij2
z1 c1 0.50 0.40 0.6403 0.5704 0.6747 0.5451
c2 0.30 0.90 0.9487 0.2048 1.2490 0.2200
c3 0.40 0.30 0.5000 0.5903 0.6435 0.5452
c4 0.90 0.40 0.9849 0.7338 0.4182 0.7302
c5 0.30 0.70 0.7616 0.2578 1.1659 0.3155
c6 0.40 0.50 0.6403 0.4296 0.8961 0.4549
z2 c1 0.90 0.30 0.9487 0.7952 0.3218 0.7800
c2 0.80 0.50 0.9434 0.6444 0.5586 0.6362
c3 0.70 0.60 0.9220 0.5489 0.7086 0.5451
c4 0.90 0.20 0.9220 0.8608 0.2187 0.8326
c5 0.90 0.20 0.9220 0.8608 0.2187 0.8326
c6 0.80 0.30 0.8544 0.7716 0.3588 0.7321
z3 c1 0.70 0.60 0.9220 0.5489 0.7086 0.5451
c2 0.50 0.30 0.5831 0.6560 0.5404 0.5909
c3 0.80 0.10 0.8062 0.9208 0.1244 0.8393
c4 0.90 0.10 0.9055 0.9296 0.1107 0.8890
c5 0.70 0.30 0.7616 0.7422 0.4049 0.6845
c6 0.50 0.50 0.7071 0.5000 0.7854 0.5000
z4 c1 0.30 0.90 0.9487 0.2048 1.2490 0.2200
c2 0.20 0.30 0.3606 0.3743 0.9828 0.4547
c3 0.30 0.70 0.7616 0.2578 1.1659 0.3155
c4 0.50 0.80 0.9434 0.3556 1.0122 0.3638
c5 0.70 0.60 0.9220 0.5489 0.7086 0.5451
c6 0.40 0.70 0.8062 0.3305 1.0517 0.3633
Table 3

Relevant data associated with the decision-maker e2.

zi cj μij3 νij3 rij3 dij3 θij3 Vpij3
z1 c1 0.40 0.30 0.5000 0.5903 0.6435 0.5452
c2 0.30 0.40 0.5000 0.4097 0.9273 0.4548
c3 0.50 0.40 0.6403 0.5704 0.6747 0.5451
c4 0.60 0.60 0.8485 0.5000 0.7854 0.5000
c5 0.70 0.70 0.9899 0.5000 0.7854 0.5000
c6 0.30 0.70 0.7616 0.2578 1.1659 0.3155
z2 c1 0.80 0.30 0.8544 0.7716 0.3588 0.7321
c2 0.70 0.10 0.7071 0.9097 0.1419 0.7897
c3 0.80 0.20 0.8246 0.8440 0.2450 0.7837
c4 0.90 0.10 0.9055 0.9296 0.1107 0.8890
c5 0.80 0.30 0.8544 0.7716 0.3588 0.7321
c6 0.80 0.10 0.8062 0.9208 0.1244 0.8393
z3 c1 0.20 0.50 0.5385 0.2422 1.1903 0.3612
c2 0.30 0.40 0.5000 0.4097 0.9273 0.4548
c3 0.80 0.60 1.0000 0.5903 0.6435 0.5903
c4 0.90 0.10 0.9055 0.9296 0.1107 0.8890
c5 0.30 0.10 0.3162 0.7952 0.3218 0.5933
c6 0.60 0.40 0.7211 0.6257 0.5880 0.5906
z4 c1 0.60 0.80 1.0000 0.4097 0.9273 0.4097
c2 0.40 0.10 0.4123 0.8440 0.2450 0.6419
c3 0.20 0.40 0.4472 0.2952 1.1071 0.4084
c4 0.70 0.10 0.7071 0.9097 0.1419 0.7897
c5 0.60 0.20 0.6325 0.7952 0.3218 0.6867
c6 0.80 0.10 0.8062 0.9208 0.1244 0.8393
Table 4

Relevant data associated with the decision-maker e3.

In Step I.4, this paper employed Eqs. (14) and (15) to identify the displaced reference points p*jk and p#jk, respectively, in connection with cjC for each ek. The determination results of the positive- and negative-ideal reference points are revealed in Tables 5 and 6, respectively.

ek cj μ*jk ν*jk r*jk d*jk θ*jk Vp*jk
e1 c1 0.90 0.30 0.9487 0.7952 0.3218 0.7800
c2 0.80 0.20 0.8246 0.8440 0.2450 0.7837
c3 0.90 0.10 0.9055 0.9296 0.1107 0.8890
c4 0.90 0.20 0.9220 0.8608 0.2187 0.8326
c5 0.90 0.20 0.9220 0.8608 0.2187 0.8326
c6 0.90 0.40 0.9849 0.7338 0.4182 0.7302
e2 c1 0.90 0.30 0.9487 0.7952 0.3218 0.7800
c2 0.80 0.30 0.8544 0.7716 0.3588 0.7321
c3 0.80 0.10 0.8062 0.9208 0.1244 0.8393
c4 0.90 0.10 0.9055 0.9296 0.1107 0.8890
c5 0.90 0.20 0.9220 0.8608 0.2187 0.8326
c6 0.80 0.30 0.8544 0.7716 0.3588 0.7321
e3 c1 0.80 0.30 0.8544 0.7716 0.3588 0.7321
c2 0.70 0.10 0.7071 0.9097 0.1419 0.7897
c3 0.80 0.20 0.8246 0.8440 0.2450 0.7837
c4 0.90 0.10 0.9055 0.9296 0.1107 0.8890
c5 0.80 0.10 0.8062 0.9208 0.1244 0.8393
c6 0.80 0.10 0.8062 0.9208 0.1244 0.8393
Table 5

Results of the positive-ideal reference point p*jk.

ek cj μ#jk ν#jk r#jk d#jk θ#jk Vp#jk
e1 c1 0.70 0.60 0.9220 0.5489 0.7086 0.5451
c2 0.40 0.60 0.7211 0.3743 0.9828 0.4094
c3 0.40 0.70 0.8062 0.3305 1.0517 0.3633
c4 0.40 0.70 0.8062 0.3305 1.0517 0.3633
c5 0.50 0.40 0.6403 0.5704 0.6747 0.5451
c6 0.40 0.90 0.9849 0.2662 1.1526 0.2698
e2 c1 0.30 0.90 0.9487 0.2048 1.2490 0.2200
c2 0.20 0.90 0.9220 0.1392 1.3521 0.1674
c3 0.30 0.70 0.7616 0.2578 1.1659 0.3155
c4 0.50 0.80 0.9434 0.3556 1.0122 0.3638
c5 0.30 0.70 0.7616 0.2578 1.1659 0.3155
c6 0.40 0.70 0.8062 0.3305 1.0517 0.3633
e3 c1 0.20 0.80 0.8246 0.1560 1.3258 0.2163
c2 0.30 0.40 0.5000 0.4097 0.9273 0.4548
c3 0.20 0.60 0.6325 0.2048 1.2490 0.3133
c4 0.60 0.60 0.8485 0.5000 0.7854 0.5000
c5 0.30 0.70 0.7616 0.2578 1.1659 0.3155
c6 0.30 0.70 0.7616 0.2578 1.1659 0.3155
Table 6

Results of the negative-ideal reference point p#jk.

In Step I.5, this paper utilized Eq. (18) to compute the PF scalar functions V(pijk), V(p*jk), and V(p#jk). The results of V(pijk) for each pijk are listed in the last columns of Tables 24. The results of the PF scalar functions V(p*jk) and V(p#jk) are indicated in the last columns of Tables 5 and 6, respectively.

In Step I.6, this paper employed the PF scalar functions V(pijk), V(p*jk), and V(p#jk) to determine the Type I dominance measure MI(pijk) using Eq. (21) based on Theorem 5. The obtained results are presented in Table 7.

ek cj MIp1jk MIp2jk MIp3jk MIp4jk
e1 c1 0.0000 0.7880 0.1931 1.0000
c2 0.4834 0.4834 0.3628 0.8699
c3 0.2600 0.2600 1.0000 0.3459
c4 0.0000 0.8879 0.8957 0.7818
c5 0.6438 0.8298 0.3184 0.0000
c6 0.0000 1.0000 0.5000 0.4021
e2 c1 0.5805 1.0000 0.5805 0.0000
c2 0.0932 0.8303 0.7501 0.5088
c3 0.4385 0.4383 1.0000 0.0000
c4 0.6977 0.8927 1.0000 0.0000
c5 0.0000 1.0000 0.7135 0.4439
c6 0.2483 1.0000 0.3706 0.0000
e3 c1 0.6376 1.0000 0.2809 0.3749
c2 0.0000 1.0000 0.0000 0.5585
c3 0.4928 1.0000 0.5889 0.2021
c4 0.0000 1.0000 1.0000 0.7447
c5 0.3522 0.7953 0.5304 0.7086
c6 0.0000 1.0000 0.5252 1.0000
Table 7

Results of the Type I dominance measure MIpijk.

In Step I.7, this paper regarded the three decision-makers of equal importance to designate the lowest acceptable level k=0.3 for k{1,2,3}. Moreover, this paper specified the nonnegative boundary condition εj=0.025 for j{1,2,,6}. The relative importance η was set as 0.2. Namely, the weights of the two objectives of “total group comprehensive dominance” and “group poorness of fit” were 0.2 and 0.8, respectively.

In Step I.8, let w=(w1,w2,,w6) denote the weight vector of the six criteria such that j=16wj=1 and wjεj=0.025 for all j. According to the decision-makers' preference sets, the individual degrees of violation based on Type I dominance measures were denoted as Γ32I,1, Γ41I,1, and Γ31I,1 for Ω1, Γ21I,2, Γ43I,2, Γ24I,2, and Γ31I,2 for Ω2, and Γ31I,3, Γ34I,3, Γ23I,3, and Γ24I,3 for Ω3.

In Step I.9, this paper applied the Type I PF LINMAP model in Eq. (47) to construct a parametric linear programming model, as shown in the Appendix. The model was solved to obtain the optimal collective weight vector and individual degrees of violation as follows: w¯=(w¯1,w¯2,,w¯6) = (0.0250, 0.2825, 0.0946, 0.5479, 0.0250, 0.0250), Γ¯43I,2=0.7412, and Γ¯32I,1=Γ¯41I,1=Γ¯31I,1=Γ¯21I,2=Γ¯24I,2=Γ¯31I,2=Γ¯31I,3=Γ¯34I,3=Γ¯23I,3=Γ¯24I,3=0.

In Step I.10, the optimal group comprehensive dominance measures were derived using Eq. (49) as follows: k=13¯1 I,k=0.7194 for z1, k=13¯2 I,k=2.5481 for z2, k=13¯3 I,k=2.2461 for z3, and k=13¯4 I,k=1.5337 for z4. Therefore, the overall priority ranking of the four alternatives was z2z3z4z1; moreover, the best compromise solution was z2. The obtained results via Algorithm I are concordant with those yielded by Xue et al.'s PF entropy-based LINMAP method [26].

Next, this paper employed the developed Algorithm II (i.e., Type II PF LINMAP method) to handle the above MCGDM problem. It is noted that Steps II.1–II.3 and II.5 of Algorithm II are the same as Steps I.1–I.3 and I.7 of Algorithm I, respectively.

In Step II.4, this paper computed the PF scalar function V(pijk) to acquire the Type II dominance measure MII(pijk) of each pijk according to Eq. (22) in Theorem 5. That is, MII(pij1)=V(pij1), MII(pij2)=V(pij2), and MII(pij3)=V(pij3) for all ziZ and cjC, and the results were indicated in the last columns of Tables 24.

In Step II.6, let the weight vector of criteria w=(w1,w2,,w6). Furthermore, the individual degrees of violation based on Type II dominance measures were denoted as Γ32II,1, Γ41II,1, and Γ31II,1 for Ω1, Γ21II,2, Γ43II,2, Γ24II,2, and Γ31II,2 for Ω2, and Γ31II,3, Γ34II,3, Γ23II,3, and Γ24II,3 for Ω3.

In Step II.7, this paper employed the Type II PF LINMAP model in Eq. (48) to set up a parametric linear programming model. Solving the model, the optimal collective weight vector w¯=(w¯1,w¯2,,w¯6) = (0.0250, 0.0250, 0.0535, 0.7810, 0.0905, 0.0250), and the optimal individual degrees of violation were as follows: Γ¯43II,2=0.4657 and Γ¯32II,1=Γ¯41II,1=Γ¯31II,1=Γ¯21II,2=Γ¯24II,2=Γ¯31II,2=Γ¯31II,3=Γ¯34II,3=Γ¯23II,3=Γ¯24II,3=0.

In Step II.8, the optimal group comprehensive dominance measures were obtained using Eq. (50) as follows: k=13¯1 II,k=1.5680 for z1, k=13¯2 II,k=2.4281 for z2, k=13¯3 II,k=2.4149 for z3, and k=13¯4 II,k=1.8224 for z4. The overall priority ranking of the alternatives was z2z3z4z1, along with the best compromise solution z2. The obtained results using Algorithm II are in conformity with those yielded by the proposed Algorithm I and Xue et al.'s approach [26].

7. COMPARATIVE ANALYSIS AND DISCUSSIONS

This section intends to implement a sensitivity analysis and conduct some comparative studies to validate the workableness and attractiveness of the proposed methodology.

Based on the Types I and II PF LINMAP models in Eqs. (47) and (48), the parameter η can adjust the proportion of the “total group comprehensive dominance” part and the “group poorness of fit” part. The proposed methodology, which originate from classical LINMAP, should initiate ideas that are least violated in regard to the decision-makers' paired preference relations over alternatives. This implies that the proportion of the “group poorness of fit” part (with the weight 1η) should be larger than the other part. To inherit the merits of classical LINMAP, 0η0.5 is recommended for practical application. Accordingly, the following sensitivity analysis would explore the application results concerning the MCGDM problem of railway project investment with different values of η varying from 0 to 0.5 under the settings of k=0.3 for k{1,2,3} and εj=0.025 for j{1,2,,6}.

The first sensitivity analysis investigates the influences of various values of the parameter η on the solution results using the Type I PF LINMAP model. Consider eleven cases in which η=0.00,0.05,,0.50. Employing Algorithm I, the comparison results of the optimal group comprehensive dominance measure k=13¯i I,k of the four alternatives are depicted in Figure 2.

Figure 2

Comparisons of the optimal group comprehensive dominance measure k=13¯i I,k under various values of η (k=0.3 and εj=0.025).

According to the comparison results in Figure 2, it is easy to observe that the Type I PF LINMAP model has high robustness because the identical ranking results were obtained in most cases. As shown in this figure, the Type I PF LINMAP model rendered the overall priority ranking z2z3z4z1 in the ten cases of η=0.00,0.05,,0.20 and η=0.30,0.35,,0.50. In these cases, the same best compromise solution z2 was obtained as well. Nonetheless, a different ranking z3z2z4z1 was acquired in the case of η = 0.25. Moreover, the best compromise solution becomes z3 in this case. As a whole, the optimal group comprehensive dominance measures k=13¯2 I,k, k=13¯3 I,k, and k=13¯4 I,k for alternatives z2, z3, and z4, respectively, progressively increase when the values of η is from 0 to 0.5. In contrast, for z1, the results of k=13¯1 I,k decrease with η varying from 0 to 0.5.

Additionally, the contrast results of the optimal Type I comprehensive dominance measure ¯i I,k for the decision-makers e1, e2, and e3 are revealed in Figures 35, respectively. With reference to the results in these figures, the comparisons among the optimal Type I comprehensive dominance measures ¯1 I,k, ¯2 I,k, ¯3 I,k, and ¯4 I,k are obvious for the decision-maker ekE.

Figure 3

Contrasts of the optimal Type I comprehensive dominance measure ¯iI,1 under various values of η for the decision-maker e1.

Figure 4

Contrasts of the optimal Type I comprehensive dominance measure ¯iI,2 under various values of η for the decision-maker e2.

Figure 5

Contrasts of the optimal Type I comprehensive dominance measure ¯iI,3 under various values of η for the decision-maker e3.

The priority rankings of the four alternatives rendered by the Type I PF LINMAP model are demonstrated in Figure 6, consisting of the overall priority ranking orders for group decision-makers and the individual ranking orders for each decision-maker. As mentioned before, the overall priority ranking z2z3z4z1 was acquired in most cases for group decision-makers. On the other hand, consider the individual ranking results for the decision-makers e1, e2, and e3. By comparing the optimal Type I comprehensive dominance measure ¯iI,1 for all ziZ, three ranking results z3z2z4z1, z4z3z2z1, and z2z3z4z1 were generated in the cases of η=0.00,0.05,0.10,0.15,0.25, η=0.20, and η=0.30,0.35,,0.50, respectively, for the decision-maker e1. Next, based on the ¯iI,2 values, only one ranking z3z2z1z4 was determined regardless of the η values for the decision-maker e2. Based on the ¯iI,3 values, two ranking results z2z3~z4z1 and z2z3z4z1 were found in the cases of η=0.00,0.05,,0.20 and η=0.25,0.30,,0.50, respectively, for the decision-maker e3.

Figure 6

Results of the priority ranking orders for group and individual decision-makers via the Type I PF linear programming technique for multidimensional analysis of preference (LINMAP) model.

The second sensitivity analysis explores the effects of different values of the parameter η on the results using the Type II PF LINMAP model. Let η=0.00,0.05,,0.50 under the settings of k=0.3 and εj=0.025 for all k and j. Applying Algorithm II, the comparison results of the optimal group comprehensive dominance measure k=13¯i II,k of the alternatives are represented in Figure 7.

Figure 7

Comparisons of the optimal group comprehensive dominance measure k=13¯i II,k under various values of η (k=0.3 and εj=0.025).

From Figure 7, it can be observed that the Type II PF LINMAP model shows strong robustness because the same ranking results were obtained in all of the investigated cases. Specifically, the Type II PF LINMAP model produced the overall priority ranking z2z3z4z1 with different values of η varying from 0 to 0.5. Moreover, the alternative z2 was the best compromise solution in the MCGDM problem. Overall, the optimal group comprehensive dominance measures k=13¯i II,k for all ziZ slowly increase as the η value is from 0 to 0.25. When η > 0.25, the values of k=13¯i II,k are almost unchangeable for each alternative.

The comparison results of the optimal Type II comprehensive dominance measure ¯i II,k for the decision-makers e1, e2, and e3 are sketched in Figures 810, respectively. As opposite to Figures 35, the contrasts among the optimal Type II comprehensive dominance measures ¯1 II,k, ¯2 II,k, ¯3 II,k, and ¯4 II,k do not vary dramatically for each ekE.

Figure 8

Contrasts of the optimal Type II comprehensive dominance measure ¯iII,1 under various values of η for the decision-maker e1.

Figure 9

Contrasts of the optimal Type II comprehensive dominance measure ¯iII,2 under various values of η for the decision-maker e2.

Figure 10

Contrasts of the optimal Type II comprehensive dominance measure ¯iII,3 under various values of η for the decision-maker e3.

Figure 11 shows the ranking results of the four candidate alternatives produced by the Type II PF LINMAP model. The graphs in this figure consist of the overall priority ranking orders for group decision-makers and the individual ranking orders for each decision-maker. In line with Figure 7, the overall priority ranking z2z3z4z1 was acquired with η varying from 0 to 0.5 for group decision-makers. Next, consider the individual ranking results based on the optimal Type II comprehensive dominance measures ¯iII,1, ¯iII,2, and ¯iII,3 for the decision-makers e1, e2, and e3, respectively. For the decision-maker e1, two ranking results z3z2z4z1 and z2z3z4z1 were obtained in the cases of η=0.00,0.05,,0.20 and η=0.25,0.30,,0.50, respectively, by comparing the ¯iII,1 values for all ziZ. Based on the ¯iII,2 values, only one ranking z3z2z1z4 was rendered regardless of the η values for the decision-maker e2. Based on the ¯iII,3 values, two ranking results z2z4z3z1 and z2z3z4z1 were generated when η=0.00,0.05,0.10 and η=0.15,0.20,,0.50, respectively, for the decision-maker e3.

Figure 11

Results of the priority ranking orders for group and individual decision-makers via the Type II PF linear programming technique for multidimensional analysis of preference (LINMAP) model.

Xue et al. [26] conducted a comprehensive analysis on the MCGDM problem involving the railway project investment to show the reliability and the sensitivity of their developed PF entropy-based LINMAP method. The three rankings z2z3z4z1, z3z2z1z4, and z3z2z4z1 were acquired according to their obtained results. As a whole, the priority rankings generated via the proposed PF LINMAP methodology are consistent with those using the PF entropy-based LINMAP approach. Moreover, a clear consensus on the MCGDM problem of railway project investment is that alternatives z2 and z3 are the better choices, while alternatives z1 and z4 are the worse choices. The practicability and effectiveness of the proposed methodology can be verified via the comparative analysis with Xue et al.'s approach. Nevertheless, in contrast to the PF entropy measure-based approach, the developed techniques using the PF scalar function-based approach provide an easy way of handling complex PF information. The implementation procedures are much simpler than Xue et al.'s approach. Even though, the workableness and advantages of the proposed methodology have been examined by means of the practical application in the railway project investment case. Moreover, the proposed methodology is capable of yielding robust and reliable ranking results according to the sensitivity analysis and comparative discussions.

8. CONCLUSIONS

This paper has extended the core structure of the classical LINMAP methods to the complex uncertainty of Pythagorean fuzziness and has developed a new PF LINMAP-based compromising methodology based on the proposed PF scalar function-based approach for solving MCGDM problems.

The proposed PF LINMAP methodology not only has the merit of the LINMAP in handling preference information over alternatives but also enhance uncertain LINMAP-based approaches by incorporating some novel concepts (e.g., PF scalar function-based dominance measures and Types I and II comprehensive dominance measures) in the core procedure of LINMAP. Two parametric linear programming problems have been formulated for effectively implementing Types I and II PF LINMAP models. Moreover, compared with the Type I PF LINMAP model, the Type II PF LINMAP model has the merits of simplicity and efficiency. The helpfulness and effectiveness of the proposed PF LINMAP-based compromising methods have been verified via the application to the MCGDM problem in regard to railway project investment. Compared to the existing PF LINMAP methods, the developed PF scalar function-based approach is capable of manipulating PF information in a fairly easy and straightforward matter. Moreover, both Types I and II PF LINMAP models have high robustness because of the reasonable and reliable application results via the sensitivity analysis and discussions. Future research can focus on the extension of incorporating the PF scalar function-based approach into other decision-making models. Furthermore, the proposed PF LINMAP-based compromising methodology can be applied to address uncertain MCGDM problems in other application fields.

CONFLICT OF INTEREST

The authors declare that there is no conflict of interest regarding the publication of this paper.

AUTHORS' CONTRIBUTIONS

Jih-Chang Wang: Methodology, Software, Validation, Formal analysis, Data Curation, Writing – Original Draft, Visualization. Ting-Yu Chen: Conceptualization, Methodology, Validation, Formal analysis, Writing – Original Draft, Writing – Review & Editing, Supervision, Funding acquisition.

DATA AVAILABILITY STATEMENT

The datasets generated during and/or analyzed during the current study are available from the corresponding author on reasonable request.

ETHICAL APPROVAL

This article does not contain any studies with human participants or animals that were performed by the authors.

ACKNOWLEDGMENTS

The authors acknowledge the assistance of the respected editor and the anonymous referees for their insightful and constructive comments, which helped to improve the overall quality of the paper. The corresponding author Ting-Yu Chen is grateful for grant funding support from the Taiwan Ministry of Science and Technology (MOST 108-2410-H-182-014-MY2) and Chang Gung Memorial Hospital (BMRP 574 and CMRPD2F0203) during the completion of this study.

APPENDIX

max0.26.4357w1+5.9404w2+6.0264w3+7.9005w4+6.3360w5+6.0463w60.8Γ32I,1+Γ41I,1+Γ31I,1+Γ21I,2+Γ43I,2+Γ24I,2+Γ31I,2+Γ31I,3+Γ34I,3+Γ23I,3+Γ24I,3
subject to:
0.5983w1+0.1452w2+1.5660w3+1.6854w41.4806w5+0.4021w60.3,0.8389w1+1.4742w20.0004w3+0.3900w4+2.0000w5+1.5034w60.3,0.8934w1+0.8829w2+1.6919w3+1.5106w4+0.3515w5+0.5252w60.3,0.5949w10.1207w2+0.7400w3+0.0078w40.5114w50.5000w6+Γ32I,10,1.0000w1+0.3865w2+0.0859w3+0.7818w40.6438w5+0.4021w6+Γ41I,10,0.1931w10.1207w2+0.7400w3+0.8957w40.3254w5+0.5000w6+Γ31I,10,0.4195w1+0.7371w20.0002w3+0.1950w4+1.0000w5+0.7517w6+Γ21I,20,0.5805w10.2413w21.0000w31.0000w40.2696w50.3706w6+Γ43I,20,1.0000w1+0.3215w2+0.4383w3+0.8927w4+0.5561w5+1.0000w6+Γ24I,20,0.0001w1+0.6569w2+0.5615w3+0.3023w4+0.7135w5+0.1223w6+Γ31I,20,0.3567w1+0.0000w2+0.0961w3+1.0000w4+0.1782w5+0.5252w6+Γ31I,30,0.0940w10.5585w2+0.3868w3+0.2553w40.1782w50.4748w6+Γ34I,30,0.7191w1+1.0000w2+0.4111w3+0.0000w4+0.2648w5+0.4748w6+Γ23I,30,0.6251w1+0.4415w1+0.7979w3+0.2553w4+0.0866w5+0.0000w6+Γ24I,30,Γ32I,1,Γ41I,1,Γ31I,1,Γ21I,2,Γ43I,2,Γ24I,2,Γ31I,2,Γ31I,3,Γ34I,3,Γ23I,3,Γ24I,30,j=16wj=1,wj0.025 for j=1,2,,6.

REFERENCES

Journal
International Journal of Computational Intelligence Systems
Volume-Issue
13 - 1
Pages
444 - 463
Publication Date
2020/04/23
ISSN (Online)
1875-6883
ISSN (Print)
1875-6891
DOI
10.2991/ijcis.d.200408.001How to use a DOI?
Copyright
© 2020 The Authors. Published by Atlantis Press SARL.
Open Access
This is an open access article distributed under the CC BY-NC 4.0 license (http://creativecommons.org/licenses/by-nc/4.0/).

Cite this article

TY  - JOUR
AU  - Jih-Chang Wang
AU  - Ting-Yu Chen
PY  - 2020
DA  - 2020/04/23
TI  - A Novel Pythagorean Fuzzy LINMAP-Based Compromising Approach for Multiple Criteria Group Decision-Making with Preference Over Alternatives
JO  - International Journal of Computational Intelligence Systems
SP  - 444
EP  - 463
VL  - 13
IS  - 1
SN  - 1875-6883
UR  - https://doi.org/10.2991/ijcis.d.200408.001
DO  - 10.2991/ijcis.d.200408.001
ID  - Wang2020
ER  -