The dynamics of an aquatic ecological model with aggregation, Fear and Harvesting Effects

1.   Introduction

Inspired by Pawlak's rough sets ^[37] and probabilistic rough sets ^[9,48], Yao ^[49,50,51] proposed the theory of three-way decision (3WD) which provides reasonable semantic interpretation to the positive, negative and boundary regions of rough sets. The core of 3WD is trisecting the whole and taking different strategies for different parts. We can simplify complex problems by dividing the whole into three parts. 3WD provide us with a framework to solve the generalized uncertainty problem. It might be considered as part of a more complete decision-making strategy which in situations of e.g., large computational burden, should only refine the analysis of the alternatives belonging to the positive (and possibly the boundary) regions. The philosophy of thinking in threes includes not only splitting the set of alternatives in three parts, it can also evoke thinking in three views, three components, three categories, three levels or three dimensions ^[53]. Different interpretations of ternary options make 3WD become a useful and universal theoretical method to solve practical problems. For instance, in a social choice context, Alcantud and Laruelle ^[2] characterized a pragmatical model of voting with three actions. Recently, Laruelle ^[25] has argued that citizens in democratic countries tend to abstain because they cannot voice their dissatisfaction in their ballots. She reports the results of a field experiment that took place during the 2017 French presidential elections: Real voters were entirely satisfied with ternary voting ^[2], and understood well its aim and purpose. Many scholars have studied and expanded the three decision theories and applied them to many disciplines in the past decade. Other researchers have represented several classifications of methods based on the 3WD theory and favorably practiced in many fields. For example, Yu et al. ^[55] offered an effective automatic process by applying the decision-theoretic rough set model to clustering. Jia et al. ^[24] developed a mathematical model for optimal representation of the decision-theoretic rough set. Liang and Liu ^[28] proposed a risk decision model based on hesitant fuzzy rough sets. Liang et al. ^[29] presented a 3WD model with linguistic features for decision-making problems. Yao ^[52] established the TAO ("trisecting-acting-outcome") framework as a fundamental model for 3WD. Hu et al. ^[23] presented two kinds of 3WD approaches and examined their properties. Li et al. ^[26] introduced 3WD models based on subset-evaluation which generalize the original models. Liu et al. ^[30] proposed a new 3WD model with intuitionistic fuzzy numbers. Li et al. ^[27] generalized Pawlak's classical model and introduced rough set models on two universes. Yang and Yao ^[47] presented two semantics for interpreting soft sets and constructed two soft set-based 3WD models. Yao ^[54] investigated set-theoretic models of 3WD and illustrated the essential role of the TAO framework in 3WD.

In addition to rough set theory which we have mentioned above, there are other models of uncertain knowledge whose advantages are used in our study. They incorporate features related to indiscernibility or granularity (rough set theory), partial membership (fuzzy set theory and its extension under hesitancy), and parameterized descriptions (soft set theory).

In 1965, Zadeh ^[56] acquainted fuzzy set (FS) theory to manage the impreciseness in the data. After its presence, many scholars have spread them to L-fuzzy sets ^[21], IVFSs ("interval-valued fuzzy sets") ^[42] and IFSs ("Intuitionistic fuzzy sets") ^[5]. In practical application, when determining the membership degree of an element to a fuzzy set, people often hesitate between two or more possible values and find it difficult to choose. In order to solve this problem, Torra ^[41] proposed the concept of a hesitant fuzzy set (HFS). Compared with classical sets and FSs, HFSs contain all the possible membership values corresponding to each alternative, which if properly handled, can reduce the information loss in the decision-making process. Based on 3WD theory, Wang et al. ^[43] developed a novel approach to MADM ("multiple attribute decision making") under a hesitant fuzzy setting.

To build a more comprehensive theoretical structure for representing and administering uncertainty, the concept of a soft set (SS) was born from a different narrative that concerns parameterization ^[36]. As a new type of nonstandard sets, the SS involves not only the domain of objects, but also a parameter space related to the object domain. In recent years, the research on soft set theory has developed quickly. Maji et al. ^[34] applied the theory of SSs to solve a decision-making problem using rough mathematics. Maji et al. ^[33] proposed several operations of SSs. They also considered the fuzzy extension of SSs in ^[31].

Later on, Maji et al. ^[32] joined SSs with the features of IFSs and hence stated the notion of an IFSS ("intuitionistic fuzzy soft set"). Peng et al. ^[38] combined SSs with PFSs ("Pythagorean fuzzy sets") to put forward the concept of Pythagorean fuzzy soft sets. Athira et al. ^[6] proposed some new entropy measures for Pythagorean fuzzy soft sets. By virtue of Archimedean t-norm and t-conorm, Garg and Arora ^[20] generalized the MSM ("Maclaurin symmetric mean") aggregation operators to IFSSs. Chen et al. ^[8] developed a parameterization reduction method for SSs. Ali et al. ^[4] revisited and improved some basic operations such as "intersection", "union", "difference", between the pairs of SSs. Garg and Arora ^[19] developed a correlation coefficient-based TOPSIS method to address decision-making problems with intuitionistic fuzzy soft information. A concept of generalized fuzzy soft sets was stated and investigated by Majumdar and Samanta ^[35]. Feng et al. ^[17] extended the preference ranking organization method for enrichment evaluation with IFSSs. Agarwal et al. ^[1] defined the notion of GIFSSs ("generalized intuitionistic fuzzy soft sets") and considered practical applications of GIFSSs. Feng et al. ^[13] improved the GIFSS and simplified this notion as a combination of an IFSS over a universal set and an IFS in a parameter set. Garg and Arora ^[18] put forth group-based GIFSSs and discussed their applications to group decision-making problems.

Returning to the motivational topic of rough set (RS) theory, we recall that it was introduced by Pawlak in 1982, who attempted to analyze the granularity-based uncertainty during the decision process ^[37]. Driven by the features of FSs and RSs, Dubois and Prade ^[10] defined the notion of rough fuzzy sets and fuzzy rough sets. Raszikowaka and Kerre ^[39] further extended the concepts presented by Dubois and Prade to $(I, T)$-fuzzy rough sets. Using the intuitionistic fuzzy overlap function and its residual implication, Wen et al. ^[44] presented a new type of intuitionistic fuzzy rough sets. Given the important role of FSs and RSs, Feng et al. ^[14] combined SSs with them. Further, Feng et al. ^[16] put forth the concept of soft rough sets and demonstrated that Pawlak's RS model is a special case of the presented concept when the SS in a soft approximation space is a partition SS. By combining fuzzy soft sets with fuzzy rough sets, Sun and Ma ^[40] put forward soft fuzzy rough sets and considered their application to decision making problems. Xie and Gong ^[46] presented a notion called hesitant soft fuzzy rough set based on SSs and HFSs. They ascertained the relationship between hesitant fuzzy rough sets and hesitant soft fuzzy rough sets as well.

The main goal of our paper is to take advantage of a novel construction of SSs derived from HFSs, in order to justify a 3WD strategy that acts on hesitant fuzzy data. In passing, we study some theoretical facts that expand our knowledge about the new SS produced from an HFS, which we term as the canonical soft set. The rest of this article is organized as follows. Section 2 gives a review of the rudiments on FSs, HFSs, SSs, RSs and 3WD. In Section 3, the notions of canonical soft sets, unit interval parameterized SSs, {and} derived HFSs are introduced. The relationships between canonical soft sets and derived HFSs are discussed. In Section 4, a novel 3WD algorithm is proposed to address group decision-making problems by using canonical soft sets of HFSs. In addition, an example regarding paper review is given to illustrate the validity of the proposed algorithm in Section 5. A summary of this study is given in Section 6.

2.   Preliminaries

Some basic concepts related to FSs, SSs, RSs and 3WD are briefly reviewed in this section. Through the paper, $\mho$ denotes the universal set and $I = [0, 1]$. For any nonempty set $K$, we use the following notations:

$\bullet \; \mathfrak{P}(K)$ represents the "power set" of $K$;

$\bullet \; \mathfrak{P}^*(K)$ represents the family of all nonempty subsets of $K$;

$\bullet \; \mathfrak{F}^*(K)$ represents the family of all nonempty finite subsets of $K$;

