Informatica logo


Login Register

  1. Home
  2. Issues
  3. Volume 33, Issue 1 (2022)
  4. Location Selection of Express Distributi ...

Informatica

Information Submit your article For Referees Help ATTENTION!
  • Article info
  • Full article
  • Related articles
  • Cited by
  • More
    Article info Full article Related articles Cited by

Location Selection of Express Distribution Centre with Probabilistic Linguistic MABAC Method Based on the Cumulative Prospect Theory
Volume 33, Issue 1 (2022), pp. 131–150
Shiqi Tang   Guiwu Wei   Xudong Chen  

Authors

 
Placeholder
https://doi.org/10.15388/21-INFOR467
Pub. online: 7 January 2022      Type: Research Article      Open accessOpen Access

Received
1 August 2021
Accepted
1 November 2021
Published
7 January 2022

Abstract

In our daily life, we could be confronted with numerous multiple attribute group decision making (MAGDM) problems. For such problems we designed a model which employs probabilistic linguistic MABAC (multi-attributive border approximation area comparison) based on the cumulative prospect theory (CPT-PL-MABAC) method to solve the MAGDM. The CPT-PL-MABAC method can take experts’ psychological behaviour and preferences into consideration. Furthermore, we utilize the combined weight consisting of subjective weight and objective weight. The objective weight is acquired by the entropy method. Additionally, the concrete calculating steps of CPT-PL-MABAC method are proposed to solve the MAGDM for selecting the optimal location of express distribution centre. Also, a numerical example for location selection of express distribution centre is given as the justification of the usefulness of the designed method. Finally, we compare the designed model with the other three existing models, and summarize the advantages and shortcomings.

1 Introduction

Multiple attribute decision making (MADM) or multiple attribute group decision making (MAGDM) is an effective approach to solve complex decision-making issues (Huang et al., 2021; Lei et al., 2021; Liu et al., 2018; Zhang D. et al., 2021; Zhang et al., 2018). In the decision-making process, decision makers are usually experts in their fields. Therefore, decision makers (DMs) would like to use linguistic terms rather than utilize the exact real numbers due to the complication of the socioeconomic setting and fuzziness of human beings’ thinking (Lei et al., 2021; Wei et al., 2021a). It means that the linguistic terms given by experts contain uncertainty and preference. To solve the uncertainty of decision-making problems, a lot of effective work has been done. Wang and Garg (2021) proposed new interaction Pythagorean operators and designed an algorithm to solve the MADM issues with Pythagorean fuzzy uncertainties. Yazdi et al. (2020) proposed an integrated method which combined BWM with Weighted Aggregated Sum-Product Assessment (WASPAS) on uncertain decision-making environments with Z-numbers. Xiao et al. (2021) built Taxonomy method for MAGDM based on interval-valued intuitionistic fuzzy information. Zhang H. et al. (2021) defined the CPT-MABAC method for spherical fuzzy MAGDM. Zhang S. et al. (2021) defined the grey relational analysis method based on cumulative prospect theory for intuitionistic fuzzy MAGDM.
The decision makers are more likely to choose ‘good’, ‘medium’, ‘a little good’ and ‘excellent’ to evaluate alternatives. Therefore, Rodriguez et al. (2012) defined hesitant fuzzy linguistic term set (HFLTS) to use the hesitancy degree in the linguistic context. Zeng et al. (2019) introduced several weighted operators to aggregate weighted hesitant fuzzy linguistic information. Liu et al. (2019) improved incomplete hesitant fuzzy linguistic preference relations (IHFLPRs). These concepts can describe ambiguity and preference in linguistic term sets, but ignored differences in the importance of evaluation information. Thus, Pang et al. (2016) used probabilistic linguistic term sets (PLTSs) to depict fuzziness and uncertainty with certain probabilities. They proposed some rules of operation and aggregation operators for PLTSs. We can find that PLTSs can more comprehensively and precisely represent the attitude of decision makers. Furthermore, many improvements have been made in decision-making issues on PLTSs. Yue et al. (2020b) put forward the group utility measure, the individual regret measure and the compromise measure under PLTSs. Some studies discussed decision making methods under PLTSs. Wei et al. (2021b) built the DAS method for probabilistic linguistic MAGDM. Chen et al. (2020) combined distillation algorithm with ELECTRE III method on PLTSs. He et al. (2021) modified the FMEA (the failure mode and effect analysis) model on the PLTSs. You et al. (2020) designed PL-VIKOR method and modified the distance measure. Some studies have introduced and defined some new distance formulas. Chang et al. (2021) introduced Hellinger distance measure. Jiang and Liao (2021) defined Kolmogorov-Smirnov distance measure on the PLTSs. Some studies have proposed effective tools to solve decision-making issues under PLTSs. Du and Liu (2021) researched quality function deployment tool under PLTSs. Lin et al. (2021) proposed score C-PLTSs and probability splitting algorithm. And a novel PLTS correlation coefficient was put forward by Luo et al. (2020). Peng and Wang (2020) introduced linguistic scale functions. Shen et al. (2021) came up with a model to reduce limitations of evaluation on the PLTSs. Teng et al. (2021) designed the Choquet integral operator under PLTSs. Wang and Liang (2020) put away a preference degree for g-granularity PLTS. Wang et al. (2021) extended the operational laws of PLTSs. Wang et al. (2020) proposed probabilistic linguistic Z-numbers to describe related information. Xie et al. (2020) defined the dual probabilistic linguistic correlation coefficient. Xu et al. (2020) proposed a method to make probabilistic linguistic more complete in describing evaluation information. Yu et al. (2020) combined stochastic dominance degrees with PLTSs. Yue et al. (2020a) introduced the projection formulas and Qu et al. (2020) introduced new utility functions on the PLTSs. Su et al. (2021a) built PT-TODIM method for probabilistic linguistic MAGDM.
Applying PLTSs and related methods to some practical cases can reflect advantages and the applicability of PLTSs. Liang et al. (2020) improved customer satisfaction evaluation system on PLTSs. Mo (2020) proposed the D-PLTS method to settle emergency decision-making issues. Pan et al. (2021) designed a probabilistic linguistic data envelopment analysis model. Xu C. et al. (2020) applied probabilistic linguistic preference relations to handle the healthcare insurance audits in China. Gao et al. (2021) proposed the PLTSs to describe information and built the MCGDM framework for the risk assessment. Luo et al. (2021) designed the IDOCRIW-COCOSO model to evaluate tourism attractions on the PLTSs. Ming et al. (2020) structured a medical service evaluation criteria system under PLTSs.
The MABAC method is an effective method to address some difficult decision making issues. Xu et al. (2019) used the MABAC algorithm to select the optimal green supplier. To select the optimal university, Gong et al. (2020) designed a new UTAE (undergraduate teaching audit and evaluation) approach combined with the MABAC method. Biswas (2020) selected the MABAC method to prepare a comparative analysis of supply chain performances. In order to make better use of the MABAC method, experts put it in different linguistic environments. Verma (2021) applied IFS (intuitionistic fuzzy set) with the MABAC algorithm. Liang et al. (2019) came up with the MABAC approach based on TFN to evaluate the risk of rock-burst. Hu et al. (2019) combined the MABAC method with the similarity of interval type-2 fuzzy numbers (IT2FNs). Sun et al. (2018) extended the MABAC method to HFLTSs (hesitant fuzzy linguistic term sets) for patients’ prioritization. Aydin (2021) applied the MABAC method with Fermantean fuzzy sets into decision-making process. Liu and Zhang (2021) integrated the MABAC model with prospect theory (PT) on a normal wiggly hesitant fuzzy set (NWHFS). Additionally, many studies combined MABAC with another algorithm to solve MADM or MAGDM problems. Pamucar et al. (2018) defined the IR-AHP-MABAC (interval rough analytic hierarchy process-MABAC) model to assess the quality of websites. Jiang et al. (2022) built the picture fuzzy MABAC method based on prospect theory for MAGDM.
The above investigations described a particular assumption that DMs are perfectly rational. However, many studies show that people’s behaviour is affected by their emotions. For example, people are inclined to be more sensitive to losses than to gains. That’s to say, the perception of equal gains and losses are not the same for DMs. In general, people are inclined to be risk-averse. Based on these assumptions of bounded rationality, the cumulative prospect theory (CPT) (Tversky and Kahneman, 1992) broke through the classical utility theory and defined the weight function and value function. Gong et al. (2018) built a new model based on CPT to tackle portfolio selection. Zhao et al. (2021b) combined CPT with TODIM method under several linguistic environments, such as pythagorean fuzzy sets (2021), the 2-tuple linguistic pythagorean fuzzy sets (Zhao et al., 2021c). Additionally, Zhao et al. (2021a) introduced the intuitionistic fuzzy MABAC method based on CPT. Furthermore, picture fuzzy sets (Jiang et al., 2021a, 2021b) were dealt with CPT. Su et al. (2021b) built the probabilistic uncertain linguistic EDAS method based on prospect theory for MAGDM.
In the originalMABAC method, the psychological factor such as the DMs’ preference towards risk will affect the distance between the border approximation area. Furthermore, there are relatively few researches on constructing the MABAC method for MAGDM depending on the CPT under PLTSs. The main research significance of this paper is the modified MABAC method with CPT which can reduce the affection. Therefore, the PL-MABAC based on cumulative prospect theory (CPT-PL-MABAC) method in this paper is defined to solve the location selection of express distribution centre, which is a classical MAGDM issue. This article makes contributions as follows: (1) the concept of CPT is integrated into the PL-MABAC method for MAGDM. This method not only has unambiguous logic and relatively simple calculation, but also expresses the DM’s psychological state, which is closer to reality; (2) we improved the entropy method, which is characterized by the mean value of attributes as the reference point; (3) the combined attribute weights are obtained through objective weight by the entropy method and by getting the subjective weight given by decision makers; (4) the effectiveness and stability of this new method is fully testified by taking advantage of a case about location selection of express distribution centre and comparisons with the existing methods.
To sum up, the structure of this paper is built as follows. The second part mainly introduces and reviews the basic knowledge, including the PLTSs and CPT. In Section 3, the PL-MABAC based on cumulative prospect theory (CPT-PL-MABAC) method is defined to solve the MAGDM. In Section 4, a case for location selection of express distribution centre is given as the justification of the usefulness of the designed method. Also, we compared our method with existing methods and demonstrated the stability and availability of this method. Finally, the main contributions of this paper, the limitations of the new method and future research directions are included.

2 Preliminaries

In order to illustrate the CPT-PL-MABAC model, some relevant knowledge is introduced.

2.1 PLTSs

