Keywords

1 Introduction

In 1999, Molodstov [12] initiated the notion of soft set theory as a general mathematical tool for dealing with vagueness, uncertainties and not clearly defined objects. Research works on the soft set theory are progressing rapidly. Some new algebraic operations and results on soft set theory defined in [2, 10]. Adding soft sets [12] with fuzzy sets [15], Maji et al. [9] defined fuzzy soft sets and studied their basic properties. As a generalization of soft set, Alkhazaleh and others [1, 46, 14] proposed the notion of a soft multi set and its basic algebraic and topological structures were studied. Alkhazaleh and Salleh [3] initiated the notion of fuzzy soft multi set theory and presented its application in decision making using Roy-Maji Algorithm [13]. Maji et al. [11] first proposed the application of soft sets for solving the decision making problems and thereafter in 2007, they also presented an application on fuzzy soft sets based decision making problems in [13]. Kong et al. [8] mentioned that the Roy-Maji algorithm [13] was wrong and they introduced a revised algorithm. Feng et al. [7] studied the validity of the Roy-Maji algorithm [13] and mentioned that the Roy-Maji Algorithm [13] has some limitations. Also, they proposed an adjustable approach to fuzzy soft sets based decision making problems by using thresholds and choice values.

In fact, all these concepts have a good application in some real life problems. But, it is seen that all these theories have their own difficulties that is why in this paper, we are going to propose an algorithm to fuzzy soft multi set based decision making problems using Feng’s algorithm, which is another one new mathematical tool for solving some real life applications of decision making problems. The feasibility of our proposed algorithm in practical applications is illustrated by a numerical example.

2 Preliminary Notes

In this current section, we briefly recall some basic notions of soft sets, fuzzy soft multi sets and level soft sets.

Definition 2.1

[12] Suppose that, U be an initial universe and \(\hat{E}\) be a set of parameters. Also, let \(\tilde{P}\left( U \right)\) denotes the power set of the universe U and \(\hat{A}\,\subseteq\,\hat{E}\). A pair \((\tilde{F},\hat{A})\) is said to be a soft set over the universe U, where \(\tilde{F}\) is a mapping given by \(\tilde{F}:\hat{A} \to \tilde{P}\left( U \right)\).

Definition 2.2

[3] Suppose \(\left\{ {U_{i} :i \in\Lambda } \right\}\) be a set of universes, such that \(\cap_{{i \in\Lambda }} U_{i} = \phi\) and let for each \(i \in\Lambda\), \(E_{i}\) be a sets of decision parameters. Also, let \(\tilde{U} = \prod_{{i \in\Lambda }} FS\left( {U_{i} } \right)\) where \(FS\left( {U_{i} } \right)\) is the set of all fuzzy subsets of \(U_{i}\), \(\hat{E} = \prod_{{i \in\Lambda }} E_{{U_{i} }}\) and \(\hat{A}\,\subseteq\,\hat{E}\). A pair \((\tilde{F},\hat{A})\) is said to be a fuzzy soft multi set over the universe \(\tilde{U}\), where \(\tilde{F}\) is a function given by \(\tilde{F}: \, \hat{A} \to \tilde{U}\).

Definition 2.3 [3]

For any fuzzy soft multi set \((\tilde{F},\hat{A})\), where \(\hat{A}\,\subseteq\,\hat{E}\) and \(\hat{E}\) is a set of parameters. A pair \(\left( {e_{{U_{i} ,j}} ,\tilde{F}_{{e_{{U_{i} ,j}} }} } \right)\) is said to be a U i —fuzzy soft multi set part of \((\tilde{F},\hat{A})\) over U, \(\forall e_{{U_{i} ,j}} \in a_{k}\) and \(\tilde{F}_{{e_{{U_{i} ,j}} }}\,\subseteq\,\tilde{F}\left( {\hat{A}} \right)\) is an approximate value set, for \(a_{k} \in \hat{A}\), \(\text{k} \in \left\{ {1,2,3,..,\text{m}} \right\}\), \(i \in \left\{ {1,2,3,..,\text{n}} \right\}\) and \(j \in \left\{ {1,2,3,..,\text{r}} \right\}\).

Definition 2.4 [7]

Let \(\varpi = (\tilde{F},\hat{A})\) is a fuzzy soft set over the universe U, where \(\hat{A}\,\subseteq\,\hat{E}\) and \(\hat{E}\) is a set of parameters. For \(t \in [0,1],\) the t-level soft set of \(\varpi\) is a crisp soft set \(L\left( {\varpi ;t} \right) = \left( {\tilde{F}_{t} ,\hat{A}} \right)\) defined by \(\tilde{F}_{t} \left( e \right) = \left\{ {u \in U:\mu_{{\tilde{F}(e)}} (u) \ge t} \right\},\) \(\forall e \in \hat{A}.\)