$\bullet \; \mathfrak{F}_n(K)$ represents the family of all finite subsets $E$ of $K$ whose cardinality satisfies $|E| = n$ ($n\ge 1$).

2.1.   Fuzzy sets and HFSs

Zadeh ^[56] suggested that a certain type of uncertainty of information can be quantified by partial membership values. Consequently, a fuzzy set $\mathcal{M}$ in $\mho$ is defined by a mapping $\mathcal{M}:\mho\rightarrow I$ which represents the membership function of $\mathcal{M}$.

This definition extends the usual notion of a characteristic function, which in set theory, is equivalent to a standard subset. Now when $u\in \mho$, the value $\mathcal{M}(u)$ is the degree to which $u$ belongs to $\mathcal{M}$. Let $\mathcal{FS}(\mho)$ denote the class of all FSs on $\mho$. A number of relevant operations of fuzzy sets can be introduced. With the "min-max" system, Zadeh defined the "intersection", "union", and "complement" operations of FSs as follows:

where $\mathcal{M}, \mathcal{N}\in \mathcal{FS}(\mho)$ and $\tau\in \mho$. When $\mathcal{M}(\tau)\leq\mathcal{N}(\tau)$ for all $\tau\in \mho$, then $\mathcal{M} \subseteq \mathcal{N}$. It is obvious that $\mathcal{M} = \mathcal{N}$ if and only if $\mathcal{M}\subseteq\mathcal{N}$ and $\mathcal{N}\subseteq\mathcal{M}$.

When an object has various viable membership values, it is often tough to ascertain its precise membership grade. For this, a concept of HFSs ("hesitant fuzzy sets") was proposed by Torra ^[41]. In an HFS, the membership grades of objects are represented by sets containing several (maybe infinitely many) values in the unit interval $I$. In the following, we recall some rudiments regarding the theory of HFSs.

Definition 2.1. ^[41] An HFS on $\mho$ is a mapping $\mathfrak{h}:\mho\to \mathfrak{P}(I)$.

Conventionally, an HFS $\mathfrak{h}$ on $\mho$ defined as a set of ordered pairs, namely $\mathfrak{h} = \{\langle \tau, \mathfrak{h}(\tau)\rangle:\tau \in \mho\}$. According to ^[45], an HFE ("hesitant fuzzy element") means a subset of $I$. That is, the power set $\mathfrak{P}(I)$ of $I$ consists of all HFEs. Given an HFS $\mathfrak{h}$ and $\tau \in \mho$, the HFE $\mathfrak{h}(\tau)$ contains all the possible membership grades of $\tau$ to the HFS $\mathfrak{h}$. Henceforth, $\mathcal{HFS}(\mho)$ denotes the class of all HFSs on $\mho$.

Definition 2.2. An HFS $\mathfrak{h}:\mho\to \mathfrak{P}^*(I)$ is said to be a regular HFS (RHFS) on $\mho$.

In practical applications, it is justifiable to assume that the employed HFSs are regular. This means that at least one value in $I$ must be assigned for each element of $\mho$ as its possible membership grade. Henceforth, the class of all RHFSs on $\mho$ is denoted by $\mathcal{RHFS}(\mho)$.

Definition 2.3. ^[7] A typical hesitant fuzzy set (THFS) on $\mho$ is a mapping $\mathfrak{h}:\mho\to \mathfrak{F}^*(I)$.

A nonempty finite subset of $I$ is called a typical hesitant fuzzy element (THFE). It is clear that the family of all THFEs coincides with $\mathfrak{F}^*(I)$. Conventionally, the possible membership grades in a THFE $E$ are listed in ascending order. In other words, $E$ is written in the form $E = \{\tau_1, \tau_2, \cdots, \tau _{n}\}\subseteq I$ such that $\tau_1 < \tau_2 < \cdots < \tau_{n}$ and $1\le|E| = n { < } \infty$. Particularly, the THFE $E = \{1\}$ is said to be full and $E = \{0\}$ is referred to as the empty HFE. Accordingly, $\{\langle \tau, \{1\}\rangle:\tau \in \mho\}$ is called the ideal (or full) HFS on $\mho$, and $\{\langle \tau, \{0\}\rangle:\tau \in \mho\}$ is called the anti-ideal (or empty) HFS on $\mho$ In the following, we denote the class of all THFSs on $\mho$ by $\mathcal{THFS}(\mho)$.

Definition 2.4. ^[3] A THFS $\mathfrak{h}$ on $\mho$ is $n$-typical if there exists a positive integer $n$ such that $|\mathfrak{h}(\tau)| = n$ for all $\tau \in \mho$.

To put it in another way, an $n$-typical hesitant fuzzy set is a mapping $\mathfrak{h}:\mho\to \mathfrak{F}_n(I)$ for some $n\ge 1$. For an HFS, there are multiple values in HFEs since there is more than one criterion for determining membership grades. This can be explained by a common application scenario. When multiple experts determine the membership grades of an object, there might be different values for the same object because different experts have distinguishing opinions.

2.2.   Soft sets

In order to establish a theory framework to describe and deal with uncertainty, Molodtsov ^[36] proposed the important concept of SSs from the perspective of parameterization. Let $E_{\mho}$ be a set containing all the relevant parameters of objects in $\mho$. Conventionally, the set $E_\mho$ is called the parameter space. For convenience, we can simply denote $E_\mho$ by $E$. The pair $(\mho, E)$ is named as a soft universe. In practical applications, the parameter space $E$ includes all attributes and characteristics of the object in $\mho$. The mathematical definition of SSs is as follows:

Definition 2.5. ^[36] Assume that $(\mho, E)$ is a soft universe. An ordered pair $\mathcal{T} = (G, B)$ is called a soft set\, over $\mho$. The subset $B\subseteq E$ is the parameter set of $\mathcal{T}$ and the approximate function of $\mathcal{T}$ is the mapping $G: B\rightarrow \mathfrak{P}(\mho)$.

Definition 2.6. ^[14] Let $\mathcal{T} = (G, B)$ be a soft set over $\mho$. Then $\mathcal{T}$ is said to be serial if $G(\varrho)\neq\varnothing$ for all $\varrho\in B$.

Definition 2.7. ^[14] Let $\mathcal{T} = (G, B)$ be a soft set over $\mho$. Then $\mathcal{T}$ is said to be full if $\bigcup_{\varrho\in B}G(\varrho) = \mho$.

A covering $\mathbb{C} = \{C^{\alpha}\mid\alpha \in \Lambda\}$ of $\mho$ is a family of non-empty subsets of $\mho$ such that for every $\tau \in \mho$, there exists an $\alpha \in \Lambda$ with $\tau \in C^{\alpha}$. A covering $\mathbb{C}$ of $\mho$ is said to be a partition of $\mho$ if

for all $\alpha, \beta\in \Lambda$.

Definition 2.8. ^[14] A soft set $\mathcal{T} = (G, B)$ over $\mho$ is called a covering soft set if it is full and serial.

Definition 2.9. ^[14] A soft set $\mathcal{T} = (G, B)$ over $\mho$ is called a partition soft set if $\{G(a)\mid a\in B\}$ forms a partition of $\mho$.

Definition 2.10. ^[15] A soft set $\mathcal{T} = (G, B)$ over $\mho$ is said to be injective if

for all $a, b\in B$.

Definition 2.11. A soft set $\mathcal{T} = (G, B)$ over $\mho$ is said to be disjoint if

for all $a, b\in B$.

Proposition 2.12. Suppose that $\mathcal{T} = (G, B)$ is a soft set over $\mho$. Then the following are equivalent:

$\rm{(1)} \; \mathcal{T}$ is an injective partition soft set;

$\rm{(2)} \; \mathcal{T}$ is a disjoint covering soft set.

Proof. Suppose that $\mathcal{T} = (G, B)$ is an injective partition soft set over $\mho$. By Definition 9, $\{G(a)\mid a\in B\}$ forms a partition of $\mho$. Thus $\mathcal{T}$ is a covering soft set such that

for all $a, b\in B$. Note also that $\mathcal{T}$ is an injective soft set. Thus for all $a, b\in B$, we have

It follows that $a\ne b$ implies $G(a)\cap G(b) = \varnothing$ for all $a, b\in B$. This shows that $\mathcal{T}$ is a disjoint covering soft set over $\mho$.