Sometimes, decision makers give fuzzy evaluation information that cannot be expressed exactly. Pang et al. (2016) came up with PLTS, which have different weights and probabilities.
Definition 1 (Gou et al., 2017).
Let $L=\{{\zeta _{ƛ}}|ƛ=\hspace{2.5pt}-\partial ,\dots ,-2,-1,0,1,2,\dots ,\partial \}$ be an LTS, and the linguistic terms ${\zeta _{ƛ}}$ can be denoted as the value information χ by transformation function κ, and the formula is as follows:
(1)
\[ \begin{aligned}{}& \kappa :[{\zeta _{-ƛ}},{\zeta _{ƛ}}]\to [0,1],\\ {} & \kappa ({\zeta _{ƛ}})=\frac{ƛ+\partial }{2\partial }=\chi .\end{aligned}\]
χ can also be translated into linguistic terms ${\zeta _{ƛ}}$ by the shifting function ${\kappa ^{-1}}$:
(2)
\[ \begin{aligned}{}& {\kappa ^{-1}}:[0,1]\to [{\zeta _{-ƛ}},{\zeta _{ƛ}}],\\ {} & {\kappa ^{-1}}(\chi )={\zeta _{(2\chi -1)\partial }}={\zeta _{ƛ}}.\end{aligned}\]
Definition 2 (Pang et al., 2016).
Suppose $L=\{{\zeta _{ƛ}}|ƛ=-\partial ,\dots ,-2,-1,0,1,2,\dots ,\partial \}$ is an LTS, then the PLTS could be defined as follows:
(3)
\[ L(p)=\Bigg\{{\zeta ^{(\gamma )}}\big({p^{(\gamma )}}\big)\Big|{\zeta ^{(\gamma )}}\in L,{p^{(\gamma )}}\geqslant 0,\gamma =1,2,\dots ,\mathrm{\# }L(p),{\sum \limits_{\gamma =1}^{\mathrm{\# }L(p)}}{p^{(\gamma )}}\leqslant 1\Bigg\}.\]
In this formula, ${\zeta ^{(\gamma )}}({p^{(\gamma )}})$ denotes γth linguistic term ${\zeta ^{(\gamma )}}$ and its corresponding probability value ${p^{(\gamma )}}$. The linguistic terms ${\zeta ^{(\gamma )}}$ are arranged in ascending order in the set $L(p)$. $\mathrm{\# }L(p)$ represents the linguistic terms’ length in $L(p)$.
To make the PLTSs easier to deal with, Pang et al. (2016) normalized the PLTS $L(p)$ as $\textit{NL}(\tilde{p})=\big\{{\zeta ^{(\gamma )}}({\tilde{p}^{(\gamma )}})\big|{\zeta ^{(\gamma )}}\in L,{\tilde{p}^{(\gamma )}}\geqslant 0,\gamma =1,2,\dots ,\mathrm{\# }L(\tilde{p}),{\textstyle\sum _{\gamma =1}^{\mathrm{\# }L(p)}}{\tilde{p}^{(\gamma )}}=1\big\}$, where ${\tilde{p}^{(\gamma )}}={p^{(\gamma )}}/{\textstyle\sum _{\gamma =1}^{\mathrm{\# }L(p)}}{p^{(\gamma )}}$ for all $\gamma =1,2,\dots ,\mathrm{\# }L(\tilde{p})$.
Definition 3 (Pang et al., 2016).
Suppose $L=\{{h_{\varepsilon }}|\varepsilon =-\vartheta ,\dots ,-1,0,1,\dots \vartheta \}$ is an LTS, ${\textit{NL}_{1}}(\tilde{p})=\big\{{\zeta _{1}^{(\gamma )}}({\tilde{p}_{1}^{(\gamma )}})\big|\gamma =1,2,\dots ,\mathrm{\# }{\textit{NL}_{1}}(\tilde{p})\big\}$ and ${\textit{NL}_{2}}(\tilde{p})=\big\{{\zeta _{2}^{(\gamma )}}({\tilde{p}_{2}^{(\gamma )}})\big|\gamma =1,2,\dots ,\mathrm{\# }{\textit{NL}_{2}}(\tilde{p})\big\}$ are two PLTSs, where $\mathrm{\# }{\textit{NL}_{1}}(\tilde{p})$ represents the linguistic term length of PLTS ${\textit{NL}_{1}}(\tilde{p})$. $\mathrm{\# }{\textit{NL}_{2}}(\tilde{p})$ reasonably represents the corresponding length of ${\textit{NL}_{2}}(\tilde{p})$. To make the subscript of PLTS symmetric, we add $\mathrm{\# }{\textit{NL}_{1}}(\tilde{p})-\mathrm{\# }{\textit{NL}_{2}}(\tilde{p})$ linguistic terms to ${\textit{NL}_{2}}(\tilde{p})$ when $\mathrm{\# }{\textit{NL}_{1}}(\tilde{p})>\mathrm{\# }{\textit{NL}_{2}}(\tilde{p})$. It should be noted that the added linguistic term defaults to the minimum linguistic term in ${\textit{NL}_{2}}(\tilde{p})$ and its corresponding probability is zero.
Definition 4 (Pang et al., 2016).
Suppose $\textit{NL}(\tilde{p})=\big\{{\zeta ^{(\gamma )}}({\tilde{p}^{(\gamma )}})\big|\gamma =1,2,\dots ,\mathrm{\# }\textit{NL}(\tilde{p})\big\}$ is a PLTS, then the score formula and deviation formula of the PLTS is as follows:
(4)
\[\begin{aligned}{}& \textit{SF}\big(\textit{NL}(\tilde{p})\big)={\sum \limits_{\gamma =1}^{\mathrm{\# }\textit{NL}(\tilde{p})}}\kappa \big(\textit{NL}(\tilde{p})\big){\tilde{p}^{(\gamma )}}\Big/{\sum \limits_{\gamma =1}^{\mathrm{\# }\textit{NL}(\tilde{p})}}{\tilde{p}^{(\gamma )}},\end{aligned}\]
(5)
\[\begin{aligned}{}& \textit{DF}\big(\textit{NL}(\tilde{p})\big)=\sqrt{{\sum \limits_{\gamma =1}^{\mathrm{\# }\textit{NL}(\tilde{p})}}{\big(\kappa \big(\textit{NL}(\tilde{p})\big){\tilde{p}^{(\gamma )}}-\textit{SF}\big(\textit{NL}(\tilde{p})\big)\big)^{2}}}\Big/{\sum \limits_{\gamma =1}^{\mathrm{\# }\textit{NL}(\tilde{p})}}{\tilde{p}^{(\gamma )}}.\end{aligned}\]
We can obtain the order relation between two PLTSs by Eqs. (4) and (5).
  • (1) If $\textit{SF}({\textit{NL}_{1}}(\tilde{p}))>\textit{SF}({\textit{NL}_{2}}(\tilde{p}))$, then ${\textit{NL}_{1}}(\tilde{p})>{\textit{NL}_{2}}(\tilde{p})$;
  • (2) If $\textit{SF}({\textit{NL}_{1}}(\tilde{p}))=\textit{SF}({\textit{NL}_{2}}(\tilde{p}))$, then $\textit{DF}({\textit{NL}_{1}}(\tilde{p}))=\textit{DF}({\textit{NL}_{2}}(\tilde{p}))$ and ${\textit{NL}_{1}}(\tilde{p})={\textit{NL}_{2}}(\tilde{p})$; if $\textit{DF}({\textit{NL}_{1}}(\tilde{p}))<\textit{DF}({\textit{NL}_{2}}(\tilde{p}))$, then ${\textit{NL}_{1}}(\tilde{p})>{\textit{NL}_{2}}(\tilde{p})$.
Definition 5 (Lin et al., 2019).
Suppose $L=\{{\zeta _{ƛ}}|ƛ=-\partial ,\dots ,-1,0,1,\dots ,\partial \}$ is an LTS. Calculate the distance from ${\textit{NL}_{1}}(\tilde{p})=\big\{{\zeta _{1}^{(\gamma )}}({\tilde{p}_{1}^{(\gamma )}})\big|\gamma =1,2,\dots ,\mathrm{\# }{\textit{NL}_{1}}(\tilde{p})\big\}$ to ${\textit{NL}_{2}}(\tilde{p})=\big\{{\zeta _{2}^{(\gamma )}}({\tilde{p}_{2}^{(\gamma )}})\big|\gamma =1,2,\dots ,\mathrm{\# }{\textit{NL}_{2}}(\tilde{p})\big\}$ by the Hamming distance as follows:
(6)
\[ d\big({\textit{NL}_{1}}(\tilde{p}),{\textit{NL}_{2}}(\tilde{p})\big)=\frac{{\textstyle\textstyle\sum _{\gamma =1}^{\mathrm{\# }{\textit{NL}_{1}}(\tilde{p})}}\big|{\tilde{p}_{1}^{(\gamma )}}\kappa ({\zeta _{1}^{(\gamma )}})-{\tilde{p}_{2}^{(\gamma )}}\kappa ({\zeta _{2}^{(\gamma )}})\big|}{\mathrm{\# }\textit{NL}(\tilde{p})}.\]

2.2 Cumulative Prospect Theory

In the cumulative prospect theory (CPT) (Tversky and Kahneman, 1992), DMs will go through two stages when they are faced with choices and make decisions: editing stage and evaluation stage. In the editing stage, the decision-makers will collect information and do some preprocessing to find out the reference point; in the evaluation stage, the decision makers will evaluate the prospect which has been pretreated and choose the best prospect based on a value function $\lambda ({x_{j}})$ and a weight function $w({p_{i}})$. Therefore, the specific form of the total value function of prospect theory is as follows Tversky and Kahneman (1992):
(7)
\[ \Lambda ({x_{j}})={\sum \limits_{j=1}^{m}}\lambda ({x_{j}})w({p_{j}}),\]
where m is the number of attributes for alternatives; j expresses the jth attribute; $\lambda ({x_{j}})$ reflects the DMs’ subjective feeling value according to the actual gains or the losses. The formula of $\lambda ({x_{j}})$ is defined as follows Tversky and Kahneman (1992):
(8)
\[ \lambda ({x_{j}})=\left\{\begin{array}{l@{\hskip4.0pt}l}{(\Delta x)^{\tau }},\hspace{1em}& \text{if}\hspace{2.5pt}\Delta x\geqslant 0,\\ {} -\theta {(-\Delta x)^{\varsigma }},\hspace{1em}& \text{if}\hspace{2.5pt}\Delta x<0,\end{array}\right.\hspace{1em}0<\tau ,\varsigma <1.\]
In this formula, ${x_{j}}$ signifies the value of the jth attribute. $\Delta >0$ signifies the gain, $\Delta x<0$ signifies the loss and $\Delta x=0$ signifies no gain or loss. τ and ς represent the parameters of risk attitudes. These depict the sensitivity of decision makers to gains and losses. θ depicts the coefficient of loss aversion, and $\theta >1$. The higher the value of θ, the more risk averse the decision maker is. Tversky and the others obtained the parameters of the value function in CPT with the method of linear regression when the parameters were $\tau =\varsigma =0.88$, $\theta =2.25$. It was more consistent with the empirical data. And it is worth mentioning that we take the probabilistic linguistic border approximation area as the reference point to gains and losses in this paper.

3 CPT-PL-MABAC Model for MAGDM Issues

We will introduce the MABAC method based on CPT and on the PLTS. We will also give the following mathematical symbols which are used to express the relevant information. We suppose that there is a collection of alternatives $\mathrm{\Re }=\{{\mathrm{\Re }_{1}},{\mathrm{\Re }_{2}},\dots ,{\mathrm{\Re }_{m}}\}$ and n qualitative attributes $\mathrm{\Im }=\{{\mathrm{\Im }_{1}},{\mathrm{\Im }_{2}},\dots ,{\mathrm{\Im }_{n}}\}$. Experts will evaluate every attribute and use linguistics ${\zeta _{ij}^{k}}$ $(i=1,2,\dots ,m,j=1,2,\dots ,n,k=1,2,\dots ,q)$ to express the value of evaluation. $\varpi =({\varpi _{1}},{\varpi _{2}},\dots ,{\varpi _{n}})$ represents the attribute weight vector, where ${\varpi _{j}}\in [0,1]$, ${\textstyle\sum _{j=1}^{n}}{\varpi _{j}}=1$ and $\mathrm{\aleph }=\{{\mathrm{\aleph }_{1}},{\mathrm{\aleph }_{2}},\dots ,{\mathrm{\aleph }_{q}}\}$ is a collection of q experts.
We designed the new PL-MABAC method in which the CPT is introduced to address MAGDM problems. A laconic frame diagram and the specific calculating procedure as follows:

3.1 The CPT-PL-MABAC Frame Diagram

See Fig. 1.
infor467_g001.jpg
Fig. 1
CPT-PL-MABAC frame diagram.

3.2 The CPT-PL-MABAC Calculating Procedure

Step 1. Transform cost attributes into beneficial ones.
Given an LTS $L=\{{\zeta _{ƛ}}|ƛ=-\partial ,\dots ,-1,0,1,\dots \partial \}$, and transform the cost attribute ${\zeta _{ƛ}}$ into the beneficial attribute ${\zeta _{-ƛ}}$.
Step 2. Shift the value of evaluation information $L=\{{\zeta _{ij}^{k}}\big|k=1,2,\dots ,q,i=1,2,\dots ,m,j=1,2,\dots ,n\}$ into PLTSs $\textit{PL}=\{{\zeta _{ij}^{(\gamma )}}({p_{ij}^{(\gamma )}})\big|\gamma =1,2,\dots ,\mathrm{\# }{L_{ij}}(p)\}$. Build the evaluation matrix $M={({\textit{PL}_{ij}}(p))_{m\times n}}$, ${\textit{PL}_{ij}}(p)=\big\{{\zeta _{ij}^{(\gamma )}}({p_{ij}^{(\gamma )}})\big|\gamma =1,2,\dots ,\mathrm{\# }{L_{ij}}(p)\big\}$ $(i=1,2,\dots ,m,j=1,2,\dots ,n)$.
Step 3. Obtain the normalized decision matrix $\textit{NM}={({\textit{NPL}_{ij}}(\tilde{p}))_{m\times n}}$ with PLTSs, ${\textit{NPL}_{ij}}(\tilde{p})=\{{\zeta _{ij}^{(\gamma )}}({\tilde{p}_{ij}^{(\gamma )}})\big|\gamma =1,2,\dots ,\mathrm{\# }{L_{ij}}(\tilde{p}),{\textstyle\sum _{\gamma =1}^{\mathrm{\# }{L_{ij}}(\tilde{p})}}{\tilde{p}_{ij}^{(\gamma )}}=1\}$ $(i=1,2,\dots ,m,j=1,2,\dots ,n)$.
Step 4. Figure up the combined weight of attributes.
We acquire the objective weight by the entropy method and get the subjective weight given by decision makers.
First, we introduce the specific procedure of the entropy method. It should be noted that when calculating entropy, we use the mean value of the attribute as the reference point to calculate its distance from the normalized attribute value.
  • 1. Calculate the mean value of jth attribute, the formula is expressed below:
    (9)
    \[\begin{aligned}{}& {\textit{ML}_{j}}({\bar{p}_{j}})=\big\{{\zeta _{j}^{(\gamma )}}\big({p_{j}^{(\gamma )}}\big)\big|\phi =1,2,\dots ,\mathrm{\# }{L_{ij}}(p)\big\},\end{aligned}\]
    (10)
    \[\begin{aligned}{}& {\zeta _{j}^{(\gamma )}}\big({p_{j}^{(\gamma )}}\big)=\frac{1}{m}{\sum \limits_{i=1}^{m}}{\zeta _{ij}^{(\gamma )}}\Bigg(\frac{1}{m}{\sum \limits_{i=1}^{m}}{p_{ij}^{(\gamma )}}\Bigg).\end{aligned}\]
  • 2. Let ${\mathrm{\wp }_{j}}$ be the entropy of the jth attribute, and calculate it by using Eq. (11):
    (11)
    \[\begin{aligned}{}{\mathrm{\wp }_{j}}& =-\frac{1}{\ln m}{\sum \limits_{i=1}^{m}}\\ {} & \hspace{1em}\times \bigg[\frac{d({\textit{NL}_{ij}}({\tilde{p}_{j}}),{\textit{ML}_{j}}({\bar{p}_{j}}))}{{\textstyle\textstyle\sum _{i=1}^{m}}d({\textit{NL}_{ij}}({\tilde{p}_{j}}),{\textit{ML}_{j}}({\bar{p}_{j}}))}\ln \bigg(\frac{d({\textit{NL}_{ij}}({\tilde{p}_{j}}),{\textit{ML}_{j}}({\bar{p}_{j}}))}{{\textstyle\textstyle\sum _{i=1}^{m}}d({\textit{NL}_{ij}}({\tilde{p}_{j}}),{\textit{ML}_{j}}({\bar{p}_{j}}))}\bigg)\bigg].\end{aligned}\]
  • 3. Compute the objective weights of the jth attribute by using Eq. (12):
    (12)
    \[ {w_{oj}}=\frac{1-{\mathrm{\wp }_{j}}}{{\textstyle\textstyle\sum _{j=1}^{n}}(1-{\mathrm{\wp }_{j}})},\hspace{1em}j=1,2\dots ,n,\]
    where ${w_{oj}}\in [0,1]$ and ${\textstyle\sum _{j=1}^{n}}{w_{oj}}=1$.
Then, we calculate the combined weights by using the following equation. The advantage of using combined weight is that the influence of subjective weight and objective weight can be considered comprehensively.
Decision makers gave the subjective weights ${w_{sj}}=({w_{s1}},{w_{s2}},\dots ,{w_{sn}})$, where ${w_{sj}}\in [0,1]$, $j=1,2,\dots ,n$, ${\textstyle\sum _{j=1}^{n}}{w_{sj}}=1$. The objective weight ${w_{oj}}=({w_{o1}},{w_{o2}},\dots ,{w_{on}})$ is calculated by using Eq. (12) directly, where ${w_{oj}}\in [0,1]$, $j=1,2,\dots ,n$, ${\textstyle\sum _{j=1}^{n}}{w_{oj}}=1$. Therefore, the combined weights of attributes ${w_{cj}}=({w_{c1}},{w_{c2}},\dots ,{w_{cn}})$ could be defined:
(13)
\[ {w_{cj}}=\frac{{w_{oj}}\ast {w_{sj}}}{{\textstyle\textstyle\sum _{j=1}^{n}}{w_{oj}}\ast {w_{sj}}},\]
where ${w_{cj}}\in [0,1]$, $j=1,2,\dots ,n$, ${\textstyle\sum _{j=1}^{n}}{w_{cj}}=1$.
Step 5. Figure out the probabilistic linguistic border approximation area (PLBAA) matrix $\mathrm{PLBAA}={({\textit{PLBAA}_{j}})_{1\times n}}$. The PLBAA could be obtained according to Eqs. (14)–(16).
(14)
\[\begin{aligned}{}& \mathrm{PLBAA}={({\textit{PLBAA}_{j}})_{1\times n}},\end{aligned}\]
(15)
\[\begin{aligned}{}& {\textit{PLBAA}_{j}}=\big\{{\stackrel{\leftrightarrow }{\zeta }_{j}^{(\gamma )}}({\stackrel{\leftrightarrow }{p}_{j}^{\hspace{0.1667em}(\gamma )}})\big|\gamma =1,2,\dots ,\mathrm{\# }{\textit{NL}_{ij}}(\stackrel{\leftrightarrow }{p})\big\},\end{aligned}\]
(16)
\[\begin{aligned}{}& {\stackrel{\leftrightarrow }{\zeta }_{j}^{(\gamma )}}\big({\stackrel{\leftrightarrow }{p}_{j}^{\hspace{0.1667em}(\gamma )}}\big)={\kappa ^{-1}}\Bigg(\sqrt[m]{{\prod \limits_{i=1}^{m}}\kappa \big({\zeta _{ij}^{(\gamma )}}\big)}\hspace{0.1667em}\Bigg)\Bigg(\sqrt[m]{{\prod \limits_{i=1}^{m}}{p_{ij}^{(\gamma )}}}\hspace{0.1667em}\Bigg).\end{aligned}\]
Step 6. Figure up the Hamming distance from PLBAA by Eq. (17) and the cumulative prospect distance matrix by using Eq. (18).
(17)
\[\begin{aligned}{}& d({\textit{NL}_{ij}}(\tilde{p}),{\textit{PLBAA}_{j}})=\Bigg({\sum \limits_{\gamma =1}^{\mathrm{\# }{\textit{NL}_{ij}}(\tilde{p})}}\big|\kappa \big({\zeta _{ij}^{(\gamma )}}\big)\big({p_{ij}^{(\gamma )}}\big)-\kappa \big({\stackrel{\leftrightarrow }{\zeta }_{j}^{(\gamma )}}\big)\big({\stackrel{\leftrightarrow }{p}_{j}^{(\gamma )}}\big)\big|\Bigg)\Big/\mathrm{\# }{\textit{NL}_{ij}}(\tilde{p}),\end{aligned}\]
(18)
\[\begin{aligned}{}& {\Lambda _{ij}}=\left\{\begin{array}{l}{[d({\textit{NL}_{ij}}(\tilde{p}),{\textit{PLBAA}_{j}})]^{\tau }}{w_{j}},\\ {} \hspace{1em}\text{if}\hspace{2.5pt}\big({\textstyle\textstyle\sum _{\gamma =1}^{\mathrm{\# }{\textit{NL}_{ij}}(\tilde{p})}}\kappa \big({\zeta _{ij}^{(\gamma )}}\big)\big({p_{ij}^{(\gamma )}}\big)-\kappa \big({\stackrel{\leftrightarrow }{\zeta }_{j}^{(\gamma )}}\big)\big({\stackrel{\leftrightarrow }{p}_{j}^{(\gamma )}}\big)\big)\big/\mathrm{\# }{\textit{NL}_{ij}}(\tilde{p})>0,\\ {} 0,\\ {} \hspace{1em}\text{if}\hspace{2.5pt}\big({\textstyle\textstyle\sum _{\gamma =1}^{\mathrm{\# }{\textit{NL}_{ij}}(\tilde{p})}}\kappa \big({\zeta _{ij}^{(\gamma )}}\big)\big({p_{ij}^{(\gamma )}}\big)-\kappa \big({\stackrel{\leftrightarrow }{\zeta }_{j}^{(\gamma )}}\big)\big({\stackrel{\leftrightarrow }{p}_{j}^{(\gamma )}}\big)\big)\big/\mathrm{\# }{\textit{NL}_{ij}}(\tilde{p})=0,\\ {} -\theta {[d({\textit{NL}_{ij}}(\tilde{p}),{\textit{PLBAA}_{j}})]^{\varsigma }}{w_{j}},\\ {} \hspace{1em}\text{if}\hspace{2.5pt}\big({\textstyle\textstyle\sum _{\gamma =1}^{\mathrm{\# }{\textit{NL}_{ij}}(\tilde{p})}}\kappa \big({\zeta _{ij}^{(\gamma )}}\big)\big({p_{ij}^{(\gamma )}}\big)-\kappa \big({\stackrel{\leftrightarrow }{\zeta }_{j}^{(\gamma )}}\big)\big({\stackrel{\leftrightarrow }{p}_{j}^{(\gamma )}}\big)\big)\big/\mathrm{\# }{\textit{NL}_{ij}}(\tilde{p})<0.\end{array}\right.\end{aligned}\]
We take ${\textit{PLBAA}_{j}}$ as reference point and the parameters in value function are $\tau =\varsigma =0.88$, $\theta =2.25$.
Step 7. Calculate the probabilistic linguistic total prospect value.
(19)
\[ {\Lambda _{i}^{\ast }}={\sum \limits_{j=1}^{n}}{\Lambda _{ij}},\hspace{1em}i=1,2,\dots ,m.\]
Step 8. Rank the value of ${\Lambda _{i}^{\ast }}$ $(i=1,2,\dots ,m)$ to obtain the best alternative.

4 An Example Analysis and Comparative Analysis

4.1 An Example Analysis

In the background of e-commerce, online shopping has become a very common way of consumption in people’s lives. The recent epidemic situation also makes people more accustomed to using online shopping for consumption. Therefore, express delivery has become a matter of great concern. Reasonable and effective site selection can improve the service quality and win the favour of customers, so as to achieve the all-win goal of Express Distribution Centre, businesses and consumers. The express industry is the product of rapid economic development. It means that the consumption capacity of a region has a crucial impact on the express business volume. How to choose a proper express distribution centre is of great importance to both express companies and consumers. Generally speaking, the more developed the region is, the more its express business volume will be, and the number of distribution centres will be more and more centralized. Additionally, the site selection also needs to consider the local population and demand. For example, the closer to the central business district, the denser the population, the more demand for express delivery. Besides, for the areas where e-commerce self-employed households are concentrated, the demand for express delivery is very large, which should be considered as the key object. Moreover, to choose a reasonable address for the express delivery centre, we must consider the problem of cost minimization. And convenient transportation can effectively ensure the timeliness of express delivery. Otherwise, in order to ensure service quality, express enterprises can only add more outlets or send more vehicles, no matter which way it will lead to increased costs. We know that choosing the best address of Express Distribution Centre is a classic MADM or MAGDM problem. In this case, we gave five alternative sites ${\mathrm{\Re }_{i}}$ $(i=1,2,3,4,5)$ to choose from. The experts selected four attributes to consider five alternative addresses: (1) ${\mathrm{\Im }_{1}}$ is the degree of economic development; (2) ${\mathrm{\Im }_{2}}$ is the construction and transportation cost; (3) ${\mathrm{\Im }_{3}}$ is the population status and demand; and (4) ${\mathrm{\Im }_{4}}$ is the degree of convenient transportation. These five potential addresses ${\mathrm{\Re }_{i}}$ $(i=1,2,3,4,5)$ must be evaluated by using the LTSs:
\[\begin{aligned}{}& \big\{{\zeta _{-3}}=\textit{deeply inapposite}(\textit{DI}),{\zeta _{-2}}=\textit{so inapposite}(\textit{SI}),{\zeta _{-1}}=\textit{inapposite}(I)\\ {} & {\zeta _{0}}=\text{middling}(M),{\zeta _{1}}=\textit{apposite}(A),{\zeta _{2}}=\textit{so apposite}(\textit{SA}),\\ {} & {\zeta _{3}}=\textit{deeply apposite}(\textit{DA})\big\}.\end{aligned}\]
by the five DMs within the above four beneficial attributes. The evaluation information by using the LTSs is listed in Tables 1–5.
Table 1
Linguistic decision matrix by the first DM.
Alternatives ${\mathrm{\Im }_{1}}$ ${\mathrm{\Im }_{2}}$ ${\mathrm{\Im }_{3}}$ ${\mathrm{\Im }_{4}}$
${\mathrm{\Re }_{1}}$ SA SI A M
${\mathrm{\Re }_{2}}$ I DI SI I
${\mathrm{\Re }_{3}}$ M I A DI
${\mathrm{\Re }_{4}}$ I DI I I
${\mathrm{\Re }_{5}}$ M I M M
Table 2
Linguistic decision matrix by the second DM.
Alternatives ${\mathrm{\Im }_{1}}$ ${\mathrm{\Im }_{2}}$ ${\mathrm{\Im }_{3}}$ ${\mathrm{\Im }_{4}}$
${\mathrm{\Re }_{1}}$ SI I DA DA
${\mathrm{\Re }_{2}}$ A I DI M
${\mathrm{\Re }_{3}}$ SA M SA A
${\mathrm{\Re }_{4}}$ DI M DI M
${\mathrm{\Re }_{5}}$ A A SI I
Table 3
Linguistic decison matrix by the third DM.
Alternatives ${\mathrm{\Im }_{1}}$ ${\mathrm{\Im }_{2}}$ ${\mathrm{\Im }_{3}}$ ${\mathrm{\Im }_{4}}$
${\mathrm{\Re }_{1}}$ A SI SA SA
${\mathrm{\Re }_{2}}$ I I SI I
${\mathrm{\Re }_{3}}$ M SI A DI
${\mathrm{\Re }_{4}}$ SI DA SA I
${\mathrm{\Re }_{5}}$ M DA M A
Table 4
Linguistic decision matrix by the fourth DM.
Alternatives ${\mathrm{\Im }_{1}}$ ${\mathrm{\Im }_{2}}$ ${\mathrm{\Im }_{3}}$ ${\mathrm{\Im }_{4}}$
${\mathrm{\Re }_{1}}$ SA I DA DA
${\mathrm{\Re }_{2}}$ A DI A M
${\mathrm{\Re }_{3}}$ M I A A
${\mathrm{\Re }_{4}}$ SI DA DI A
${\mathrm{\Re }_{5}}$ M DA SI I
Table 5
Linguistic decision matrix by the fifth DM.
Alternatives ${\mathrm{\Im }_{1}}$ ${\mathrm{\Im }_{2}}$ ${\mathrm{\Im }_{3}}$ ${\mathrm{\Im }_{4}}$
${\mathrm{\Re }_{1}}$ SA M DA DA
${\mathrm{\Re }_{2}}$ SA SI A SI
${\mathrm{\Re }_{3}}$ I I A SI
${\mathrm{\Re }_{4}}$ DI SA DI A
${\mathrm{\Re }_{5}}$ A DA A I
For the convenience of calculation, we first express the evaluation information given by experts by using linguistic term sets (Tables 6–10).
Table 6
Decision matrix with linguistic term sets by the first DM.
Alternatives ${\mathrm{\Im }_{1}}$ ${\mathrm{\Im }_{2}}$ ${\mathrm{\Im }_{3}}$ ${\mathrm{\Im }_{4}}$
${\mathrm{\Re }_{1}}$ ${\zeta _{2}}$ ${\zeta _{-2}}$ ${\zeta _{1}}$ ${\zeta _{0}}$
${\mathrm{\Re }_{2}}$ ${\zeta _{-1}}$ ${\zeta _{-3}}$ ${\zeta _{-2}}$ ${\zeta _{-1}}$
${\mathrm{\Re }_{3}}$ ${\zeta _{0}}$ ${\zeta _{-1}}$ ${\zeta _{1}}$ ${\zeta _{-3}}$
${\mathrm{\Re }_{4}}$ ${\zeta _{-1}}$ ${\zeta _{-3}}$ ${\zeta _{-1}}$ ${\zeta _{-1}}$
${\mathrm{\Re }_{5}}$ ${\zeta _{0}}$ ${\zeta _{-1}}$ ${\zeta _{0}}$ ${\zeta _{0}}$
Table 7
Decision matrix with linguistic term sets by the second DM.
Alternatives ${\mathrm{\Im }_{1}}$ ${\mathrm{\Im }_{2}}$ ${\mathrm{\Im }_{3}}$ ${\mathrm{\Im }_{4}}$
${\mathrm{\Re }_{1}}$ ${\zeta _{-2}}$ ${\zeta _{-1}}$ ${\zeta _{3}}$ ${\zeta _{3}}$
${\mathrm{\Re }_{2}}$ ${\zeta _{1}}$ ${\zeta _{-1}}$ ${\zeta _{-3}}$ ${\zeta _{0}}$
${\mathrm{\Re }_{3}}$ ${\zeta _{2}}$ ${\zeta _{0}}$ ${\zeta _{2}}$ ${\zeta _{1}}$
${\mathrm{\Re }_{4}}$ ${\zeta _{-3}}$ ${\zeta _{0}}$ ${\zeta _{-3}}$ ${\zeta _{0}}$
${\mathrm{\Re }_{5}}$ ${\zeta _{1}}$ ${\zeta _{1}}$ ${\zeta _{-2}}$ ${\zeta _{-1}}$
Table 8
Decision matrix with linguistic term sets by the third DM.
Alternatives ${\mathrm{\Im }_{1}}$ ${\mathrm{\Im }_{2}}$ ${\mathrm{\Im }_{3}}$ ${\mathrm{\Im }_{4}}$
${\mathrm{\Re }_{1}}$ ${\zeta _{1}}$ ${\zeta _{-2}}$ ${\zeta _{2}}$ ${\zeta _{2}}$
${\mathrm{\Re }_{2}}$ ${\zeta _{-1}}$ ${\zeta _{-1}}$ ${\zeta _{-2}}$ ${\zeta _{-1}}$
${\mathrm{\Re }_{3}}$ ${\zeta _{0}}$ ${\zeta _{-2}}$ ${\zeta _{1}}$ ${\zeta _{-3}}$
${\mathrm{\Re }_{4}}$ ${\zeta _{-2}}$ ${\zeta _{3}}$ ${\zeta _{2}}$ ${\zeta _{-1}}$
${\mathrm{\Re }_{5}}$ ${\zeta _{0}}$ ${\zeta _{3}}$ ${\zeta _{0}}$ ${\zeta _{1}}$
Table 9
Decision matrix with linguistic term sets by the fourth DM.
Alternatives ${\mathrm{\Im }_{1}}$ ${\mathrm{\Im }_{2}}$ ${\mathrm{\Im }_{3}}$ ${\mathrm{\Im }_{4}}$
${\mathrm{\Re }_{1}}$ ${\zeta _{2}}$ ${\zeta _{-1}}$ ${\zeta _{3}}$ ${\zeta _{3}}$
${\mathrm{\Re }_{2}}$ ${\zeta _{1}}$ ${\zeta _{-3}}$ ${\zeta _{1}}$ ${\zeta _{0}}$
${\mathrm{\Re }_{3}}$ ${\zeta _{0}}$ ${\zeta _{-1}}$ ${\zeta _{1}}$ ${\zeta _{1}}$
${\mathrm{\Re }_{4}}$ ${\zeta _{-2}}$ ${\zeta _{3}}$ ${\zeta _{-3}}$ ${\zeta _{1}}$
${\mathrm{\Re }_{5}}$ ${\zeta _{0}}$ ${\zeta _{3}}$ ${\zeta _{-2}}$ ${\zeta _{-1}}$
Table 10
Decision matrix with linguistic term sets by the fifth DM.
Alternatives ${\mathrm{\Im }_{1}}$ ${\mathrm{\Im }_{2}}$ ${\mathrm{\Im }_{3}}$ ${\mathrm{\Im }_{4}}$
${\mathrm{\Re }_{1}}$ ${\zeta _{2}}$ ${\zeta _{0}}$ ${\zeta _{3}}$ ${\zeta _{3}}$
${\mathrm{\Re }_{2}}$ ${\zeta _{2}}$ ${\zeta _{-2}}$ ${\zeta _{1}}$ ${\zeta _{-2}}$
${\mathrm{\Re }_{3}}$ ${\zeta _{-1}}$ ${\zeta _{-1}}$ ${\zeta _{1}}$ ${\zeta _{-2}}$
${\mathrm{\Re }_{4}}$ ${\zeta _{-3}}$ ${\zeta _{2}}$ ${\zeta _{-3}}$ ${\zeta _{1}}$
${\mathrm{\Re }_{5}}$ ${\zeta _{1}}$ ${\zeta _{3}}$ ${\zeta _{1}}$ ${\zeta _{-1}}$
Then, we choose the most appropriate site fot the logistics distribution centre by using CPT-PL-MABAC method.
Step 1. Transform the cost attribute ${\mathrm{\Im }_{2}}$ into a beneficial one. If the cost attribute value is ${\zeta _{\lambda }}$, then transform it into beneficial attribute value ${\zeta _{-\lambda }}$ (see Tables 11–15).
Table 11
Linguistic evaluating value matrix by the first DM.
Alternatives ${\mathrm{\Im }_{1}}$ ${\mathrm{\Im }_{2}}$ ${\mathrm{\Im }_{3}}$ ${\mathrm{\Im }_{4}}$
${\mathrm{\Re }_{1}}$ ${\zeta _{2}}$ ${\zeta _{2}}$ ${\zeta _{1}}$ ${\zeta _{0}}$
${\mathrm{\Re }_{2}}$ ${\zeta _{-1}}$ ${\zeta _{3}}$ ${\zeta _{-2}}$ ${\zeta _{-1}}$
${\mathrm{\Re }_{3}}$ ${\zeta _{0}}$ ${\zeta _{1}}$ ${\zeta _{1}}$ ${\zeta _{-3}}$
${\mathrm{\Re }_{4}}$ ${\zeta _{-1}}$ ${\zeta _{3}}$ ${\zeta _{-1}}$ ${\zeta _{-1}}$
${\mathrm{\Re }_{5}}$ ${\zeta _{0}}$ ${\zeta _{1}}$ ${\zeta _{0}}$ ${\zeta _{0}}$
Table 12
Linguistic evaluating value matrix by the second DM.
Alternatives ${\mathrm{\Im }_{1}}$ ${\mathrm{\Im }_{2}}$ ${\mathrm{\Im }_{3}}$ ${\mathrm{\Im }_{4}}$
${\mathrm{\Re }_{1}}$ ${\zeta _{-2}}$ ${\zeta _{1}}$ ${\zeta _{3}}$ ${\zeta _{3}}$
${\mathrm{\Re }_{2}}$ ${\zeta _{1}}$ ${\zeta _{1}}$ ${\zeta _{-3}}$ ${\zeta _{0}}$
${\mathrm{\Re }_{3}}$ ${\zeta _{2}}$ ${\zeta _{0}}$ ${\zeta _{2}}$ ${\zeta _{1}}$
${\mathrm{\Re }_{4}}$ ${\zeta _{-3}}$ ${\zeta _{0}}$ ${\zeta _{-3}}$ ${\zeta _{0}}$
${\mathrm{\Re }_{5}}$ ${\zeta _{1}}$ ${\zeta _{-1}}$ ${\zeta _{-2}}$ ${\zeta _{-1}}$
Table 13
Linguistic evaluating value matrix by the third DM.
Alternatives ${\mathrm{\Im }_{1}}$ ${\mathrm{\Im }_{2}}$ ${\mathrm{\Im }_{3}}$ ${\mathrm{\Im }_{4}}$
${\mathrm{\Re }_{1}}$ ${\zeta _{1}}$ ${\zeta _{2}}$ ${\zeta _{2}}$ ${\zeta _{2}}$
${\mathrm{\Re }_{2}}$ ${\zeta _{-1}}$ ${\zeta _{1}}$ ${\zeta _{-2}}$ ${\zeta _{-1}}$
${\mathrm{\Re }_{3}}$ ${\zeta _{0}}$ ${\zeta _{2}}$ ${\zeta _{1}}$ ${\zeta _{-3}}$
${\mathrm{\Re }_{4}}$ ${\zeta _{-2}}$ ${\zeta _{-3}}$ ${\zeta _{2}}$ ${\zeta _{-1}}$
${\mathrm{\Re }_{5}}$ ${\zeta _{0}}$ ${\zeta _{-3}}$ ${\zeta _{0}}$ ${\zeta _{1}}$
Table 14
Linguistic evaluating value matrix by the fourth DM.
Alternatives ${\mathrm{\Im }_{1}}$ ${\mathrm{\Im }_{2}}$ ${\mathrm{\Im }_{3}}$ ${\mathrm{\Im }_{4}}$
${\mathrm{\Re }_{1}}$ ${\zeta _{2}}$ ${\zeta _{1}}$ ${\zeta _{3}}$ ${\zeta _{3}}$
${\mathrm{\Re }_{2}}$ ${\zeta _{1}}$ ${\zeta _{3}}$ ${\zeta _{1}}$ ${\zeta _{0}}$
${\mathrm{\Re }_{3}}$ ${\zeta _{0}}$ ${\zeta _{1}}$ ${\zeta _{1}}$ ${\zeta _{1}}$
${\mathrm{\Re }_{4}}$ ${\zeta _{-2}}$ ${\zeta _{-3}}$ ${\zeta _{-3}}$ ${\zeta _{1}}$
${\mathrm{\Re }_{5}}$ ${\zeta _{0}}$ ${\zeta _{-3}}$ ${\zeta _{-2}}$ ${\zeta _{-1}}$
Step 2. Shift the evaluation information with LTSs into a decision matrix $M={({\textit{PL}_{ij}}(p))_{m\times n}}$ with PLTSs (see Table 16).
Table 15
Linguistic evaluating value matrix by the fifth DM.
Alternatives ${\mathrm{\Im }_{1}}$ ${\mathrm{\Im }_{2}}$ ${\mathrm{\Im }_{3}}$ ${\mathrm{\Im }_{4}}$
${\mathrm{\Re }_{1}}$ ${\zeta _{2}}$ ${\zeta _{0}}$ ${\zeta _{3}}$ ${\zeta _{3}}$
${\mathrm{\Re }_{2}}$ ${\zeta _{2}}$ ${\zeta _{2}}$ ${\zeta _{1}}$ ${\zeta _{-2}}$
${\mathrm{\Re }_{3}}$ ${\zeta _{-1}}$ ${\zeta _{1}}$ ${\zeta _{1}}$ ${\zeta _{-2}}$
${\mathrm{\Re }_{4}}$ ${\zeta _{-3}}$ ${\zeta _{-2}}$ ${\zeta _{-3}}$ ${\zeta _{1}}$
${\mathrm{\Re }_{5}}$ ${\zeta _{1}}$ ${\zeta _{-3}}$ ${\zeta _{1}}$ ${\zeta _{-1}}$
Step 3. Normalize the decision matrix with PLTSs. Transform the decision matrix $M={({\textit{PL}_{ij}}(p))_{m\times n}}$ into the normalized decision matrix $\textit{NM}={(\textit{NPL}{i_{ij}}(\tilde{p}))}_{m\times n}$, ${\textit{NPL}_{ij}}(\tilde{p})=\big\{{\zeta _{ij}^{(\gamma )}}({\tilde{p}_{ij}^{(\gamma )}})\big|\gamma =1,2,\dots ,\mathrm{\# }{L_{ij}}(\tilde{p}),{\textstyle\sum _{\gamma =1}^{\mathrm{\# }{L_{ij}}(\tilde{p})}}{\tilde{p}_{ij}^{(\gamma )}}=1\big\}$ $(i=1,2,\dots ,m,j=1,2,\dots ,n)$ (see Table 17).
Table 16
Decision matrix with PLTSs.
Alternatives ${\mathrm{\Im }_{1}}$ ${\mathrm{\Im }_{2}}$
${\mathrm{\Re }_{1}}$ $\{{\zeta _{-2}}(0.2),{\zeta _{1}}(0.2),{\zeta _{2}}(0.6)\}$ $\{{\zeta _{-2}}(0.4),{\zeta _{-1}}(0.4),{\zeta _{0}}(0.2)\}$
${\mathrm{\Re }_{2}}$ $\{{\zeta _{-1}}(0.4),{\zeta _{1}}(0.4),{\zeta _{2}}(0.2)\}$ $\{{\zeta _{-3}}(0.4),{\zeta _{-2}}(0.2),{\zeta _{-1}}(0.4)\}$
${\mathrm{\Re }_{3}}$ $\{{\zeta _{-1}}(0.2),{\zeta _{0}}(0.6),{\zeta _{2}}(0.2)\}$ $\{{\zeta _{-2}}(0.2),{\zeta _{-1}}(0.6),{\zeta _{0}}(0.2)\}$
${\mathrm{\Re }_{4}}$ $\{{\zeta _{-3}}(0.4),{\zeta _{-2}}(0.4),{\zeta _{-1}}(0.2)\}$ $\{{\zeta _{0}}(0.2),{\zeta _{2}}(0.2),{\zeta _{3}}(0.6)\}$
${\mathrm{\Re }_{5}}$ $\{{\zeta _{0}}(0.0),{\zeta _{0}}(0.6),{\zeta _{1}}(0.4)\}$ $\{{\zeta _{-1}}(0.2),{\zeta _{1}}(0.6),{\zeta _{3}}(0.2)\}$
Alternatives ${\mathrm{\Im }_{3}}$ ${\mathrm{\Im }_{4}}$
${\mathrm{\Re }_{1}}$ $\{{\zeta _{1}}(0.2),{\zeta _{2}}(0.2),{\zeta _{3}}(0.6)\}$ $\{{\zeta _{0}}(0.2),{\zeta _{2}}(0.2),{\zeta _{3}}(0.6)\}$
${\mathrm{\Re }_{2}}$ $\{{\zeta _{-3}}(0.2),{\zeta _{-2}}(0.4),{\zeta _{1}}(0.4)\}$ $\{{\zeta _{-2}}(0.2),{\zeta _{-1}}(0.4),{\zeta _{0}}(0.4)\}$
${\mathrm{\Re }_{3}}$ $\{{\zeta _{1}}(0.0),{\zeta _{1}}(0.8),{\zeta _{2}}(0.2)\}$ $\{{\zeta _{-3}}(0.4),{\zeta _{-2}}(0.2),{\zeta _{1}}(0.4)\}$
${\mathrm{\Re }_{4}}$ $\{{\zeta _{-3}}(0.6),{\zeta _{-1}}(0.2),{\zeta _{2}}(0.2)\}$ $\{{\zeta _{-1}}(0.4),{\zeta _{0}}(0.2),{\zeta _{1}}(0.4)\}$
${\mathrm{\Re }_{5}}$ $\{{\zeta _{-2}}(0.4),{\zeta _{0}}(0.4),{\zeta _{1}}(0.2)\}$ $\{{\zeta _{-1}}(0.6),{\zeta _{0}}(0.2),{\zeta _{1}}(0.2)\}$
Step 4. Figure out the combined weight.
Table 17
Normalized decision matrix with PLTSs.
Alternatives ${\mathrm{\Im }_{1}}$ ${\mathrm{\Im }_{2}}$
${\mathrm{\Re }_{1}}$ $\{{\zeta _{-2}}(0.2),{\zeta _{1}}(0.2),{\zeta _{2}}(0.6)\}$ $\{{\zeta _{0}}(0.2),{\zeta _{1}}(0.4),{\zeta _{2}}(0.4)\}$
${\mathrm{\Re }_{2}}$ $\{{\zeta _{-1}}(0.4),{\zeta _{1}}(0.4),{\zeta _{2}}(0.2)\}$ $\{{\zeta _{1}}(0.4),{\zeta _{2}}(0.2),{\zeta _{3}}(0.4)\}$
${\mathrm{\Re }_{3}}$ $\{{\zeta _{-1}}(0.2),{\zeta _{0}}(0.6),{\zeta _{2}}(0.2)\}$ $\{{\zeta _{0}}(0.2),{\zeta _{1}}(0.6),{\zeta _{2}}(0.2)\}$
${\mathrm{\Re }_{4}}$ $\{{\zeta _{-3}}(0.4),{\zeta _{-2}}(0.4),{\zeta _{-1}}(0.2)\}$ $\{{\zeta _{-1}}(0.6),{\zeta _{1}}(0.2),{\zeta _{2}}(0.2)\}$
${\mathrm{\Re }_{5}}$ $\{{\zeta _{0}}(0.0),{\zeta _{0}}(0.6),{\zeta _{1}}(0.4)\}$ $\{{\zeta _{-3}}(0.2),{\zeta _{-1}}(0.6),{\zeta _{1}}(0.2)\}$
Alternatives ${\mathrm{\Im }_{3}}$ ${\mathrm{\Im }_{4}}$
${\mathrm{\Re }_{1}}$ $\{{\zeta _{1}}(0.2),{\zeta _{2}}(0.2),{\zeta _{3}}(0.6)\}$ $\{{\zeta _{0}}(0.2),{\zeta _{2}}(0.2),{\zeta _{3}}(0.6)\}$
${\mathrm{\Re }_{2}}$ $\{{\zeta _{-3}}(0.2),{\zeta _{-2}}(0.4),{\zeta _{1}}(0.4)\}$ $\{{\zeta _{-2}}(0.2),{\zeta _{-1}}(0.4),{\zeta _{0}}(0.4)\}$
${\mathrm{\Re }_{3}}$ $\{{\zeta _{1}}(0.0),{\zeta _{1}}(0.8),{\zeta _{2}}(0.2)\}$ $\{{\zeta _{-3}}(0.4),{\zeta _{-2}}(0.2),{\zeta _{1}}(0.4)\}$
${\mathrm{\Re }_{4}}$ $\{{\zeta _{-3}}(0.6),{\zeta _{-1}}(0.2),{\zeta _{2}}(0.2)\}$ $\{{\zeta _{-1}}(0.6),{\zeta _{1}}(0.2),{\zeta _{2}}(0.2)\}$
${\mathrm{\Re }_{5}}$ $\{{\zeta _{-2}}(0.4),{\zeta _{0}}(0.4),{\zeta _{1}}(0.2)\}$ $\{{\zeta _{-1}}(0.6),{\zeta _{0}}(0.2),{\zeta _{1}}(0.2)\}$
Firstly, the objective weights are calculated by the entrophy method and the detailed calculation steps are as follows:
  • (1) The mean value of jth attribute is calculated by Eqs. (9)–(10) (see Table 18).
  • (2) The ${\mathrm{\wp }_{j}}$ is the entropy of the jth attribute, it is calculated by Eq. (11) (see Table 19).
  • (3) The objective weight of the jth attribute is computed by Eq. (12), and the results are as follows: ${w_{o1}}=0.515$, ${w_{o2}}=0.136$, ${w_{o3}}=0.215$, ${w_{o4}}=0.134$.
Table 18
The mean value for all attributes.
The mean value
${_{{\mathrm{\Im }_{1}}}}$ $\{{\zeta _{0.2700}}(0.2400),{\zeta _{0.5000}}(0.5200),{\zeta _{0.7000}}(0.2400)\}$
${_{{\mathrm{\Im }_{2}}}}$ $\{{\zeta _{0.3300}}(0.3200),{\zeta _{0.5300}}(0.4000),{\zeta _{0.7700}}(0.2800)\}$
${_{{\mathrm{\Im }_{3}}}}$ $\{{\zeta _{0.3000}}(0.2800),{\zeta _{0.5000}}(0.4000),{\zeta _{0.8000}}(0.3200)\}$
${_{{\mathrm{\Im }_{4}}}}$ $\{{\zeta _{0.2700}}(0.4000),{\zeta _{0.5000}}(0.2400),{\zeta _{0.7300}}(0.3600)\}$
Table 19
Probabilistic linguistic total prospect value of the all alternatives.
Alternatives ${_{{\mathrm{\Im }_{1}}}}$ ${_{{\mathrm{\Im }_{2}}}}$ ${_{{\mathrm{\Im }_{3}}}}$ ${_{{\mathrm{\Im }_{4}}}}$
${\mathrm{\wp }_{j}}$ 0.8689 0.9653 0.9453 0.9657
Secondly, the subjective weights are given by experts, which are: ${w_{s1}}=0.1$, ${w_{s2}}=0.4$, ${w_{s3}}=0.3$, ${w_{s4}}=0.2$.
Finally, the combined weight can be calculated by Eq. (13), and the results are as follows: ${w_{c1}}=0.261$, ${w_{c2}}=0.276$, ${w_{c3}}=0.326$, ${w_{c4}}=0.136$.
Step 5. According to Eqs. (14)–(16), the $\textit{PLBAA}={({\textit{PLBAA}_{j}})_{1\times 4}}$ for all attributes can be obtained (see Table 20).
Step 6. The Hamming distance can be calculated by using Eq. (17) and the cumulative prospect Hamming distance can be calculated by using Eq. (18) (see Tables 21–22).
Table 20
PLBAA for all attributes.
PLBAA
${_{{\mathrm{\Im }_{1}}}}$ $\{{\zeta _{0.0000}}(0.0000),{\zeta _{0.4503}}(0.5102),{\zeta _{0.6635}}(0.2297)\}$
${_{{\mathrm{\Im }_{2}}}}$ $\{{\zeta _{0.0000}}(0.2862),{\zeta _{0.4599}}(0.3565),{\zeta _{0.7463}}(0.2639)\}$
${_{{\mathrm{\Im }_{3}}}}$ $\{{\zeta _{0.0000}}(0.0000),{\zeta _{0.4342}}(0.3482),{\zeta _{0.7905}}(0.2862)\}$
${_{{\mathrm{\Im }_{4}}}}$ $\{{\zeta _{0.0000}}(0.3565),{\zeta _{0.4342}}(0.2297),{\zeta _{0.7137}}(0.3288)\}$
Table 21
The Hamming distance matrix.
Alternatives ${\mathrm{\Im }_{1}}$ ${\mathrm{\Im }_{2}}$ ${\mathrm{\Im }_{3}}$ ${\mathrm{\Im }_{4}}$
${\mathrm{\Re }_{1}}$ 0.0726 0.1130 0.2779 0.1774
${\mathrm{\Re }_{2}}$ 0.0615 0.1575 −0.0417 0.0338
${\mathrm{\Re }_{3}}$ 0.0504 0.1221 0.1472 −0.0328
${\mathrm{\Re }_{4}}$ −0.0830 −0.0759 −0.0480 0.1005
${\mathrm{\Re }_{5}}$ 0.0615 −0.0332 0.0695 0.1005
Step 7. Figure up the probabilistic linguistic total prospect value, which is computed by using Eq. (19) (see Table 23).
Table 22
The cumulative prospect distance matrix.
Alternatives ${\mathrm{\Im }_{1}}$ ${\mathrm{\Im }_{2}}$ ${\mathrm{\Im }_{3}}$ ${\mathrm{\Im }_{4}}$
${\mathrm{\Re }_{1}}$ 0.0236 0.0419 0.0724 0.0307
${\mathrm{\Re }_{2}}$ 0.0204 0.0561 −0.0462 0.0072
${\mathrm{\Re }_{3}}$ 0.0171 0.0448 0.0624 −0.0157
${\mathrm{\Re }_{4}}$ −0.0596 −0.0664 −0.0524 0.0186
${\mathrm{\Re }_{5}}$ 0.0204 −0.0321 0.0322 0.0186
Step 8. According to the above calculation, the rank of alternatives is ${\mathrm{\Re }_{1}}>{\mathrm{\Re }_{3}}>{\mathrm{\Re }_{5}}>{\mathrm{\Re }_{2}}>{\mathrm{\Re }_{4}}$, and the optimal location is ${N_{1}}$.
Table 23
Probabilistic linguistic total prospect value of the all alternatives.
Alternatives ${\mathrm{\Re }_{1}}$ ${\mathrm{\Re }_{2}}$ ${\mathrm{\Re }_{3}}$ ${\mathrm{\Re }_{4}}$ ${\mathrm{\Re }_{5}}$
${\Lambda _{i}^{\ast }}$ 0.1686 0.0374 0.1087 −0.1598 0.0391

4.2 Comparative Analysis

We compared our proposed model with three existing methods, which are the PLWA operator (Pang et al., 2016), the PL-TOPSIS method (Pang et al., 2016) and the PL-GRA method (Liang et al., 2018) (let $\rho =0.5$) (see Table 24).
Table 24
Order by using diverse methods.
Methods Order Optimal alternative Bad alternative
PLWA operator (Pang et al., 2016) ${\mathrm{\Re }_{1}}>{\mathrm{\Re }_{3}}>{\mathrm{\Re }_{2}}>{\mathrm{\Re }_{5}}>{\mathrm{\Re }_{4}}$ ${\mathrm{\Re }_{1}}$ ${\mathrm{\Re }_{4}}$
PL-TOPSIS method (Pang et al., 2016) ${\mathrm{\Re }_{1}}>{\mathrm{\Re }_{3}}>{\mathrm{\Re }_{2}}>{\mathrm{\Re }_{5}}>{\mathrm{\Re }_{4}}$ ${\mathrm{\Re }_{1}}$ ${\mathrm{\Re }_{4}}$
PL-GRA method (Liang et al., 2018) ${\mathrm{\Re }_{1}}>{\mathrm{\Re }_{2}}>{\mathrm{\Re }_{3}}>{\mathrm{\Re }_{5}}>{\mathrm{\Re }_{4}}$ ${\mathrm{\Re }_{1}}$ ${\mathrm{\Re }_{4}}$
PL-MABAC ${\mathrm{\Re }_{1}}>{\mathrm{\Re }_{2}}>{\mathrm{\Re }_{3}}>{\mathrm{\Re }_{5}}>{\mathrm{\Re }_{4}}$ ${\mathrm{\Re }_{1}}$ ${\mathrm{\Re }_{4}}$
CPT-PL-MABAC method ${\mathrm{\Re }_{1}}>{\mathrm{\Re }_{3}}>{\mathrm{\Re }_{5}}>{\mathrm{\Re }_{2}}>{\mathrm{\Re }_{4}}$ ${\mathrm{\Re }_{1}}$ ${\mathrm{\Re }_{4}}$
As you can see from the table above, all four methods obtain the same optimal site ${N_{1}}$ and the same nonoptimal site ${N_{4}}$. It means that our method is stable and valid. We can also find the other sites are ranked slightly differently because each method has different emphases. The PL-GRA method emphasizes the shape similarity degree from the PIS, the PL-TOPSIS method emphasizes the distance closeness degree from the PIS and NIS, and the PLWA operator emphasizes the group influences degrees. Additionally, the PL-MABAC emphasizes the distance from the border approximation area. The new CPT-PL-MAC is not only an efficient and reliable decision-making tool with direct computation algorithms and a steady solution, but also introduced the psychological factor of experts.

5 Conclusion

The location selection of the express distribution centre is of great significance in the development of the express delivery industry. Therefore, a new PL-MAGDM method (CPT-PL-MABAC) is established to be applied to this issue. The main contributions of this article can be summarized as follows. Firstly, we introduce the CPT into the original MABAC method under PLTSs. The psychological factors of experts are introduced in the evaluation. Secondly, we improved the entropy method under PLTSs, which is characterized by the mean value of attributes as the reference point. Thirdly, we improved the distance formula between the evaluation values of the alternative and PLBBA. Finally, the new method enriches the decision-making method based on PLTS and enriches the model of location selection.
The CPT-PL-MABAC model is a stable decision-making tool with direct computation algorithms. Also, it can get comprehensive final sorting results because it considers the potential values of gains and losses. However, the method proposed is ineffective in the face of some problems when attribute weights and evaluation information are not completely known. Moreover, we only refer to reference points and value functions in CPT.
In future studies, we plan to deal with the situation where the weights are not completely known. Additionally, this method can be applied to other specific decision-making problems and many other unpredictable and fuzzy environments, for example, green energy supplier issues and other location selection issues.

References

 
Aydin, S. (2021). A novel multi-expert MABAC method based on fermatean fuzzy sets. Journal of Multiple-Valued Logic and Soft Computing, 37, 533–552.
 
Biswas, S. (2020). Measuring performance of healthcare supply chains in India: a comparative analysis of multi-criteria decision making methods. Decision Making Applications in Management and Engineering, 3, 162–189.
 
Chang, J.Y., Liao, H.C., Mi, X.M., Al-Barakati, A. (2021). A probabilistic linguistic TODIM method considering cumulative probability-based Hellinger distance and its application in waste mobile phone recycling. Applied Intelligence, 51(3). https://doi.org/10.1007/s10489-021-02185-w.
 
Chen, Z.Y., Wang, X.K., Peng, J.J., Zhang, H.Y., Wang, J.Q. (2020). An integrated probabilistic linguistic projection method forMCGDMbased onELECTRE IIIand the weighted convex median voting rule. Expert Systems, 37(6), e12593.
 
Du, Y.F., Liu, D. (2021). A novel approach to relative importance ratings of customer requirements in QFD based on probabilistic linguistic preferences. Fuzzy Optimization and Decision Making. https://doi.org/10.1007/s10700-020-09347-4.
 
Gao, J.W., Guo, F.J., Li, X.Z., Huang, X., Men, H.J. (2021). Risk assessment of offshore photovoltaic projects under probabilistic linguistic environment. Renewable Energy, 163, 172–187.
 
Gong, C., Xu, C.H., Ando, M., Xi, X.M. (2018). A new method of portfolio optimization under cumulative prospect theory. Tsinghua Science and Technology, 23, 75–86.
 
Gong, J.W., Li, Q., Yin, L.S., Liu, H.C. (2020). Undergraduate teaching audit and evaluation using an extended MABAC method underq-rung orthopair fuzzy environment. International Journal of Intelligent Systems, 35, 1912–1933.
 
Gou, X.J., Xu, Z.S., Liao, H.C. (2017). Multiple criteria decision making based on Bonferroni means with hesitant fuzzy linguistic information. Soft Computing, 21, 6515–6529.
 
He, S.S., Wang, Y.T., Peng, J.J., Wang, J.Q. (2021). Risk ranking of wind turbine systems through an improved FMEA based on probabilistic linguistic information and the TODIM method. Journal of the Operational Research Society. https://doi.org/10.1080/01605682.2020.1854629.
 
Hu, J.H., Chen, P.P., Yang, Y. (2019). An interval type-2 fuzzy similarity-based MABAC approach for patient-centered care. Mathematics, 7(2), 140. https://doi.org/10.3390/math7020140.
 
Huang, Y., Lin, R., Chen, X. (2021). An enhancement EDAS method based on prospect theory. Technological and Economic Development of Economy, 27, 1019–1038.
 
Jiang, L.S., Liao, H.C. (2021). Network consensus analysis of probabilistic linguistic preference relations for group decision making and its application in urban household waste classification. Journal of Cleaner Production, 2781, 122766.
 
Jiang, Z., Wei, G., Chen, X. (2021a). EDAS method based on cumulative prospect theory for multiple attribute group decision-making under picture fuzzy environment. Journal of Intelligent & Fuzzy Systems. https://doi.org/10.3233/JIFS-211171.
 
Jiang, Z., Wei, G., Wu, J., Chen, X. (2021b). CPT-TODIM method for picture fuzzy multiple attribute group decision making and its application to food enterprise quality credit evaluation. Journal of Intelligent & Fuzzy Systems, 4, 10115–10128.
 
Jiang, Z., Wei, G., Guo, Y. (2022). Picture fuzzy MABAC method based on prospect theory for multiple attribute group decision making and its application to suppliers selection. Journal of Intelligent & Fuzzy Systems. https://doi.org/10.3233/JIFS-211359.
 
Lei, F., Wei, G., Shen, W., Guo, Y. (2021). PDHL-EDAS method for multiple attribute group decision making and its application to 3D printer selection. Technological and Economic Development of Economy, 1–22. https://doi.org/10.3846/tede.2021.15884.
 
Liang, D.C., Kobina, A., Quan, W. (2018). Grey relational analysis method for probabilistic linguistic multi-criteria group decision-making based on geometric Bonferroni mean. International Journal of Fuzzy Systems, 20, 2234–2244.
 
Liang, D.C., Dai, Z.Y., Wang, M.W., Li, J.J. (2020). Web celebrity shop assessment and improvement based on online review with probabilistic linguistic term sets by using sentiment analysis and fuzzy cognitive map. Fuzzy Optimization and Decision Making, 19, 561–586.
 
Liang, W.Z., Zhao, G.Y., Wu, H., Dai, B. (2019). Risk assessment of rockburst via an extended MABAC method under fuzzy environment. Tunnelling and Underground Space Technology, 83, 533–544.
 
Lin, M.W., Chen, Z.Y., Liao, H.C., Xu, Z.S. (2019). ELECTRE II method to deal with probabilistic linguistic term sets and its application to edge computing. Nonlinear Dynamics, 96, 2125–2143.
 
Lin, M.W., Chen, Z.Y., Xu, Z.S., Gou, X.J., Herrera, F. (2021). Score function based on concentration degree for probabilistic linguistic term sets: an application to TOPSIS and VIKOR. Information Sciences, 551, 270–290.
 
Liu, P.D., Zhang, P. (2021). A normal wiggly hesitant fuzzy MABAC method based on CCSD and prospect theory for multiple attribute decision making. International Journal of Intelligent Systems, 36, 447–477.
 
Liu, Y.S., Tang, L.N., Ma, Y.Z., Yang, T.H. (2018). TFT-LCD module cell layout design using simulation and fuzzy multiple attribute group decision-making approach. Applied Soft Computing, 68, 873–888.
 
Liu, H.B., Ma, Y., Jiang, L. (2019). Managing incomplete preferences and consistency improvement in hesitant fuzzy linguistic preference relations with applications in group decision making. Information Fusion, 51, 19–29.
 
Luo, D.D., Zeng, S.Z., Chen, J. (2020). A probabilistic linguistic multiple attribute decision making based on a new correlation coefficient method and its application in hospital assessment. Mathematics, 8(3), 340. https://doi.org/10.3390/math8030340.
 
Luo, Y.Y., Zhang, X.X., Qin, Y., Yang, Z., Liang, Y. (2021). Tourism attraction selection with sentiment analysis of online reviews based on probabilistic linguistic term sets and the IDOCRIW-COCOSO model. International Journal of Fuzzy Systems, 23, 295–308.
 
Ming, Y., Luo, L., Wu, X.L., Liao, H.C., Lev, B., Jiang, L. (2020). Managing patient satisfaction in a blood-collection room by the probabilistic linguistic gained and lost dominance score method integrated with the best-worst method. Computers & Industrial Engineering, 145, 106547.
 
Mo, H.M. (2020). An emergency decision-making method for probabilistic linguistic term sets extended by D number theory. Symmetry-Basel, 12(3), 380. https://doi.org/10.3390/sym12030380.
 
Pamucar, D., Stevic, Z., Zavadskas, E.K. (2018). Integration of interval rough AHP and interval rough MABAC methods for evaluating university web pages. Applied Soft Computing, 67, 141–163.
 
Pan, L., Xu, Z.S., Ren, P.J. (2021) DEA cross-efficiency framework for efficiency evaluation with probabilistic linguistic term sets. Journal of the Operational Research Society, 72(5), 1191–1206.
 
Pang, Q., Wang, H., Xu, Z.S. (2016). Probabilistic linguistic linguistic term sets in multi-attribute group decision making. Information Sciences, 369, 128–143.
 
Peng, H.G., Wang, J.Q. (2020). Multi-criteria sorting decision making based on dominance and opposition relations with probabilistic linguistic information. Fuzzy Optimization and Decision Making, 19, 435–470.
 
Qu, G.H., Xue, R.D., Li, T.J., Qu, W.H., Xu, Z.S. (2020). A stochastic multi-attribute method for measuring sustainability performance of a supplier based on a triple bottom line approach in a dual hesitant fuzzy linguistic Environment. International Journal of Environmental Research and Public Health, 17, 2138.
 
Rodriguez, R.M., Martinez, L., Herrera, F. (2012). Hesitant fuzzy linguistic term sets for decision making. IEEE Transactions on Fuzzy Systems, 20, 109–119.
 
Shen, A., Peng, S.L., Liu, G.F. (2021). Transforming and decision-making based on probabilistic linguistic term sets with comparative linguistic expressions and incomplete assessments. Journal of Intelligent & Fuzzy Systems, 40, 491–506.
 
Su, Y., Zhao, M., Wei, C., Chen, X. (2021a). PT-TODIM method for probabilistic linguistic MAGDM and application to industrial control system security supplier selection. International Journal of Fuzzy Systems. https://doi.org/10.1007/s40815-40021-01125-40817.
 
Su, Y., Zhao, M., Wei, G., Wei, C., Chen, X. (2021b). Probabilistic uncertain linguistic EDAS method based on prospect theory for multiple attribute group decision-making and its application to green finance. International Journal of Fuzzy Systems. https://doi.org/10.1007/s40815-40021-01184-w.
 
Sun, R.X., Hu, J.H., Zhou, J.D., Chen, X.H. (2018). A hesitant fuzzy linguistic projection-based MABAC method for patients’ prioritization. International Journal of Fuzzy Systems, 20, 2144–2160.
 
Teng, F., Liu, P.D., Liang, X. (2021). Unbalanced probabilistic linguistic decision-making method for multi-attribute group decision-making problems with heterogeneous relationships and incomplete information. Artificial Intelligence Review, 54(6). https://doi.org/10.1007/s10462-020-09927-1.
 
Tversky, A., Kahneman, D. (1992). Advances in prospect theory: cumulative representation of uncertainty. Journal of Risk and Uncertainty, 5, 297–323.
 
Verma, R. (2021). On intuitionistic fuzzy order-alpha divergence and entropy measures with MABAC method for multiple attribute group decision-making. Journal of Intelligent & Fuzzy Systems, 40, 1191–1217.
 
Wang, B.L., Liang, J.Y. (2020). A novel preference measure for multi-granularity probabilistic linguistic term sets and its applications in large-scale group decision-making. International Journal of Fuzzy Systems, 22, 2350–2368.
 
Wang, L., Garg, H. (2021). Algorithm for multiple attribute decision-making with interactive Archimedean norm operations under Pythagorean fuzzy uncertainty. International Journal of Computational Intelligence Systems, 14(1), 503–527.
 
Wang, M.W., Liang, D.C., Xu, Z.S., Ye, D.J. (2021). The evaluation of mobile health apps: a psychological perception-based probabilistic linguistic belief thermodynamic multiple attribute decision making method. Journal of the Operational Research Society, 72(11). https://doi.org/10.1080/01605682.2020.1801361.
 
Wang, X.K., Wang, Y.T., Wang, J.Q., Cheng, P.F., Li, L. (2020). A TODIM-PROMETHEE II based multi-criteria group decision making method for risk evaluation of water resource carrying capacity under probabilistic linguistic Z-number circumstances. Mathematics, 8, 1190. https://doi.org/10.3390/math8071190.
 
Wei, G., Wei, C., Guo, Y. (2021a). EDAS method for probabilistic linguistic multiple attribute group decision making and their application to green supplier selection. Soft Computing, 25, 9045–9053.
 
Wei, G., Wu, J., Guo, Y., Wang, J., Wei, C. (2021b). An extended COPRAS model for multiple attribute group decision making based on single-valued neutrosophic 2-tuple linguistic environment. Technological and Economic Development of Economy, 27, 353–368.
 
Xiao, L., Wei, G., Guo, Y., Chen, X. (2021). Taxonomy method for multiple attribute group decision making based on interval-valued intuitionistic fuzzy with entropy. Journal of Intelligent & Fuzzy Systems, 41, 7031–7045.
 
Xie, W.Y., Xu, Z.S., Ren, Z.L., Herrera-Viedma, E. (2020). The probe for the weighted dual probabilistic linguistic correlation coefficient to invest an artificial intelligence project. Soft Computing, 24, 15389–15408.
 
Xu, C., Qian, G., Wang, H. (2020). Stochastic multiple criteria comprehensive evaluation based on probabilistic linguistic preference relations: a case study of healthcare insurance audits in China. International Journal of Fuzzy Systems, 22, 1607–1623.
 
Xu, X.G., Shi, H., Zhang, L.J., Liu, H.C. (2019). Green supplier evaluation and selection with an extended MABAC method under the heterogeneous information environment. Sustainability, 11(23), 6616.
 
Xu, X.H., Hou, Y.Z., He, J.S., Zhang, Z.T. (2020). A two-stage similarity clustering-based large group decision-making method with incomplete probabilistic linguistic evaluation information. Soft Computing, 24, 16869–16883.
 
Yazdi, A.K., Komijan, A.R., Wanke, P.F., Sardar, S. (2020). Oil project selection in Iran: a hybrid MADM approach in an uncertain environment. Applied Soft Computing, 88, 106066.
 
You, S.Y., Zhang, L.J., Xu, X.G., Liu, H.C. (2020). A new integrated multi-criteria decision making and multi-objective programming model for sustainable supplier selection and order allocation. Symmetry-Basel, 12, 302.
 
Yu, S.M., Du, Z.J., Lin, X.D., Luo, H.Y., Wang, J.Q. (2020). A stochastic dominance-based approach for hotel selection under probabilistic linguistic environment. Mathematics, 8, 1525.
 
Yue, N., Wu, D.R., Xie, J.L., Chen, S.L. (2020a). Probabilistic linguistic multi-criteria decision-making based on double information under imperfect conditions. Fuzzy Optimization and Decision Making, 19, 391–433.
 
Yue, N., Xie, J.L., Chen, S.L. (2020b). Some new basic operations of probabilistic linguistic term sets and their application in multi-criteria decision making. Soft Computing, 24, 12131–12148.
 
Zeng, W.Y., Li, D.Q., Yin, Q. (2019). Weighted hesitant fuzzy linguistic term sets and its application in group decision making. Journal of Intelligent & Fuzzy Systems, 37, 1099–1112.
 
Zhang, D., Su, Y., Zhao, M., Chen, X. (2021). CPT-TODIM method for interval neutrosophic MAGDM and its application to third-party logistics service providers selection. Technological and Economic Development of Economy, 1–19. https://doi.org/10.3846/tede.2021.15758.
 
Zhang, H., Wei, G., Chen, X. (2021). CPT-MABAC method for spherical fuzzy multiple attribute group decision making and its application to green supplier selection. Journal of Intelligent & Fuzzy Systems, 41, 1009–1019.
 
Zhang, H.J., Palomares, I., Dong, Y.C., Wang, W.W. (2018). Managing non-cooperative behaviors in consensus-based multiple attribute group decision making: an approach based on social network analysis. Knowledge-Based Systems, 162, 29–45.
 
Zhang, S., Gao, H., Wei, G., Chen, X. (2021). Grey relational analysis method based on cumulative prospect theory for intuitionistic fuzzy multi-attribute group decision making. Journal of Intelligent & Fuzzy Systems, 41, 3783–3795.
 
Zhao, M.W., Wei, G.W., Chen, X.D., Wei, Y. (2021a). Intuitionistic fuzzy MABAC method based on cumulative prospect theory for multiple attribute group decision making. International Journal of Intelligent Systems, 36, 6337–6359.
 
Zhao, M.W., Wei, G.W., Wei, C., Wu, J. (2021b). Pythagorean fuzzy TODIM method based on the cumulative prospect theory for MAGDM and its application on risk assessment of science and technology projects. International Journal of Fuzzy Systems, 23(1), https://doi.org/10.1007/s40815-40020-00986-40818.
 
Zhao, M.W., Wei, G.W., Wu, J., Guo, Y.F., Wei, C. (2021c). TODIM method for multiple attribute group decision making based on cumulative prospect theory with 2-tuple linguistic neutrosophic sets. International Journal of Intelligent Systems, 36, 1199–1222.

Biographies

Tang Shiqi

S. Tang is a current master’s student with College of Mathematical Sciences, Sichuan Normal University, Chengdu, 610066, PR China. She is currently interested in aggregation operators, decision making and computing with words.

Wei Guiwu
weiguiwu@163.com

G. Wei has an MSc and a PhD degrees in applied mathematics from SouthWest Petroleum University, and in business administration from School of Economics and Management at SouthWest Jiaotong University, China, respectively. From May 2010 to April 2012, he was a postdoctoral researcher at the School of Economics and Management, Tsinghua University, Beijing, China. He is a professor in the School of Business at Sichuan Normal University. He has published more than 100 papers in journals, books and conference proceedings, including journals such as Omega, Decision Support Systems, Expert Systems with Applications, Applied Soft Computing, Knowledge and Information Systems, Computers & Industrial Engineering, Knowledge-Based Systems, International Journal of Intelligent Systems, International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, International Journal of Computational Intelligence Systems, International Journal of Machine Learning and Cybernetics, Fundamenta Informaticae, Informatica, Kybernetes, International Journal of Knowledge-Based and Intelligent Engineering Systems and Information: An International Interdisciplinary Journal. He has published 1 book. He has participated in several scientific committees and serves as a reviewer of a wide range of journals including Computers & Industrial Engineering, International Journal of Information Technology and Decision Making, Knowledge-Based Systems, Information Sciences, International Journal of Computational Intelligence Systems and European Journal of Operational Research. He is currently interested in aggregation operators, decision making and computing with words.

Chen Xudong

X. Chen has a PhD degree in applied mathematics for business administration from school of Economics and Management at SouthWest Jiaotong University, China, respectively. He is a professor in the School of Accounting, Southwestern University of Finance and Economics, Chengdu, 610074, PR China. He is currently interested in finance analysis, decision making and computing with words.


Reading mode PDF XML

Table of contents
  • 1 Introduction
  • 2 Preliminaries
  • 3 CPT-PL-MABAC Model for MAGDM Issues
  • 4 An Example Analysis and Comparative Analysis
  • 5 Conclusion
  • References
  • Biographies

Copyright
© 2022 Vilnius University
by logo by logo
Open access article under the CC BY license.

Keywords
multiple attribute group decision making (MAGDM) PLTSs MABAC algorithm entropy method cumulative prospect theory (CPT) location selection

Metrics
since January 2020
1256

Article info
views

650

Full article
views

638

PDF
downloads

177

XML
downloads

Export citation

Copy and paste formatted citation
Placeholder

Download citation in file


Share


RSS

  • Figures
    1
  • Tables
    24
infor467_g001.jpg
Fig. 1
CPT-PL-MABAC frame diagram.
Table 1
Linguistic decision matrix by the first DM.
Table 2
Linguistic decision matrix by the second DM.
Table 3
Linguistic decison matrix by the third DM.
Table 4
Linguistic decision matrix by the fourth DM.
Table 5
Linguistic decision matrix by the fifth DM.
Table 6
Decision matrix with linguistic term sets by the first DM.
Table 7
Decision matrix with linguistic term sets by the second DM.
Table 8
Decision matrix with linguistic term sets by the third DM.
Table 9
Decision matrix with linguistic term sets by the fourth DM.
Table 10
Decision matrix with linguistic term sets by the fifth DM.
Table 11
Linguistic evaluating value matrix by the first DM.
Table 12
Linguistic evaluating value matrix by the second DM.
Table 13
Linguistic evaluating value matrix by the third DM.
Table 14
Linguistic evaluating value matrix by the fourth DM.
Table 15
Linguistic evaluating value matrix by the fifth DM.
Table 16
Decision matrix with PLTSs.
Table 17
Normalized decision matrix with PLTSs.
Table 18
The mean value for all attributes.
Table 19
Probabilistic linguistic total prospect value of the all alternatives.
Table 20
PLBAA for all attributes.
Table 21
The Hamming distance matrix.
Table 22
The cumulative prospect distance matrix.
Table 23
Probabilistic linguistic total prospect value of the all alternatives.
Table 24
Order by using diverse methods.
infor467_g001.jpg
Fig. 1
CPT-PL-MABAC frame diagram.
Table 1
Linguistic decision matrix by the first DM.
Alternatives ${\mathrm{\Im }_{1}}$ ${\mathrm{\Im }_{2}}$ ${\mathrm{\Im }_{3}}$ ${\mathrm{\Im }_{4}}$
${\mathrm{\Re }_{1}}$ SA SI A M
${\mathrm{\Re }_{2}}$ I DI SI I
${\mathrm{\Re }_{3}}$ M I A DI
${\mathrm{\Re }_{4}}$ I DI I I
${\mathrm{\Re }_{5}}$ M I M M
Table 2
Linguistic decision matrix by the second DM.
Alternatives ${\mathrm{\Im }_{1}}$ ${\mathrm{\Im }_{2}}$ ${\mathrm{\Im }_{3}}$ ${\mathrm{\Im }_{4}}$
${\mathrm{\Re }_{1}}$ SI I DA DA
${\mathrm{\Re }_{2}}$ A I DI M
${\mathrm{\Re }_{3}}$ SA M SA A
${\mathrm{\Re }_{4}}$ DI M DI M
${\mathrm{\Re }_{5}}$ A A SI I
Table 3
Linguistic decison matrix by the third DM.
Alternatives ${\mathrm{\Im }_{1}}$ ${\mathrm{\Im }_{2}}$ ${\mathrm{\Im }_{3}}$ ${\mathrm{\Im }_{4}}$
${\mathrm{\Re }_{1}}$ A SI SA SA
${\mathrm{\Re }_{2}}$ I I SI I
${\mathrm{\Re }_{3}}$ M SI A DI
${\mathrm{\Re }_{4}}$ SI DA SA I
${\mathrm{\Re }_{5}}$ M DA M A
Table 4
Linguistic decision matrix by the fourth DM.
Alternatives ${\mathrm{\Im }_{1}}$ ${\mathrm{\Im }_{2}}$ ${\mathrm{\Im }_{3}}$ ${\mathrm{\Im }_{4}}$
${\mathrm{\Re }_{1}}$ SA I DA DA
${\mathrm{\Re }_{2}}$ A DI A M
${\mathrm{\Re }_{3}}$ M I A A
${\mathrm{\Re }_{4}}$ SI DA DI A
${\mathrm{\Re }_{5}}$ M DA SI I
Table 5
Linguistic decision matrix by the fifth DM.
Alternatives ${\mathrm{\Im }_{1}}$ ${\mathrm{\Im }_{2}}$ ${\mathrm{\Im }_{3}}$ ${\mathrm{\Im }_{4}}$
${\mathrm{\Re }_{1}}$ SA M DA DA
${\mathrm{\Re }_{2}}$ SA SI A SI
${\mathrm{\Re }_{3}}$ I I A SI
${\mathrm{\Re }_{4}}$ DI SA DI A
${\mathrm{\Re }_{5}}$ A DA A I
Table 6
Decision matrix with linguistic term sets by the first DM.
Alternatives ${\mathrm{\Im }_{1}}$ ${\mathrm{\Im }_{2}}$ ${\mathrm{\Im }_{3}}$ ${\mathrm{\Im }_{4}}$
${\mathrm{\Re }_{1}}$ ${\zeta _{2}}$ ${\zeta _{-2}}$ ${\zeta _{1}}$ ${\zeta _{0}}$
${\mathrm{\Re }_{2}}$ ${\zeta _{-1}}$ ${\zeta _{-3}}$ ${\zeta _{-2}}$ ${\zeta _{-1}}$
${\mathrm{\Re }_{3}}$ ${\zeta _{0}}$ ${\zeta _{-1}}$ ${\zeta _{1}}$ ${\zeta _{-3}}$
${\mathrm{\Re }_{4}}$ ${\zeta _{-1}}$ ${\zeta _{-3}}$ ${\zeta _{-1}}$ ${\zeta _{-1}}$
${\mathrm{\Re }_{5}}$ ${\zeta _{0}}$ ${\zeta _{-1}}$ ${\zeta _{0}}$ ${\zeta _{0}}$
Table 7
Decision matrix with linguistic term sets by the second DM.
Alternatives ${\mathrm{\Im }_{1}}$ ${\mathrm{\Im }_{2}}$ ${\mathrm{\Im }_{3}}$ ${\mathrm{\Im }_{4}}$
${\mathrm{\Re }_{1}}$ ${\zeta _{-2}}$ ${\zeta _{-1}}$ ${\zeta _{3}}$ ${\zeta _{3}}$
${\mathrm{\Re }_{2}}$ ${\zeta _{1}}$ ${\zeta _{-1}}$ ${\zeta _{-3}}$ ${\zeta _{0}}$
${\mathrm{\Re }_{3}}$ ${\zeta _{2}}$ ${\zeta _{0}}$ ${\zeta _{2}}$ ${\zeta _{1}}$
${\mathrm{\Re }_{4}}$ ${\zeta _{-3}}$ ${\zeta _{0}}$ ${\zeta _{-3}}$ ${\zeta _{0}}$
${\mathrm{\Re }_{5}}$ ${\zeta _{1}}$ ${\zeta _{1}}$ ${\zeta _{-2}}$ ${\zeta _{-1}}$
Table 8
Decision matrix with linguistic term sets by the third DM.
Alternatives ${\mathrm{\Im }_{1}}$ ${\mathrm{\Im }_{2}}$ ${\mathrm{\Im }_{3}}$ ${\mathrm{\Im }_{4}}$
${\mathrm{\Re }_{1}}$ ${\zeta _{1}}$ ${\zeta _{-2}}$ ${\zeta _{2}}$ ${\zeta _{2}}$
${\mathrm{\Re }_{2}}$ ${\zeta _{-1}}$ ${\zeta _{-1}}$ ${\zeta _{-2}}$ ${\zeta _{-1}}$
${\mathrm{\Re }_{3}}$ ${\zeta _{0}}$ ${\zeta _{-2}}$ ${\zeta _{1}}$ ${\zeta _{-3}}$
${\mathrm{\Re }_{4}}$ ${\zeta _{-2}}$ ${\zeta _{3}}$ ${\zeta _{2}}$ ${\zeta _{-1}}$
${\mathrm{\Re }_{5}}$ ${\zeta _{0}}$ ${\zeta _{3}}$ ${\zeta _{0}}$ ${\zeta _{1}}$
Table 9
Decision matrix with linguistic term sets by the fourth DM.
Alternatives ${\mathrm{\Im }_{1}}$ ${\mathrm{\Im }_{2}}$ ${\mathrm{\Im }_{3}}$ ${\mathrm{\Im }_{4}}$
${\mathrm{\Re }_{1}}$ ${\zeta _{2}}$ ${\zeta _{-1}}$ ${\zeta _{3}}$ ${\zeta _{3}}$
${\mathrm{\Re }_{2}}$ ${\zeta _{1}}$ ${\zeta _{-3}}$ ${\zeta _{1}}$ ${\zeta _{0}}$
${\mathrm{\Re }_{3}}$ ${\zeta _{0}}$ ${\zeta _{-1}}$ ${\zeta _{1}}$ ${\zeta _{1}}$
${\mathrm{\Re }_{4}}$ ${\zeta _{-2}}$ ${\zeta _{3}}$ ${\zeta _{-3}}$ ${\zeta _{1}}$
${\mathrm{\Re }_{5}}$ ${\zeta _{0}}$ ${\zeta _{3}}$ ${\zeta _{-2}}$ ${\zeta _{-1}}$
Table 10
Decision matrix with linguistic term sets by the fifth DM.
Alternatives ${\mathrm{\Im }_{1}}$ ${\mathrm{\Im }_{2}}$ ${\mathrm{\Im }_{3}}$ ${\mathrm{\Im }_{4}}$
${\mathrm{\Re }_{1}}$ ${\zeta _{2}}$ ${\zeta _{0}}$ ${\zeta _{3}}$ ${\zeta _{3}}$
${\mathrm{\Re }_{2}}$ ${\zeta _{2}}$ ${\zeta _{-2}}$ ${\zeta _{1}}$ ${\zeta _{-2}}$
${\mathrm{\Re }_{3}}$ ${\zeta _{-1}}$ ${\zeta _{-1}}$ ${\zeta _{1}}$ ${\zeta _{-2}}$
${\mathrm{\Re }_{4}}$ ${\zeta _{-3}}$ ${\zeta _{2}}$ ${\zeta _{-3}}$ ${\zeta _{1}}$
${\mathrm{\Re }_{5}}$ ${\zeta _{1}}$ ${\zeta _{3}}$ ${\zeta _{1}}$ ${\zeta _{-1}}$
Table 11
Linguistic evaluating value matrix by the first DM.
Alternatives ${\mathrm{\Im }_{1}}$ ${\mathrm{\Im }_{2}}$ ${\mathrm{\Im }_{3}}$ ${\mathrm{\Im }_{4}}$
${\mathrm{\Re }_{1}}$ ${\zeta _{2}}$ ${\zeta _{2}}$ ${\zeta _{1}}$ ${\zeta _{0}}$
${\mathrm{\Re }_{2}}$ ${\zeta _{-1}}$ ${\zeta _{3}}$ ${\zeta _{-2}}$ ${\zeta _{-1}}$
${\mathrm{\Re }_{3}}$ ${\zeta _{0}}$ ${\zeta _{1}}$ ${\zeta _{1}}$ ${\zeta _{-3}}$
${\mathrm{\Re }_{4}}$ ${\zeta _{-1}}$ ${\zeta _{3}}$ ${\zeta _{-1}}$ ${\zeta _{-1}}$
${\mathrm{\Re }_{5}}$ ${\zeta _{0}}$ ${\zeta _{1}}$ ${\zeta _{0}}$ ${\zeta _{0}}$
Table 12
Linguistic evaluating value matrix by the second DM.
Alternatives ${\mathrm{\Im }_{1}}$ ${\mathrm{\Im }_{2}}$ ${\mathrm{\Im }_{3}}$ ${\mathrm{\Im }_{4}}$
${\mathrm{\Re }_{1}}$ ${\zeta _{-2}}$ ${\zeta _{1}}$ ${\zeta _{3}}$ ${\zeta _{3}}$
${\mathrm{\Re }_{2}}$ ${\zeta _{1}}$ ${\zeta _{1}}$ ${\zeta _{-3}}$ ${\zeta _{0}}$
${\mathrm{\Re }_{3}}$ ${\zeta _{2}}$ ${\zeta _{0}}$ ${\zeta _{2}}$ ${\zeta _{1}}$
${\mathrm{\Re }_{4}}$ ${\zeta _{-3}}$ ${\zeta _{0}}$ ${\zeta _{-3}}$ ${\zeta _{0}}$
${\mathrm{\Re }_{5}}$ ${\zeta _{1}}$ ${\zeta _{-1}}$ ${\zeta _{-2}}$ ${\zeta _{-1}}$
Table 13
Linguistic evaluating value matrix by the third DM.
Alternatives ${\mathrm{\Im }_{1}}$ ${\mathrm{\Im }_{2}}$ ${\mathrm{\Im }_{3}}$ ${\mathrm{\Im }_{4}}$
${\mathrm{\Re }_{1}}$ ${\zeta _{1}}$ ${\zeta _{2}}$ ${\zeta _{2}}$ ${\zeta _{2}}$
${\mathrm{\Re }_{2}}$ ${\zeta _{-1}}$ ${\zeta _{1}}$ ${\zeta _{-2}}$ ${\zeta _{-1}}$
${\mathrm{\Re }_{3}}$ ${\zeta _{0}}$ ${\zeta _{2}}$ ${\zeta _{1}}$ ${\zeta _{-3}}$
${\mathrm{\Re }_{4}}$ ${\zeta _{-2}}$ ${\zeta _{-3}}$ ${\zeta _{2}}$ ${\zeta _{-1}}$
${\mathrm{\Re }_{5}}$ ${\zeta _{0}}$ ${\zeta _{-3}}$ ${\zeta _{0}}$ ${\zeta _{1}}$
Table 14
Linguistic evaluating value matrix by the fourth DM.
Alternatives ${\mathrm{\Im }_{1}}$ ${\mathrm{\Im }_{2}}$ ${\mathrm{\Im }_{3}}$ ${\mathrm{\Im }_{4}}$
${\mathrm{\Re }_{1}}$ ${\zeta _{2}}$ ${\zeta _{1}}$ ${\zeta _{3}}$ ${\zeta _{3}}$
${\mathrm{\Re }_{2}}$ ${\zeta _{1}}$ ${\zeta _{3}}$ ${\zeta _{1}}$ ${\zeta _{0}}$
${\mathrm{\Re }_{3}}$ ${\zeta _{0}}$ ${\zeta _{1}}$ ${\zeta _{1}}$ ${\zeta _{1}}$
${\mathrm{\Re }_{4}}$ ${\zeta _{-2}}$ ${\zeta _{-3}}$ ${\zeta _{-3}}$ ${\zeta _{1}}$
${\mathrm{\Re }_{5}}$ ${\zeta _{0}}$ ${\zeta _{-3}}$ ${\zeta _{-2}}$ ${\zeta _{-1}}$
Table 15
Linguistic evaluating value matrix by the fifth DM.
Alternatives ${\mathrm{\Im }_{1}}$ ${\mathrm{\Im }_{2}}$ ${\mathrm{\Im }_{3}}$ ${\mathrm{\Im }_{4}}$
${\mathrm{\Re }_{1}}$ ${\zeta _{2}}$ ${\zeta _{0}}$ ${\zeta _{3}}$ ${\zeta _{3}}$
${\mathrm{\Re }_{2}}$ ${\zeta _{2}}$ ${\zeta _{2}}$ ${\zeta _{1}}$ ${\zeta _{-2}}$
${\mathrm{\Re }_{3}}$ ${\zeta _{-1}}$ ${\zeta _{1}}$ ${\zeta _{1}}$ ${\zeta _{-2}}$
${\mathrm{\Re }_{4}}$ ${\zeta _{-3}}$ ${\zeta _{-2}}$ ${\zeta _{-3}}$ ${\zeta _{1}}$
${\mathrm{\Re }_{5}}$ ${\zeta _{1}}$ ${\zeta _{-3}}$ ${\zeta _{1}}$ ${\zeta _{-1}}$
Table 16
Decision matrix with PLTSs.
Alternatives ${\mathrm{\Im }_{1}}$ ${\mathrm{\Im }_{2}}$
${\mathrm{\Re }_{1}}$ $\{{\zeta _{-2}}(0.2),{\zeta _{1}}(0.2),{\zeta _{2}}(0.6)\}$ $\{{\zeta _{-2}}(0.4),{\zeta _{-1}}(0.4),{\zeta _{0}}(0.2)\}$
${\mathrm{\Re }_{2}}$ $\{{\zeta _{-1}}(0.4),{\zeta _{1}}(0.4),{\zeta _{2}}(0.2)\}$ $\{{\zeta _{-3}}(0.4),{\zeta _{-2}}(0.2),{\zeta _{-1}}(0.4)\}$
${\mathrm{\Re }_{3}}$ $\{{\zeta _{-1}}(0.2),{\zeta _{0}}(0.6),{\zeta _{2}}(0.2)\}$ $\{{\zeta _{-2}}(0.2),{\zeta _{-1}}(0.6),{\zeta _{0}}(0.2)\}$
${\mathrm{\Re }_{4}}$ $\{{\zeta _{-3}}(0.4),{\zeta _{-2}}(0.4),{\zeta _{-1}}(0.2)\}$ $\{{\zeta _{0}}(0.2),{\zeta _{2}}(0.2),{\zeta _{3}}(0.6)\}$
${\mathrm{\Re }_{5}}$ $\{{\zeta _{0}}(0.0),{\zeta _{0}}(0.6),{\zeta _{1}}(0.4)\}$ $\{{\zeta _{-1}}(0.2),{\zeta _{1}}(0.6),{\zeta _{3}}(0.2)\}$
Alternatives ${\mathrm{\Im }_{3}}$ ${\mathrm{\Im }_{4}}$
${\mathrm{\Re }_{1}}$ $\{{\zeta _{1}}(0.2),{\zeta _{2}}(0.2),{\zeta _{3}}(0.6)\}$ $\{{\zeta _{0}}(0.2),{\zeta _{2}}(0.2),{\zeta _{3}}(0.6)\}$
${\mathrm{\Re }_{2}}$ $\{{\zeta _{-3}}(0.2),{\zeta _{-2}}(0.4),{\zeta _{1}}(0.4)\}$ $\{{\zeta _{-2}}(0.2),{\zeta _{-1}}(0.4),{\zeta _{0}}(0.4)\}$
${\mathrm{\Re }_{3}}$ $\{{\zeta _{1}}(0.0),{\zeta _{1}}(0.8),{\zeta _{2}}(0.2)\}$ $\{{\zeta _{-3}}(0.4),{\zeta _{-2}}(0.2),{\zeta _{1}}(0.4)\}$
${\mathrm{\Re }_{4}}$ $\{{\zeta _{-3}}(0.6),{\zeta _{-1}}(0.2),{\zeta _{2}}(0.2)\}$ $\{{\zeta _{-1}}(0.4),{\zeta _{0}}(0.2),{\zeta _{1}}(0.4)\}$
${\mathrm{\Re }_{5}}$ $\{{\zeta _{-2}}(0.4),{\zeta _{0}}(0.4),{\zeta _{1}}(0.2)\}$ $\{{\zeta _{-1}}(0.6),{\zeta _{0}}(0.2),{\zeta _{1}}(0.2)\}$
Table 17
Normalized decision matrix with PLTSs.
Alternatives ${\mathrm{\Im }_{1}}$ ${\mathrm{\Im }_{2}}$
${\mathrm{\Re }_{1}}$ $\{{\zeta _{-2}}(0.2),{\zeta _{1}}(0.2),{\zeta _{2}}(0.6)\}$ $\{{\zeta _{0}}(0.2),{\zeta _{1}}(0.4),{\zeta _{2}}(0.4)\}$
${\mathrm{\Re }_{2}}$ $\{{\zeta _{-1}}(0.4),{\zeta _{1}}(0.4),{\zeta _{2}}(0.2)\}$ $\{{\zeta _{1}}(0.4),{\zeta _{2}}(0.2),{\zeta _{3}}(0.4)\}$
${\mathrm{\Re }_{3}}$ $\{{\zeta _{-1}}(0.2),{\zeta _{0}}(0.6),{\zeta _{2}}(0.2)\}$ $\{{\zeta _{0}}(0.2),{\zeta _{1}}(0.6),{\zeta _{2}}(0.2)\}$
${\mathrm{\Re }_{4}}$ $\{{\zeta _{-3}}(0.4),{\zeta _{-2}}(0.4),{\zeta _{-1}}(0.2)\}$ $\{{\zeta _{-1}}(0.6),{\zeta _{1}}(0.2),{\zeta _{2}}(0.2)\}$
${\mathrm{\Re }_{5}}$ $\{{\zeta _{0}}(0.0),{\zeta _{0}}(0.6),{\zeta _{1}}(0.4)\}$ $\{{\zeta _{-3}}(0.2),{\zeta _{-1}}(0.6),{\zeta _{1}}(0.2)\}$
Alternatives ${\mathrm{\Im }_{3}}$ ${\mathrm{\Im }_{4}}$
${\mathrm{\Re }_{1}}$ $\{{\zeta _{1}}(0.2),{\zeta _{2}}(0.2),{\zeta _{3}}(0.6)\}$ $\{{\zeta _{0}}(0.2),{\zeta _{2}}(0.2),{\zeta _{3}}(0.6)\}$
${\mathrm{\Re }_{2}}$ $\{{\zeta _{-3}}(0.2),{\zeta _{-2}}(0.4),{\zeta _{1}}(0.4)\}$ $\{{\zeta _{-2}}(0.2),{\zeta _{-1}}(0.4),{\zeta _{0}}(0.4)\}$
${\mathrm{\Re }_{3}}$ $\{{\zeta _{1}}(0.0),{\zeta _{1}}(0.8),{\zeta _{2}}(0.2)\}$ $\{{\zeta _{-3}}(0.4),{\zeta _{-2}}(0.2),{\zeta _{1}}(0.4)\}$
${\mathrm{\Re }_{4}}$ $\{{\zeta _{-3}}(0.6),{\zeta _{-1}}(0.2),{\zeta _{2}}(0.2)\}$ $\{{\zeta _{-1}}(0.6),{\zeta _{1}}(0.2),{\zeta _{2}}(0.2)\}$
${\mathrm{\Re }_{5}}$ $\{{\zeta _{-2}}(0.4),{\zeta _{0}}(0.4),{\zeta _{1}}(0.2)\}$ $\{{\zeta _{-1}}(0.6),{\zeta _{0}}(0.2),{\zeta _{1}}(0.2)\}$
Table 18
The mean value for all attributes.
The mean value
${_{{\mathrm{\Im }_{1}}}}$ $\{{\zeta _{0.2700}}(0.2400),{\zeta _{0.5000}}(0.5200),{\zeta _{0.7000}}(0.2400)\}$
${_{{\mathrm{\Im }_{2}}}}$ $\{{\zeta _{0.3300}}(0.3200),{\zeta _{0.5300}}(0.4000),{\zeta _{0.7700}}(0.2800)\}$
${_{{\mathrm{\Im }_{3}}}}$ $\{{\zeta _{0.3000}}(0.2800),{\zeta _{0.5000}}(0.4000),{\zeta _{0.8000}}(0.3200)\}$
${_{{\mathrm{\Im }_{4}}}}$ $\{{\zeta _{0.2700}}(0.4000),{\zeta _{0.5000}}(0.2400),{\zeta _{0.7300}}(0.3600)\}$
Table 19
Probabilistic linguistic total prospect value of the all alternatives.
Alternatives ${_{{\mathrm{\Im }_{1}}}}$ ${_{{\mathrm{\Im }_{2}}}}$ ${_{{\mathrm{\Im }_{3}}}}$ ${_{{\mathrm{\Im }_{4}}}}$
${\mathrm{\wp }_{j}}$ 0.8689 0.9653 0.9453 0.9657
Table 20
PLBAA for all attributes.
PLBAA
${_{{\mathrm{\Im }_{1}}}}$ $\{{\zeta _{0.0000}}(0.0000),{\zeta _{0.4503}}(0.5102),{\zeta _{0.6635}}(0.2297)\}$
${_{{\mathrm{\Im }_{2}}}}$ $\{{\zeta _{0.0000}}(0.2862),{\zeta _{0.4599}}(0.3565),{\zeta _{0.7463}}(0.2639)\}$
${_{{\mathrm{\Im }_{3}}}}$ $\{{\zeta _{0.0000}}(0.0000),{\zeta _{0.4342}}(0.3482),{\zeta _{0.7905}}(0.2862)\}$
${_{{\mathrm{\Im }_{4}}}}$ $\{{\zeta _{0.0000}}(0.3565),{\zeta _{0.4342}}(0.2297),{\zeta _{0.7137}}(0.3288)\}$
Table 21
The Hamming distance matrix.
Alternatives ${\mathrm{\Im }_{1}}$ ${\mathrm{\Im }_{2}}$ ${\mathrm{\Im }_{3}}$ ${\mathrm{\Im }_{4}}$
${\mathrm{\Re }_{1}}$ 0.0726 0.1130 0.2779 0.1774
${\mathrm{\Re }_{2}}$ 0.0615 0.1575 −0.0417 0.0338
${\mathrm{\Re }_{3}}$ 0.0504 0.1221 0.1472 −0.0328
${\mathrm{\Re }_{4}}$ −0.0830 −0.0759 −0.0480 0.1005
${\mathrm{\Re }_{5}}$ 0.0615 −0.0332 0.0695 0.1005
Table 22
The cumulative prospect distance matrix.
Alternatives ${\mathrm{\Im }_{1}}$ ${\mathrm{\Im }_{2}}$ ${\mathrm{\Im }_{3}}$ ${\mathrm{\Im }_{4}}$
${\mathrm{\Re }_{1}}$ 0.0236 0.0419 0.0724 0.0307
${\mathrm{\Re }_{2}}$ 0.0204 0.0561 −0.0462 0.0072
${\mathrm{\Re }_{3}}$ 0.0171 0.0448 0.0624 −0.0157
${\mathrm{\Re }_{4}}$ −0.0596 −0.0664 −0.0524 0.0186
${\mathrm{\Re }_{5}}$ 0.0204 −0.0321 0.0322 0.0186
Table 23
Probabilistic linguistic total prospect value of the all alternatives.
Alternatives ${\mathrm{\Re }_{1}}$ ${\mathrm{\Re }_{2}}$ ${\mathrm{\Re }_{3}}$ ${\mathrm{\Re }_{4}}$ ${\mathrm{\Re }_{5}}$
${\Lambda _{i}^{\ast }}$ 0.1686 0.0374 0.1087 −0.1598 0.0391
Table 24
Order by using diverse methods.
Methods Order Optimal alternative Bad alternative
PLWA operator (Pang et al., 2016) ${\mathrm{\Re }_{1}}>{\mathrm{\Re }_{3}}>{\mathrm{\Re }_{2}}>{\mathrm{\Re }_{5}}>{\mathrm{\Re }_{4}}$ ${\mathrm{\Re }_{1}}$ ${\mathrm{\Re }_{4}}$
PL-TOPSIS method (Pang et al., 2016) ${\mathrm{\Re }_{1}}>{\mathrm{\Re }_{3}}>{\mathrm{\Re }_{2}}>{\mathrm{\Re }_{5}}>{\mathrm{\Re }_{4}}$ ${\mathrm{\Re }_{1}}$ ${\mathrm{\Re }_{4}}$
PL-GRA method (Liang et al., 2018) ${\mathrm{\Re }_{1}}>{\mathrm{\Re }_{2}}>{\mathrm{\Re }_{3}}>{\mathrm{\Re }_{5}}>{\mathrm{\Re }_{4}}$ ${\mathrm{\Re }_{1}}$ ${\mathrm{\Re }_{4}}$
PL-MABAC ${\mathrm{\Re }_{1}}>{\mathrm{\Re }_{2}}>{\mathrm{\Re }_{3}}>{\mathrm{\Re }_{5}}>{\mathrm{\Re }_{4}}$ ${\mathrm{\Re }_{1}}$ ${\mathrm{\Re }_{4}}$
CPT-PL-MABAC method ${\mathrm{\Re }_{1}}>{\mathrm{\Re }_{3}}>{\mathrm{\Re }_{5}}>{\mathrm{\Re }_{2}}>{\mathrm{\Re }_{4}}$ ${\mathrm{\Re }_{1}}$ ${\mathrm{\Re }_{4}}$

INFORMATICA

  • Online ISSN: 1822-8844
  • Print ISSN: 0868-4952
  • Copyright © 2023 Vilnius University

About

  • About journal

For contributors

  • OA Policy
  • Submit your article
  • Instructions for Referees
    •  

    •  

Contact us

  • Institute of Data Science and Digital Technologies
  • Vilnius University

    Akademijos St. 4

    08412 Vilnius, Lithuania

    Phone: (+370 5) 2109 338

    E-mail: informatica@mii.vu.lt

    https://informatica.vu.lt/journal/INFORMATICA
Powered by PubliMill  •  Privacy policy