#### Abstract

Molodtsov’s soft set theory is a newly emerging mathematical tool to handle uncertainty. However, the classical soft sets are not appropriate to deal with imprecise and fuzzy parameters. This paper aims to extend the classical soft sets to hesitant fuzzy soft sets which are combined by the soft sets and hesitant fuzzy sets. Then, the complement, “AND”, “OR”, union and intersection operations are defined on hesitant fuzzy soft sets. The basic properties such as DeMorgan’s laws and the relevant laws of hesitant fuzzy soft sets are proved. Finally, with the help of level soft set, the hesitant fuzzy soft sets are applied to a decision making problem and the effectiveness is proved by a numerical example.

#### 1. Introduction

In the real world, there are many complicated problems in economics, engineering, environment, social science, and management science. They are characterized with uncertainty, imprecision, and vagueness. We cannot successfully utilize the classical methods to deal with these problems because there are various types of uncertainties involved in these problems. Moreover, though there are many theories, such as theory of probability, theory of fuzzy sets, theory of interval mathematics, and theory of rough sets to be considered as mathematical tools to deal with uncertainties, Molodtsov [1] pointed out all these theories had their own limitations. Moreover, in order to overcome these difficulties, Molodtsov [1] firstly proposed a new mathematical tool named soft set theory to deal with uncertainty and imprecision. This theory has been demonstrated to be a useful tool in many applications such as decision making, measurement theory, and game theory.

The soft set model can be combined with other mathematical models. Maji et al. [2] firstly presented the concept of fuzzy soft set by combining the theories of fuzzy set and soft set together. Furthermore, Maji et al. [3–5] established the notion of intuitionistic fuzzy soft set which was based on a combination of the intuitionistic fuzzy set [6, 7] and soft set models. By combining the interval-valued fuzzy set [8, 9] and soft set, Yang et al. [10] presented the concept of the interval-valued fuzzy soft set. Jiang et al. [11] initiated the concept of interval-valued intuitionistic fuzzy soft sets as an interval-valued fuzzy extension of the intuitionistic fuzzy soft set theory or an intuitionistic fuzzy extension of the interval-valued fuzzy soft set theory. Recently, Xiao et al. [12] presented the trapezoidal fuzzy soft set and Yang et al. [13] introduced the multifuzzy soft set, respectively, and applied them in decision making problems. Roy and Maji [14], Kong et al. [15], Feng et al. [16], and Jiang et al. [17] also applied the fuzzy soft set in the decision making problems. Jun [18] initiated the application of soft sets in BCK/BCI-algebras and introduced the concept of soft BCK/BCI-algebras. Furthermore, Jun and Park [19] and Jun et al. [20, 21] applied the soft sets in ideal theory of BCK/BCI-algebras and d-algebras. Feng et al. [22, 23] initiated the concept of rough soft sets, soft rough sets, and soft rough fuzzy sets.

Recently, in order to tackle the difficulty in establishing the degree of membership of an element in a set, Torra and Narukawa [24] and Torra [25] proposed the concept of a hesitant fuzzy set. This new extension of fuzzy set can handle the cases that the difficulty in establishing the membership degree does not arise from a margin of error (as in intuitionistic or interval-valued fuzzy sets) or a specified possibility distribution of the possible values (as in type-2 fuzzy sets), but arises from our hesitation among a few different values [26]. Thus the hesitant fuzzy set can more accurately reflect the people’s hesitancy in stating their preferences over objects, compared to the fuzzy set and its many classical extensions. The purpose of this paper is to extend the soft set model to the hesitant fuzzy set, and, thus, we establish a new soft set model named hesitant fuzzy soft set.

The rest of this paper is organized as follows. We first review some background on soft set, fuzzy soft set, and hesitant fuzzy set in Section 2. In Section 3, the concepts and operations of hesitant fuzzy soft set are proposed and their properties are discussed in detail. In Section 4, we apply the proposed hesitant fuzzy soft set to a decision making problem and give an explicit algorithm. Finally, we conclude in Section 5.

#### 2. Preliminaries

##### 2.1. Soft Sets

Suppose that is an initial universe set, is a set of parameters, is the power set of and .

*Definition 1 (see [1]). *A pair is called a soft set over , where is a mapping given by .

In other words, a soft set over is a parameterized family of subsets of the universe . For , may be considered as the set of -approximate elements of the soft set .