Conversely, assume that $\mathcal{T}$ is a disjoint covering soft set over $\mho$. According to Definition 8, $\mathcal{T}$ is both full and serial. Thus we have $\bigcup_{b\in B}G(b) = \mho$ and $G(b)\neq \varnothing$ for all $b\in B$. Since $\mathcal{T}$ is disjoint, we can deduce that $\mathcal{T}$ is an injective soft set such that $G(a)\ne G(b)$ implies $G(a)\cap G(b) = \varnothing$ for all $a, b\in B$. Thus $\{G(a)\mid a\in B\}$ forms a partition of $\mho$. This shows that $\mathcal{T}$ is an injective partition soft set over $\mho$.

2.3.   Rough sets and soft rough sets

Let $\varGamma$ represent an equivalence relation on $\mho$. The pair $(\mho, \varGamma)$ is said to be a Pawlak approximation space ^[37]. For any $\tau_1, \tau_2\in \mho$, if $(\tau_1, \tau_2)\in \varGamma$ we said that $\tau_1$ and $\tau_2$ are $\varGamma$-indiscernible. The equivalence class of $\tau_1\in \mho$ is denoted by $[\tau_1]_\varGamma$. The quotient set of $\mho$ with respect to $\varGamma$ is denoted by $\mho/\varGamma$.

Assume that $\varGamma$ is an equivalence relation on $\mho$ and $\Upsilon$ is a subset of $\mho$. Then $\Upsilon$ can be characterized by means of the following two approximations:

The sets $\varGamma_*\Upsilon$ and $\varGamma^*\Upsilon$ are called the lower and upper approximations of $\Upsilon$ with respect to the approximation space $(\mho, \varGamma)$. We say that the set $\Upsilon$ is definable if $\varGamma_*\Upsilon = \varGamma^*\Upsilon$; otherwise, $\Upsilon$ is said to be rough or inexact.

Furthermore, we can define the positive region, boundary region and negative region of $\Upsilon$ respectively as follows:

Assume that $C = \varGamma_*\Upsilon$ and $D = \varGamma^*\Upsilon$ where $\Upsilon\subseteq \mho$. Sometimes, a rough set can also be represented by the pair $(C, D)\in \mathfrak{P}(\mho)\times \mathfrak{P}(\mho)$. If $\Upsilon$ is defined by a predicate $\mathfrak{H}$ and $\tau\in \mho$, we have the following:

$\bullet \; \tau\in \varGamma_*\Upsilon$ means that $\tau$ certainly has property $\mathfrak{H}$;

$\bullet \; \tau\in \varGamma^*\Upsilon$ means that $\tau$ possibly has property $\mathfrak{H}$;

$\bullet \; \tau\in \text{Neg}_{\varGamma}\Upsilon$ means that $\tau$ definitely does not have property $\mathfrak{H}$.

Feng et al. ^[16] considered the generalization of Pawlak's rough sets based on soft set theory, and put forward the concept of soft rough sets. Different from rough sets based on Pawlak approximation space, soft rough sets are based on the granular structure given by a soft approximation space (SAS). An SAS is an ordered pair $(\mho, \mathcal{T})$, where $\mathcal{T}$ is a soft set over $\mho$. More specifically, the soft lower and upper approximations are defined in the following way:

Definition 2.13. ^[16] Assume that $\mathcal{T} = (G, B)$ is a soft set over $\mho$, $H\subseteq\mho$ and $\mathcal{P} = (\mho, \mathcal{T})$ is a soft approximation space. The soft lower approximation $\underline{apr}_{\mathcal{P}}(H)$ and the soft upper approximation $\overline{apr}_{\mathcal{P}}(H)$ of $H$ with respect to the SAS $\mathcal{P} = (\mho, \mathcal{T})$ are defined as:

When $\underline{apr}_{\mathcal{P}}(H) = \overline{apr}_{\mathcal{P}}(H)$, we say that the set $H$ is soft $\mathcal{P}$-definable; otherwise, $H$ is said to be a soft $\mathcal{P}$-rough set.

Below the concepts given in Definition 2.13 are reformulated:

Proposition 2.14. ^[16] Suppose that $\mathcal{T} = (G, B)$ is a soft set over $\mho$ and $\mathcal{P} = (\mho, \mathcal{T})$ is an SAS. Then

where $H$ is a subset of $\mho$.

Continuing with the framework of Definition 2.13, we recall some useful properties:

Theorem 2.15. ^[14] Assume that $\mathcal{T} = (G, B)$ is a soft set over $\mho$ and $\mathcal{P} = (\mho, \mathcal{T})$ is an SAS. For $H, J\subseteq \mho$, we have

$\rm{(1)} \; \underline{apr}_\mathcal{P}(\varnothing) = \overline{apr}_\mathcal{P}(\varnothing) = \varnothing$;

$\rm{(2)} \; \underline{apr}_\mathcal{P}(\mho) = \overline{apr}_\mathcal{P}(\mho) = \bigcup_{\varrho\in B}G(\varrho)$;

$\rm{(3)} \; H\subseteq J\Rightarrow \underline{apr}_\mathcal{P}(H)\subseteq \underline{apr}_\mathcal{P}(J)$;

$\rm{(4)} \; H\subseteq J\Rightarrow \overline{apr}_\mathcal{P}(H)\subseteq\overline{apr}_\mathcal{P}(J)$;

$\rm{(5)} \; \underline{apr}_\mathcal{P}(H\cap J)\subseteq\underline{apr}_\mathcal{P}(H)\cap \underline{apr}_\mathcal{P}(J)$;

$\rm{(6)} \; \underline{apr}_\mathcal{P}(H\cup J)\supseteq \underline{apr}_\mathcal{P}(H)\cup\underline{apr}_\mathcal{P}(J)$;

$\rm{(7)} \; \overline{apr}_\mathcal{P}(H\cup J) = \overline{apr}_\mathcal{P}(H)\cup \overline{apr}_\mathcal{P}(J)$;

$\rm{(8)} \; \overline{apr}_\mathcal{P}(H\cap J)\subseteq\overline{apr}_\mathcal{P}(H)\cap\overline{apr}_\mathcal{P}(J)$.

Theorem 2.16. ^[16] Suppose that $\mathcal{T}$ is a soft set over $\mho$ and $\mathcal{P} = (\mho, \mathcal{T})$ is an SAS. Then the following are equivalent:

$\rm{(1)} \; \mathcal{T}$ is a full soft set;

$\rm{(2)} \; \underline{apr}_\mathcal{P}(\mho) = \mho$;

$\rm{(3)} \; \overline{apr}_\mathcal{P}(\mho) = \mho$;

$\rm{(4)} \; \Upsilon\subseteq\overline{apr}_\mathcal{P}(\Upsilon)$ for all $\Upsilon\subseteq \mho$;

$\rm{(5)} \; \overline{apr}_\mathcal{P}(\{\tau\})\neq\varnothing$ for all $\tau\in \mho$.

2.4.   Three-way decision

3WD is an uncertain framework based on theory of probability rough sets and decision rough sets. The basic philosophy of 3WD is thinking in threes which means to understand and process a whole through three different and related parts. Based on the trisecting-acting-outcome framework, Yao ^[52] has proposed a generalized 3WD model. Hereinafter, the framework trisecting-acting-outcome is simply named TAO. The TAO model of 3WD concentrates on the following three works:

(1) To divide the universe into three parts;

(2) To take actions on the three parts separately;

(3) To optimize the results and obtain a desirable outcome.

It is clear that the TAO model of 3WD is an interpretative case of thinking in threes. The fundamental notion of 3WD is trisecting the whole. Three parts of trisection can be seen as three different aspects, perspectives or components of the whole and their integration represents and covers the whole. Hence the three parts are both independent and interrelated.

Yao ^[51] introduced a general model for building a trisection with a single evaluation function. In this model, a linearly ordered set $(L, \leq)$ is used as the codomain of an evaluation function, which specifies the scale of the evaluation. Given two evaluation values $n, m\in L$, $n < m$ means $n\leq m$ and $n\neq m$. Moreover, we also write $n < m$ as $m > n$.

