1. Introduction
Multiple criteria decision making (MCDM) is an important part of modern decision science and relates to many complex factors, such as economics, psychological behavior, ideology, military and so on. For a proper description of objects in an uncertain and ambiguous environment, indeterminate and incomplete information has to be properly handled. Intuitionistic fuzzy sets were introduced by Atanassov [1], followed by Molodtsov [2] on soft set and neutrosophy logic [3] and neutrosophic sets [4] by Smarandache. The term neutrosophy means knowledge of neutral thought and this neutral represents the main distinction between fuzzy and intuitionistic fuzzy logic and set. Presently, work on soft set theory is progressing rapidly. Various operations and applications of soft sets were developed rapidly, including multi-adjoint t-concept lattices [5], signatures, definitions, operators and applications to fuzzy modelling [6], fuzzy inference system optimized by genetic algorithm for robust face and pose detection [7], fuzzy multi-objective modeling of effectiveness and user experience in online advertising [8], possibility fuzzy soft set [9], soft multiset theory [10], multiparameterized soft set [11], soft intuitionistic fuzzy sets [12], Q-fuzzy soft sets [13,14,15], and multi Q-fuzzy sets [16,17,18], thereby opening avenues to many applications [19,20]. Later, Maji [21] introduced a more generalized concept, which is a combination of neutrosophic sets and soft sets and studied its properties. Alkhazaleh and Salleh [22] defined the concept of fuzzy soft expert sets, which were later extended to vague soft expert set theory [23], generalized vague soft expert set [24], and multi Q-fuzzy soft expert set [25]. Şahin et al. [26] introduced neutrosophic soft expert sets, while Hassan et al. [27] extended it further to Q-neutrosophic soft expert sets. Broumi et al. [28] defined neutrosophic parametrized soft set theory and its decision making. Deli [29] introduced refined neutrosophic sets and refined neutrosophic soft sets.
Since membership values are inadequate for providing complete information in some real problems which has different membership values for each element, different generalizations of fuzzy sets, intuitionistic fuzzy sets and neutrosophic sets have been introduced called the multi fuzzy set [30], intuitionistic fuzzy multiset [31] and neutrosophic multiset [32,33], respectively. In the multisets, an element of a universe can be constructed more than once with possibly the same or different membership values. Some work on the multi fuzzy set [34,35], on the intuitionistic fuzzy multiset [36,37,38,39] and on the neutrosophic multiset [40,41,42,43] have been studied. The above set theories have been applied to many different areas including real decision-making problems [44,45,46,47]. The aim of this paper is allow the neutrosophic set to handle problems involving incomplete, indeterminacy and awareness of inconsistency knowledge, and this is further developed to neutrosohic soft expert sets.
The initial contributions of this paper involve the introduction of various new set-theoretic operators on neutrosophic soft expert multisets (NSEMs) and their properties. Later, we intend to extend the discussion further by proposing the concept of NSEMs and its basic operations, namely complement, union, intersection AND and OR, along with a definition of a NSEMs-aggregation operator to construct an algorithm of a NSEMs decision method. Finally we provide an application of the constructed algorithm to solve a decision-making problem.
2. Preliminaries
In this section we review the basic definitions of a neutrosophic set, neutrosophic soft set, soft expert sets, neutrosophic soft expert sets, and NP-aggregation operator required as preliminaries.
([4]). A neutrosophic set on the universe of discourse is defined as There is no restriction on the sum of (u); (u) and (u), so .
([21]). Let be an initial universe set and be a set of parameters. Consider . Let denotes the set of all neutrosophic sets of . The collection is termed to be the neutrosophic soft set over , where F is a mapping given by .
([22]). is an initial universe, is a set of parameters is a set of experts (agents), and a set of opinions. Let and . A pair is called a soft expert set over , where is mapping given by where denote the power set of .
([26]). A pair is called a neutrosophic soft expert set over , where is mapping given by
(1)
where denotes the power neutrosophic set of .([26]). The complement of a neutrosophic soft expert set denoted by and is defined as = where is mapping given by = neutrosophic soft expert complement with .
([26]). The agree-neutrosophic soft expert set over is a neutrosophic soft expert subset of is defined as
(2)
([26]). The disagree-neutrosophic soft expert set over is a neutrosophic soft expert subset of is defined as
(3)
([26]). Let and be two NSESs over the common universe U. Then the union of and is denoted by “” and is defined by , where and the truth-membership, indeterminacy-membership and falsity-membership of are as follows:
(4)
([26]). Let and be two NSESs over the common universe . Then the intersection of and is denoted by “” and is defined by , where and the truth-membership, indeterminacy-membership and falsity-membership of are as follows:
(5)
.([29]). Let be a universe. A neutrosophic multiset set (Nms) on can be defined as follows:
where, and such that andThis is the truth-membership sequence, indeterminacy-membership sequence and falsity-membership sequence of the element respectively. Also, P is called the dimension (cardinality) of Nms denoted . We arrange the truth-membership sequence in decreasing order but the corresponding indeterminacy-membership and falsity-membership sequence may not be in decreasing or increasing order.
The set of all neutrosophic multisets on is denoted by NMS().
([28]). Let NP-soft set. Then an NP-aggregation operator of denoted by is defined by
which is a neutrosophic set over ,(6)
and where,(7)
is the cardinality of .3. Neutrosophic Soft Expert Multiset (NSEM) Sets
This section introduces neutrosophic soft expert multiset as a generalization of neutrosophic soft expert set. Throughout this paper, is an initial universe, is a set of parameters is a set of experts (agents), and a set of opinions. Let and and is a membership function of ; that is, .
A pair is called a neutrosophic soft expert multiset over , where is mapping given by
(8)
where be the set of all neutrosophic soft expert subsets of . For any parameter is referred as the neutrosophic value set of parameter , i.e.,(9)
where are the membership sequence of truth, indeterminacy and falsity respectively of the element . For any , and
In fact is a parameterized family of neutrosophic soft expert multisets on , which has the degree of possibility of the approximate value set which is prepresented by for each parameter . So we can write it as follows:
(10)
Suppose that is a set of computers and is a set of decision parameters. Let be set of experts. Suppose that
The neutrosophic soft expert multiset is a parameterized family of all neutrosophic multisets of and describes a collection of approximation of an object.
For two neutrosophic soft expert multisets (NSEMs) and over , is called a neutrosophic soft expert subset of if
-
i.
,
-
ii.
for all is neutrosophic soft expert subset .
Consider Example 1. Suppose that and are as follows.
Since is a neutrosophic soft expert subset of , clearly . Let and be defined as follows:
Therefore .
Two NSEMs and over are said to be equal if is a NSEM subset of and is a NSEM subset of .
Agree-NSEMs over is a NSEM subset of defined as follows.
(11)
Consider Example 1. The agree- neutrosophic soft expert multisets over is
A disagree-NSEMs over is a NSES subset of is defined as follows:
(12)
Consider Example 1. The disagree- neutrosophic soft expert multisets over are
4. Basic Operations on NSEMs
The complement of a neutrosophic soft expert multiset is denoted by and is defined by where is mapping given by
(13)
for eachConsider Example 1. The complement of the neutrosophic soft expert multiset denoted by is given by as follows:
If is a neutrosophic soft expert multiset over , then
-
1.
-
2.
-
3.
(1) From Definition 17, we have where and for each . Now where
Thus , for all
The Proofs (2) and (3) can proved similarly. □
The union of two NSEMs and over , denoted by is a NSEMs where and
(14)
where .Suppose that and are two NSEMs over , such that
Then = where
If , and are three NSEMs over , then
-
1.
-
2.
.
(1) We want to prove that
by using Definition 18, we consider the case when if as other cases are trivial. We will haveAlso consider the case when as the other cases are trivial. We will have
(2) The proof is straightforward. □
The intersection of two NSEMs and over , denoted by where and
(15)
where .Suppose that and are two NSEMs over , such that
Then where
If , and are three NSEMs over , then
-
1.
-
2.
.
(1) We want to prove that
by using Definition 19, we consider the case when if as other cases are trivial. We will haveAlso consider the case when as the other cases are trivial. We will have
(2) The proof is straightforward. □
If , and are three NSEMs over . Then
-
1.
.
-
2.
.
The proofs can be easily obtained from Definitions 18 and 19. □
5. AND and OR Operations
Let and be any two NSEMs over , then denoted is defined by
(16)
where such that for all where represent the basic intersection.Suppose that and are two NSEMs over , such that
Then where
Let and be any two NSEMs over , then denoted is defined by
(17)
where such that for all where represent the basic union.Suppose that and are two NSEMs over , such that
Then where
Let and be NSEMs over . Then
-
1.
-
2.
(1) Suppose that and be NSEMs over defined as:
(2) The proofs can be easily obtained from Definitions 20 and 21. □
6. NSEMs-Aggregation Operator
In this section, we define a NSEMs-aggregation operator of NSEMs to construct a decision method by which approximate functions of a soft expert set are combined to produce a neutrosophic set that can be used to evaluate each alternative.
Let . Then NSEMs-aggregation operator of denoted by is defined by
which are NSEMs over
(18)
where is the cardinality of V and is defined below(19)
Let , be NSEMs. Then a reduced fuzzy set of is a fuzzy set over is denoted by
(20)
where and7. An Application of NSEMs
In this section, we present an application of NSEMs theory in a decision-making problem. Based on Definitions 22 and 23, we construct an algorithm for the NSEMs decision-making method as follows:
Step 1-Choose a feasible subset of the set of parameters.
Step 2-Construct the NSEMs for each opinion (agree, disagree) of expert.
Step 3-Compute the aggregation NSEMS of and the reduced fuzzy set of
Step 4-Score
Step 5-Choose the element of that has maximum membership. This will be the optimal solution.
In the architectural design process, let us assume that the design outputs used in the design of moving structures are taken by a few experts at certain time intervals. So, let us take the samples at three different timings in a day (in 08:30, 14:30 and 20:30) The design of moving structures consists of the architectural design, the design of the mechanism and the design of the surface covering membrane. Architectural design will be evaluated from these designs., Suppose there are three parameters where the parameters stand for “time”, “temperature” and “spatial needs” respectively. Let be a set of experts. After a serious discussion, the experts construct the following NSEMs.
-
Step 1-Choose a feasible subset of the set of parameters:
-
Step 2-Construct the neutrosophic soft expert tables for each opinion (agree, disagree) of expert.
-
Step 3-Now calculate the score of agree by using the data in Table 1 to obtain values in Table 2.
Now calculate the score of disagree by using the data in Table 3 to obtain values in Table 4.
-
Step 4-The final score of is computed as follows:
Score,
Score
Score
-
Step 5-Clearly, the maximum score is the score 0.053, shown in the above for the Hence the best decision for the experts is to select worker as the company’s employee.
8. Comparison Analysis
The NSEMs model give more precision, flexibility and compatibility compared to the classical, fuzzy and/or neutrosophic models.
In order to verify the feasibility and effectiveness of the proposed decision-making approach, a comparison analysis using neutrosophic soft expert decision method, with those methods used by Alkhazaleh and Salleh [18], Maji [17], Sahin et al. [22], Hassan et al. [23] and Ulucay et al. [40] are given in Table 5, based on the same illustrative example as in An Application of NSEMs. Clearly, the ranking order results are consistent with those in [17,18,22,23,40].
9. Conclusions
In this paper, we reviewed the basic concepts of neutrosophic set, neutrosophic soft set, soft expert sets, neutrosophic soft expert sets and NP-aggregation operator before establishing the concept of neutrosophic soft expert multiset (NSEM). The basic operations of NSEMs, namely complement, union, intersection AND and OR were defined. Subsequently a definition of NSEM-aggregation operator is proposed to construct an algorithm of a NSEM decision method. Finally an application of the constructed algorithm to solve a decision-making problem is provided. This new extension will provide a significant addition to existing theories for handling indeterminacy, and spurs more developments of further research and pertinent applications.
Author Contributions
All authors contributed equally.
Conflicts of Interest
The authors declare no conflict of interest.
Tables
Table 1Agree-neutrosophic soft expert multiset.
Degree table of agree- neutrosophic soft expert multiset.
p | 0.1136 | 0.1267 | 0.093 |
q | 0.1142 | 0.0933 | 0.015 |
Disagree-neutrosophic soft expert multiset.
Degree table of disagree-neutrosophic soft expert multiset.
p | 0.1631 | 0.1468 | 0.1386 |
q | 0.1155 | 0.0933 | 0.04 |
Comparison of fuzzy soft set and its extensive set theory.
Fuzzy Soft Expert | Neutrosophic Soft Set | Neutrosophic Soft Expert | Q-Neutrosophic Soft Expert | Generalized Neutrosophic Soft Expert | NSEMs | |
---|---|---|---|---|---|---|
Methods | Alkhazaleh and Salleh [22] | Maji [21] | Sahin et al. [26] | Hassan et al. [27] | Ulucay et al. [48] | Proposed Method in this paper |
Domain | Universe of discourse | Universe of discourse | Universe of discourse | Universe of discourse | Universe of discourse | Universe of discourse |
True | Yes | Yes | Yes | Yes | Yes | Yes |
Falsity | No | Yes | Yes | Yes | No | No |
Indeterminacy | No | Yes | Yes | Yes | No | No |
Expert | Yes | No | Yes | Yes | Yes | No |
Q | No | No | No | Yes | Yes | Yes |
Ranking | ||||||
Membershipvalued | Membership-valued | Single-valued | single-valued | Single-valued | Single-valued | Multi-valued |
You have requested "on-the-fly" machine translation of selected content from our databases. This functionality is provided solely for your convenience and is in no way intended to replace human translation. Show full disclaimer
Neither ProQuest nor its licensors make any representations or warranties with respect to the translations. The translations are automatically generated "AS IS" and "AS AVAILABLE" and are not retained in our systems. PROQUEST AND ITS LICENSORS SPECIFICALLY DISCLAIM ANY AND ALL EXPRESS OR IMPLIED WARRANTIES, INCLUDING WITHOUT LIMITATION, ANY WARRANTIES FOR AVAILABILITY, ACCURACY, TIMELINESS, COMPLETENESS, NON-INFRINGMENT, MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Your use of the translations is subject to all use restrictions contained in your Electronic Products License Agreement and by using the translation functionality you agree to forgo any and all claims against ProQuest or its licensors for your use of the translation functionality and any output derived there from. Hide full disclaimer
© 2019 by the authors.
Abstract
In this paper, we have investigated neutrosophic soft expert multisets (NSEMs) in detail. The concept of NSEMs is introduced. Several operations have been defined for them and their important algebraic properties are studied. Finally, we define a NSEMs aggregation operator to construct an algorithm for a NSEM decision-making method that allows for a more efficient decision-making process.
You have requested "on-the-fly" machine translation of selected content from our databases. This functionality is provided solely for your convenience and is in no way intended to replace human translation. Show full disclaimer
Neither ProQuest nor its licensors make any representations or warranties with respect to the translations. The translations are automatically generated "AS IS" and "AS AVAILABLE" and are not retained in our systems. PROQUEST AND ITS LICENSORS SPECIFICALLY DISCLAIM ANY AND ALL EXPRESS OR IMPLIED WARRANTIES, INCLUDING WITHOUT LIMITATION, ANY WARRANTIES FOR AVAILABILITY, ACCURACY, TIMELINESS, COMPLETENESS, NON-INFRINGMENT, MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Your use of the translations is subject to all use restrictions contained in your Electronic Products License Agreement and by using the translation functionality you agree to forgo any and all claims against ProQuest or its licensors for your use of the translation functionality and any output derived there from. Hide full disclaimer