Definition 2.5 [7]

Suppose \(\varpi = (\tilde{F},\hat{A})\) be a fuzzy soft set over U, where \(\hat{A}\,\subseteq\,\hat{E}\) and \(\hat{E}\) is the parameter set. Let \(\lambda :\hat{A} \to [0,1]\) be a fuzzy set in \(\hat{A}\), which is called a threshold fuzzy set. The level soft set of the fuzzy soft set \(\varpi\) with respect to the fuzzy set \(\lambda\) is a crisp soft set \(L\left( {\varpi ;\lambda } \right) = \left( {\tilde{F}_{\lambda } ,\hat{A}} \right)\) defined by \(\tilde{F}_{\lambda } \left( e \right) = \left\{ {u \in U:\mu_{{\tilde{F}(e)}} (u) \ge \lambda \left( e \right)} \right\},\) \(\forall e \in A.\)

Definition 2.6 [7]

Let \(\varpi = (\tilde{F},\hat{A})\) is a fuzzy soft set over a finite universe U, where \(\hat{A} \subseteq \hat{E}\) and \(\hat{E}\) is the set of parameters. The mid-threshold of the fuzzy soft set \(\varpi\) define a fuzzy set \(mid_{\varpi } :\hat{A} \to [0,1]\) by \(\forall e \in \hat{A},\) \(mid_{\varpi } \left( e \right) = \frac{1}{\left| U \right|}\sum\limits_{u \in U} {\mu_{{\tilde{F}(e)}} (u)}\) and the level soft set of \(\varpi\) with respect to the mid-threshold fuzzy set \(mid_{\varpi }\), namely \(L\left( {\varpi ;mid_{\varpi } } \right)\) is said to be mid-level soft set of \(\varpi .\)

Definition 2.7 [7]

Let \(\varpi = (\tilde{F},\hat{A})\) be a fuzzy soft set over a finite universe U, where \(\hat{A} \subseteq \hat{E}\) and \(\hat{E}\) is the parameter set. The max-threshold of the fuzzy soft set \(\varpi\) define a fuzzy set \(\max_{\varpi } :\hat{A} \to [0,1]\) by \(\forall e \in \hat{A},\) \(\max_{\varpi } \left( e \right) = \mathop {\hbox{max} }\limits_{u \in U} \mu_{{\tilde{F}(e)}} (u)\) and the level soft set of \(\varpi\) with respect to the max-threshold fuzzy set \(\max_{\varpi }\), namely \(L\left( {\varpi ;\max_{\varpi } } \right)\) is said to be top-level soft set of \(\varpi .\)

3 An Adjustable Approach Based on Feng’s Algorithm

3.1 Feng’s Algorithm Using Choice Values

The details of Feng’s Algorithm [7] for solving a decision-making problem based on a fuzzy soft set are as follows:

Algorithm 1

(Feng’s Algorithm)

  1. 1.

    Input the fuzzy soft set \(\varpi = (\tilde{F},\hat{A})\)

  2. 2.

    Input a threshold fuzzy set \(\lambda :\hat{A} \to [0,1]\) (or select a threshold value \(t \in [0,1]\) or select mid-level decision criterion or select top-level decision criterion) for solving decision making problem.

  3. 3.

    Obtain the level soft set \(L\left( {\varpi ;\lambda } \right)\) of \(\varpi\) with respect to the threshold fuzzy set \(\lambda\) (or \(L\left( {\varpi ;t} \right)\) or \(L\left( {\varpi ;mid} \right)\) or \(L\left( {\varpi ;\hbox{max} } \right)\)).

  4. 4.

    Present the level soft set \(L\left( {\varpi ;\lambda } \right)\) (or \(L\left( {\varpi ;t} \right)\); or \(L\left( {\varpi ;mid} \right)\); or \(L\left( {\varpi ;\hbox{max} } \right)\)) as in tabular form and also, obtain the choice value \(s_{i}\) of \(u_{i} \in U,\forall i\).

  5. 5.

    The final optimal decision to be select \(u_{k}\) if \(s_{k} = \max_{i} s_{i}\).

  6. 6.

    If k has more than one value, then any one of \(u_{k}\) may be chosen.

3.2 Application of Fuzzy Soft Multi Sets in Decision-Making Problems

In this section, we propose an algorithm (Algorithm 2) for fuzzy soft multi sets based decision making problems, using Feng’s Algorithm [7], as described above. In the following, we have to show our algorithm (Algorithm 2):