Definition 2.17. ^[51] Let $\mathcal{E}:\mho\longrightarrow (L, \leq)$ be an evaluation function on $\mho$. Given two thresholds $\lambda, \mu\in L$ with $\lambda < \mu$, a trisection of $\mho$ can be derived as follows:

Intuitively, we refer to elements in the disjoint sets $\text{Pos}^{[\mu, .)}(\mathcal{E})$, $\text{Bnd}^{(\lambda, \mu)}(\mathcal{E})$ and $\text{Neg}^{(., \lambda]}(\mathcal{E})$ as positive, neutral and negative objects, respectively. The above model plays a fundamental role in constructing set-theoretic models of 3WDs ^[51]. It should be noted that how to select easy-to-understand and meaningful scales is an issue of great importance. In many practical applications, it is sufficient to consider subsets of real numbers as evaluation scales. More specifically, as a special case of Definition 2.17, we have the following notion.

Definition 2.18. ^[54] Suppose that $\mathcal{E}:\mho\longrightarrow [b, a]$ is an evaluation on $\mho$ where $b < a$ are two real numbers. Given two thresholds $\gamma, \delta$ with $b\leq \gamma < \delta\leq a$, a trisection of $\mho$ can be derived as follows:

Elements in the disjoint sets $H^{[\delta, a]}(\mathcal{E})$, $M^{(\gamma, \delta)}(\mathcal{E})$ and $L^{[b, \gamma]}(\mathcal{E})$ are called objects with high, medium and low values, respectively.

To facilitate the reading of this article, the abbreviations of some frequently used terminologies are listed in Table 1.

3.   Mutual representations between HFSs and SSs

In this section, we define some useful concepts including canonical soft sets, unit interval parameterized SSs and derived HFSs. The relationships among these notions are examined in detail.

Definition 3.1. Suppose that $\mathfrak{h}:\mho\rightarrow \mathfrak{P}(I)$ is an HFS. Then

is called the value space of the HFS $\mathfrak{h}$.

In other words, the value space of an HFS is a set containing all possible membership values of objects in $\mho$.

Definition 3.2. Let $\mathfrak{h}:\mho\rightarrow \mathfrak{P}(I)$ be an HFS with its value space $V_\mathfrak{h}$. Then

is called the value coset of $\kappa\in V_\mathfrak{h}$.

Definition 3.3. A soft set $\mathcal{T} = (G, B)$ over $\mho$ is called a unit interval parameterized soft set\, (UIPSS) if $B\subseteq I$.

Definition 3.4. ^[12] Let $\mathcal{T} = (G, B)$ be a soft set over $\mho$ and $\nu\in \mho$. Then

is said to be the parameter coset of the alternative $\nu$ in $G$.

Note that $\mathrm{Co}_{\mathcal{T}}(\nu)$ contains all the parameters of the alternative $\nu$, according to the information carried by $\mathcal{T}$.

Definition 3.5. Let $\mathcal{T} = (G, B)$ be a UIPSS over $\mho$ and $\nu\in \mho$. Then we can define an HFS $\mathfrak{h}_{\mathcal{T}}:\mho\rightarrow \mathfrak{P}(I)$ on $\mho$ by

which is said to be the derived hesitant fuzzy set (DHFS) of the UIPSS $\mathcal{T}$.

Definition 3.6. Let $\mathfrak{h}:\mho\rightarrow \mathfrak{P}(I)$ be an HFS. A soft set $\mathfrak{C}_\mathfrak{h} = (\hat{C}_\mathfrak{h}, V_\mathfrak{h})$ over $\mho$ is called the canonical soft set (CSS) of the HFS $\mathfrak{h}$, where $V_\mathfrak{h} = \bigcup_{\tau\in \mho}\mathfrak{h}(\tau)$ and $\hat{C}_\mathfrak{h}(\kappa) = \mathfrak{h}^{-1}(\kappa)$ for all $\kappa\in V_\mathfrak{h}$.

Example 3.7. Let $\mho = \{\tau_1, \tau_2, \tau_3, \tau_4\}$ and $\mathfrak{h}_1$ be an HFS over $\mho$. Suppose that the HFEs of $\mathfrak{h}_1$ are given by $\mathfrak{h}_1(\tau_1) = \{0.2, 0.4, 0.5\}$, $\mathfrak{h}_1(\tau_2) = \{0.4, 0.5\}$, $\mathfrak{h}_1(\tau_3) = \{0.4, 0.7, 0.8\}$, $\mathfrak{h}_1(\tau_4) = \{0.5, 0.8\}$. By Definition 3.1, the value space of $\mathfrak{h}_1$ is $V_{\mathfrak{h}_1} = \{0.2, 0.4, 0.5, 0.7, 0.8\} = V_1$. According to Definition 3.2, the value cosets of $\mathfrak{h}_1$ can be computed. The obtained results are $\mathfrak{h}_1^{-1}(0.2) = \{\tau_1\}$, $\mathfrak{h}_1^{-1}(0.4) = \{\tau_1, \tau_2, \tau_3\}$, $\mathfrak{h}_1^{-1}(0.5) = \{\tau_1, \tau_2, \tau_4\}$, $\mathfrak{h}_1^{-1}(0.7) = \{\tau_3\}$ and $\mathfrak{h}_1^{-1}(0.8) = \{\tau_3, \tau_4\}$. The CSS $\mathfrak{C}_{\mathfrak{h}_1} = (\mathfrak{h}_1^{-1}, V_1)$ of the HFS $\mathfrak{h}_1$ is shown in Table 2.

The following result shows an explicit mutual connection between UIPSSs and HFSs:

Theorem 3.8. Assume that $\mathcal{T} = (G, B)$ is a serial UIPSS over $\mho$ and $\mathfrak{h}_{\mathcal{T}}:\mho \rightarrow \mathfrak{P}(I)$ is the DHFS of $\mathcal{T}$. Then we have $\mathfrak{C}_{\mathfrak{h}_{\mathcal{T}}} = \mathcal{T}$, where $\mathfrak{C}_{\mathfrak{h}_{\mathcal{T}}}$ is the CSS of $\mathfrak{h}_{\mathcal{T}}$.

Proof. Let $\mathcal{T} = (G, B)$ be a serial UIPSS over $\mho$ and $\mathfrak{h}_{\mathcal{T}}:\mho \rightarrow \mathfrak{P}(I)$ be the DHFS of $\mathcal{T}$. By Definition 3.5, the DHFS $\mathfrak{h}_{\mathcal{T}}$ of $\mathcal{T}$ is given by $\mathfrak{h}_{\mathcal{T}}(\nu) = \mathrm{Co}_{\mathcal{T}}(\nu) = \{\varrho\in B:\nu\in G(\varrho)\}$ with $\nu\in \mho$. Then according to Definition 3.6, the CSS of $\mathfrak{h}_{\mathcal{T}}$ is a UIPSS $\mathfrak{C}_{\mathfrak{h}_{\mathcal{T}}} = (\hat{C}_{\mathfrak{h}_{\mathcal{T}}}, V_{\mathfrak{h}_{\mathcal{T}}})$ over $\mho$ and $\hat{C}_{\mathfrak{h}_{\mathcal{T}}}(\kappa) = \mathfrak{h}_{\mathcal{T}}^{-1}(\kappa)$ for all $\kappa\in V_{\mathfrak{h}_{\mathcal{T}}}$.

Firstly, we prove $V_{\mathfrak{h}_{\mathcal{T}}} = B$. By Definition 3.1, we have $V_{\mathfrak{h}_{\mathcal{T}}} = \bigcup_{\nu\in \mho}\mathfrak{h}_{\mathcal{T}}(\nu)$. For any $\kappa\in V_{\mathfrak{h}_{\mathcal{T}}}$, there exist a $\nu_0\in \mho$ such that $\kappa\in \mathfrak{h}_{\mathcal{T}}(\nu_0)$. It is clear that $\kappa\in \mathrm{Co}_{\mathcal{T}}(\nu_0)$ such that $\kappa\in B$. Hence we have $V_{\mathfrak{h}_{\mathcal{T}}}\subseteq B$. Conversely, assume that $\mathcal{T} = (G, B)$ is a serial UIPSS. By Definition 6, we have $G(\varrho)\ne \varnothing$ for any $\varrho\in B$. This means that for any $\varrho\in B$ there exist a $\nu_0\in \mho$ such that $\nu_0\in G(\varrho)$. Then, by definition, we have $\varrho\in \mathrm{Co}_{\mathcal{T}}(\nu_0)$ and then $\varrho\in \mathfrak{h}_{\mathcal{T}}(\nu_0)$. It is clear that $\varrho\in V_{\mathfrak{h}_{\mathcal{T}}}$ for any $\varrho\in B$. Thus we have $B\subseteq V_{\mathfrak{h}_{\mathcal{T}}}$. We have proved $V_{\mathfrak{h}_{\mathcal{T}}} = B$.