*Example 2. *Suppose that is a set of houses and is a set of parameters, which stands for the parameters “cheap,” “beautiful,” “size,” “location,” and “surrounding environment,” respectively. In this case, a soft set can be defined as a mapping from parameter set to the set of all subsets of . In this way, the set of the houses with specific characteristics can be described.

Assume that , , , , and , which mean “houses (cheap)” whose function-value is the set , “houses (beautiful)” whose function-value is the set , “houses (big size)” whose function-value is the set , “houses (in good location)” whose function-value is the set , “houses (great surrounding environment)” whose function-value is the set , respectively. Then we can view the soft set as consisting of the following collection of approximations:

For the purpose of storing a soft set in a computer, we can represent the soft set defined in Example 2 in tabular form as Table 1 shows.

##### 2.2. Fuzzy Soft Sets

*Definition 3 (see [2]). *Let be the set of all fuzzy subsets of , a pair is called a fuzzy soft set over , where is a mapping given by .

*Example 4. *Reconsider Example 2. In real life, the perception of the people is characterized by a certain degree of vagueness and imprecision; thus, when people consider if a house is cheap the information cannot be expressed with only two crisp numbers 0 and 1. Instead it should be characterized by a membership function which associates with each element a real number in the interval . Then, fuzzy soft set can describe the characteristics of the house under the fuzzy information.

Similarly, for the purpose of storing a fuzzy soft set in a computer, we could also represent the fuzzy soft set defined in Example 4 in Table 2.

##### 2.3. Hesitant Fuzzy Sets

*Definition 5 (see [25]). *A hesitant fuzzy set (HFS) on is in terms of a function that when applied to returns a subset of , which can be represented as the following mathematical symbol:
where is a set of values in , denoting the possible membership degrees of the element to the set . For convenience, we call a hesitant fuzzy element (HFE) and the set of all HFEs.

Furthermore, Torra [25] defined the empty hesitant set and the full hesitant set.

*Definition 6 (see [25]). *Given hesitant fuzzy set , if for all in , then is called the null hesitant fuzzy set, denoted by . If for all in , then is called the full hesitant fuzzy set, denoted by .

*Definition 7 (see [27]). *For a HFE , is called the score function of , where is the number of the values in . For two HFEs and , if , then ; if , then .

Let and be two HFEs. It is noted that the number of values in different HFEs and are commonly different; that is, . For convenience, let . To operate correctly, we should extend the shorter one until both of them have the same length when we compare them. To extend the shorter one, the best way is to add the same value several times in it [28]. In fact, we can extend the shorter one by adding any value in it. The selection of this value mainly depends on the decision makers’ risk preferences. Optimists anticipate desirable outcomes and may add the maximum value, while pessimists expect unfavorable outcomes and may add the minimum value. For example, let , let , and let . To operate correctly, we should extend to until it has the same length of , the optimist may extend as and the pessimist may extend it as . Although the results may be different if we extend the shorter one by adding different values, this is reasonable because the decision makers’ risk preferences can directly influence the final decision. The same situation can also be found in many existing references [29–31]. In this paper, we assume that the decision makers are all pessimistic (other situations can be studied similarly).

We arrange the elements in in decreasing order, and let be the th largest value in .

*Definition 8. *Given two hesitant fuzzy sets and , is called the fuzzy subset of if and only if , for and , which can be denoted by .

*Definition 9. * and are two hesitant fuzzy sets, we call and is hesitant fuzzy equal if and only if(1)(2)

which can be denoted by .

Given three HFEs, , , and , Torra [25] and Torra and Narukawa [24] defined the following HFE operations:(1),(2),(3),where and are the lower bound and upper bound of the given hesitant fuzzy elements, respectively.

Therefore, giving two hesitant fuzzy soft sets and , we can define the following operations:(1);(2);(3).

Moreover, for the aggregation of hesitant fuzzy information, Xia and Xu [27] defined the following new operations on HFEs , , and :(1);(2);(3);(4).

#### 3. Hesitant Fuzzy Soft Sets

##### 3.1. The Concept of Hesitant Fuzzy Soft Sets

*Definition 10. *Let be the set of all hesitant fuzzy sets in ; a pair is called a hesitant fuzzy soft set over , where is a mapping given by

A hesitant fuzzy soft set is a mapping from parameters to . It is a parameterized family of hesitant fuzzy subsets of . For , may be considered as the set of -approximate elements of the hesitant fuzzy soft set .