Algorithm 2

  1. (1)

    Input the (resultant) fuzzy soft multi set \((\tilde{F},\hat{A})\)

  2. (2)

    Apply the Algorithm 1 (Feng’s Algorithm) to the first fuzzy soft multi set part in \((\tilde{F},\hat{A})\), to obtain the decision \(S_{{k_{1} }}\).

  3. (3)

    Modify the fuzzy soft multi set \((\tilde{F},\hat{A})\), by taking all values in each row, where the choice value of \(S_{{k_{1} }}\) is maximum and changing the values in the other rows by 0 (zero), to get \((\tilde{F},\hat{A})_{1}\).

  4. (4)

    Apply the Algorithm 1 (Feng’s Algorithm) to the second fuzzy soft multi set part in \((\tilde{F},\hat{A})_{1}\), to obtain the decision \(S_{{k_{2} }}\)

  5. (5)

    Modify the fuzzy soft multi set \((\tilde{F},\hat{A})_{1}\), by taking the first two parts fixed and apply the method as in step (3) to the next part, to get \((\tilde{F},\hat{A})_{2}\)

  6. (6)

    Apply the Algorithm 1 (Feng’s Algorithm) to the third fuzzy soft multi set part in \((\tilde{F},\hat{A})_{2}\), to obtain the decision \(S_{{k_{3} }}\).

  7. (7)

    Finally, we have the optimal decision for decision maker is \((S_{{k_{1} }} ,S_{{k_{2} }} ,S_{{k_{3} }} )\).

3.3 Application in Decision-Making Problems

Let us consider three universes \(U_{1} = \left\{ {h_{1} ,h_{2} ,h_{3} ,h_{4} } \right\}\), \(U_{2} = \left\{ {c_{1} ,c_{2} ,c_{3} } \right\}\) and \(U_{2} = \left\{ {v_{1} ,v_{2} ,v_{3} } \right\}\) are sets of houses, cars and hotels respectively and let \(E_{{U_{1} }} = \left\{ {e_{{U_{1} ,1}} ,e_{{U_{1} ,2}} ,e_{{U_{1} ,3}} } \right\},\) \(E_{{U_{2} }} = \left\{ {e_{{U_{2} ,1}} ,e_{{U_{2} ,2}} ,e_{{U_{2} ,3}} } \right\},\) \(E_{{U_{3} }} = \left\{ {e_{{U_{3} ,1}} ,e_{{U_{3} ,2}} ,e_{{U_{3} ,3}} } \right\}\) be the sets of respective decision parameters related to the above three universes.

Let \(\tilde{U} = \prod_{i = 1}^{3} FS\left( {U_{i} } \right)\), \(\tilde{E} = \prod_{i = 1}^{3} E_{{U_{i} }}\) and \(\hat{A} \subseteq \hat{E}\), such that

$$\begin{aligned} \hat{A} = & \left\{ {a_{1} = (e_{{U_{1} ,1}} ,e_{{U_{2} ,1}} ,e_{{U_{3} ,1}} ),a_{2} = (e_{{U_{1} ,1}} ,e_{{U_{2} ,2}} ,e_{{U_{3} ,1}} ),} \right.a_{3} = (e_{{U_{1} ,2}} ,e_{{U_{2} ,3}} ,e_{{U_{3} ,1}} ),a_{4} = (e_{{U_{1} ,3}} ,e_{{U_{2} ,3}} ,e_{{U_{3} ,1}} ), \\ & a_{5} = (e_{{U_{1} ,1}} ,e_{{U_{2} ,1}} ,e_{{U_{3} ,2}} ),a_{6} = (e_{{U_{1} ,1}} ,e_{{U_{2} ,2}} ,e_{{U_{3} ,2}} ),a_{7} = (e_{{U_{1} ,2}} ,e_{{U_{2} ,3}} ,e_{{U_{3} ,3}} ),\left. {a_{8} = (e_{{U_{1} ,3}} ,e_{{U_{2} ,3}} ,e_{{U_{3} ,3}} )} \right\}. \\ \end{aligned}$$

Assume that, Mr. X wants to buy a house, a car and rent a hotel with respect to the three sets of decision parameters as in above. Suppose the resultant fuzzy soft multi set be \((\tilde{F},\hat{A})\) given in Table 1.

Table 1 The tabular representation of the fuzzy soft multi-set \((\tilde{F},\hat{A})\)

First, we apply the Algorithm 1 (Feng’s Algorithm) to the U 1—fuzzy soft multi set part in \((\tilde{F},\hat{A})\) to obtain the decision from the first fuzzy soft multi set part \(U_{1}\). Now we represent the U 1—fuzzy soft multi set part in \((\tilde{F},\hat{A})\) as in Table 2.

Table 2 Tabular representation of U 1—fuzzy soft multi set part of \((\tilde{F},\hat{A})\)