Then we prove $\hat{C}_{\mathfrak{h}_{\mathcal{T}}}(\kappa) = G(\kappa)$ for any $\kappa\in V_{\mathfrak{h}_{\mathcal{T}}} = B$. Assume that $\nu_0\in G(\kappa)$ for any $\kappa\in B$. According to Definition 3.5, we have $\kappa\in \mathfrak{h}_{\mathcal{T}}(\nu_0)$. Then, by Definition 3.2, we have $\nu_0\in \mathfrak{h}_{\mathcal{T}}^{-1}(\kappa)$. So it is easy to see $\nu_0\in \hat{C}_{\mathfrak{h}_{\mathcal{T}}}(\kappa)$. Hence we have proved that $G(\kappa)\subseteq \hat{C}_{\mathfrak{h}_{\mathcal{T}}}(\kappa)$ for any $\kappa\in B$. Conversely, Assume that $\nu_0\in \hat{C}_{\mathfrak{h}_{\mathcal{T}}}(\kappa)$. From the definition of CSSs, we have $\nu_0\in \mathfrak{h}_{\mathcal{T}}^{-1}(\kappa)$. Then by definition of value coset, we have $\kappa\in \mathfrak{h}_{\mathcal{T}}(\nu_0)$ and then $\kappa\in \mathrm{Co}_{\mathcal{T}}(\nu_0)$. So it is easy to see $\nu_0\in G(\kappa)$. Thus we have proved that $\hat{C}_{\mathfrak{h}_{\mathcal{T}}}(\kappa)\subseteq G(\kappa)$ for any $\kappa\in B$. We have proved that $\hat{C}_{\mathfrak{h}_{\mathcal{T}}}(\kappa) = G(\kappa)$ established for any $\kappa\in {V_{\mathfrak{h}_{\mathcal{T}}} = B}$. Hence, we conclude that $\mathfrak{C}_{\mathfrak{h}_{\mathcal{T}}} = \mathcal{T}$, which completes the proof.

It should be noted that $\mathfrak{C}_{\mathfrak{h}_{\mathcal{T}}} = \mathcal{T}$ might not hold when the UIPSS $\mathcal{T}$ is not serial. To demonstrate this, let us consider the following example.

Example 3.9. Let $\mho = \{\tau_1, \tau_2, \tau_3, \tau_4\}$ and $\mathcal{T} = (G, B)$ be an UIPSS over $\mho$. The parameter set of $\mathcal{T}$ is $B = \{0.1, 0.5, 0.7, 0.9, 1\}$ and the approximate function of $\mathcal{T}$ is given by $G(0.1) = \{\tau_1, \tau_4\}$, $G(0.5) = \{\tau_1, \tau_2, \tau_3\}$, $G(0.7) = \{\tau_1, \tau_2, \tau_4\}$, $G(0.9) = \{\tau_3, \tau_4\}$ and $G(1) = \varnothing$. The tabular representation of $\mathcal{T}$ is shown in Table 3. By Definition 3.5, the DHFS $\mathfrak{h}_{\mathcal{T}}$ of $\mathcal{T}$ is an HFS with its HFEs given by: $\mathfrak{h}_{\mathcal{T}}(\tau_1) = \{0.1, 0.5, 0.7\}$, $\mathfrak{h}_{\mathcal{T}}(\tau_2) = \{0.5, 0.7\}$, $\mathfrak{h}_{\mathcal{T}}(\tau_3) = \{0.5, 0.9\}$ and $\mathfrak{h}_{\mathcal{T}}(\tau_4) = \{0.1, 0.7, 0.9\}$. According to Definition 3.6, we can obtain the CSS $\mathfrak{C}_{\mathfrak{h}_{\mathcal{T}}} = (\hat{C}_{\mathfrak{h}_{\mathcal{T}}}, V_{\mathfrak{h}_{\mathcal{T}}})$ of the DHFS $\mathfrak{h}_{\mathcal{T}}$, which is shown in Table 4. As we know, the parameter set $V_{\mathfrak{h}_{\mathcal{T}}}$ of $\mathfrak{C}_{\mathfrak{h}_{\mathcal{T}}}$ is the value space of the DHFS $\mathfrak{h}_{\mathcal{T}}$. It is clear that

This shows that $\mathfrak{C}_{\mathfrak{h}_{\mathcal{T}}}\ne \mathcal{T}$ if $\mathcal{T}$ is not a serial UIPSS.

Theorem 3.10. Suppose that $\mathfrak{h}$ is an HFS on $\mho$ and $\mathfrak{C}_\mathfrak{h} = (\hat{C}_\mathfrak{h}, V_\mathfrak{h})$ is the CSS of $\mathfrak{h}$. Then we have $\mathfrak{h}_{\mathfrak{C}_\mathfrak{h}} = \mathfrak{h}$, where $\mathfrak{h}_{\mathfrak{C}_\mathfrak{h}}$ is the DHFS of $\mathfrak{C}_{\mathfrak{h}}$.

Proof. Let $\mathfrak{h}:\mho\rightarrow \mathfrak{P}(I)$ be an HFS on $\mho$ and $\mathfrak{C}_\mathfrak{h} = (\hat{C}_\mathfrak{h}, V_\mathfrak{h})$ be the CSS of $\mathfrak{h}$. By Definition 3.6, $\mathfrak{C}_\mathfrak{h}$ is an UIPSS and $\hat{C}_\mathfrak{h}(a) = \mathfrak{h}^{-1}(a)$ for all $a\in V_\mathfrak{h}$. Let $\mathfrak{h}_{\mathfrak{C}_\mathfrak{h}}$ be the DHFS of $\mathfrak{C}_{\mathfrak{h}}$ and be given by $\mathfrak{h}_{\mathfrak{C}_\mathfrak{h}}(\nu) = \mathrm{Co}_{\mathfrak{C}_\mathfrak{h}}(\nu) = \{a\in V_\mathfrak{h}:\nu\in {\hat{C}_\mathfrak{h}}(a)\}$.

Assume that $a\in \mathfrak{h}(\nu_0)$ for any $\nu_0\in \mho$. By Definition 3.2, it is clear that $\nu_0\in \mathfrak{h}^{-1}(a)$. Then we have $\nu_0\in \hat{C}_\mathfrak{h}(a)$. From the definition of DHFS, it is easy to see $a\in \mathfrak{h}_{\mathfrak{C}_\mathfrak{h}}(\nu_0)$. Thus we have $\mathfrak{h}(\nu_0)\subseteq \mathfrak{h}_{\mathfrak{C}_\mathfrak{h}}(\nu_0)$ for any $\nu_0\in \mho$. Conversely, assume that $a\in \mathfrak{h}_{\mathfrak{C}_\mathfrak{h}}(\nu_0)$. By definition of DHFS, we have $\nu_0\in {\hat{C}_\mathfrak{h}}(a)$ which also show that $\nu_0\in \mathfrak{h}^{-1}(a)$. From the definition of value cosets, it is easy to see that $a\in \mathfrak{h}(\nu_0)$. Thus we have $\mathfrak{h}_{\mathfrak{C}_\mathfrak{h}}(\nu_0)\subseteq \mathfrak{h}(\nu_0)$ for any $\nu_0\in \mho$. We have proved that $\mathfrak{h}_{\mathfrak{C}_\mathfrak{h}}(\nu_0) = \mathfrak{h}(\nu_0)$ for any $\nu_0\in \mho$.

The following result presents some characterizations of RHFSs in terms of their CSSs.

