Hesitant Neutrosophic Linguistic Sets and Their Application in Multiple Attribute Decision Making

Abstract

In this paper, the hesitant neutrosophic linguistic set is first defined by extending a hesitant fuzzy set to accommodate linguistic terms and neutrosophic fuzzy values. Some operational laws are defined for hesitant neutrosophic linguistic fuzzy information. Several distance measures have been defined including generalized hesitant neutrosophic linguistic distance, generalized hesitant neutrosophic linguistic Hausdorff distance, and generalized hesitant neutrosophic linguistic hybrid distance. Some hesitant neutrosophic fuzzy linguistic aggregation operators based on the Choquet integral have been defined. A new multiple attribute decision making method for hesitant neutrosophic fuzzy linguistic information has been developed based on TOPSIS. In order to illustrate the feasibility and practical advantages of the new algorithm, we use it to select a company to invest. The new method is then compared with other methods.

1. Introduction

With the development of society and the economy, decision problems have become increasingly complicated. Fuzziness and uncertainty exists extensively in the decision process. Many useful tools have been developed to model fuzzy and uncertain information, including fuzzy sets, intuitionistic fuzzy sets, interval-valued intuitionistic fuzzy sets, linguistic arguments, hesitant fuzzy sets, and neutrosophic sets. Many useful methods have been developed based on these tools. Smarandache [1] developed the neutrosophic set by generalizing a fuzzy set, an intuitionistic fuzzy set [2], and a hesitant fuzzy set. The neutrosophic set has received extensively attention [3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25] recently. The neutrosophic fuzzy set has been extended to accommodate interval values [7,8], linguistic variables [9,10], and trapezoidal fuzzy numbers [11]. Ye [9] proposed the concept of a single valued neutrosophic linguistic set as a generalization of the concepts of a linguistic variable and an intuitionistic linguistic set. Ye [11] combined trapezoidal fuzzy numbers with a single-valued neutrosophic set to propose a trapezoidal neutrosophic set and defined some trapezoidal neutrosophic fuzzy aggregation operators. The neutrosophic fuzzy set has been used in image segmentation [12], clustering analysis [13], supply chain management [14], etc. Guo and Sengür [12] utilized the neutrosophic set in image segmentation and proposed a novel algorithm based on neutrosophic similarity clustering. Karaaslan [13] defined the concept of a single-valued neutrosophic refined soft set by extending a single-valued neutrosophic refined set. Some aggregation operators have been developed [3,7,15,16,17,18]. Liu and Tang [3] proposed some power average aggregation operators for interval neutrosophic sets, including the interval neutrosophic power generalized weighted aggregation operator and interval neutrosophic power generalized ordered weighted aggregation operator. Zhao et al. [7] defined the generalized weighted aggregation operator for interval valued neutrosophic sets based on a traditional generalized weighted aggregation operator. Liu and Shi [15] defined the interval neutrosophic hesitant fuzzy set and developed some new interval neutrosophic hesitant fuzzy generalized hybrid aggregation operators. Liu et al. [16] proposed some generalized neutrosophic number hamacher weighted aggregation operators. Sun et al. [17] defined a ranking index to compare two interval neutrosophic numbers and defined an interval neutrosophic Choquet integral operator. Peng et al. [18] developed the multi-valued neutrosophic sets and defined the operations of multi-valued neutrosophic numbers based on Einstein operations. Some distances, cross entropies and correlation coefficient measures have been defined [19,20,21,22,23,24,25,26]. Ye [19] defined the Hamming and Euclidean distances between interval neutrosophic sets and proposed the similarity measures based on the relationship between similarity measures and distances. Ye presented single-valued neutrosophic cross entropy in [20] and presented the correlation coefficient of single-valued neutrosophic sets based on the extension of the intuitionistic fuzzy correlation coefficient in [21]. Zhang et al. [22] proposed a new correlation coefficient measure for interval neutrosophic sets. Şahin [23] defined the interval neutrosophic cross-entropy based on extension of fuzzy cross entropy and single-valued neutrosophic cross entropy. Tian et al. [26] proposed a fuzzy cross entropy approach to calculate the discrimination measure between alternatives and the absolute ideal solutions.

A hesitant fuzzy set is another extension of the fuzzy set, which was developed by Torra and Narukawa [27,28]. In the hesitant fuzzy set, the membership degree of an element to a set is represented by several possible values. Compared with other tools to model fuzzy and uncertain information, the hesitant fuzzy set is more flexible and accurate, especially for large-scale and complex decision problems. The hesitant fuzzy set has received a great deal of attention [29,30,31,32,33,34]. Due to the fuzzy nature of human thinking, decision-makers would like to evaluate with linguistic terms. Several linguistic decision making models have been developed [35,36,37,38,39], including the 2-tuple linguistic model [35], uncertain linguistic variables [36], the hesitant fuzzy linguistic terms set [37], and the linguistic hesitant intuitionistic fuzzy term set [39]. With the development of the economy and society, decision problems become more and more complex, and multiple decision-makers from different fields are invited to evaluate. Decision-makers (DMs) would like to use linguistic terms in the evaluation process, but they may express some hesitation, which can be modeled properly by the neutrosophic set. Since each DM has his/her own characteristics, he/she can give proper evaluation values if he/she is familiar with the attribute and can refuse to produce any evaluation values if he/she is unfamiliar with the attribute in order to assure accuracy and reasonability of decision results. DMs can use a different number of linguistic terms and a different number of neutrosophic fuzzy values in evaluating the attribute. Then, we can get hesitant neutrosophic linguistic information. Ye [40] developed hesitant interval neutrosophic linguistic set and proposed the hesitant interval neutrosophic linguistic weighted average operator and a hesitant interval neutrosophic linguistic weighted geometric operator. It is rather difficult to use interval linguistic values in evaluation, and distances between hesitant interval neutrosophic linguistic elements have not been studied. To our best knowledge, hesitant neutrosophic linguistic sets, which are very important in decision-making, especially for complex decision-making problems requiring fast evaluation, have not been studied. Motivated by the idea of the hesitant fuzzy set, the neutrosophic set, and linguistic terms, we present hesitant neutrosophic linguistic sets. Then, we define some operational laws and some distant measures between hesitant neutrosophic linguistic sets. A new multiple attribute decision-making method based on hesitant neutrosophic linguistic information has thus been developed.

The rest of the paper is organized as follows. In Section 2, we first briefly review some concepts on the hesitant fuzzy set, the linguistic variable, and the neutrosophic set. Then, we propose a definition of the hesitant neutrosophic linguistic set and provide some operation laws of hesitant neutrosophic linguistic elements. We also define the cosine value between two hesitant neutrosophic linguistic elements to compare them. In Section 3, we present some distance measures for hesitant neutrosophic linguistic elements. In Section 4, we develop some hesitant neutrosophic linguistic aggregation operators based on the Choquet integral. In Section 5, we present a new multiple attribute group decision-making method based on TOPSIS for hesitant neutrosophic fuzzy linguistic information. A numerical example is presented in Section 6, and some comparisons are also made. Conclusions are presented in Section 7.

2. Preliminaries

In this section, we give the definition of the hesitant neutrosophic linguistic set and present some operation laws. We also present the method to compare two hesitant neutrosophic linguistic elements by using their cosine values.

In the decision-making process, there are cases where a DM, in determining the membership of an element to a set, doubts several different values. Torra and Narukawa [27,28] generalized a fuzzy set to make each membership include several values and developed the hesitant fuzzy set (HFS). An HFS is defined in terms of a function that returns a set of membership values of each element in the domain.

Definition 1.

Let X be a reference set. An HFS $\tilde{A}$ on X is a function m that returns a subset of values in $[0,1]$ when it is applied to X:

$$\tilde{A}=\{<x,m_{\tilde{A}}\left(x\right)>\mid x\in X\}$$

where $m_{\tilde{A}}\left(x\right)$ is a set of some different values in $[0,1]$, representing the possible membership degrees of element $x\in X$ to $\tilde{A}$. $m_{\tilde{A}}\left(x\right)$ is called a hesitant fuzzy element (HFE).

Let $S=\left\{s_i\right|i=1,\dots ,g\}$ be a finite and totally ordered discrete term set, where $s_i$ represents a possible value for a linguistic variable. For example, a set of nine terms [36] can be expressed as

$$\begin{array}{cc}\hfill S=& \{s_1=\mathrm{extremely}\mathrm{poor},s_2=\mathrm{very}\mathrm{poor},s_3=\mathrm{poor},s_4=\mathrm{slightly}\mathrm{poor},s_5=\mathrm{fair},\hfill \\ \hfill & s_6=\mathrm{slightly}\mathrm{good},s_7=\mathrm{good},s_8=\mathrm{very}\mathrm{good},s_9=\mathrm{extremely}\mathrm{good}\}.\hfill \end{array}$$

The above set satisfies the following properties:

(1)

The set is ordered: $s_i\ge s_j$, if $i\ge j$.

(2)

Max operator: $\max \{s_i,s_j\}=s_i$, if $i\ge j$.

(3)

Min operator: $\min \{s_i,s_j\}=s_i$, if $i\le j$.

(4)

Negation operator: $\mathrm{neg}\left\{s_i\right\}=s_{g-i}$.

In order to preserve all the information, the discrete linguistic term sets S can be extended to a continuous one: $\overline{S}=\{s_{\alpha }\mid s_0\le s_{\alpha }\le s_g\},\alpha \in [0,g]$.

Definition 2.

[1] Let X be a universeof discourse, with a generic element in X denoted by x. A neutrosophic set A in X is

$$A=\{x(T_A\left(x\right),I_A\left(x\right),F_A\left(x\right))\mid x\in X\},$$