In the Table 3, we see that the maximum choice value (sk) is s3 = 6 and scored by \(h_{3}\). So we modify the fuzzy soft multi set \((\tilde{F},\hat{A})\), by taking all values in each row are fixed, where the choice value of \(h_{3}\) is maximized and changing the values in other rows by 0 (zero), to get \((\tilde{F},\hat{A})_{1}\) as in Table 4.

Table 3 Mid-level soft set of the U 1—fuzzy soft multiset part in \((\tilde{F},\hat{A})\), with choice values
Table 4 The tabular representation of the fuzzy soft multi-set \((\tilde{F},\hat{A})_{1}\)

We apply the Algorithm 1 (Feng’s Algorithm) to the U 2—fuzzy soft multi set part in \((\tilde{F},\hat{A})_{1}\), to obtain the decision from U 2—fuzzy soft multi set part in \((\tilde{F},\hat{A})\). Now we represent the U 2—fuzzy soft multi set part in \((\tilde{F},\hat{A})_{1}\) as in Table 5.

Table 5 Tabular representation of the U 2—fuzzy soft multi set part in \((\tilde{F},\hat{A})_{1}\)

In Table 6, we see that the maximum choice value (sk) is s1 = 3 and scored by \(c_{1}\). Therefore, we modify the fuzzy soft multi set \((\tilde{F},\hat{A})_{1}\) by taking all values in each row are fixed, where the choice value of \(c_{1}\) is maximized and changing the values in other rows by 0 (zero), to get \((\tilde{F},\hat{A})_{2}\) (Table 7).

Table 6 Mid-level soft set of the U 2—fuzzy soft multi set part in \((\tilde{F},\hat{A})_{1} ,\) with choice values
Table 7 Tabular representation of the fuzzy soft multi set \((\tilde{F},\hat{A})_{2}\)

Similarly, we apply the Algorithm 1 (Feng’s Algorithm) to the U 3—fuzzy soft multi set part in \((\tilde{F},\hat{A})_{2}\), to obtain the decision from U 3—fuzzy soft multi set part in \((\tilde{F},\hat{A})\). Now we represent the U 3—fuzzy soft multi set part in \((\tilde{F},\hat{A})_{2}\) as in Table 8.

Table 8 Tabular representation of U 3—fuzzy soft multi set part in \((\tilde{F},\hat{A})_{2}\)

In Table 9, we see that the maximum choice value (sk) is 2, scored by v1 and v2.

Table 9 Mid-level soft set of the U 3—fuzzy soft multi set part in \((\tilde{F},\hat{A})_{2} ,\) with choice values

Thus, the final optimal decision for decision maker Mr. X is \(\left( {h_{3} ,c_{1} ,v_{1} } \right)\) or \(\left( {h_{3} ,c_{1} ,v_{2} } \right),\) i.e. Mr. X may chose \(\left( {h_{3} ,c_{1} ,v_{1} } \right)\) or \(\left( {h_{3} ,c_{1} ,v_{1} } \right).\)

Remark 1

In the step (7) of our algorithm (Algorithm 2), if there are too many optimal choices obtained, then decision maker may go back to the step (2) as in our algorithm (Algorithm 2) and replace the level soft set (decision criterion) that he/she once used to adjust the final optimal decision in the fuzzy soft multi set based decision making problems.

Advantages of our algorithm (Algorithm 2) are as follows:

  1. (1)

    From the above illustration, we have seen that our algorithm (Algorithm 2) is too simple and less computation than Alkhazaleh–Salleh Algorithm [3]. Because instead of computing comparison tables and calculating scores as in Alkhazaleh–Salleh Algorithm [3], we have to consider only choice values of objects form the level soft sets of fuzzy soft multi set parts in the fuzzy soft multi set.

  2. (2)

    Also, our algorithm (Algorithm 2) is an adjustable algorithm, because the level soft set (decision rule) used by decision makers, which are changeable. For example, if we take top-level decision criterion in step (2) of our algorithm (Algorithm 2), then we have the choice value of each object in the top-level soft set of fuzzy soft multi set parts in the fuzzy soft multi set, if we take another decision rule such as the mid-level decision criterion, then we have choice values from the mid-level soft set of fuzzy soft multi set parts in the fuzzy soft multi set.

4 Conclusion

In [8], Kong et al. mentioned that the Roy-Maji Algorithm [13] was wrong and Feng et al. [7] mentioned that the Roy-Maji Algorithm [13] has some limitations and Alkhazaleh and Salleh [3] presented an application of fuzzy soft multi set based decision-making problems using Roy-Maji Algorithm [13], so Alkhazaleh–Salleh Algorithm [3] is not sufficient to solve fuzzy soft multi set based decision making problems. In this study, we have proposed an algorithm for fuzzy soft multi set based decision making problems using Feng’s algorithm [7], which is more stable and more feasible than the Alkhazaleh–Salleh Algorithm [3] for solving decision-making problems based on fuzzy soft multi sets.