Theorem 3.11. Assume that $\mathfrak{h}$ is an HFS on $\mho$ with its CSS $\mathfrak{C}_{\mathfrak{h}} = (\hat{C}_{\mathfrak{h}}, V_{\mathfrak{h}})$. Then the following are equivalent:

$\rm{(1)} \; \mathfrak{h}$ is an RHFS;

$\rm{(2)} \; \mathfrak{C}_{\mathfrak{h}}$ is a full soft set;

$\rm{(3)} \; \mathfrak{C}_{\mathfrak{h}}$ is a covering soft set.

Proof. Firstly, we show that (1) implies (2). Assume that $\mathfrak{h}$ is an RHFS. For every $u\in \mho$, $\mathfrak{h}(u)$ is non-empty, whence there exists $\alpha\in \mathfrak{h}(u)$. That is, $u\in \hat{C}_{\mathfrak{h}}(\alpha)$ for some $\alpha\in V_{\mathfrak{h}}$. Thus $\mho\subseteq\bigcup_{\alpha\in V_{\mathfrak{h}}}\hat{C}_{\mathfrak{h}}(\alpha)$. Clearly, we also have $\bigcup_{\alpha\in V_{\mathfrak{h}}}\hat{C}_{\mathfrak{h}}(\alpha)\subseteq \mho$. Thus $\bigcup_{\alpha\in V_{\mathfrak{h}}}\hat{C}_{\mathfrak{h}}(\alpha) = \mho$. Therefore, $\mathfrak{C}_{\mathfrak{h}} = (\hat{C}_{\mathfrak{h}}, V_{\mathfrak{h}})$ is a full soft set over $\mho$.

Next, assume that $\mathfrak{C}_{\mathfrak{h}} = (\hat{C}_{\mathfrak{h}}, V_{\mathfrak{h}})$ is a full soft set. To prove that $\mathfrak{C}_{\mathfrak{h}}$ is a covering soft set, we only need to show that $\hat{C}_{\mathfrak{h}}(\alpha)\neq\varnothing$ for all $\alpha\in V_{\mathfrak{h}}$. In fact, let $\alpha\in V_{\mathfrak{h}}$. Then we have $\alpha\in \mathfrak{h}(u)$ for some $u\in \mho$. Hence, $\hat{C}_{\mathfrak{h}}(\alpha)$ is non-empty since $u\in \hat{C}_{\mathfrak{h}}(\alpha)$. This shows that (2) implies (3).

Lastly, we show that (3) implies (1). Assume that $\mathfrak{C}_{\mathfrak{h}} = (\hat{C}_{\mathfrak{h}}, V_{\mathfrak{h}})$ is a covering soft set. By Definition 8, $\mathfrak{C}_{\mathfrak{h}}$ is a full soft set over $\mho$. Thus we have $\bigcup_{\alpha\in V_{\mathfrak{h}}}\hat{C}_{\mathfrak{h}}(\alpha) = \mho$. Therefore, there exists $\alpha\in V_{\mathfrak{h}}$ with $u\in \hat{C}_{\mathfrak{h}}(\alpha)$ for all $u\in \mho$. It follows that $\mathfrak{h}(u)$ is non-empty since $\alpha\in \mathfrak{h}(u)$. That is, $\mathfrak{h}$ is an RHFS.

At the end of this section, we give several interesting characterizations of fuzzy sets by virtue of CSSs of HFSs.

Theorem 3.12. Let $\mathfrak{h}$ be an HFS on $\mho$ with its CSS $\mathfrak{C}_{\mathfrak{h}} = (\hat{C}_{\mathfrak{h}}, V_{\mathfrak{h}})$. Then the following are equivalent:

$\rm{(1)} \; \mathfrak{h}$ is a fuzzy set;

$\rm{(2)} \; \mathfrak{h}(\tau)$ is a singleton for all $\tau\in \mho$;

$\rm{(3)} \; \mathfrak{C}_{\mathfrak{h}}$ is a disjoint full soft set;

$\rm{(4)} \; \mathfrak{C}_{\mathfrak{h}}$ is a disjoint covering soft set;

$\rm{(5)} \; \mathfrak{C}_{\mathfrak{h}}$ is an injective partition soft set.

Proof. Note first that $\mathfrak{h}$ is a fuzzy set if and only if $|\mathfrak{h}(\tau)| = 1$ for all $\tau\in \mho$. Thus it is clear that (1) and (2) are equivalent.

Next, assume that $\mathfrak{h}(\tau)$ is a singleton for all $\tau\in \mho$. It is obvious that $\mathfrak{h}$ is an RHFS since $|\mathfrak{h}(\tau)| = 1$ for all $\tau\in \mho$. According to Theorem 3.11, it follows that the CSS $\mathfrak{C}_{\mathfrak{h}} = (\hat{C}_{\mathfrak{h}}, V_{\mathfrak{h}})$ of the HFS $\mathfrak{h}$ is a full soft set. We can also show that $\mathfrak{C}_{\mathfrak{h}}$ is a disjoint soft set. In fact, assume that there exist $\kappa_1, \kappa_2\in V_\mathfrak{h}$ such that $\kappa_1\neq \kappa_2$ and $\mathfrak{h}^{-1}(\kappa_1)\cap \mathfrak{h}^{-1}(\kappa_2)\ne\varnothing$. Take $\tau_0\in \mathfrak{h}^{-1}(\kappa_1)\cap\mathfrak{h}^{-1}(\kappa_2)$. Then we have $\{\kappa_1, \kappa_2\}\subseteq\mathfrak{h}(\tau_0)$. Note also that $\kappa_1\ne \kappa_2$. It follows that $|\mathfrak{h}(\tau_0)|\ge 2$, which leads to a contradiction. Therefore, $\mathfrak{C}_{\mathfrak{h}}$ is a disjoint full soft set. Conversely, suppose that $\mathfrak{C}_{\mathfrak{h}} = (\hat{C}_{\mathfrak{h}}, V_{\mathfrak{h}})$ is a disjoint full soft set. From Definition 2.11, it follows that $\kappa_1\ne \kappa_2$ implies $\mathfrak{h}^{-1}(\kappa_1)\cap \mathfrak{h}^{-1}(\kappa_2) = \varnothing$ for all $\kappa_1, \kappa_2\in V_\mathfrak{h}$. This means that $|\mathfrak{h}(\tau)|\le 1$ for all $\tau\in \mho$. Since $\mathfrak{C}_{\mathfrak{h}}$ is also a full soft set, it follows from Theorem 3.11 that $\mathfrak{h}$ is an RHFS. Hence, $|\mathfrak{h}(\tau)|\ge 1$ for all $\tau\in \mho$. Therefore, $\mathfrak{h}(\tau)$ is a singleton for all $\tau\in \mho$. This shows that (2) and (3) are equivalent.

According to Theorem 3.11, it can be seen that the CSS $\mathfrak{C}_{\mathfrak{h}}$ is a full soft set if and only if it is a covering soft set. This implies that (3) and (4) are equivalent.

In addition, it follows from Proposition 2.12 that (4) and (5) are equivalent.

4.   A novel 3WD model

The purpose of this section is to state a novel 3WD algorithm with potential to help us in decision-making with hesitant fuzzy information. This strategy will benefit from the novel idea of CSSs associated with HFSs.

4.1.   Soft approximations based on HFSs

Suppose that $\mathfrak{h}$ is an HFS and $\mathfrak{C}_{\mathfrak{h}} = (\hat{C}_{\mathfrak{h}}, V_{\mathfrak{h}})$ is its CSS. Then $P = (\mho, \mathfrak{C}_{\mathfrak{h}})$ forms an SAS. According to Definition 2.13, we state the soft lower and upper approximations as:

where $\Upsilon$ is a subset of $\mho$.

Furthermore, the positive, boundary and the negative regions of $\Upsilon$ can be defined from $\mathfrak{h}$ as follows:

Example 4.1. Suppose that a transport company intends to deliver a batch of relief supplies to the disaster area. There are four available transport modes $\mho = \{\tau_1, \tau_2, \tau_3, \tau_4\}$. The meaning of the objects in $\mho$ is given as below:

$\bullet \; \tau_1$: highway transportation;

$\bullet \; \tau_2$: air transportation;