*Example 11. *Continue to consider Example 2. Mr. X evaluates the optional six houses under various attributes with hesitant fuzzy element; then, hesitant fuzzy soft set can describe the characteristics of the house under the hesitant fuzzy information.

Consider

Similarly, we can also represent the hesitant fuzzy soft set in the form of Table 3 for the purpose of storing the hesitant fuzzy soft set in a computer.

*Definition 12. *Let . and are two hesitant fuzzy soft sets over . is said to be a hesitant fuzzy soft subset of if(1),(2)For all , .In this case, we write .

*Example 13. *Given two hesitant fuzzy soft sets and , is the set of the optional houses. , , and
Then, we have .

*Definition 14. *Two hesitant fuzzy soft sets and are said to be hesitant fuzzy soft equal if is a hesitant fuzzy soft subset of and is a hesitant fuzzy soft subset of .

In this case, we write .

*Definition 15. *A hesitant fuzzy soft set is said to be empty hesitant fuzzy soft set, denoted by , if for all .

*Definition 16. *A hesitant fuzzy soft set is said to be full hesitant fuzzy soft set, denoted by , if for all .

##### 3.2. Operations on Hesitant Fuzzy Soft Sets

*Definition 17. *The complement of a hesitant fuzzy soft set is denoted by and is defined by
where is a mapping given by for all .

Clearly, is the same as and .

It is worth noting that in the above definition of complement, the parameter set of the complement is still the original parameter set , instead of .

*Example 18. *Reconsider Example 11; the can be calculated as follows:

*Definition 19. *The AND operation on two hesitant fuzzy soft sets and which is denoted by is defined by , where , for all .

*Definition 20. *The OR operation on the two hesitant fuzzy soft sets and which is denoted by is defined by , where , for all .

*Example 21. *The results of “AND” and “OR” operations on the hesitant fuzzy soft sets and in Example 13 are shown in Tables 4 and 5, respectively.

Theorem 22 (De Morgan’s laws of hesitant fuzzy soft sets). *Let and be two hesitant fuzzy soft sets over ; we have*(1)*,*(2)*.*

*Proof. * Suppose that . Therefore . Similarly, . Now take ; therefore,
Hence, is proved.

(2) Similar to the above process, it is easy to prove that .

Theorem 23. *Let , , and be three hesitant fuzzy soft sets over . Then the associative law of hesitant fuzzy soft sets holds as follows:
*

*Proof. *For all , , and , because , we can conclude that holds.

Similarly, we can also conclude that .

*Remark 24. *The distribution law of hesitant fuzzy soft sets does not hold. That is,

For all , , and , because for the hesitant fuzzy sets, we can conclude that . Similarly, we can also conclude that .

*Definition 25. *Union of two hesitant fuzzy soft sets and over is the hesitant fuzzy soft set , where , and for all ,
We write .

*Example 26. *Reconsider Example 13, the Union of hesitant fuzzy soft sets and is shown in Table 6.

*Definition 27. *Intersection of two hesitant fuzzy soft sets and with over is the hesitant fuzzy soft set , where , and for all , .

We write .

*Example 28. *Reconsider Example 13, the Intersection of hesitant fuzzy soft sets and is shown in Table 7.

Theorem 29. *Let and be two hesitant fuzzy soft sets over . Then,*(1)*,*(2)*,*(3)*,*(4)*,*(5)*,*(6)*,*(7)*,*(8)*. *

Theorem 30. *Let and be two hesitant fuzzy soft sets over . Then,*(1)*,*(2)*.*

*Proof. * Suppose that , where , and for all ,
Thus , and
Similarly, suppose that , where , and for all ,
Obviously, for all , . Part of Theorem 30 is proved.

(2) Similar to the above process, it is easy to prove that .

Theorem 31. *Let and be two hesitant fuzzy soft sets over . Then,*(1)*,*(2)*.*

*Proof. * Suppose that , where , and for all ,
Then , and
Similarly, suppose , where . Then, for all , .

Hence, it is obvious that and, for all , ; thus, is proved.

Similar to the above process, it is easy to prove that .

Theorem 32. *Let and be two hesitant fuzzy soft sets over ; then,*(1)*,*(2)*.*

*Proof. * Suppose that , and for all ,
Then , and for all ,
Similarly, suppose that , and for all ,
Hence, ; the is proved.

Similar to the above process, it is easy to prove that .

#### 4. Application of Hesitant Fuzzy Soft Sets