where $T_A$ is the truth-membership function, $I_A$ is the indeterminacy-membership function, $F_A$ is the real falsity-membership function. $T_A\left(x\right),I_A\left(x\right)$ and $F_A\left(x\right)$ are real standard or nonstandard subsets of $]0^{-},1^{+}[$. There is no restriction on the sum of $T_A\left(x\right),I_A\left(x\right)$ and $F_A\left(x\right)$, we can obtain $0^{-}\le T_A\left(x\right)+I_A\left(x\right)+F_A\left(x\right)\le 3^{+}$.

DMs would like to evaluate with linguistic terms since such terms reflect the fuzzy nature of human thinking. For complex decision-making problems, multiple experts from different fields are invited to evaluate alternatives with respect to multiple attributes. If the expert is familiar with the attribute, he/she can provide a proper evaluation value. If he/she is not familiar with the attribute, he/she can refuse to provide any evaluation value to assure the reasonability of the results. If two experts use the same truth-membership, indeterminacy-membership, or real falsity-membership, they are merged. We can then obtain the hesitant neutrosophic linguistic set as follows.

Definition 3.

Let $X=\{x_1,x_2,\dots ,x_n\}$ be a reference set. A hesitant neutrosophic linguistic set (HNLS) A in X is

$$A=\left\{<x_i,h_A\left(x_i\right)>\mid x_i\in X,i=1,2,\dots ,n\right\}$$

where $h_A\left(x_i\right)=\left\{\left(s_{{\theta }_i},(T\left(s_{{\theta }_i}\right),I\left(s_{{\theta }_i}\right),F\left(s_{{\theta }_i}\right))\right)\right\}$, $T\left(s_{{\theta }_i}\right)$ is the set of truth-membership functions, $I\left(s_{{\theta }_i}\right)$ is the set of indeterminacy-membership functions, and $F\left(s_{{\theta }_i}\right)$ is the set of real falsity-membership functions. $sup\left(T\left(s_{{\theta }_i}\right)\right)+sup\left(I\left(s_{{\theta }_i}\right)\right)+sup\left(F\left(s_{{\theta }_i}\right)\right)\le 3$. For convenience, we call $h_A\left(x_i\right)$ the hesitant neutrosophic linguistic element (HNLE). We can use $a=(s_{{\theta }_i},(T\left(s_{{\theta }_i}\right),I\left(s_{{\theta }_i}\right),and$ $F\left(s_{{\theta }_i}\right)\left)\right)$ to represent a neutrosophic linguistic element (NLE).

Definition 4.

Let $h,h_1$, and $h_2$ be HNLEs, and let $h=\{a_k\}$, $h_1=\{a_i^{(1)}\}$, $h_2=\{a_j^{(2)}\}$, $a_k=\left(s_{{\theta }_k},(T(s_{{\theta }_k}),I(s_{{\theta }_k}),F(s_{{\theta }_k}))\right)\in h$, $a_i^{(1)}=\left(s_{{\theta }_i^{(1)}},(T(s_{{\theta }_i^{(1)}}),I(s_{{\theta }_i^{(1)}}),F(s_{{\theta }_i^{(1)}}))\right)\in h_1$ and $a_j^{(2)}=(s_{{\theta }_j^{(2)}},(T(s_{{\theta }_j^{(2)}}),I(s_{{\theta }_j^{(2)}}),$ $F(s_{{\theta }_j^{(2)}})))\in h_2$ be NLEs. Let ${\mu }_i^{(1)}\in F(s_{{\theta }_i^{(1)}}),{\mu }_j^{(2)}\in F(s_{{\theta }_j^{(2)}}),{\nu }_i^{(1)}\in T(s_{{\theta }_i^{(1)}}),{\nu }_j^{(2)}\in T(s_{{\theta }_j^{(2)}}),{\tau }_i^{(1)}\in I(s_{{\theta }_i^{(1)}}),{\tau }_j^{(2)}\in I(s_{{\theta }_j^{(2)}})$. $\lambda >0$. The operational laws can be defined as follows.

(1) 

$h_1\oplus h_2={\bigcup }_{a_i^{(1)}\in h_1,a_j^{(2)}\in h_2}\{(s_{{\theta }_i^{(1)}+{\theta }_j^{(2)}},$ $\bigcup \{({\mu }_i^{(1)}+{\mu }_j^{(2)}-{\mu }_i^{(1)}{\mu }_j^{(2)},$ ${\nu }_i^{(1)}{\nu }_j^{(2)},{\tau }_i^{(1)}{\tau }_j^{(2)})\})\}$

(2) 

$h_1\otimes h_2={\bigcup }_{a_i^{(1)}\in h_1,a_j^{(2)}\in h_2}\{(s_{{\theta }_i^{(1)}{\theta }_j^{(2)}},$ $\bigcup \{({\mu }_i^{(1)}{\mu }_j^{(2)},{\nu }_i^{(1)}+{\nu }_j^{(2)}-{\nu }_i^{(1)}{\nu }_j^{(2)},{\tau }_i^{(1)}+{\tau }_j^{(2)}-{\tau }_i^{(1)}{\tau }_j^{(2)})\})\}$

(3) 

$\lambda h={\bigcup }_{a_k\in h}\left\{\left(s_{\lambda {\theta }_k},\bigcup \{(1-{(1-{\mu }_k)}^{\lambda },{({\nu }_k)}^{\lambda },{({\tau }_k)}^{\lambda })\}\right)\right\}$

(4) 

$h^{\lambda }={\bigcup }_{a_k\in h}\left\{\left(s_{{\theta }_k^{\lambda }},\bigcup \{({({\mu }_k)}^{\lambda },1-{(1-{\nu }_k)}^{\lambda },1-{(1-{\tau }_k)}^{\lambda })\}\right)\right\}$.

Theorem 1.

Let $h,h_1,h_2$, and $h_3$ be HNLEs, $\lambda ,{\lambda }_1$ and ${\lambda }_2>0$. Then,

(1) 

$h_1\oplus h_2=h_2\oplus h_1$

(2) 

$h_1\otimes h_2=h_2\otimes h_1$

(3) 

$\lambda (h_1\oplus h_2)=\lambda h_1\oplus \lambda h_2$

(4) 

$({\lambda }_1+{\lambda }_2)h={\lambda }_{1}h\oplus {\lambda }_{2}h$

(5) 

${(h_1\otimes h_2)}^{\lambda }=h_1^{\lambda }\otimes h_2^{\lambda }$

(6) 

$h^{{\lambda }_1+{\lambda }_2}=h^{{\lambda }_1}\otimes h^{{\lambda }_2}$

(7) 

$(h_1\oplus h_2)\oplus h_3=h_1\oplus (h_2\oplus h_3)$

(8) 

$(h_1\otimes h_2)\otimes h_3=h_1\otimes (h_2\otimes h_3)$.

Different HNLEs may have different NLEs, and different NLEs may have different truth- memberships, indeterminacy-memberships, or falsity-memberships. In order to define the distances between two HNLEs more accurately, we need to extend the HNLEs until they have the same number of NLEs and until each NLE has the same number of truth-memberships, indeterminacy-memberships, and falsity-memberships. We can extend the HNLEs according to the risk attitudes of the decision- makers. If decision-makers are risk-seeking, the largest NLE can be added; if decision-makers are risk-averse, the smallest NLE can be added; if decision-makers are risk-neutral, the average value of NLEs can be added.

Definition 5.

Let $a_i$ and $a_j$ be NLEs. $a_i=\left(s_{{\theta }_i},(T\left(s_{{\theta }_i}\right),I\left(s_{{\theta }_i}\right),F\left(s_{{\theta }_i}\right))\right)$, $a_j=(s_{{\theta }_j},$ $(T\left(s_{{\theta }_j}\right),I\left(s_{{\theta }_j}\right),F\left(s_{{\theta }_j}\right)))$, ${\mu }_{ik}\in T\left(s_{{\theta }_i}\right)$, ${\nu }_{il}\in I\left(s_{{\theta }_i}\right)$, ${\tau }_{im}\in F\left(s_{{\theta }_i}\right)$, ${\mu }_{jk}\in T\left(s_{{\theta }_j}\right)$, ${\nu }_{jl}\in I\left(s_{{\theta }_j}\right)$, ${\tau }_{jm}\in F\left(s_{{\theta }_j}\right)$. The cosine value between $a_i$ and $a_j$ can be defined as follows:

$$cos(a_i,a_j)=\frac{{\theta }_i{\theta }_j/g^2+\frac{1}{l_t}{\sum }_{k=1}^{l_t}{\mu }_{i\sigma \left(k\right)}{\mu }_{j\sigma \left(k\right)}+\frac{1}{l_i}{\sum }_{k=1}^{l_i}{\nu }_{i\sigma \left(k\right)}{\nu }_{j\sigma \left(k\right)}+\frac{1}{l_f}{\sum }_{k=1}^{l_f}{\tau }_{i\sigma \left(k\right)}{\tau }_{j\sigma \left(k\right)}}{4\parallel a_i\parallel ·\parallel a_j\parallel }$$

(1)

where $\parallel a_i\parallel ={\left(\frac{1}{4}({\theta }_i^2/g^2+\frac{1}{l_t}{\sum }_{k=1}^{l_t}{\mu }_{ik}^2+\frac{1}{l_i}{\sum }_{k=1}^{l_i}{\nu }_{ik}^2+\frac{1}{l_f}{\sum }_{k=1}^{l_f}{\tau }_{ik}^2)\right)}^{1/2}$, $\parallel a_j\parallel =(\frac{1}{4}({\theta }_j^2/g^2+$ $\frac{1}{l_t}{\sum }_{k=1}^{l_t}{\mu }_{jk}^2$ $+\frac{1}{l_i}{\sum }_{k=1}^{l_i}{\nu }_{jk}^2$ $+\frac{1}{l_f}{\sum }_{k=1}^{l_f}{\tau }_{jk}^2){)}^{1/2}$, g is the number of linguistic variables in the linguistic term set, $l_t$ is the number of truth-memberships in the NLE, $l_i$ is the number of indeterminacy-membership in the NLE, and $l_f$ is the number of falsity-membership in the NLE. $0<cos(a_i,a_j)\le 1$. If $a_j$ is the ideal solution $I=(s_g,\{1,\dots ,1\},\{0,\dots ,0\},\{0,\dots ,0\})$, then

$$cos(a_i,I)=\frac{{\theta }_i/g+\frac{1}{l_t}{\sum }_{k=1}^{l_t}{\mu }_{i\sigma \left(k\right)}}{\sqrt{2({\theta }_i^2/g^2+\frac{1}{l_t}{\sum }_{k=1}^{l_t}{\mu }_{ik}^2+\frac{1}{l_i}{\sum }_{k=1}^{l_i}{\nu }_{ik}^2+\frac{1}{l_f}{\sum }_{k=1}^{l_f}{\tau }_{ik}^2)}}.$$

Definition 6.

Let $a_1,a_2$ be two NLEs. If $cos(a_1,I)\le cos(a_2,I)$, then $a_1\le a_2$.

Definition 7.

Let $h_1,h_2$ be HNLEs. $h_1=\{a_i^{(1)}\}=\{(s_{{\theta }_i^{(1)}},(T(s_{{\theta }_i^{(1)}}),I(s_{{\theta }_i^{(1)}}),$ $F(s_{{\theta }_i^{(1)}})))\}$, $h_2=\{a_i^{(2)}\}=\{(s_{{\theta }_i^{(2)}},$ $(T(s_{{\theta }_i^{(2)}}),$ $I(s_{{\theta }_i^{(2)}}),$ $F(s_{{\theta }_i^{(1)}})))\}$. The cosine value between $h_1$ and $h_2$ can be defined as follows:

$$cos(h_1,h_2)=\frac{h_1·h_2}{\parallel h_1\parallel ·\parallel h_2\parallel }$$

(2)

where

$$h_1·h_2=\frac{1}{4l}\sum _{i=1}^l\left(({\theta }_{\sigma (i)}^{(1)}{\theta }_{\sigma (i)}^{(2)})/g^2+\frac{1}{l_t}\sum _{k=1}^{l_t}({\mu }_{\sigma (ik)}^{(1)}{\mu }_{\sigma (ik)}^{(2)})+\frac{1}{l_i}\sum _{k=1}^{l_i}{\left({\nu }_{\sigma (ik)}^{(1)}{\nu }_{\sigma (ik)}^{(2)}\right)}^2+\frac{1}{l_t}\sum _{k=1}^{l_t}{\left({\tau }_{\sigma (ik)}^{(1)}{\tau }_{\sigma (ik)}^{(1)}\right)}^2\right)$$

$\parallel h_1\parallel ={\left(\frac{1}{4l}{\sum }_{i=1}^l\left({({\theta }_i^{(1)})}^2/g^2+\frac{1}{l_t}{\sum }_{k=1}^{l_t}{({\mu }_{ik}^{(1)})}^2+\frac{1}{l_i}{\sum }_{k=1}^{l_i}{\left({\nu }_{ik}^{(1)}\right)}^2+\frac{1}{l_f}{\sum }_{k=1}^{l_f}{\left({\tau }_{ik}^{(1)}\right)}^2\right)\right)}^{1/2}$

$\parallel h_2\parallel =(\frac{1}{4l}{\sum }_{i=1}^l({({\theta }_i^{(2)})}^2/g^2+\frac{1}{l_t}{\sum }_{k=1}^{l_t}{({\mu }_{ik}^{(2)})}^2+\frac{1}{l_i}{\sum }_{k=1}^{l_i}{\left({\nu }_{ik}^{(2)}\right)}^2+$ $\frac{1}{l_f}{\sum }_{k=1}^{l_f}*$ ${\left({\tau }_{ik}^{(2)}\right)}^2){)}^{1/2}$.

l is the number of NLEs in the HNLEs, g is the number of linguistic variables in the linguistic term set, $l_t$ is the number of truth-memberships in an NLE, $l_i$ is the number of indeterminacy-membership in an NLE, $l_f$ is the number of falsity-membership in an NLE. $0<cos(h_1,h_2)\le 1$. When $h_2$ is the ideal solution $I^{\prime }=\{(s_g,\{1,\dots ,1\},\{0,\dots ,0\},\{0,\dots ,0\})\}$, the bigger $cos(h_1,I^{\prime })$ between $h_1$ and $I^{\prime }$ is, the more consistent the direction between $h_1$ and $I^{\prime }$ is. Thus,

$$cos(h_1,I^{\prime })=\frac{\frac{1}{l}{\sum }_{i=1}^l\left(({\theta }_{\sigma (i)}^{(1)})/g+\frac{1}{l_t}{\sum }_{k=1}^{l_t}{\mu }_{\sigma (ik)}^{(1)}\right)}{\sqrt{\frac{2}{l}{\sum }_{i=1}^l\left({({\theta }_i^{(1)})}^2/g^2+\frac{1}{l_t}{\sum }_{k=1}^{l_t}{({\mu }_{ik}^{(1)})}^2+\frac{1}{l_i}{\sum }_{k=1}^{l_i}{\left({\nu }_{ik}^{(1)}\right)}^2+\frac{1}{l_t}{\sum }_{k=1}^{l_f}{\left({\tau }_{ik}^{(1)}\right)}^2\right)}}.$$

(3)

Definition 8.

Let $h_1,h_2$ be two HNLEs. If $cos(h_1,I^{\prime })\le cos(h_2,I^{\prime })$, then $h_1\le h_2$.

3. Some Hesitant Neutrosophic Fuzzy Linguistic Distance Measures

In this section, we propose some distance measures for the hesitant neutrosophic fuzzy linguistic values and we also propose some correlated distance measures by using the Choquet integral.

The distance measures are very important since they are the basis of many well-known methods including TOPSIS, VIKOR, and ELECTRE. In this section, we develop some distance measures for hesitant neutrosophic fuzzy linguistic information.

Definition 9.

Let $h_1,h_2$ be HNLEs. The distance measure between $h_1$ and $h_2$ can be defined as $d(h_1,h_2)$, which satisfies the following properties:

(1) 

$0\le d(h_1,h_2)\le 1$;

(2) 

$d(h_1,h_2)=0$ if and only if $h_1=h_2$;

(3) 

$d(h_1,h_2)=d(h_2,h_1)$.

Definition 10.

Let $h_1,h_2$ be HNLEs. Then the similarity measure between $h_1$ and $h_2$ is defined as $\rho (h_1,h_2)$, which satisfies the following properties:

(1) 

$0\le \rho (h_1,h_2)\le 1$;

(2) 

$\rho (h_1,h_2)=1$ if and only if $h_1=h_2$;

(3) 

$\rho (h_1,h_2)=\rho (h_2,h_1)$.

Remark 1.

If $d(h_1,h_2)$ is the distance between $h_1$ and $h_2$, then $\rho (h_1,h_2)=1-d(h_1,h_2)$ is the similarity measure between $h_1$ and $h_2$. Hence, we only focus on the distance measures, and the similarity measures can be determined easily.

Let $h_1,h_2$ be HNLEs. $h_1=\{a_i^{(1)}\}=\{(s_{{\theta }_i^{(1)}},(T(s_{{\theta }_i^{(1)}}),I(s_{{\theta }_i^{(1)}}),$ $F(s_{{\theta }_i^{(1)}})))\}$, $T(s_{{\theta }_i^{(1)}})=\{{\mu }_{i{t}_i}^{(1)}\},$ $I(s_{{\theta }_i^{(1)}})=\{{\nu }_{i{t}_i}^{(1)}\},F(s_{{\theta }_i^{(1)}})=\{{\tau }_{i{t}_i}^{(1)}\}$ and $h_2=\{a_i^{(2)}\}=\{(s_{{\theta }_i^{(2)}},$ $(T(s_{{\theta }_i^{(2)}}),$ $I(s_{{\theta }_i^{(2)}}),$ $F(s_{{\theta }_i^{(1)}})))\}$, $T(s_{{\theta }_i^{(2)}})=\{{\mu }_{i{t}_i}^{(2)}\},I(s_{{\theta }_i^{(2)}})=\{{\nu }_{i{t}_i}^{(2)}\},F(s_{{\theta }_i^{(2)}})=\{{\tau }_{i{t}_i}^{(2)}\}$. $a_{\sigma (i)}^{(k)}\ge a_{\sigma (j)}^{(k)}$ for $i\ge j$. l is the number of NLEs in HNLE, g is the number of linguistic variables in the linguistic term set, $l_t$ is the number of truth-memberships in an NLE, $l_i$ is the number of indeterminacy-membership in an NLE, $l_f$ is the number of falsity-membership in an NLE. Based on the operation laws of HNLEs and the extension principle, we define some distance measures between HNLEs.

The hesitant neutrosophic linguistic Euclidean distance between $h_1$ and $h_2$ can be defined as follows:

$$\begin{array}{cc}\hfill d_E(h_1,h_2)=& \left(\frac{1}{4l}\sum _{i=1}^l\right({\left({\theta }_{\sigma \left(i\right)}^{\left(1\right)}-{\theta }_{\sigma \left(i\right)}^{\left(2\right)}\right)}^2/g^2+\frac{1}{l_t}\sum _{k=1}^{l_t}{\left({\mu }_{\sigma \left(ik\right)}^{\left(1\right)}-{\mu }_{\sigma \left(ik\right)}^{\left(2\right)}\right)}^2+\frac{1}{l_i}\sum _{k=1}^{l_i}({\nu }_{\sigma \left(ik\right)}^{\left(1\right)}-\hfill \\ \hfill & {\nu }_{\sigma \left(ik\right)}^{\left(2\right)}{)}^2+\frac{1}{l_t}\sum _{k=1}^{l_t}{\left({\tau }_{\sigma \left(ik\right)}^{\left(1\right)}-{\tau }_{\sigma \left(ik\right)}^{\left(2\right)}\right)}^2){)}^{1/2}.\hfill \end{array}$$

(4)

The hesitant neutrosophic linguistic Hamming distance between $h_1$ and $h_2$ can be defined as follows:

$$\begin{array}{cc}\hfill d_H(h_1,h_2)=& \frac{1}{4l}\sum _{i=1}^l(\mid {\theta }_{\sigma \left(i\right)}^{\left(1\right)}-{\theta }_{\sigma \left(i\right)}^{\left(2\right)}\mid /g+\frac{1}{l_t}\sum _{k=1}^{l_t}\mid {\mu }_{\sigma \left(ik\right)}^{\left(1\right)}-{\mu }_{\sigma \left(ik\right)}^{\left(2\right)}\mid +\frac{1}{l_i}\sum _{k=1}^{l_i}\mid {\nu }_{\sigma \left(ik\right)}^{\left(1\right)}-\hfill \\ \hfill & {\nu }_{\sigma \left(ik\right)}^{\left(2\right)}\mid +\frac{1}{l_t}\sum _{k=1}^{l_t}\mid {\tau }_{\sigma \left(ik\right)}^{\left(1\right)}-{\tau }_{\sigma \left(ik\right)}^{\left(2\right)}\mid ).\hfill \end{array}$$

(5)

The hesitant neutrosophic linguistic Hamming–Hausdorff distance can be defined as follows:

$$\begin{array}{cc}\hfill d_{HH}(h_1,h_2)=& \frac{1}{4}\underset{i,k}{max}\{\mid {\theta }_{\sigma \left(i\right)}^{\left(1\right)}-{\theta }_{\sigma \left(i\right)}^{\left(2\right)}\mid /g+\mid {\mu }_{\sigma \left(ik\right)}^{\left(1\right)}-{\mu }_{\sigma \left(ik\right)}^{\left(2\right)}\mid +\mid {\nu }_{\sigma \left(ik\right)}^{\left(1\right)}-{\nu }_{\sigma \left(ik\right)}^{\left(2\right)}\mid +\hfill \\ \hfill & \mid {\tau }_{\sigma \left(ik\right)}^{\left(1\right)}-{\tau }_{\sigma \left(ik\right)}^{\left(2\right)}\mid \}.\hfill \end{array}$$

(6)

The hesitant neutrosophic linguistic Euclidean–Hausdorff distance can be defined as

$$\begin{array}{cc}\hfill d_{EH}(h_1,h_2)=& \left(\frac{1}{4}\underset{i,k}{max}\right\{{({\theta }_{\sigma \left(i\right)}^{\left(1\right)}-{\theta }_{\sigma \left(i\right)}^{\left(2\right)})}^2/g^2+\mid {\mu }_{\sigma \left(ik\right)}^{\left(1\right)}-{\mu }_{\sigma \left(ik\right)}^{\left(2\right)}{\mid }^2+\mid {\nu }_{\sigma \left(ik\right)}^{\left(1\right)}-{\nu }_{\sigma \left(ik\right)}^{\left(2\right)}{\mid }^2+\hfill \\ \hfill & \mid {\tau }_{\sigma \left(ik\right)}^{\left(1\right)}-{\tau }_{\sigma \left(ik\right)}^{\left(2\right)}{\mid }^2\}{)}^{1/2}.\hfill \end{array}$$

(7)

The hybrid hesitant neutrosophic linguistic Hamming distance can be defined as

$$\begin{array}{cc}\hfill d_{HybH}(h_1,h_2)=& \frac{1}{2}\left(\frac{1}{4l}\sum _{i=1}^l\right(\mid {\theta }_{\sigma \left(i\right)}^{\left(1\right)}-{\theta }_{\sigma \left(i\right)}^{\left(2\right)}\mid /g+\frac{1}{l_t}\sum _{k=1}^{l_t}\mid {\mu }_{\sigma \left(ik\right)}^{\left(1\right)}-{\mu }_{\sigma \left(ik\right)}^{\left(2\right)}\mid +\frac{1}{l_i}\sum _{k=1}^{l_i}\mid {\nu }_{\sigma \left(ik\right)}^{\left(1\right)}-\hfill \\ \hfill & {\nu }_{\sigma \left(ik\right)}^{\left(2\right)}\mid +\frac{1}{l_t}\sum _{k=1}^{l_t}\mid {\tau }_{\sigma \left(ik\right)}^{\left(1\right)}-{\tau }_{\sigma \left(ik\right)}^{\left(2\right)}\mid )+\frac{1}{4}\underset{i,k}{max}\{\mid {\theta }_{\sigma \left(i\right)}^{\left(1\right)}-{\theta }_{\sigma \left(i\right)}^{\left(2\right)}\mid /g+\mid {\mu }_{\sigma \left(ik\right)}^{\left(1\right)}-\hfill \\ \hfill & {\mu }_{\sigma \left(ik\right)}^{\left(2\right)}\mid +\mid {\nu }_{\sigma \left(ik\right)}^{\left(1\right)}-{\nu }_{\sigma \left(ik\right)}^{\left(2\right)}\mid +\mid {\tau }_{\sigma \left(ik\right)}^{\left(1\right)}-{\tau }_{\sigma \left(ik\right)}^{\left(2\right)}\mid \left\}\right).\hfill \end{array}$$

(8)

The hybrid hesitant neutrosophic linguistic Euclidean distance can be defined as

$$\begin{array}{cc}\hfill d_{HybE}(h_1,h_2)=& \frac{1}{2}\left(\right(\frac{1}{4l}\sum _{i=1}^l({\left({\theta }_{\sigma \left(i\right)}^{\left(1\right)}-{\theta }_{\sigma \left(i\right)}^{\left(2\right)}\right)}^2/g^2+\frac{1}{l_t}\sum _{k=1}^{l_t}{\left({\mu }_{\sigma \left(ik\right)}^{\left(1\right)}-{\mu }_{\sigma \left(ik\right)}^{\left(2\right)}\right)}^2+\frac{1}{l_i}\sum _{k=1}^{l_i}({\nu }_{\sigma \left(ik\right)}^{\left(1\right)}-\hfill \\ \hfill & {\nu }_{\sigma \left(ik\right)}^{\left(2\right)}{)}^2+\frac{1}{l_t}\sum _{k=1}^{l_t}{\left({\tau }_{\sigma \left(ik\right)}^{\left(1\right)}-{\tau }_{\sigma \left(ik\right)}^{\left(2\right)}\right)}^2){)}^{1/2}+(\frac{1}{4}\underset{i,k}{max}\{{({\theta }_{\sigma \left(i\right)}^{\left(1\right)}-{\theta }_{\sigma \left(i\right)}^{\left(2\right)})}^2/g^2+\mid {\mu }_{\sigma \left(ik\right)}^{\left(1\right)}-\hfill \\ \hfill & {\mu }_{\sigma \left(ik\right)}^{\left(2\right)}{\mid }^2+\mid {\nu }_{\sigma \left(ik\right)}^{\left(1\right)}-{\nu }_{\sigma \left(ik\right)}^{\left(2\right)}{\mid }^2+\mid {\tau }_{\sigma \left(ik\right)}^{\left(1\right)}-{\tau }_{\sigma \left(ik\right)}^{\left(2\right)}{\mid }^2\left\}{)}^{1/2}\right).\hfill \end{array}$$

(9)

The generalized hesitant neutrosophic linguistic distance can be defined as

$$\begin{array}{cc}\hfill d_G(h_1,h_2)=& \left(\frac{1}{4l}\sum _{i=1}^l\right({\left({\theta }_{\sigma \left(i\right)}^{\left(1\right)}-{\theta }_{\sigma \left(i\right)}^{\left(2\right)}\right)}^{\lambda }/g^{\lambda }+\frac{1}{l_t}\sum _{k=1}^{l_t}{\left({\mu }_{\sigma \left(ik\right)}^{\left(1\right)}-{\mu }_{\sigma \left(ik\right)}^{\left(2\right)}\right)}^{\lambda }+\frac{1}{l_i}\sum _{k=1}^{l_i}({\nu }_{\sigma \left(ik\right)}^{\left(1\right)}-\hfill \\ \hfill & {\nu }_{\sigma \left(ik\right)}^{\left(2\right)}{)}^{\lambda }+\frac{1}{l_t}\sum _{k=1}^{l_t}{\left({\tau }_{\sigma \left(ik\right)}^{\left(1\right)}-{\tau }_{\sigma \left(ik\right)}^{\left(2\right)}\right)}^{\lambda }){)}^{1/\lambda }.\hfill \end{array}$$

(10)

If $\lambda =1$, the generalized hesitant neutrosophic linguistic distance becomes the hesitant neutrosophic linguistic Hamming distance. If $\lambda =2$, then the generalized hesitant neutrosophic linguistic distance becomes the hesitant neutrosophic linguistic Euclidean distance.

The generalized hesitant neutrosophic linguistic Hausdorff distance can be defined as

$$\begin{array}{cc}\hfill d_{GH}(h_1,h_2)=& \left(\frac{1}{4}\underset{i,k}{max}\right\{\mid {\theta }_{\sigma \left(i\right)}^{\left(1\right)}-{\theta }_{\sigma \left(i\right)}^{\left(2\right)}{\mid }^{\lambda }/g^{\lambda }+\mid {\mu }_{\sigma \left(ik\right)}^{\left(1\right)}-{\mu }_{\sigma \left(ik\right)}^{\left(2\right)}{\mid }^{\lambda }+\mid {\nu }_{\sigma \left(ik\right)}^{\left(1\right)}-{\nu }_{\sigma \left(ik\right)}^{\left(2\right)}{\mid }^{\lambda }+\hfill \\ \hfill & \mid {\tau }_{\sigma \left(ik\right)}^{\left(1\right)}-{\tau }_{\sigma \left(ik\right)}^{\left(2\right)}{\mid }^{\lambda }\}{)}^{1/\lambda }.\hfill \end{array}$$

(11)

If $\lambda =1$, the generalized hesitant neutrosophic linguistic Hausdorff distance becomes the hesitant neutrosophic linguistic Hamming–Hausdorff distance. If $\lambda =2$, the generalized hesitant neutrosophic linguistic Hausdorff distance becomes the hesitant neutrosophic linguistic Euclidean–Hausdorff distance.

The generalized hesitant neutrosophic linguistic hybrid distance can be defined as

$$\begin{array}{cc}\hfill d_{GHyb}(h_1,h_2)=& \left(\frac{1}{2}\right(\frac{1}{4l}\sum _{i=1}^l({\left({\theta }_{\sigma \left(i\right)}^{\left(1\right)}-{\theta }_{\sigma \left(i\right)}^{\left(2\right)}\right)}^{\lambda }/g^{\lambda }+\frac{1}{l_t}\sum _{k=1}^{l_t}{\left({\mu }_{\sigma \left(ik\right)}^{\left(1\right)}-{\mu }_{\sigma \left(ik\right)}^{\left(2\right)}\right)}^{\lambda }+\frac{1}{l_i}\sum _{k=1}^{l_i}({\nu }_{\sigma \left(ik\right)}^{\left(1\right)}\hfill \\ \hfill & -{\nu }_{\sigma \left(ik\right)}^{\left(2\right)}{)}^{\lambda }+\frac{1}{l_t}\sum _{k=1}^{l_t}{\left({\tau }_{\sigma \left(ik\right)}^{\left(1\right)}-{\tau }_{\sigma \left(ik\right)}^{\left(2\right)}\right)}^{\lambda })+\frac{1}{4}\underset{i,k}{max}\{\mid {\theta }_{\sigma \left(i\right)}^{\left(1\right)}-{\theta }_{\sigma \left(i\right)}^{\left(2\right)}{\mid }^{\lambda }/g^{\lambda }+\mid {\mu }_{\sigma \left(ik\right)}^{\left(1\right)}\hfill \\ \hfill & -{\mu }_{\sigma \left(ik\right)}^{\left(2\right)}{\mid }^{\lambda }+\mid {\nu }_{\sigma \left(ik\right)}^{\left(1\right)}-{\nu }_{\sigma \left(ik\right)}^{\left(2\right)}{\mid }^{\lambda }+\mid {\tau }_{\sigma \left(ik\right)}^{\left(1\right)}-{\tau }_{\sigma \left(ik\right)}^{\left(2\right)}{\mid }^{\lambda }\left\}\right){)}^{1/\lambda }.\hfill \end{array}$$

(12)

Definition 11.

[41]. A fuzzy measure μon the set X is a set function $\mu :P\left(X\right)\to [0,1]$, satisfying the following axioms:

(1) 

$\mu (\varnothing )=0,\mu \left(X\right)=1$;

(2) 

$B\subseteq C$ implies $\mu \left(B\right)\le \mu \left(C\right)$, for all $B,C\subseteq X$;

(3) 

$\mu (B\cup C)=\mu \left(B\right)+\mu \left(C\right)+\rho \mu \left(B\right)\mu \left(C\right)$ for all $B,C\subseteq X$ and $B\cap C=\varnothing$, where $\rho \in (-1,+\infty ).$

Here, ∅ is an empty set.

Let $X=\{x_1,x_2,\dots ,x_n\}$ be a finite set. Sugeno [42] provided the following equation to determine the fuzzy measure on X, avoiding the computational complexity.

$$m\left(X\right)=\left\{\begin{array}{cc}\frac{1}{\rho }({\mathrm{\Pi }}_{i=1}^n(1+\rho m\left(x_i\right))-1),\hfill & \rho \ne 0,\hfill \\ \sum _{i=1}^{n}m\left(x_i\right),\hfill & \rho =0.\hfill \end{array}\right.$$

(13)

The value $\rho$ can be uniquely determined from $m\left(X\right)=1$ by the following equation:

$$\rho ={\mathrm{\Pi }}_{i=1}^n(1+\rho m\left(x_i\right))-1.$$

(14)

Let $X=\{x_1,x_2,\dots ,x_n\}$ be a reference set, let m be the fuzzy measure [41] on X, and let $H_1=\{h_1^{\left(1\right)},h_2^{\left(1\right)},\dots ,h_n^{\left(1\right)}\}$ and $H_2=\{h_1^{\left(2\right)},h_2^{\left(2\right)},$ $\dots ,h_n^{\left(2\right)}\}$ be two collections of the HNLEs on X, where $h_j^{\left(k\right)}=\left\{a_j^{l\left(k\right)}\right\}$ $(j=1,2,\dots ,n,k=1,2)$. We then develop some weighted distances between HNLEs based on the Choquet integral.

The generalized hesitant neutrosophic linguistic correlation averaging distance between $H_1$ and $H_2$ can be defined as follows:

$$\begin{array}{cc}\hfill d_{GC}(H_1,H_2)=& \left(\sum _{j=1}^n\frac{(m\left(A_{\sigma \left(j\right)}\right)-m\left(A_{\sigma (j-1)}\right))}{4l}\sum _{i=1}^l\right({\left({\theta }_{\sigma \left(ji\right)}^{\left(1\right)}-{\theta }_{\sigma \left(ji\right)}^{\left(2\right)}\right)}^{\lambda }/g^{\lambda }+\frac{1}{l_t}\sum _{k=1}^{l_t}({\mu }_{\sigma \left(jik\right)}^{\left(1\right)}-\hfill \\ \hfill & {\mu }_{\sigma \left(jik\right)}^{\left(2\right)}{)}^{\lambda }+\frac{1}{l_u}\sum _{k=1}^{l_u}{\left({\nu }_{\sigma \left(jik\right)}^{\left(1\right)}-{\nu }_{\sigma \left(jik\right)}^{\left(2\right)}\right)}^{\lambda }+\frac{1}{l_v}\sum _{k=1}^{l_v}{\left({\tau }_{\sigma \left(jik\right)}^{\left(1\right)}-{\tau }_{\sigma \left(jik\right)}^{\left(2\right)}\right)}^{\lambda }){)}^{1/\lambda }.\hfill \end{array}$$

(15)

If $\lambda =1$, the generalized hesitant neutrosophic linguistic correlation averaging distance becomes the hesitant neutrosophic linguistic correlation averaging Hamming distance as follows:

$$\begin{array}{cc}\hfill d_{CH}(H_1,H_2)=& \sum _{j=1}^n\frac{(m\left(A_{\sigma \left(j\right)}\right)-m\left(A_{\sigma (j-1)}\right))}{4l}\sum _{i=1}^l\left(\right|{\theta }_{\sigma \left(ji\right)}^{\left(1\right)}-{\theta }_{\sigma \left(ji\right)}^{\left(2\right)}|/g+\frac{1}{l_t}\sum _{k=1}^{l_t}|{\mu }_{\sigma \left(jik\right)}^{\left(1\right)}-\hfill \\ \hfill & {\mu }_{\sigma \left(jik\right)}^{\left(2\right)}|+\frac{1}{l_u}\sum _{k=1}^{l_u}|{\nu }_{\sigma \left(jik\right)}^{\left(1\right)}-{\nu }_{\sigma \left(jik\right)}^{\left(2\right)}|+\frac{1}{l_v}\sum _{k=1}^{l_v}|{\tau }_{\sigma \left(jik\right)}^{\left(1\right)}-{\tau }_{\sigma \left(jik\right)}^{\left(2\right)}\left|\right).\hfill \end{array}$$

(16)

If $\lambda =2$, the generalized hesitant neutrosophic linguistic correlation averaging distance becomes the hesitant neutrosophic linguistic correlation averaging Euclidean distance as follows:

$$\begin{array}{cc}\hfill d_{CE}(H_1,H_2)=& \left(\sum _{j=1}^n\frac{(m\left(A_{\sigma \left(j\right)}\right)-m\left(A_{\sigma (j-1)}\right))}{4l}\sum _{i=1}^l\right({\left({\theta }_{\sigma \left(ji\right)}^{\left(1\right)}-{\theta }_{\sigma \left(ji\right)}^{\left(2\right)}\right)}^2/g^2+\frac{1}{l_t}\sum _{k=1}^{l_t}({\mu }_{\sigma \left(jik\right)}^{\left(1\right)}-\hfill \\ \hfill & {\mu }_{\sigma \left(jik\right)}^{\left(2\right)}{)}^2+\frac{1}{l_u}\sum _{k=1}^{l_u}{\left({\nu }_{\sigma \left(jik\right)}^{\left(1\right)}-{\nu }_{\sigma \left(jik\right)}^{\left(2\right)}\right)}^2+\frac{1}{l_v}\sum _{k=1}^{l_v}{\left({\tau }_{\sigma \left(jik\right)}^{\left(1\right)}-{\tau }_{\sigma \left(jik\right)}^{\left(2\right)}\right)}^2){)}^{1/2}.\hfill \end{array}$$

(17)

The generalized hesitant neutrosophic linguistic correlation averaging Housdorff distance is defined as follows:

$$\begin{array}{cc}\hfill d_{GCH}(H_1,H_2)=& \left(\sum _{j=1}^n\frac{(m\left(A_{\sigma \left(j\right)}\right)-m\left(A_{\sigma (j-1)}\right))}{4}\underset{i,k}{max}\right\{\mid {\theta }_{\sigma \left(ji\right)}^{\left(1\right)}-{\theta }_{\sigma \left(ji\right)}^{\left(2\right)}{\mid }^{\lambda }/g^{\lambda }+\mid {\mu }_{\sigma \left(jik\right)}^{\left(1\right)}-{\mu }_{\sigma \left(jik\right)}^{\left(2\right)}{\mid }^{\lambda }\hfill \\ \hfill & +\mid {\nu }_{\sigma \left(jik\right)}^{\left(1\right)}-{\nu }_{\sigma \left(jik\right)}^{\left(2\right)}{\mid }^{\lambda }+\mid {\tau }_{\sigma \left(jik\right)}^{\left(1\right)}-{\tau }_{\sigma \left(jik\right)}^{\left(2\right)}{\mid }^{\lambda }\}{)}^{1/\lambda }.\hfill \end{array}$$

(18)

If $\lambda =1$, the generalized hesitant neutrosophic linguistic correlation averaging Housdorff distance becomes the hesitant neutrosophic linguistic correlation averaging Hamming–Housdorff distance

$$\begin{array}{cc}\hfill d_{CHH}(H_1,H_2)=& \left(\sum _{j=1}^n\frac{(m\left(A_{\sigma \left(j\right)}\right)-m\left(A_{\sigma (j-1)}\right))}{4}\underset{i,k}{max}\right\{\mid {\theta }_{\sigma \left(ji\right)}^{\left(1\right)}-{\theta }_{\sigma \left(ji\right)}^{\left(2\right)}\mid /g+\mid {\mu }_{\sigma \left(jik\right)}^{\left(1\right)}-{\mu }_{\sigma \left(jik\right)}^{\left(2\right)}\mid \hfill \\ \hfill & +\mid {\nu }_{\sigma \left(jik\right)}^{\left(1\right)}-{\nu }_{\sigma \left(jik\right)}^{\left(2\right)}\mid +\mid {\tau }_{\sigma \left(jik\right)}^{\left(1\right)}-{\tau }_{\sigma \left(jik\right)}^{\left(2\right)}\mid \left\}\right).\hfill \end{array}$$

(19)

If $\lambda =2$, the generalized hesitant neutrosophic linguistic correlation averaging Housdorff distance becomes the hesitant neutrosophic linguistic correlation averaging Euclidean–Housdorff distance:

$$\begin{array}{cc}\hfill d_{CEH}(H_1,H_2)=& \left(\sum _{j=1}^n\frac{(m\left(A_{\sigma \left(j\right)}\right)-m\left(A_{\sigma (j-1)}\right))}{4}\underset{i,k}{max}\right\{\mid {\theta }_{\sigma \left(ji\right)}^{\left(1\right)}-{\theta }_{\sigma \left(ji\right)}^{\left(2\right)}{\mid }^2/g^2+\mid {\mu }_{\sigma \left(jik\right)}^{\left(1\right)}-{\mu }_{\sigma \left(jik\right)}^{\left(2\right)}{\mid }^2\hfill \\ \hfill & +\mid {\nu }_{\sigma \left(jik\right)}^{\left(1\right)}-{\nu }_{\sigma \left(jik\right)}^{\left(2\right)}{\mid }^2+\mid {\tau }_{\sigma \left(jik\right)}^{\left(1\right)}-{\tau }_{\sigma \left(jik\right)}^{\left(2\right)}{\mid }^2\}{)}^{1/2}.\hfill \end{array}$$

(20)

The generalized hesitant neutrosophic linguistic hybrid correlation averaging distance between $H_1$ and $H_2$ can be defined as follows:

$$\begin{array}{cc}\hfill d_{GHC}(H_1,H_2)=& \left(\frac{1}{2}\right(\sum _{j=1}^n\frac{1}{4}(m\left(A_{\sigma \left(j\right)}\right)-m\left(A_{\sigma (j-1)}\right))\left(\frac{1}{l}\sum _{i=1}^l\right({\left({\theta }_{\sigma \left(ji\right)}^{\left(1\right)}-{\theta }_{\sigma \left(ji\right)}^{\left(2\right)}\right)}^{\lambda }/g^{\lambda }+\hfill \\ \hfill & \frac{1}{l_t}\sum _{k=1}^{l_t}{\left({\mu }_{\sigma \left(jik\right)}^{\left(1\right)}-{\mu }_{\sigma \left(jik\right)}^{\left(2\right)}\right)}^{\lambda }+\frac{1}{l_u}\sum _{k=1}^{l_u}{\left({\nu }_{\sigma \left(jik\right)}^{\left(1\right)}-{\nu }_{\sigma \left(jik\right)}^{\left(2\right)}\right)}^{\lambda }+\frac{1}{l_v}\sum _{k=1}^{l_v}({\tau }_{\sigma \left(jik\right)}^{\left(1\right)}-\hfill \\ \hfill & {\tau }_{\sigma \left(jik\right)}^{\left(2\right)}{)}^{\lambda })+\underset{i,k}{max}\{\mid {\theta }_{\sigma \left(ji\right)}^{\left(1\right)}-{\theta }_{\sigma \left(ji\right)}^{\left(2\right)}{\mid }^{\lambda }/g^{\lambda }+\mid {\mu }_{\sigma \left(jik\right)}^{\left(1\right)}-{\mu }_{\sigma \left(jik\right)}^{\left(2\right)}{\mid }^{\lambda }\hfill \\ \hfill & +\mid {\nu }_{\sigma \left(jik\right)}^{\left(1\right)}-{\nu }_{\sigma \left(jik\right)}^{\left(2\right)}{\mid }^{\lambda }+\mid {\tau }_{\sigma \left(jik\right)}^{\left(1\right)}-{\tau }_{\sigma \left(jik\right)}^{\left(2\right)}{\mid }^{\lambda }\left\}\right){)}^{1/\lambda }.\hfill \end{array}$$

(21)

If $\lambda =1$, the generalized hesitant neutrosophic linguistic hybrid correlation averaging distance becomes the hesitant neutrosophic linguistic hybrid correlation Hamming distance:

$$\begin{array}{cc}\hfill d_{CHyb}(H_1,H_2)=& \frac{1}{2}\left(\sum _{j=1}^n\frac{1}{4}(m\left(A_{\sigma \left(j\right)}\right)-m\left(A_{\sigma (j-1)}\right))\right(\frac{1}{l}\sum _{i=1}^l(\left({\theta }_{\sigma \left(ji\right)}^{\left(1\right)}-{\theta }_{\sigma \left(ji\right)}^{\left(2\right)}\right)/g+\hfill \\ \hfill & \frac{1}{l_t}\sum _{k=1}^{l_t}\left({\mu }_{\sigma \left(jik\right)}^{\left(1\right)}-{\mu }_{\sigma \left(jik\right)}^{\left(2\right)}\right)+\frac{1}{l_u}\sum _{k=1}^{l_u}\left({\nu }_{\sigma \left(jik\right)}^{\left(1\right)}-{\nu }_{\sigma \left(jik\right)}^{\left(2\right)}\right)+\frac{1}{l_v}\sum _{k=1}^{l_v}({\tau }_{\sigma \left(jik\right)}^{\left(1\right)}-\hfill \\ \hfill & {\tau }_{\sigma \left(jik\right)}^{\left(2\right)}\left)\right)+\underset{i,k}{max}\{\mid {\theta }_{\sigma \left(ji\right)}^{\left(1\right)}-{\theta }_{\sigma \left(ji\right)}^{\left(2\right)}\mid /g+\mid {\mu }_{\sigma \left(jik\right)}^{\left(1\right)}-{\mu }_{\sigma \left(jik\right)}^{\left(2\right)}\mid \hfill \\ \hfill & +\mid {\nu }_{\sigma \left(jik\right)}^{\left(1\right)}-{\nu }_{\sigma \left(jik\right)}^{\left(2\right)}\mid +\mid {\tau }_{\sigma \left(jik\right)}^{\left(1\right)}-{\tau }_{\sigma \left(jik\right)}^{\left(2\right)}\mid \left\}\right).\hfill \end{array}$$

(22)

If $\lambda =2$, the generalized hesitant neutrosophic linguistic hybrid correlation averaging distance becomes the hesitant neutrosophic linguistic hybrid correlation Euclidean distance:

$$\begin{array}{cc}\hfill d_{CHE}(H_1,H_2)=& \left(\frac{1}{2}\right(\sum _{j=1}^n\frac{1}{4}(m\left(A_{\sigma \left(j\right)}\right)-m\left(A_{\sigma (j-1)}\right))\left(\frac{1}{l}\sum _{i=1}^l\right({\left({\theta }_{\sigma \left(ji\right)}^{\left(1\right)}-{\theta }_{\sigma \left(ji\right)}^{\left(2\right)}\right)}^2/g^2+\hfill \\ \hfill & \frac{1}{l_t}\sum _{k=1}^{l_t}{\left({\mu }_{\sigma \left(jik\right)}^{\left(1\right)}-{\mu }_{\sigma \left(jik\right)}^{\left(2\right)}\right)}^2+\frac{1}{l_u}\sum _{k=1}^{l_u}{\left({\nu }_{\sigma \left(jik\right)}^{\left(1\right)}-{\nu }_{\sigma \left(jik\right)}^{\left(2\right)}\right)}^2+\frac{1}{l_v}\sum _{k=1}^{l_v}({\tau }_{\sigma \left(jik\right)}^{\left(1\right)}-\hfill \\ \hfill & {\tau }_{\sigma \left(jik\right)}^{\left(2\right)}{)}^2)+\underset{i,k}{max}\{\mid {\theta }_{\sigma \left(ji\right)}^{\left(1\right)}-{\theta }_{\sigma \left(ji\right)}^{\left(2\right)}{\mid }^2/g^2+\mid {\mu }_{\sigma \left(jik\right)}^{\left(1\right)}-{\mu }_{\sigma \left(jik\right)}^{\left(2\right)}{\mid }^2\hfill \\ \hfill & +\mid {\nu }_{\sigma \left(jik\right)}^{\left(1\right)}-{\nu }_{\sigma \left(jik\right)}^{\left(2\right)}{\mid }^2+\mid {\tau }_{\sigma \left(jik\right)}^{\left(1\right)}-{\tau }_{\sigma \left(jik\right)}^{\left(2\right)}{\mid }^2\left\}\right){)}^{1/2}.\hfill \end{array}$$

(23)

4. Some Hesitant Neutrosophic Fuzzy Linguistic Aggregation Operators Based on the Choquet Integral

In this section, we present some hesitant neutrosophic fuzzy linguistic aggregation operators considering correlation by using the Choquet integral.

Definition 12.

Let $X=\{x_1,x_2,\dots ,x_n\}$ be a reference set, and let m be the fuzzy measure [41] on X. Let $h_j=\{a_j^k\}$ $(j=1,2,\dots ,n)$ be a collection of the HNLEs, then the hesitant neutrosophic fuzzy linguistic correlation averaging (HNLCA) operator can be defined as follows:

$$HNLCA(h_1,h_2,\dots ,h_n)=\sum _{j=1}^n(m\left(A_{\sigma \left(j\right)}\right)-m\left(A_{\sigma (j-1)}\right))h_{\sigma \left(j\right)}$$

(24)

where $\left(\sigma \right(1),\sigma (2),\dots ,\sigma (n\left)\right)$ is a permutation of $(1,2,\dots ,n)$ such that $h_{\sigma \left(1\right)}\ge h_{\sigma \left(2\right)}\ge \dots \ge h_{\sigma \left(n\right)}$. $A_{\sigma \left(i\right)}=\{x_{\sigma \left(1\right)},x_{\sigma \left(2\right)},\dots ,x_{\sigma \left(i\right)}\}$, $A_{\sigma \left(0\right)}=\varnothing$, and ∅ is an empty set.

The aggregated value of the HNLCA operator is also an HNLE.

$$\begin{array}{cc}\hfill & HNLCA(h_1,h_2,\dots ,h_n)=\sum _{j=1}^n(m\left(A_{\sigma \left(j\right)}\right)-m\left(A_{\sigma (j-1)}\right))h_{\sigma \left(j\right)}\hfill \\ \hfill =& \bigcup _{a_j^k\in h_j}\left\{\right(s_{{\sum }_{j=1}^n(m\left(A_{\sigma \left(j\right)}\right)-m\left(A_{\sigma (j-1)}\right)){\theta }_{\sigma \left(j\right)}^k},\bigcup \left\{\right(1-\prod _{j=1}^n{(1-{\mu }_{\sigma \left(j\right)}^k)}^{m\left(A_{\sigma \left(j\right)}\right)-m\left(A_{\sigma (j-1)}\right)},\hfill \\ \hfill & \prod _{j=1}^n{\left({\nu }_{\sigma \left(j\right)}^k\right)}^{m\left(A_{\sigma \left(j\right)}\right)-m\left(A_{\sigma (j-1)}\right)},\prod _{j=1}^n{\left({\tau }_{\sigma \left(j\right)}^k\right)}^{m\left(A_{\sigma \left(j\right)}\right)-m\left(A_{\sigma (j-1)}\right)}\left)\right\}\left)\right\}.\hfill \end{array}$$

Definition 13.

Let $X=\{x_1,x_2,\dots ,x_n\}$ be a reference set, and let m be the fuzzy measure on X. Let $h_j=\{a_j^k\}$ $(j=1,2,\dots ,n)$ be a collection of the HNLEs. Thus, the hesitant neutrosophic fuzzy linguistic correlation geometric averaging (HNLCGA) operator can be defined as follows:

$$HNLCGA(h_1,h_2,\dots ,h_n)=\prod _{j=1}^n{\left(h_{\sigma \left(j\right)}\right)}^{(m\left(A_{\sigma \left(j\right)}\right)-m\left(A_{\sigma (j-1)}\right))},$$

(25)

where $\left(\sigma \right(1),\sigma (2),\dots ,\sigma (n\left)\right)$ is a permutation of $(1,2,\dots ,n)$ such that $h_{\sigma \left(1\right)}\ge h_{\sigma \left(2\right)}\ge \dots \ge h_{\sigma \left(n\right)}$. $A_{\sigma \left(i\right)}=\{x_{\sigma \left(1\right)},x_{\sigma \left(2\right)},\dots ,x_{\sigma \left(i\right)}\}$, $A_{\sigma \left(0\right)}=\varnothing$, and ∅ is an empty set.

The aggregated value of the HNLCGA operator is also an HNLE.

$$\begin{array}{cc}\hfill & HNLCGA(h_1,h_2,\dots ,h_n)=\prod _{j=1}^n{\left(h_{\sigma \left(j\right)}\right)}^{(m\left(A_{\sigma \left(j\right)}\right)-m\left(A_{\sigma (j-1)}\right))}\hfill \\ \hfill =& \bigcup _{a_j^k\in h_j}\left\{\right(s_{{\prod }_{j=1}^n{\left({\theta }_{\sigma \left(j\right)}^k\right)}^{(m\left(A_{\sigma \left(j\right)}\right)-m\left(A_{\sigma (j-1)}\right))}},\bigcup \left\{\right(\prod _{j=1}^n{\left({\mu }_{\sigma \left(j\right)}^k\right)}^{m\left(A_{\sigma \left(j\right)}\right)-m\left(A_{\sigma (j-1)}\right)},\hfill \\ \hfill & 1-\prod _{j=1}^n{(1-{\nu }_{\sigma \left(j\right)}^k)}^{m\left(A_{\sigma \left(j\right)}\right)-m\left(A_{\sigma (j-1)}\right)},1-\prod _{j=1}^n{(1-{\tau }_{\sigma \left(j\right)}^k)}^{m\left(A_{\sigma \left(j\right)}\right)-m\left(A_{\sigma (j-1)}\right)}\left)\right\}\left)\right\}.\hfill \end{array}$$

We further develop the generalized hesitant neutrosophic fuzzy linguistic correlation averaging (GHNLCA) operator as follows.

Definition 14.

Let $X=\{x_1,x_2,\dots ,x_n\}$ be a reference set, and let m be the fuzzy measure on X. If $h_j=\{a_j^k\}$ $(j=1,2,\dots ,n)$ is a collection of the HNLEs, then the GHNLCA operator can be defined as follows:

$$GHNLCA(h_1,h_2,\dots ,h_n)={\left(\sum _{j=1}^n(m(A_{\sigma (j)})-m(A_{\sigma (j-1)})){(h_{\sigma (j)})}^{\lambda }\right)}^{1/\lambda },$$

(26)

where $(\sigma (1),\sigma (2),\dots ,\sigma (n))$ is a permutation of $(1,2,\dots ,n)$ such that $h_{\sigma (1)}\ge h_{\sigma (2)}\ge \dots \ge h_{\sigma (n)}$. $A_{\sigma (i)}=\{x_{\sigma (1)},x_{\sigma (2)},\dots ,x_{\sigma (i)}\}$, $A_{\sigma (0)}=\varnothing$ , ∅ is an empty set, and $\lambda >0$.

The aggregated value of the GHNLCA operator is also an HNLE.

$$\begin{array}{cc}\hfill & GHNLCA(h_1,h_2,\dots ,h_n)={\left(\sum _{j=1}^{n}m(A_{\sigma (j)})-m(A_{\sigma (j-1)}){(h_{\sigma (j)})}^{\lambda }\right)}^{1/\lambda }\hfill \\ \hfill =& \bigcup _{a_j^k\in h_j}\{(s_{{({\sum }_{j=1}^n(m(A_{\sigma (j)})-m(A_{\sigma (j-1)})){({\theta }_{\sigma (j)}^k)}^{\lambda })}^{1/\lambda }},\bigcup \{({\left(1-\prod _{j=1}^n{(1-{({\mu }_{\sigma (j)}^k)}^{\lambda })}^{m(A_{\sigma (j)})-m(A_{\sigma (j-1)})}\right)}^{1/\lambda },\hfill \\ \hfill & 1-{(1-\prod _{j=1}^n{(1-{(1-{\nu }_{\sigma (j)}^k)}^{\lambda })}^{m(A_{\sigma (j)})-m(A_{\sigma (j-1)})})}^{1/\lambda },1-(1-\prod _{j=1}^n(1-(1-\hfill \\ \hfill & {\tau }_{\sigma (j)}^k{)}^{\lambda }{{)}^{m(A_{\sigma (j)})-m(A_{\sigma (j-1)})})}^{1/\lambda })\})\}.\hfill \end{array}$$

Theorem 2.

(Commutativity). If $(h_1^{\prime },h_2^{\prime },\dots ,h_n^{\prime })$ is any permutation of $(h_1,h_2,\dots ,h_n)$, then

$$GHNLCA(h_1^{\prime },h_2^{\prime },\dots ,h_n^{\prime })=GHNLCA(h_1,h_2,\dots ,h_n).$$

Proof of Theorem 2.

$$\begin{array}{cc}\hfill & \mathrm{GHNLCA}(h_1,h_2,\dots ,h_n)={\left(\sum _{j=1}^{n}m(A_{\sigma (j)})-m(A_{\sigma (j-1)}){(h_{\sigma (j)})}^{\lambda }\right)}^{1/\lambda }\hfill \\ \hfill =& \bigcup _{a_j^k\in h_j}\{(s_{{({\sum }_{j=1}^n(m(A_{\sigma (j)})-m(A_{\sigma (j-1)})){({\theta }_{\sigma (j)}^k)}^{\lambda })}^{1/\lambda }},\bigcup \{({\left(1-\prod _{j=1}^n{(1-{({\mu }_{\sigma (j)}^k)}^{\lambda })}^{m(A_{\sigma (j)})-m(A_{\sigma (j-1)})}\right)}^{1/\lambda },\hfill \\ \hfill & 1-{(1-\prod _{j=1}^n{(1-{(1-{\nu }_{\sigma (j)}^k)}^{\lambda })}^{m(A_{\sigma (j)})-m(A_{\sigma (j-1)})})}^{1/\lambda },1-(1-\prod _{j=1}^n(1-(1-\hfill \\ \hfill & {\tau }_{\sigma (j)}^k{)}^{\lambda }{{)}^{m(A_{\sigma (j)})-m(A_{\sigma (j-1)})})}^{1/\lambda })\})\}\hfill \end{array}$$

and

$$\begin{array}{cc}\hfill & \mathrm{GHNLCA}(h_1^{\prime },h_2^{\prime },\dots ,h_n^{\prime })={\left(\sum _{j=1}^{n}m({A^{\prime }}_{\sigma (j)})-m({A^{\prime }}_{\sigma (j-1)}){({h^{\prime }}_{\sigma (j)})}^{\lambda }\right)}^{1/\lambda }\hfill \\ \hfill =& \bigcup _{a_j^k\in h_j}\{(s_{{({\sum }_{j=1}^n(m({A^{\prime }}_{\sigma (j)})-m({A^{\prime }}_{\sigma (j-1)})){({{\theta }^{\prime }}_{\sigma (j)}^k)}^{\lambda })}^{1/\lambda }},\bigcup \{({\left(1-\prod _{j=1}^n{(1-{({{\mu }^{\prime }}_{\sigma (j)}^k)}^{\lambda })}^{m({A^{\prime }}_{\sigma (j)})-m({A^{\prime }}_{\sigma (j-1)})}\right)}^{1/\lambda },\hfill \\ \hfill & 1-{(1-\prod _{j=1}^n{(1-{(1-{{\nu }^{\prime }}_{\sigma (j)}^k)}^{\lambda })}^{m({A^{\prime }}_{\sigma (j)})-m({A^{\prime }}_{\sigma (j-1)})})}^{1/\lambda },1-(1-\prod _{j=1}^n(1-(1-\hfill \\ \hfill & {{\tau }^{\prime }}_{\sigma (j)}^k{)}^{\lambda }{{)}^{m({A^{\prime }}_{\sigma (j)})-m({A^{\prime }}_{\sigma (j-1)})})}^{1/\lambda })\})\}.\hfill \end{array}$$

If $(h_1^{\prime },h_2^{\prime },\dots ,h_n^{\prime })$ is any permutation of $(h_1,h_2,\dots ,h_n)$, then we have $h_{\sigma (j)}=h_{\sigma (j)}^{\prime }$ and $m(A_{\sigma (j)})=m({A^{\prime }}_{\sigma (j)})$.

$$\mathrm{GHNLCA}(h_1^{\prime },h_2^{\prime },\dots ,h_n^{\prime })=\mathrm{GHNLCA}(h_1,h_2,\dots ,h_n).$$

 ☐

Theorem 3.

(Idempotency). If $h_j=h,j=1,2,\dots ,n$, $h_j=\{a_j^k\}$, $a_j^k=(s_{{\theta }_j^{(k)}},(T(s_{{\theta }_j^{(k)}}),I(s_{{\theta }_j^{(k)}}),$ $F(s_{{\theta }_j^{(k)}})))$, $T(s_{{\theta }_j^{(k)}})=\{{\mu }_j^{(k)}\}$, $I(s_{{\theta }_j^{(k)}})=\{{\nu }_j^{(k)}\}$, $F(s_{{\theta }_j^{(k)}})=\{{\tau }_j^{(k)}\}$, then

$$GHNLCA(h_1,h_2,\dots ,h_n)=h.$$

Proof of Theorem 3.

$$\begin{array}{cc}\hfill & \mathrm{GHNLCA}(h_1,h_2,\dots ,h_n)={\left(\sum _{j=1}^{n}m(A_{\sigma (j)})-m(A_{\sigma (j-1)}){(h_{\sigma (j)})}^{\lambda }\right)}^{1/\lambda }\hfill \\ \hfill =& \bigcup _{a_j^k\in h_j}\{(s_{{({\sum }_{j=1}^n(m(A_{\sigma (j)})-m(A_{\sigma (j-1)})){({\theta }_{\sigma (j)}^k)}^{\lambda })}^{1/\lambda }},\bigcup \{({\left(1-\prod _{j=1}^n{(1-{({\mu }_{\sigma (j)}^k)}^{\lambda })}^{m(A_{\sigma (j)})-m(A_{\sigma (j-1)})}\right)}^{1/\lambda },\hfill \\ \hfill & 1-{(1-\prod _{j=1}^n{(1-{(1-{\nu }_{\sigma (j)}^k)}^{\lambda })}^{m(A_{\sigma (j)})-m(A_{\sigma (j-1)})})}^{1/\lambda },1-(1-\prod _{j=1}^n(1-(1-\hfill \\ \hfill & {\tau }_{\sigma (j)}^k{)}^{\lambda }{{)}^{m(A_{\sigma (j)})-m(A_{\sigma (j-1)})})}^{1/\lambda })\})\}.\hfill \end{array}$$

If $h_j=h,j=1,2,\dots ,n$, then $a_j^k=a^k=\left(s_{{\theta }^k},(T(s_{{\theta }^k}),I(s_{{\theta }^k}),F(s_{{\theta }^k}))\right)$, $T(s_{{\theta }^k})=\{{\mu }^{(k)}\}$, $I(s_{{\theta }^k})=\{{\nu }^{(k)}\}$, $F(s_{{\theta }^k})=\{{\tau }^{(k)}\}$. Thus,

$$\begin{array}{c}{s}_{{({\sum }_{j=1}^n(m(A_{\sigma (j)})-m(A_{\sigma (j-1)})){({\theta }^k)}^{\lambda })}^{1/\lambda }}=s_{{({({\theta }^k)}^{\lambda }{\sum }_{j=1}^n(m(A_{\sigma (j)})-m(A_{\sigma (j-1)})))}^{1/\lambda }}=s_{{({({\theta }^k)}^{\lambda })}^{1/\lambda }}=s_{{\theta }^k}\hfill \end{array}$$

$$\begin{array}{cc}\hfill & {\left(1-\prod _{j=1}^n{(1-{({\mu }_{\sigma (j)}^k)}^{\lambda })}^{m(A_{\sigma (j)})-m(A_{\sigma (j-1)})}\right)}^{1/\lambda }={\left(1-\prod _{j=1}^n{(1-{({\mu }^{(k)})}^{\lambda })}^{m(A_{\sigma (j)})-m(A_{\sigma (j-1)})}\right)}^{1/\lambda }\hfill \\ \hfill =& {\left(1-{(1-{({\mu }^{(k)})}^{\lambda })}^{{\sum }_{j=1}^n(m(A_{\sigma (j)})-m(A_{\sigma (j-1)}))}\right)}^{1/\lambda }={\left(1-{(1-{({\mu }^{(k)})}^{\lambda })}^{{\sum }_{j=1}^n(m(A_{\sigma (j)})-m(A_{\sigma (j-1)}))}\right)}^{1/\lambda }\hfill \\ \hfill =& {\left(1-(1-{({\mu }^{(k)})}^{\lambda })\right)}^{1/\lambda }={\mu }^{(k)}.\hfill \end{array}$$

$$\begin{array}{cc}\hfill & 1-{(1-\prod _{j=1}^n{(1-{(1-{\nu }_{\sigma (j)}^{(k)})}^{\lambda })}^{m(A_{\sigma (j)})-m(A_{\sigma (j-1)})})}^{1/\lambda }\hfill \\ \hfill =& 1-{(1-\prod _{j=1}^n{(1-{(1-{\nu }^{(k)})}^{\lambda })}^{m(A_{\sigma (j)})-m(A_{\sigma (j-1)})})}^{1/\lambda }\hfill \\ \hfill =& 1-{(1-{(1-{(1-{\nu }^{(k)})}^{\lambda })}^{{\sum }_{j=1}^n(m(A_{\sigma (j)})-m(A_{\sigma (j-1)}))})}^{1/\lambda }\hfill \\ \hfill =& 1-{(1-(1-{(1-{\nu }^{(k)})}^{\lambda }))}^{1/\lambda }=1-{({(1-{\nu }^{(k)})}^{\lambda })}^{1/\lambda }={\nu }^{(k)}.\hfill \end{array}$$

$$\begin{array}{cc}\hfill & 1-{(1-\prod _{j=1}^n{(1-{(1-{\tau }_{\sigma (j)}^{(k)})}^{\lambda })}^{m(A_{\sigma (j)})-m(A_{\sigma (j-1)})})}^{1/\lambda }\hfill \\ \hfill =& 1-{(1-\prod _{j=1}^n{(1-{(1-{\tau }^{(k)})}^{\lambda })}^{m(A_{\sigma (j)})-m(A_{\sigma (j-1)})})}^{1/\lambda }\hfill \\ \hfill =& 1-{(1-{(1-{(1-{\tau }^{(k)})}^{\lambda })}^{{\sum }_{j=1}^n(m(A_{\sigma (j)})-m(A_{\sigma (j-1)}))})}^{1/\lambda }\hfill \\ \hfill =& 1-{(1-(1-{(1-{\tau }^{(k)})}^{\lambda }))}^{1/\lambda }=1-{({(1-{\tau }^{(k)})}^{\lambda })}^{1/\lambda }={\tau }^{(k)}.\hfill \end{array}$$

Hence, $\mathrm{GHNLCA}(h_1,h_2,\dots ,h_n)=h$.  ☐

Definition 15.

Let $X=\{x_1,x_2,\dots ,x_n\}$ be a reference set, and let m be the fuzzy measure on X. If $h_j=\{a_j^k\}$ $(j=1,2,\dots ,n)$ is a collection of the HNLEs, then the QHNLCA operator can be defined as follows:

$$QHNLCA(h_1,h_2,\dots ,h_n)=g^{-1}\left(\sum _{j=1}^n(m(A_{\sigma (j)})-m(A_{\sigma (j-1)}))g(h_{\sigma (j)})\right)$$

(27)

where $(\sigma (1),\sigma (2),\dots ,\sigma (n))$ is a permutation of $(1,2,\dots ,n)$ such that $h_{\sigma (1)}\ge h_{\sigma (2)}\ge \dots \ge h_{\sigma (n)}$. $A_{\sigma (i)}=\{x_{\sigma (1)},x_{\sigma (2)},\dots ,x_{\sigma (i)}\}$, $A_{\sigma (0)}=\varnothing$ , ∅ is an empty set, and $g(x)$ is a strictly monotonic continuous function.

5. The Hesitant Neutrosophic Fuzzy Linguistic Decision-Making Method Based on TOPSIS

For a multiple attribute decision-making problem with p different periods $t_k(k=1,2,\dots ,p)$. Let $\{A_1,A_2,\dots ,A_m\}$ be the set of alternatives, and let $\{C_1,C_2,\dots ,C_n\}$ be the set of attributes. $h_{ij}^k=\{(s_{{\theta }_{ij}^k},$ $(T(s_{{\theta }_{ij}^k}),$ $I(s_{{\theta }_{ij}^k}),$ $F(s_{{\theta }_{ij}^k})))\}$ is the hesitant neutrosophic linguistic evaluation value given by DMs in evaluating alternative $A_i$ with respect to the attribute $C_j$ in period k, where $s_{{\theta }_{ij}^k}\in S$, ${\mu }_{ij}^{kt}\in T(s_{{\theta }_{ij}^k})$, ${\nu }_{ij}^{kl}\in I(s_{{\theta }_{ij}^k})$, ${\tau }_{ij}^{km}\in F(s_{{\theta }_{ij}^k})$, and $0\le sup{\mu }_{ij}^{kt}+sup{\nu }_{ij}^{kl}+sup{\tau }_{ij}^{km}\le 3$. The decision matrix is formed as $D^k={(h_{ij}^k)}_{m\times n}(k=1,2,\dots ,p)$.

Algorithm

Step 1. The DMs evaluate alternatives $A_i(i=1,2,\dots ,m)$ with respect to attributes $C_j(j=1,2,\dots ,n)$ in period $k(k=1,2,\dots ,p)$ with hesitant neutrosophic fuzzy linguistic elements and decision matrices are formed $H^k={(h_{ij}^k)}_{m\times n}$.

$$H^k=\left(\begin{array}{cccc}{h}_{11}^k\hfill & h_{12}^k& \dots & \hfill h_{1n}^k\\ h_{21}^k\hfill & h_{22}^k& \dots & \hfill h_{2n}^k\\ ⋮\hfill & ⋮& \ddots & \hfill ⋮\\ h_{m1}^k\hfill & h_{m2}^k& \dots & \hfill h_{mn}^k\end{array}\right).$$

Step 2. Confirm the fuzzy density of each period and determine $\rho$ by using the equation $\rho ={\mathrm{\Pi }}_{i=1}^n(1+\rho m(t_i))-1)$.

Step 3. Calculate the evaluation values $h_{ij}^1,h_{ij}^2,\dots ,h_{ij}^p$ in different periods into collective $h_{ij}$ by using the GHNLCA operator as follows:

$$\begin{array}{cc}\hfill h_{ij}=& \mathrm{GHNLCA}(h_{ij}^1,h_{ij}^2,\dots ,h_{ij}^p)\hfill \\ \hfill =& \bigcup _{a_{ij}^k\in h_{ij}^k}\{(s_{{({\sum }_{k=1}^p(m(A_{\sigma (k)})-m(A_{\sigma (k-1)})){({\theta }_{ij}^{(k)})}^{\lambda })}^{1/\lambda }},\bigcup \{({\left(1-\prod _{k=1}^p{(1-{({\mu }_{ij}^{kt})}^{\lambda })}^{m(A_{\sigma (k)})-m(A_{\sigma (k-1)})}\right)}^{1/\lambda },\hfill \\ \hfill & 1-{(1-\prod _{k=1}^p{(1-{(1-{\nu }_{ij}^{kl})}^{\lambda })}^{m(A_{\sigma (k)})-m(A_{\sigma (k-1)})})}^{1/\lambda },1-(1-\prod _{k=1}^p(1-(1-\hfill \\ \hfill & {\tau }_{ij}^{km}{)}^{\lambda }{{)}^{m(A_{\sigma (k)})-m(A_{\sigma (k-1)})})}^{1/\lambda })\})\}\hfill \end{array}$$

where $A_{\sigma (k)}=\{t_1,t_2,\dots ,t_k\}$, $A_0=\varphi$. Thus, the decision matrix is formed as $H={(h_{ij})}_{m\times n}$, $h_{ij}=\{(s_{{\theta }_{ij}},$ $(T(s_{{\theta }_{ij}}),$ $I(s_{{\theta }_{ij}}),$ $F(s_{{\theta }_{ij}})))\}$.

Step 4. Extend the collective decision matrix according to risk attitudes of DMs until all HNLEs have the same number of NLEs and until each NLE has the same number of truth-memberships, indeterminacy-memberships, and falsity-memberships. The extended decision matrix is formed as $H^{\prime }={(h_{ij}^{\prime })}_{m\times n}$.

Step 5. Determine the hesitant neutrosophic linguistic positive ideal solution (HNLPIS), denoted as $h^{+}$, and the hesitant neutrosophic linguistic negative ideal solution (HNLNIS), denoted as $h^{-}$, as follows:

$$h^{+}=(h_1^{+},h_2^{+},\dots ,h_n^{+})=(\underset{i}{max}{h}_{i1}^{\prime },\underset{i}{max}{h}_{i2}^{\prime },\dots ,\underset{i}{max}{h}_{in}^{\prime }),$$

(28)

$$h^{-}=(h_1^{-},h_2^{-},\dots ,h_n^{-})=(\underset{i}{min}{h}_{i1}^{\prime },\underset{i}{min}{h}_{i2}^{\prime },\dots ,\underset{i}{min}{h}_{in}^{\prime }),$$

(29)

where $h_j^{+}=\{(s_{{\theta }_j^{t+}},(T(s_{{\theta }_j^{t+}}),I(s_{{\theta }_j^{t+}}),F(s_{{\theta }_j^{t+}})))\}$, $T(s_{{\theta }_j^{t+}})=\{{\mu }_{ijk}^{t+}\}$, $I(s_{{\theta }_j^{t+}})=\{{\nu }_{ijk}^{t+}\}$,$F(s_{{\theta }_j^{t+}})=\{{\tau }_{ijk}^{t+}\}$, $h_j^{-}=\{(s_{{\theta }_j^{t-}},(T(s_{{\theta }_j^{t-}}),I(s_{{\theta }_j^{t-}}),F(s_{{\theta }_j^{t-}})))\}$, $T(s_{{\theta }_j^{t-}})=\{{\mu }_{ijk}^{t-}\}$, $I(s_{{\theta }_j^{t-}})=\{{\nu }_{ijk}^{t-}\}$,$F(s_{{\theta }_j^{t-}})=\{{\tau }_{ijk}^{t-}\}$.

Step 6. Confirm the fuzzy density $m(C_i)$ of each attribute. Determine $\rho$ by using Equation (14) and calculate fuzzy measures of attribute sets.

Step 7. Based on the generalized hesitant neutrosophic linguistic correlation weighted averaging distance, calculate the distances of each alternative’s collective evaluation values to the HNLPIS $h^{+}$ and HNLNIS $h^{-}$, respectively.

$$\begin{array}{cc}\hfill d_{GC}^{i+}(h_i,h^{+})=& (\sum _{j=1}^n(m(B_{\sigma (j)})-m(B_{\sigma (j-1)}))\frac{1}{4l}\sum _{i=1}^l(\frac{1}{l_{\theta }}\sum _{t=1}^{l_{\theta }}(|{\theta }_{\sigma (ji)}^t-{\theta }_{\sigma (ji)}^{t+}{|}^{\lambda }/g^{\lambda }+\hfill \\ \hfill & \frac{1}{l_t}\sum _{k=1}^{l_t}|{\mu }_{\sigma (jik)}^t-{\mu }_{\sigma (jik)}^{t+}{|}^{\lambda }+\frac{1}{l_u}\sum _{k=1}^{l_u}|{\nu }_{\sigma (jik)}^t-{\nu }_{\sigma (jik)}^{t+}{|}^{\lambda }+\frac{1}{l_v}\sum _{k=1}^{l_v}|{\tau }_{\sigma (jik)}^t-\hfill \\ \hfill & {\tau }_{\sigma (jik)}^{t+}{|}^{\lambda })){)}^{1/\lambda }\hfill \end{array}$$

(30)

$$\begin{array}{cc}\hfill d_{GC}^{i-}(h_i,h^{-})=& (\sum _{j=1}^n(m(B_{\sigma (j)})-m(B_{\sigma (j-1)}))(\frac{1}{4l}\sum _{i=1}^l\frac{1}{l_{\theta }}\sum _{t=1}^{l_{\theta }}(|{\theta }_{\sigma (ji)}^t-{\theta }_{\sigma (ji)}^{t-}{|}^{\lambda }/g^{\lambda }+\hfill \\ \hfill & \frac{1}{l_t}\sum _{k=1}^{l_t}|{\mu }_{\sigma (jik)}^t-{\mu }_{\sigma (jik)}^{t-}{|}^{\lambda }+\frac{1}{l_u}\sum _{k=1}^{l_u}|{\nu }_{\sigma (jik)}^t-{\nu }_{\sigma (jik)}^{t-}{|}^{\lambda }+\frac{1}{l_v}\sum _{k=1}^{l_v}|{\tau }_{\sigma (jik)}^t-\hfill \\ \hfill & {\tau }_{\sigma (jik)}^{t-}{|}^{\lambda })){)}^{1/\lambda }\hfill \end{array}$$

(31)

where $d_{GC}^{1+}(h_{\sigma (i1)},h_{\sigma (1)}^{+})\ge d_{GC}^{2+}(h_{\sigma (i2)},h_{\sigma (2)}^{+})$ $\ge \dots \ge d_{GC}^{n+}(h_{\sigma (in)},h_{\sigma (n)}^{+})$, $d_{GC}^{1-}(h_{\sigma (i1)},h_{\sigma (1)}^{-})\ge d_{GC}^{2-}(h_{\sigma (i2)},h_{\sigma (2)}^{-})$ $\ge \dots \ge d_{GC}^{n-}(h_{\sigma (in)},h_{\sigma (n)}^{-})$, $B_{\sigma (j)}=\{C_{\sigma (1)},C_{\sigma (2)},\dots ,C_{\sigma (j)}\}$, and $B_{\sigma (0)}=\varphi$, $C_{\sigma (j)}$ is the attribute corresponding to the jth largest $d_{GC}^{i+}(h_{ij},h_j^{+})$ in $d_{GC}^{i+}$ or the jth largest $d_{GC}^{i-}(h_{ij},h_j^{-})$ in $d_{GC}^{i-}$.

Step 8. Calculate closeness coefficients $C{C}_i(i=1,2,\dots ,m)$ for alternatives $A_i(i=1,2,\dots ,m)$ as follows:

$$C{C}_i=\frac{d_{GC}^{i-}(h_i,h^{-})}{d_{GC}^{i+}(h_i,h^{-})+d_{GC}^{i-}(h_i,h^{+})},i=1,2,\dots ,m.$$

(32)

Step 9. Rank alternatives according to the ranking of closeness coefficients and select the optimal alternative.

6. Numerical Example

6.1. Practical Example

A company wants to invest a sum of money in an industry (adapted from [43]). The experts mainly consider the following attributes: $C_1$—the price of the product; $C_2$—the quality of the product; $C_3$—the risk; $C_4$—the delivery time. After pre-evaluation, there are five alternatives left for further evaluation. Alternatives are evaluated with respect to attributes using hesitant neutrosophic linguistic information. They consider information in three periods ($t_i,i=1,2,\dots ,3$). The new method is used to rank alternatives.

Step 1. The hesitant neutrosophic linguistic matrices $D^k(k=1,2,3)$ are given by experts in evaluating alternatives with respect to attributes in different periods as in

Table 1. Decision matrix $D^1$.

Alternative	${\mathit{C}}_1$	${\mathit{C}}_2$
$A_1$	{($s_5$,({0.3,0.4},{0.2},{0.3}))}	{($s_4$, ({0.4},{0.3},{0.2}))}
$A_2$	{($s_6$,({0.6},{0.1},{0.2})),($s_7$,({0.3},{0.4},{0.3}))}	{($s_5$,({0.6},{0.1},{0.2}))}
$A_3$	{($s_4$,({0.3},{0.2},{0.3}))}	{($s_3$,({0.5},{0.2},{0.3})),($s_4$,({0.3},{0.2},{0.5}))}
$A_4$	{($s_4$,({0.7},{0.0},{0.1})),($s_5$,({0.6},{0.2},{0.2}))}	{($s_7$,({0.6},{0.1},{0.2}))}
$A_5$	{($s_3$,({0.5},{0.3,0.4},{0.2}))}	{($s_2$,({0.3},{0.3,0.4},{0.5}))}
	${\mathit{C}}_{\mathbf{3}}$	${\mathit{C}}_{\mathbf{4}}$
$A_1$	{($s_2$,({0.2,0.3},{0.3},{0.5,0.6}))}	{($s_5$,({0.5},{0.2},{0.4})),($s_7$,({0.4},{0.2},{0.3}))}
$A_2$	{($s_3$,({0.5},{0.3},{0.2}))}	{($s_6$,({0.7,0.8},{0.1},{0.1}))}
$A_3$	{($s_5$,({0.6},{0.1},{0.3}))}	{($s_2$,({0.4},{0.2},{0.3}))}
$A_4$	{($s_2$,({0.7},{0.2},{0.1,0.2}))}	{($s_3$,({0.5},{0.3},{0.2}))}
$A_5$	{($s_8$,({0.4},{0.3},{0.4}))}	{($s_4$,({0.5},{0.4},{0.3})),($s_5$,({0.3},{0.3},{0.5}))}

,

Table 2. Decision matrix $D^2$.

Alternative	${\mathit{C}}_1$	${\mathit{C}}_2$
$A_1$	{($s_6$,({0.2},{0.4},{0.3})),($s_7$,({0.5},{0.1},{0.2}))}	{($s_5$, ({0.2},{0.2,0.4},{0.5}))}
$A_2$	{($s_4$,({0.4},{0.1},{0.3}))}	{($s_6$,({0.4},{0.3},{0.5}))}
$A_3$	{($s_7$,({0.5},{0.3,0.4},{0.1}))}	{($s_4$,({0.2},{0.4},{0.3}))}
$A_4$	{($s_3$,({0.5},{0.2},{0.2}))}	{($s_6$,({0.5},{0.2,0.3},{0.2}))}
$A_5$	{($s_2$,({0.6},{0.4},{0.3}))}	{($s_4$,({0.6},{0.3},{0.4})))}
	${\mathit{C}}_{\mathbf{3}}$	${\mathit{C}}_{\mathbf{4}}$
$A_1$	{($s_3$,({0.4},{0.4},{0.3}))}	{($s_3$,({0.5},{0.2},{0.4}))}
$A_2$	{($s_4$,({0.3},{0.2},{0.4}))}	{($s_5$,({0.6},{0.1,0.2},{0.3}))}
$A_3$	{($s_3$,({0.5},{0.3},{0.2}))}	{($s_2$,({0.3},{0.2},{0.3}))}
$A_4$	{($s_4$,({0.4},{0.2},{0.1}))}	{($s_3$,({0.4},{0.1},{0.3})),($s_4$,({0.3},{0.2},{0.2}))}
$A_5$	{($s_5$,({0.7,0.8},{0.3},{0.3}))}	{($s_6$,({0.5},{0.3},{0.4}))}

and

Table 3. Decision matrix $D^3$.

Alternative	${\mathit{C}}_1$	${\mathit{C}}_2$
$A_1$	{($s_3$,({0.3},{0.4},{0.5}))}	{($s_3$, ({0.3},{0.4},{0.2}))}
$A_2$	{($s_5$,({0.5},{0.2},{0.3}))}	{($s_4$,({0.7},{0.2},{0.2}))}
$A_3$	{($s_4$,({0.4},{0.1},{0.3})),($s_5$,({0.6},{0.2},{0.1}))}	{($s_5$,({0.6},{0.1},{0.3}))}
$A_4$	{($s_6$,({0.6},{0.1},{0.2}))}	{($s_4$,({0.5},{0.2},{0.2}))}
$A_5$	{($s_3$,({0.4},{0.2},{0.3}))}	{($s_6$,({0.7,0.8},{0.2},{0.4}))}
	${\mathit{C}}_{\mathbf{3}}$	${\mathit{C}}_{\mathbf{4}}$
$A_1$	{($s_6$,({0.2},{0.1,0.3},{0.6}))}	{($s_5$,({0.4},{0.3},{0.3}))}
$A_2$	{($s_2$,({0.7},{0.2},{0.1}))}	{($s_4$,({0.5},{0.2},{0.2})),($s_5$,({0.6},{0.1},{0.2}))}
$A_3$	{($s_7$,({0.6},{0.2},{0.2}))}	{($s_2$,({0.7},{0.1},{0.2}))}
$A_4$	{($s_4$,({0.4,0.5},{0.1},{0.2}))}	{($s_3$,({0.6},{0.2,0.4},{0.3}))}
$A_5$	{($s_2$,({0.6},{0.2},{0.4})),($s_3$,({0.5},{0.2},{0.3}))}	{($s_7$,({0.8},{0.2},{0.1}))}

.

Step 2. Determine the fuzzy density of different $t_i$ and $\lambda$. Assume $m\left(t_1\right)=0.3,m\left(t_2\right)=0.4$, and $m\left(t_3\right)=0.5.$ By using Equation (14), we can get $\rho =-0.3793$. Then we can get $m(t_1,t_2)=0.6545,m(t_1,t_3)=0.7431,m(t_2,t_3)=0.8241$, and $m(t_1,t_2,t_3)=1.0$.

Step 3. Aggregate the collective evaluation values by using the GHNLCA operator. We can take different $\lambda$ values. Here, we consider the HNLCA operator by taking $\lambda =1$ in the GHNLCA operator. The results are shown in

Table 4. Collective decision matrix D.

Alternative	${\mathit{C}}_1$	${\mathit{C}}_2$
$A_1$	{($s_{4.6635}$,({0.2661,0.2992},{0.3249},{0.3579})),	{($s_{4.0090}$,({0.2992},{0.2870,0.3669},{0.2768}))}
	($s_{5.0180}$,({0.3787,0.4068},{0.1988},{0.3100}))}
$A_2$	{($s_{4.9455}$,({0.5012},{0.1271},{0.2656}))}	{($s_{5.009}$,({0.5819},{0.1876},{0.2768}))}
$A_3$	{($s_{5.0635}$,({0.4109},{0.1817,0.2013},{0.2032})),	{($s_{4.0455}$,({0.4532},{0.2013},{0.3000})),
	($s_{5.4090}$,({0.4879},{0.2309,0.2557},{0.1390}))}	($s_{4.3455}$,({0.3951},{0.2013},{0.3497}))}
$A_4$	{($s_{4.3365}$,({0.6029},{0.0000},{0.1625})),	{($s_{5.3090}$,({0.5324},{0.1625,0.1876},{0.2000}))}
	($s_{4.6365}$,({0.5671},{0.1574},{0.2000}))}
$A_5$	{($s_{2.6455}$,({0.4340},{0.2888,0.3148},{0.2656}))}	{($s_{4.0910}$,({0.5716,0.6276},{0.2608,0.2843},{0.4277}))}
	${\mathit{C}}_{\mathbf{3}}$	${\mathit{C}}_{\mathbf{4}}$
$A_1$	{($s_{3.7365}$,({0.2776,0.3059},{0.2273,0.3322},{0.4443}))}	{($s_{4.291}$,({0.4657},{0.2301},{0.3622})),
		($s_{4.891}$,({0.4376},{0.2301},{0.3322}))}
$A_2$	{($s_{3.0090}$,({0.5278},{0.2259},{0.2013}))}	{($s_{4.9545}$,({0.6037,0.6491},{0.1271,0.1625},{0.1876}))}
$A_3$	{($s_{4.9820}$,({0.5671},{0.1876},{0.2259}))}	{($s_{2.0000}$,({0.5013},{0.1574},{0.2608}))}
$A_4$	{($s_{3.4000}$,({0.5126,0.5424},{0.1574},{0.1271,0.1564}))}	{($s_{3.0000}$,({0.5062},{0.1767,0.2245},{0.2656}))}
		{($s_{3.3545}$,({0.4785},{0.2259,0.2870},{0.2301}))}
$A_5$	{($s_{4.8635}$,({0.5921,0.6467},{0.2608},{0.3612})),	{($s_{5.7455}$,({0.6357},{0.2843},{0.2273}))}
	($s_{5.2090}$,({0.5594,0.6184},{0.2608},{0.3270}))}	{($s_{6.0455}$,({0.5970},{0.2608},{0.2649}))}

.

Step 4. Assume decision-makers are risk-averse. Thus, the smallest linguistic evaluation value, the smallest truth-membership, the largest indeterminacy-membership, and the largest falsity- membership can be added until all the HNLEs have the same number of NLEs and until each NLE has the same number of truth-memberships, indeterminacy-memberships, and falsity-memberships. The results are shown in

Table 5. Extended hesitant neutrosophic fuzzy linguistic decision matrix $\tilde{D}$.

Alternative	${\mathit{C}}_1$	${\mathit{C}}_2$
$A_1$	{($s_{4.6635}$,({0.2661,0.2992},{0.3249,0.3669},{0.3579,0.4443})),	{($s_{4.0090}$,({0.2661,0.2992},{0.2870,0.3669},{0.2768,0.4443})),
	($s_{5.0180}$,({0.3787,0.4068},{0.1988,0.3669},{0.3100,0.4443}))}	($s_{2.0000}$,({0.2661,0.2661},{0.3669,0.3669},{0.4443,0.4443}))}
$A_2$	{($s_{4.9455}$,({0.2661,0.5012},{0.1271,0.3669},{0.2656,0.4443})),	{($s_{5.009}$,({0.2661,0.5819},{0.1876,0.3669},{0.2768,0.4443})),
	($s_{2.0000}$,({0.2661,0.2661},{0.3669,0.3669},{0.4443,0.4443}))}	($s_{2.0000}$,({0.2661,0.2661},{0.3669,0.3669},{0.4443,0.4443}))}
$A_3$	{($s_{5.0635}$,({0.2661,0.4109},{0.1817,0.2013},{0.2032,0.4443})),	{($s_{4.0455}$,({0.2661,0.4532},{0.2013,0.3669},{0.3000,0.4443})),
	($s_{5.4090}$,({0.2661,0.4879},{0.2309,0.2557},{0.1390,0.4443}))}	($s_{4.3455}$,({0.2661,0.3951},{0.2013,0.3669},{0.3497,0.4443}))}
$A_4$	{($s_{4.3365}$,({0.2661,0.6029},{0.0000,0.3669},{0.1625,0.4443})),	{($s_{5.3090}$,({0.2661,0.5324},{0.1625,0.1876},{0.2000,0.4443})),
	($s_{4.6365}$,({0.2661,0.5671},{0.1574,0.3669},{0.2000,0.4443}))}	($s_{2.0000}$,({0.2661,0.2661},{0.3669,0.3669},{0.4443,0.4443}))}
$A_5$	{($s_{2.6455}$,({0.2661,0.4340},{0.2888,0.3148},{0.2656,0.4443})),	{($s_{4.0910}$,({0.5716,0.6276},{0.2608,0.2843},{0.4277,0.4443})),
	($s_{2.0000}$,({0.2661,0.2661},{0.3669,0.3669},{0.4443,0.4443}))}	($s_{2.0000}$,({0.2661,0.2661},{0.3669,0.3669},{0.4443,0.4443}))}
	${\mathit{C}}_{\mathbf{3}}$	${\mathit{C}}_{\mathbf{4}}$
$A_1$	{($s_{3.7365}$,({0.2776,0.3059},{0.2273,0.3322},{0.4443,0.4443})),	{($s_{4.291}$,({0.2661,0.4657},{0.2301,0.3669},{0.3622,0.4443})),
	{($s_{2.0000}$,({0.2661,0.2661},{0.3669,0.3669},{0.4443,0.4443}))}	($s_{4.891}$,({0.2661,0.4376},{0.2301,0.3669},{0.3322,0.4443}))}
$A_2$	{($s_{3.0090}$,({0.2661,0.5278},{0.2259,0.3669},{0.2013,0.4443})),	{($s_{4.9545}$,({0.6037,0.6491},{0.1271,0.1625},{0.1876,0.4443})),
	($s_{2.0000}$,({0.2661,0.2661},{0.3669,0.3669},{0.4443,0.4443}))}	($s_{2.0000}$,({0.2661,0.2661},{0.3669,0.3669},{0.4443,0.4443}))}
$A_3$	{($s_{4.9820}$,({0.2661,0.5671},{0.1876,0.3669},{0.2259,0.4443})),	{($s_{2.0000}$,({0.2661,0.5013},{0.1574,0.3669},{0.2608,0.4443})),
	($s_{2.0000}$,({0.2661,0.2661},{0.3669,0.3669},{0.4443,0.4443}))}	($s_{2.0000}$,({0.2661,0.2661},{0.3669,0.3669},{0.4443,0.4443}))}
$A_4$	{($s_{3.4000}$,({0.5126,0.5424},{0.1574,0.3669},{0.1271,0.1564})),	{($s_{3.0000}$,({0.2661,0.5062},{0.1767,0.2245},{0.2656,0.4443})),
	($s_{2.0000}$,({0.2661,0.2661},{0.3669,0.3669},{0.4443,0.4443}))}	($s_{3.3545}$,({0.2661,0.4785},{0.2259,0.2870},{0.2301,0.4443}))}
$A_5$	{($s_{4.8635}$,({0.5921,0.6467},{0.2608,0.3669},{0.3612,0.4443})),	{($s_{5.7455}$,({0.2661,0.6357},{0.2843,0.3669},{0.2273,0.4443})),
	($s_{5.2090}$,({0.5594,0.6184},{0.2608,0.3669},{0.3270,0.4443}))}	($s_{6.0455}$,({0.2661,0.5970},{0.2608,0.3669},{0.2649,0.4443}))}

.

Step 5. We take the HNLPIS and the HNLNIS as follows:

HNLPIS: $h^{+}=\{\{(s_9,(\{1,1\},\{0,0\},\{0,0\})),(s_9,(\{1,1\},\{0,0\},\{0,0\}))\},\{(s_9,(\{1,1\},\{0,0\},\{0,0\})),$ $(s_9,(\{1,1\},\{0,$ $0\},$ $\{0,0\}\left)\right)\},\{(s_9,(\{1,1\},\{0,0\},\{0,0\})),(s_9,(\{1,1\},\{0,0\},\{0,0\}))\},\left\{\right(s_9,(\{1,1\},\{0,0\},$ $\{0,0\}\left)\right),(s_9,(\{1,1\},\{0,0\},\{0,0\}))\left\}\right\}$.

HNLNIS: $h^{-}=\left\{\right\{(s_1,(\{0,0\},\{1,1\},\{1,1\},(s_1,(\{0,0\},\{1,1\},\{1,1\}))\},\left\{\right(s_1,(\{0,0\},\{1,1\},\{1,1\},$ $(s_1,(\{0,0\},\{1,1\},\{1,1\}))\},\{(s_1,(\{0,0\},\{1,1\},\{1,1\},(s_1,(\{0,0\},\{1,1\},\{1,1\}))\},\left\{\right(s_1,(\{0,0\},\{1,1\},\{1,1\},$ $(s_1,(\{0,0\},\{1,1\},\{1,1\}))\left\}\right\}.$

Step 6. Assume $m\left(C_1\right)=0.25$, $m\left(C_2\right)=0.35$, $m\left(C_3\right)=0.30$, and $m\left(C_4\right)=0.20$. We can get $\rho =-0.2330$ by using Equation (14). Then, we can determine the fuzzy measures of the attribute sets as follows:

$m\left(\left\{C_1\right\}\right)=0.25$, $m\left(\left\{C_2\right\}\right)=0.35$, $m\left(\left\{C_3\right\}\right)=0.30$, $m\left(\left\{C_4\right\}\right)=0.20$, $m\left(\{C_1,C_2\}\right)=0.5796$, $m\left(\{C_1,C_3\}\right)=0.5325$, $m\left(\{C_1,C_4\}\right)=0.4383$, $m\left(\{C_2,C_3\}\right)=0.6255$, $m\left(\{C_2,C_4\}\right)=0.5337$, $m\left(\{C_3,C_4\}\right)=0.4860$, $m\left(\{C_1,C_2,C_3\}\right)=0.8391$, $m\left(\{C_1,C_2,C_4\}\right)=0.7526$, $m\left(\right\{C_1,$ $C_3,C_4\left\}\right)$ $=0.7077$, $m\left(\{C_2,C_3,C_4\}\right)=0.7964$, $m\left(\{C_1,C_2,C_3,C_4\}\right)=1.0$.

Step 7. Calculate the correlated distances of each alternative’s evaluation values to the HNLPIS and the HNLNIS by generalized hesitant neutrosophic linguistic correlation weighted averaging distance. Here, we can take different $\lambda$ in Equations (30) and (31). If $\lambda =2$, we can get

$d_{CE}^{1+}=0.5249,d_{CE}^{2+}=0.5344,d_{CE}^{3+}=0.5082,d_{CE}^{4+}=0.5190,d_{CE}^{5+}=0.5249,$ $d_{CE}^{1-}=0.5107,d_{CE}^{2-}=0.5231,d_{CE}^{3-}=0.5432,d_{CE}^{4-}=0.5624,d_{CE}^{5-}=0.5439.$

Step 8. Calculate closeness coefficients of alternatives as

$C{C}_1=0.4932,C{C}_2=0.4947,C{C}_3=0.5166,C{C}_4=0.5200,C{C}_5=0.5262$.

Step 9. Rank alternatives according to the ranking of $C{C}_i$ to get $A_5>A_4>A_3>A_2>A_1$ and the optimal alternative is $A_5$.

If another $\lambda$ value is used in Step 7, we can get distances, coefficients, and alternative rankings as in

Table 6. Decision results using different $\lambda$ with hesitant neutrosophic linguistic elements (HNLEs).

$\mathit{\lambda }$		${\mathit{A}}_1$	${\mathit{A}}_2$	${\mathit{A}}_3$	${\mathit{A}}_4$	${\mathit{A}}_5$	Ranking
$\lambda =0.1$	$d_i^{+}$	0.4762	0.4625	0.4409	0.3748	0.4462	$A_4>A_5>A_3>A_1>A_2$
	$d_i^{-}$	0.4386	0.4168	0.4605	0.4381	0.4786
	$C{C}_i$	0.4795	0.4740	0.5109	0.5389	0.5175
$\lambda =0.5$	$d_i^{+}$	0.4868	0.4793	0.4564	0.4355	0.4554	$A_5>A_4>A_3>A_1>A_2$
	$d_i^{-}$	0.4568	0.4452	0.4810	0.4720	0.4956
	$C{C}_i$	0.4841	0.4816	0.5131	0.5201	0.5212
$\lambda =1$	$d_i^{+}$	0.4999	0.4990	0.4749	0.4686	0.4670	$A_5>A_4>A_3>A_1>A_2$
	$d_i^{-}$	0.4772	0.4759	0.5043	0.5079	0.5144
	$C{C}_i$	0.4884	0.4882	0.5150	0.5201	0.5242
$\lambda =2$	$d_i^{+}$	0.5249	0.5344	0.5082	0.5190	0.4898	$A_5>A_4>A_3>A_2>A_1$
	$d_i^{-}$	0.5107	0.5231	0.5432	0.5624	0.5439
	$C{C}_i$	0.4932	0.4947	0.5166	0.5200	0.5262
$\lambda =5$	$d_i^{+}$	0.6142	0.6326	0.5922	0.6236	0.5561	$A_5>A_4>A_3>A_2>A_1$
	$d_i^{-}$	0.5725	0.6031	0.6171	0.6546	0.5930
	$C{C}_i$	0.4824	0.4881	0.5103	0.5121	0.5160
$\lambda =10$	$d_i^{+}$	0.6201	0.6616	0.5925	0.6746	0.5673	$A_3>A_5>A_4>A_2>A_1$
	$d_i^{-}$	0.6266	0.6714	0.6807	0.7290	0.6310
	$C{C}_i$	0.5026	0.5037	0.5346	0.5194	0.5266

.

6.2. Comparison Analysis

Comparisons with other methods have been made [44,45]. If indeterminacy memberships are not considered, hesitant neutrosophic linguistic elements reduce to hesitant intuitionistic fuzzy linguistic elements (HIFLEs) [44] ${h^{\prime }}_{ij}^k=\{(s_{{\theta }_{ij}^k},$ ($I(s_{{\theta }_{ij}^k}),$ $F(s_{{\theta }_{ij}^k})))\}$. We first aggregate hesitant intuitionistic fuzzy linguistic elements given by different DMs in different periods into collective ones ${h^{\prime }}_{ij}=\left\{\right(s_{{\theta }_{ij}},$ ($I\left(s_{{\theta }_{ij}}\right),$ $F\left(s_{{\theta }_{ij}}\right)\left)\right)\}$ by using the generalized hesitant intuitionistic fuzzy linguistic correlated averaging (GHIFLCA) operator as in Equation (33).

$$\begin{array}{cc}\hfill & \mathrm{GHIFLCA}(h_1^{\prime },h_2^{\prime },\dots ,h_n^{\prime })={\left(\sum _{j=1}^{n}m(A_{\sigma (j)})-m(A_{\sigma (j-1)}){(h_{\sigma (j)}^{\prime })}^{\lambda }\right)}^{1/\lambda }\hfill \\ \hfill =& \bigcup _{a_j^k\in h_j}\{(s_{{({\sum }_{j=1}^n(m(A_{\sigma (j)})-m(A_{\sigma (j-1)})){({\theta }_{\sigma (j)}^k)}^{\lambda })}^{1/\lambda }},\bigcup \{({\left(1-\prod _{j=1}^n{(1-{({\mu }_{\sigma (j)}^k)}^{\lambda })}^{m(A_{\sigma (j)})-m(A_{\sigma (j-1)})}\right)}^{1/\lambda },\hfill \\ \hfill & 1-{(1-\prod _{j=1}^n{(1-{(1-{\tau }_{\sigma (j)}^k)}^{\lambda })}^{m(A_{\sigma (j)})-m(A_{\sigma (j-1)})})}^{1/\lambda })\})\}.\hfill \end{array}$$

(33)

Assuming DMs are risk-averse, we extend the hesitant intuitionistic fuzzy linguistic elements by adding the smallest linguistic evaluation values, the smallest truth-memberships, and the largest false-memberships. Determine the hesitant intuitionistic fuzzy linguistic positive ideal solution (HIFLPIS) $h^{\prime +}$ and the hesitant intuitionistic fuzzy linguistic negative ideal solution (HIFLNIS) $h^{\prime -}$.

HIFLPIS: $h^{\prime +}=\{\{(s_9,(\{1,1\},\{0,0\})),(s_9,(\{1,1\},\{0,0\}))\},\{(s_9,(\{1,1\},\{0,0\})),(s_9,(\{1,1\},$ $\{0,0\}))\},\{(s_9,(\{1,1\},\{0,0\})),(s_9,(\{1,1\},\{0,0\}))\},$ $\{(s_9,(\{1,1\},\{0,0\})),(s_9,(\{1,1\},\{0,0\}))\}\}$.

HIFLNIS: $h^{\prime -}=\{\{(s_1,(\{0,0\},\{1,1\},(s_1,(\{0,0\},\{1,1\}))\},\{(s_1,(\{0,0\},$ $\{1,1\},$ $(s_1,(\{0,0\},\{1,$ $1\}))\},$ $\{(s_1,(\{0,0\},\{1,1\},$ $(s_1,(\{0,0\},\{1,1\}))\},$ $\{(s_1,$ $(\{0,0\},\{1,1\},(s_1,(\{0,0\},\{1,1\}))\}\}.$

Calculate the distances of the collective evaluation values to $h^{\prime +}$ and $h^{\prime -}$ by using Equations (34) and (35). The results are shown in

Table 7. Decision results using different $\lambda$ with hesitant intuitionistic fuzzy linguistic elements (HIFLEs).

$\mathit{\lambda }$	${\mathit{CC}}_{\mathit{i}}$	${\mathit{A}}_1$	${\mathit{A}}_2$	${\mathit{A}}_3$	${\mathit{A}}_4$	${\mathit{A}}_5$	Ranking
$\lambda =0.1$	$C{C}_i$	0.4110	0.4295	0.4556	0.4787	0.4678	$A_4>A_5>A_3>A_2>A_1$
$\lambda =0.5$	$C{C}_i$	0.4158	0.4369	0.4589	0.4809	0.4718	$A_4>A_5>A_3>A_2>A_1$
$\lambda =1$	$C{C}_i$	0.4212	0.4443	0.4626	0.4838	0.4756	$A_4>A_5>A_3>A_2>A_1$
$\lambda =2$	$C{C}_i$	0.4300	0.4541	0.4686	0.4891	0.4800	$A_4>A_5>A_3>A_2>A_1$
$\lambda =5$	$C{C}_i$	0.4444	0.4659	0.4791	0.4997	0.4796	$A_4>A_5>A_3>A_2>A_1$
$\lambda =10$	$C{C}_i$	0.4775	0.4812	0.5026	0.5021	0.4705	$A_3>A_4>A_2>A_5>A_1$

.

$$\begin{array}{cc}\hfill d_i(h_i^{\prime },h^{\prime +})=& (\sum _{j=1}^n(m(B_{\sigma (j)})-m(B_{\sigma (j-1)}))\frac{1}{3l}\sum _{i=1}^l(\frac{1}{l_{\theta }}\sum _{t=1}^{l_{\theta }}(|{\theta }_{\sigma (ji)}^t-9{|}^{\lambda }/9^{\lambda }+\hfill \\ \hfill & \frac{1}{l_t}\sum _{k=1}^{l_t}|{\mu }_{\sigma (jik)}^t-1{|}^{\lambda }+\frac{1}{l_t}\sum _{k=1}^{l_t}|{\tau }_{\sigma (jik)}^t-0{|}^{\lambda })){)}^{1/\lambda }.\hfill \end{array}$$

(34)

$$\begin{array}{cc}\hfill d_i(h_i^{\prime },h^{\prime -})=& (\sum _{j=1}^n(m(B_{\sigma (j)})-m(B_{\sigma (j-1)}))\frac{1}{3l}\sum _{i=1}^l(\frac{1}{l_{\theta }}\sum _{t=1}^{l_{\theta }}(|{\theta }_{\sigma (ji)}^t-1{|}^{\lambda }/9^{\lambda }+\hfill \\ \hfill & \frac{1}{l_t}\sum _{k=1}^{l_t}|{\mu }_{\sigma (jik)}^t-0{|}^{\lambda }+\frac{1}{l_t}\sum _{k=1}^{l_t}|{\tau }_{\sigma (jik)}^t-1{|}^{\lambda })){)}^{1/\lambda }.\hfill \end{array}$$

(35)

Calculate the closeness coefficients of alternatives by using Equation (32). The results are also shown in Table 7. From the results, we can get different ranking results if indeterminacy memberships are not considered. In most cases, $A_4$ is the optimal alternative and $A_5$ becomes the suboptimal alternative. If $\lambda =10$, $A_3$ is the optimal alternative, and $A_5$ is ranked as the second to last.

If the linguistic arguments are not considered, the hesitant neutrosophic linguistic elements reduce to the hesitant neutrosophic elements [45] ${h^{″}}_{ij}^k=\{($ $T_{ij}^k,$ $I_{ij}^k,$ $F_{ij}^k)\}$. The hesitant neutrosophic elements are first aggregated into collective ones by using the generalized hesitant neutrosophic fuzzy correlated averaging (GHNFCA) operator as follows:

$$\begin{array}{cc}\hfill & \mathrm{GHNFCA}(h_1^{″},h_2^{″},\dots ,h_n^{″})={\left(\sum _{j=1}^{n}m(A_{\sigma (j)})-m(A_{\sigma (j-1)}){(h_{\sigma (j)}^{\prime \prime })}^{\lambda }\right)}^{1/\lambda }\hfill \\ \hfill =& \bigcup _{a_j^k\in h_j}\{\bigcup \{({\left(1-\prod _{j=1}^n{(1-{({\mu }_{\sigma (j)}^k)}^{\lambda })}^{m(A_{\sigma (j)})-m(A_{\sigma (j-1)})}\right)}^{1/\lambda },1-(1-\prod _{j=1}^n(1-(1-\hfill \\ \hfill & {\nu }_{\sigma (j)}^k{)}^{\lambda }{{)}^{m(A_{\sigma (j)})-m(A_{\sigma (j-1)})})}^{1/\lambda },1-{(1-\prod _{j=1}^n{(1-{(1-{\tau }_{\sigma (j)}^k)}^{\lambda })}^{m(A_{\sigma (j)})-m(A_{\sigma (j-1)})})}^{1/\lambda })\})\}.\hfill \end{array}$$

The DMs are also assumed to be risk-averse and the smallest truth-membership, the largest indeterminacy-membership, and the largest falsity-membership are added. Determine the hesitant neutrosophic fuzzy positive ideal solution $h^{\prime \prime +}$ and hesitant neutrosophic fuzzy negative ideal solution $h^{\prime \prime -}$. Calculate the distances of collective neutrosophic fuzzy values to $h^{\prime \prime +}$ and $h^{\prime \prime -}$ by the following equations:

$$\begin{array}{cc}\hfill d_i(h_i^{″},h^{″+})=& (\sum _{j=1}^n(m(B_{\sigma (j)})-m(B_{\sigma (j-1)}))\frac{1}{3l}\sum _{i=1}^l(\frac{1}{l_{\theta }}\sum _{t=1}^{l_{\theta }}(|{\mu }_{\sigma (ji)}^t-1{|}^{\lambda }+\hfill \\ \hfill & \frac{1}{l_t}\sum _{k=1}^{l_t}|{\nu }_{\sigma (jik)}^t-0{|}^{\lambda }+\frac{1}{l_t}\sum _{k=1}^{l_t}|{\tau }_{\sigma (jik)}^t-0{|}^{\lambda })){)}^{1/\lambda }.\hfill \end{array}$$

(36)

$$\begin{array}{cc}\hfill d_i(h_i^{″},h^{″-})=& (\sum _{j=1}^n(m(B_{\sigma (j)})-m(B_{\sigma (j-1)}))\frac{1}{3l}\sum _{i=1}^l(\frac{1}{l_{\theta }}\sum _{t=1}^{l_{\theta }}(|{\mu }_{\sigma (ji)}^t-0{|}^{\lambda }+\hfill \\ \hfill & \frac{1}{l_t}\sum _{k=1}^{l_t}|{\nu }_{\sigma (jik)}^t-1{|}^{\lambda }+\frac{1}{l_t}\sum _{k=1}^{l_t}|{\tau }_{\sigma (jik)}^t-1{|}^{\lambda })){)}^{1/\lambda }.\hfill \end{array}$$

(37)

Other steps are the same as the proposed methods. If $\lambda =2$, we can get the results as $C{C}_1=0.7661$, $C{C}_1=0.7229$, $C{C}_1=0.7686$, $C{C}_1=0.6880$, and $C{C}_1=0.7256$. The alternatives can be ranked as $A_3>A_1>A_5>A_2>A_4$.

Results of different methods are listed in

Table 8. Results of different methods.

Method	Ranking
Method from [44]	$A_4>A_5>A_3>A_2>A_1$
Method from [45]	$A_3>A_1>A_5>A_2>A_4$
Proposed method	$A_5>A_4>A_3>A_2>A_1$

if $\lambda =2$. From the results, we can see that different ranking results can be obtained using different methods. In the method of [45], only hesitant neutrosophic fuzzy values have been considered. In the method of [44], the memberships are in the form of intuitionistic fuzzy values. In fact, DMs would like to evaluate with linguistic arguments in the evaluation process. By using hesitant neutrosophic fuzzy elements to model fuzziness and uncertainty, more accuracy results can be obtained. Decision results are more reasonable in the proposed method. Based on comparison with existing methods, therefore, this paper presents a new way of solving multiple attribute decision-making in a hesitant neutrosophic linguistic environment.

7. Conclusions

In this paper, we first introduce a definition of the hesitant neutrosophic fuzzy linguistic set. We then define some distance measures including the hesitant neutrosophic linguistic Euclidean distance, the hesitant neutrosophic linguistic Hamming distance, and the generalized hesitant neutrosophic linguistic distance. We also define some correlated distance measures including the generalized hesitant neutrosophic linguistic correlation averaging distance and the generalized hesitant neutrosophic linguistic hybrid correlation averaging distance. We present some correlated aggregation operators for hesitant neutrosophic fuzzy linguistic set including the HNLCA operator, the HNLCGA operator, the GHNLCA operator, and the QHNLCA operator. A new hesitant neutrosophic fuzzy linguistic multiple attribute decision-making method has been developed based on the new distance measures and the new aggregation operators. We apply the new method to solve investment problems. Two special cases of the hesitant neutrosophic fuzzy linguistic set from existing works have been used in the numerical example to illustrate the difference between the proposed method and several other methods.

The proposed method has the following advantages. First, the hesitant neutrosophic fuzzy linguistic set is the extension of the hesitant fuzzy set, the neutrosophic set, and the linguistic term set, which can be applied in decision problems with imprecise, uncertain, incomplete, and inconsistent information. Compared with other tools, the hesitant neutrosophic fuzzy linguistic set is more flexible and accurate, and many existing tools are special cases of the hesitant neutrosophic fuzzy linguistic set. Second, correlation exists extensively in the decision-making process, which can be modeled by using the Choquet integral. We combine the Choquet integral with the hesitant neutrosophic fuzzy linguistic theory to develop some distance measures and aggregation operators. Finally, the new multiple attribute group decision-making method is based on the TOPSIS and the Choquet integral for hesitant neutrosophic fuzzy linguistic information, which can be used to solve complicated decision problems.