$\bullet \; \tau_3$: railway transportation;

$\bullet \; \tau_4$: sea transportation.

The transportation company invites several experts to evaluate the four methods of transportation and take into account factors such as time, cost and weather. Based on the evaluation results, an HFS $\mathfrak{h}_{2}$ is constructed. Assume that the $\mathfrak{h}_{2}$ is given by $\mathfrak{h}_{2}({\tau_1}) = \{0.4, 0.8\}$, $\mathfrak{h}_{2}({\tau_2}) = \{0.6, 0.8, 1\}$, $\mathfrak{h}_{2}({\tau_3}) = \{0.2, 0.4, 0.8\}$, $\mathfrak{h}_{2}({\tau_4}) = \{0, 0.2\}$. It is easy to see that

is the value space of $\mathfrak{h}_{2}$. By Definition 3.6, we can establish the CSS $\mathfrak{C}_{\mathfrak{h}_{2}} = (\mathfrak{h}_{2}^{-1}, V_2)$ of HFS $\mathfrak{h}_{2}$. The obtained results are shown in Table 5.

Let $P = (\mho, \mathfrak{C}_{\mathfrak{h}_{2}})$ be the corresponding SAS. For $\Upsilon = \{\tau_1, \tau_2\}\subseteq \mho$, the soft lower approximation of $\Upsilon$ is

and the soft upper approximation of $\Upsilon$ is

Moreover, we can obtain the positive region $\text{Pos}_{\mathfrak{h}_{2}}(\Upsilon) = \underline{\Upsilon}_{\mathfrak{h}_{2}} = \{\tau_2\}$, the negative region $\text{Neg}_{\mathfrak{h}_{2}}(\Upsilon) = \mho-\overline{\Upsilon}_{\mathfrak{h}_{2}} = \{\tau_4\}$ and the boundary region $\text{Bnd}_{\mathfrak{h}_{2}}(\Upsilon) = \overline{\Upsilon}_{\mathfrak{h}_{2}}-\underline{\Upsilon}_{\mathfrak{h}_{2}} = \{\tau_1, \tau_3\}$. These results indicate that the air transportation is the best choice for this task while the sea transportation should not be considered.

The next result simplifies the computation of the soft upper approximations of singletons. Notice that their soft lower approximations are quite trivial: $\forall \tau_i\in\mho$, $\underline{\{\tau_i\}} = \{\tau_i\}$ if and only if $\hat{C}_\mathfrak{h}(\kappa) = \{\tau_i\}$ for some $\kappa\in V_\mathfrak{h}$; otherwise, $\underline{\{\tau_i\}} = \varnothing$.

Proposition 4.2. Let $\mathfrak{h}$ be an HFS on $\mho$ and $\mathfrak{C}_{\mathfrak{h}} = (\hat{C}_{\mathfrak{h}}, V_{\mathfrak{h}})$ be the CSS of $\mathfrak{h}$. For every $\tau_i\in\mho$, the soft upper approximation of $\{\tau_i\}$ can be calculated by

Proof. According to Eq (4.2), we immediately have $\overline{\{\tau_i\}}_\mathfrak{h} = \bigcup_{\kappa\in V_\mathfrak{h}} \{\hat{C}_\mathfrak{h}(\kappa)\mid \hat{C}_\mathfrak{h}(\kappa)\cap \{\tau_i\}\neq \varnothing\}$. By Definition 3.2 and Definition 3.6, we can deduce that

It follows that $\overline{\{\tau_i\}}_\mathfrak{h} = \bigcup_{\kappa\in \mathfrak{h}(\tau_i)}\mathfrak{h}^{-1}(\kappa)$, which completes the proof.

4.2.   A 3WD method with CSSs of HFSs

Suppose there is a director who is in charge of a group of specialists. All the specialists are requested to evaluate each alternative in a universe of discourse $\mho = \{\tau_1, \tau_2, \cdots, \tau_n\}$. For the sake of simplicity, we assume that the evaluation scores given by the experts are chosen from the unit interval [0, 1], and a higher score means a more positive evaluation on the concerned alternative. Based on these evaluation results, an HFS $\mathfrak{h}$ can be constructed on $\mho$, which stores the decision information collected from the group of specialists. After checking the evaluation from the expert group, the director select several alternatives in $\mho$ to form a pre-decision set $R$. In this 3WD process, the main purpose is to derive a trisection of $\mho$ as a general consensus among all the specialists together with the director. In the following, we present a novel approach for solving 3WD problems by virtue of HFSs and their CSSs.

Firstly, we can transform the HFS $\mathfrak{h}$ into its CSS $\mathfrak{C}_{\mathfrak{h}} = (\hat{C}_{\mathfrak{h}}, V_{\mathfrak{h}})$. Using the CSS $\mathfrak{C}_{\mathfrak{h}}$, we construct an SAS $\mathcal{P} = (\mho, \mathfrak{C}_\mathfrak{h})$. Based on the SAS $\mathcal{P}$, we can calculate the soft upper approximations $\overline{\{\tau_i\}}_\mathfrak{h}$ of each alternative $\tau_i\in\mho$ ($i = 1, 2, \cdots, n$) according to Eq (4.3). It should be noted that $\overline{\{\tau_i\}}_\mathfrak{h}$ can be interpreted as the set of alternatives in $\mho$ which have at least one evaluation score in common with the alternative $\tau_i$.

Secondly, we should select an appropriate evaluation function $\mathcal{E}:\mho\longrightarrow [0, 1]$ which plays a core role in 3WD process. As pointed out by Hu ^[22], a cogent evaluation function should satisfy the monotonicity axiom. In other words, an alternative with higher value of evaluation function is considered to be more positive than an alternative with lower value. Actually, this can also be seen from the trisection as given in Definition 2.17. Furthermore, it is more reasonable and flexible for us to consider the following two cases when addressing decision-making problems in real-world scenarios:

$\bullet$ The director would like to select favorable alternatives in $\mho$ to form a positive pre-decision set $R$;

$\bullet$ The director would like to select rejective alternatives in $\mho$ to form a negative pre-decision set $R$.

In light of the above-mentioned issues, we define the evaluation function as follows:

where $\tau_i\in\mho$ ($i = 1, 2, \cdots, n$), "$\setminus$" denotes the set difference operation and $R$ is the pre-decision set.

Finally, given two thresholds $\gamma, \delta$ with $0\leq \gamma < \delta\leq 1$, we can obtain the trisection of all alternatives in $\mho$ as follows:

The alternatives in high value region $H^{[\delta, 1]}(\mathcal{E})$ should be accepted. The alternatives in medium value region $M^{(\gamma, \delta)}(\mathcal{E})$ need further consideration. The alternatives in low value region $L^{[0, \gamma]}(\mathcal{E})$ should be rejected. The complete process of the proposed method is summarized as Algorithm 1 in Table 6.

5.   An illustrative example

To confirm the reliability of the proposed 3WD method with CSSs of HFSs, we consider an example regarding peer review of research papers given as follows.

In the peer-review process of academic papers, each manuscript is reviewed by a group of referees who are professional in the field of their expertise. The reviewers are usually invited by an Associate Editor of an academic journal. Based on the comments from all the reviewers and the Associate Editor, the Editor-in-Chief can make a final decision to accept, revise or reject the manuscript.

Suppose that an Associate Editor of an academic journal is in charge of the review process of seven research papers. These articles constitute the universe of discourse $\mho = \{\tau_1, \tau_2, \cdots, \tau_7\}$. In this context, it is cleat that the Associate Editor serves as the director of the expert group constituted by several reviewers. For simplicity, we assume that the Associate Editor invites three referees to review each paper in $\mho$ and give their evaluation scores valued in the unit interval [0, 1]. Clearly, a higher score reflects a better evaluation on the reviewed paper. Based on the evaluation scores given by three referees, we can construct an HFS $\mathfrak{h}$ on $\mho$, which is a $3$-THFS by Definition 4. Assume that the HFEs of $\mathfrak{h}$ are given by $\mathfrak{h}(\tau_1) = \{0.1, 0.3, 0.5\}$, $\mathfrak{h}(\tau_2) = \{0.5, 0.6, 0.7\}$, $\mathfrak{h}(\tau_3) = \{0.1, 0.2, 0.4\}$, $\mathfrak{h}(\tau_4) = \{0.4, 0.5, 0.7\}$, $\mathfrak{h}(\tau_5) = \{0.3, 0.6, 0.7\}$, $\mathfrak{h}(\tau_6) = \{0.6, 0.7, 0.9\}$ and $\mathfrak{h}(\tau_7) = \{0.6, 0.8, 0.9\}$. The membership grades in the HFE $\mathfrak{h}(\tau_i)$ ($i = 1, 2, \cdots, 7$) represent the scores given by three reviewers. After checking all these manuscripts and related review comments, the Associate Editor chooses three papers in $\mho$ to form a negative pre-decision set $R = \{\tau_1, \tau_3, \tau_4\}$. This means that the Associate Editor intends to reject papers $\tau_1$, $\tau_3$ and $\tau_4$.