Roy and Maji [14] presented an algorithm to solve the decision making problems according to a comparison table from the fuzzy soft set. Later, Kong et al. [15] pointed out that the algorithm in Roy and Maji [14] was incorrect by giving a counterexample. Kong et al. [15] also presented a modified algorithm which was based on the comparison of choice values of different objects [13]. However, Feng et al. [16] further explored the fuzzy soft set based decision making problems more deeply and pointed out that the concept of choice values was not suitable to solve the decision making problems involving fuzzy soft sets, though it was an efficient method to solve the crisp soft set based decision making problems. They proposed a novel approach by using the level soft sets to solve the fuzzy soft set based decision making problems. Thus, some decision making problems that cannot be solved by the methods in Roy and Maji [14] and Kong et al. [15] can be successfully solved by this approach. In the following, we will apply this level soft sets method to hesitant fuzzy soft set based decision making problems.

Let and be a hesitant fuzzy soft set over . For every , , we can calculate the score of each hesitant fuzzy element by Definition 7. Thus, we define an induced fuzzy set with respect to in as . By using this method, we can change a hesitant fuzzy set into an induced fuzzy set . Furthermore, once the induced fuzzy soft set of a hesitant fuzzy soft set has been obtained, we can determine the optimal alternative according to Feng’s [16] algorithm. The explicit algorithm of the decision making based on hesitant fuzzy soft set is given as follows.

*Algorithm 33. *
Consider the following.(1)Input the hesitant fuzzy soft set .(2)Compute the induced fuzzy soft set .(3)Input a threshold fuzzy set (or give a threshold value ; or choose the midlevel decision rule; or choose the top-level decision rule) for decision making.(4)Compute the level soft set of with respect to the threshold fuzzy set (or the -level soft set ; or the mid-level soft set ; or the top-level soft set ).(5)Present the level soft set (or ; or ; or ) in tabular form and compute the choice value of , for all .(6)The optimal decision is to select .(7)If there are more than one s, then any one of may be chosen.

*Remark 34. *In order to get a unique optimal choice according to the above algorithm, the decision makers can go back to the third step and change the threshold (or decision criteria) in case that there is more than one optimal choice that can be obtained in the last step. Moreover, the final optimal decision can be adjusted according to the decision makers’ preferences.

We adopt the following example to illustrate the idea of algorithm given above.

*Example 35. *Consider a retailer planning to open a new store in the city. There are five sites, , to be selected. Five attributes are considered: market (), traffic (), rent price (), competition (), and brand improvement (). Suppose that the retailer evaluates the optional five sites under various attributes with hesitant fuzzy element; then, hesitant fuzzy soft set can describe the characteristics of the sites under the hesitant fuzzy information, which is shown in Table 8.

In order to select the optimal sites to open the store based on the above hesitant fuzzy soft set, according to Algorithm 33, we can calculate the score of each hesitant fuzzy element and obtain the induced fuzzy soft set , which is shown as in Table 9.

As an adjustable approach, one can use different rules (or the thresholds) to get different decision results, according to his or her preference. For example, we use the midlevel decision rule in our paper and the midlevel threshold fuzzy set of is as . Furthering, we can get the midlevel soft set of , whose tabular form is as Table 10 shows. The choice values of each site are also shown in the last column of Table 10.

According to Table 10, the maximum choice value is 3 and so the optimal decision is to select . Therefore, the retailer should select site 3 as the best site to open a store.

#### 5. Conclusion

In this paper we consider the notion of hesitant fuzzy soft sets which combine the hesitant fuzzy sets and soft sets. Then we define the complement, “AND”, “OR”, union and intersection operations on hesitant fuzzy soft sets. The basic properties such as De Morgan’s laws and the relevant laws of hesitant fuzzy soft sets are proved. Finally, we apply it to a decision making problem with the help of level soft set.

Our research can be explored deeply in two directions in the future. Firstly, we can combine other membership functions and soft sets to make novel soft sets which have different forms; Secondly, we can not only explore the application of hesitant fuzzy soft set in decision making more deeply, but also apply the hesitant fuzzy soft set in many other areas such as forecasting and data analysis.

#### Conflict of Interests

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

#### Acknowledgments

This research is supported by the Innovation Group Science Foundation Project of the National Natural Science Foundation of China (no. 71221006), the Major International Collaboration Project of the National Natural Science Foundation of China (no. 71210003), and the Humanities and Social Sciences Major Project of the Ministry of Education of China (no. 13JZD016).