In the following, we demonstrate how to help the Editor-in-Chief to achieve a general consensus among all the reviewers and the Associate Editor so as to make final decisions on seven papers by using Algorithm 1.

Step 1. Based on Definition 3.6, we first transform the $3$-THFS $\mathfrak{h}$ into its CSS $\mathfrak{C}_{\mathfrak{h}} = (\hat{C}_{\mathfrak{h}}, V_{\mathfrak{h}})$ as shown in Table 7. It is easy to see that

By Definition 3.2, we can compute the value cosets of all evaluation scores in $V_\mathfrak{h}$. The obtained results are as follows: $\mathfrak{h}^{-1}(0.1) = \{\tau_1, \tau_3\}$, $\mathfrak{h}^{-1}(0.2) = \{\tau_3\}$, $\mathfrak{h}^{-1}(0.3) = \{\tau_1, \tau_5\}$, $\mathfrak{h}^{-1}(0.4) = \{\tau_3, \tau_4\}$, $\mathfrak{h}^{-1}(0.5) = \{\tau_1, \tau_2, \tau_4\}$, $\mathfrak{h}^{-1}(0.6) = \{\tau_2, \tau_5, \tau_6, \tau_7\}$, $\mathfrak{h}^{-1}(0.7) = \{\tau_2, \tau_4, \tau_5, \tau_6\}$, $\mathfrak{h}^{-1}(0.8) = \{\tau_7\}$ and $\mathfrak{h}^{-1}(0.9) = \{\tau_6, \tau_7\}$. It should be noted that the approximation function of the CSS $\mathfrak{C}_{\mathfrak{h}}$ is specified by these value cosets.

Step 2. Using the CSS $\mathfrak{C}_{\mathfrak{h}} = (\hat{C}_{\mathfrak{h}}, V_{\mathfrak{h}})$, we can construct an SAS $\mathcal{P} = (\mho, \mathfrak{C}_{\mathfrak{h}})$. By Eq (4.3), the soft upper approximations $\overline{\{\tau_i\}}_\mathfrak{h}$ of each paper $\tau_i\in \mho \; (i = 1, 2, \cdots, 7)$ with respect to the SAS $\mathcal{P} = (\mho, \mathfrak{C}_{\mathfrak{h}})$ can be calculated as follows:

The first equality $\overline{\{\tau_1\}}_\mathfrak{h} = \{\tau_1, \tau_2, \tau_3, \tau_4, \tau_5\}$ indicates that the papers $\tau_1$, $\tau_2$, $\tau_3$, $\tau_4$, $\tau_5$ have at least one evaluation score in common with the paper $\tau_1$. Also, it can be seen that the papers $\tau_1$, $\tau_2$, $\tau_4$, $\tau_5$, $\tau_6$, $\tau_7$ have at least one evaluation score in common with the paper $\tau_2$, since we have $\overline{\{\tau_2\}}_\mathfrak{h} = \{\tau_1, \tau_2, \tau_4, \tau_5, \tau_6, \tau_7\}$. The rest of the above results can be explained in a similar fashion.

Step 3.Now, let us consider the evaluation function $\mathcal{E}:\mho\longrightarrow [0, 1]$ in this particular case. It is clear that the pre-decision set $R = \{\tau_1, \tau_3, \tau_4\}$ is negative since it contains the papers that the Associate Editor intends to reject. According to Eq (4.4), we calculate the evaluation values $\mathcal{E}(\tau_i)$ of each paper $\tau_i\in \mho \; (i = 1, 2, \cdots, 7)$ as follows:

In this context, the evaluation value $\mathcal{E}(\tau_i)$ can be interpreted as the proportion of papers in $\overline{\{\tau_i\}}_\mathfrak{h}$ which are not rejected by the Associate Editor. For instance, the evaluation value $\mathcal{E}(\tau_1) = 0.4$ shows that 40% of the papers which have at least one evaluation score in common with $\tau_1$ are not rejected by the Associate Editor. Based on the evaluation values, we can rank $\tau_i$ and $\tau_j$ as follows:

$\bullet \; \tau_i\succ\tau_j$ if and only if $\mathcal{E}(\tau_i) > \mathcal{E}(\tau_j)$;

$\bullet \; \tau_i\prec\tau_j$ if and only if $\mathcal{E}(\tau_i) < \mathcal{E}(\tau_j)$;

$\bullet \; \tau_i\approx\tau_j$ if and only if $\mathcal{E}(\tau_i) = \mathcal{E}(\tau_j)$.

Specifically, we have the following ranking of all the papers:

Step 4. Next, we need to select a pair of thresholds $\gamma, \delta$ from the unit interval [0, 1] with $\gamma < \delta$. These thresholds are used to attain the trisection of the universe of discourse. In this problem, we choose $\gamma = 0.4$ and $\delta = 0.7$ as the low and high thresholds, respectively.

Step 5. Based on the evaluation values and the thresholds, we can obtain the trisection of all the papers in $\mho$ as follows:

$\rm{(1)}$ High value region: $H^{[0.7, 1]}(\mathcal{E}) = \{\tau_6, \tau_7\}$;

$\rm{(2)}$ Medium value region: $M^{(0.4, 0.7)}(\mathcal{E}) = \{\tau_2, \tau_4, \tau_5\}$;

$\rm{(3)}$ Low value region: $L^{[0, 0.4]}(\mathcal{E}) = \{\tau_1, \tau_3\}$.

Step 6. It can be seen that the above results are obtained by taking into account both the evaluation scores given by three referees and the pre-decision provided by the Associate Editor. According to the obtained trisection, the Editor-in-Chief is advised to make the final decision regarding papers in $\mho$ as follows:

$\rm{(1)}$ The papers $\tau_6, \tau_7$ in high value region $H^{[0.7, 1]}(\mathcal{E})$ should be accepted;

$\rm{(2)}$ The papers $\tau_2, \tau_4, \tau_5$ in medium value region $M^{(0.4, 0.7)}(\mathcal{E})$ should be revised;

$\rm{(3)}$ The papers $\tau_1, \tau_3$ in low value region $L^{[0, 0.4]}(\mathcal{E})$ should be rejected.

6.   Conclusions

We defined the unit interval parameterized SS, CSS and derived HFS in this study. With the proposed notions, mutual representations between HFSs and SSs have been investigated. By transforming an HFS into its CSS, we developed a soft rough model based on HFSs. By virtue of this soft rough model, a novel 3WD method has been proposed for solving decision-making problems with hesitant fuzzy information. A numerical example was presented to illustrate the validity and feasibility of our 3WD method. It has shown that the proposed approach achieved a general consensus between the expert group and the director. In the future, we will further explore other potential applications of CSSs and examine more properties of HFSs from the perspective of SSs. In addition, it would be interesting to discover inner connections between probabilistic HFSs ^[57] and probabilistic SSs ^[11] by using similar techniques. These links might prompt new 3WD techniques in the context of group decision-making with partial memberships, hesitation, and probabilistic information.

Acknowledgments

The authors are highly grateful to the anonymous referees for their valuable comments and suggestions. This work was partially supported by the National Natural Science Foundation of China [Grant No. 11301415], the Shaanxi Provincial Key Research and Development Program [Grant No. 2021SF-480], and the Natural Science Basic Research Plan in Shaanxi Province of China [Grant No. 2018JM1054].

Conflict of interest

The authors declare no conflict of interest.