Next Article in Journal
Effect of Time-Varying Factors on Optimal Combination of Quality Inspectors for Offline Inspection Station
Next Article in Special Issue
Neutrosophic Multigroups and Applications
Previous Article in Journal
Matching Number, Independence Number, and Covering Vertex Number of Γ(Zn)
Previous Article in Special Issue
Design of Fuzzy Sampling Plan Using the Birnbaum-Saunders Distribution
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Neutrosophic Soft Expert Multiset and Their Application to Multiple Criteria Decision Making

1
TBMM Public Relations Building 2nd Floor, B206 room Ministries, 06543 Ankara, Turkey
2
Department of Mathematics, Gaziantep University, 27310 Gaziantep, Turkey
*
Author to whom correspondence should be addressed.
Mathematics 2019, 7(1), 50; https://doi.org/10.3390/math7010050
Submission received: 11 December 2018 / Revised: 26 December 2018 / Accepted: 2 January 2019 / Published: 6 January 2019
(This article belongs to the Special Issue New Challenges in Neutrosophic Theory and Applications)

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.

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.
Definition 1
([4]). A neutrosophic set A on the universe of discourse U is defined as A = { u ,   ( μ A ( u ) ,   v A ( u ) ,   w A ( u ) ) :   u U ,   μ A ( u ) ,   v A ( u ) ,   w A ( u ) [ 0 , 1 ] } . There is no restriction on the sum of μ A (u); v A (u) and w A (u), so 0 μ A ( u ) + v A ( u ) + w A ( u ) 3 + .
Definition 2
([21]). Let U be an initial universe set and E be a set of parameters. Consider A E . Let N S ( U ) denotes the set of all neutrosophic sets of U . The collection ( F , A ) is termed to be the neutrosophic soft set over U , where F is a mapping given by F : A N S ( U ) .
Definition 3
([22]). U is an initial universe, E is a set of parameters X is a set of experts (agents), and O = { a g r e e = 1 , d i s a g r e e = 0 } a set of opinions. Let Z = E × X × O and A Z . A pair ( F , A ) is called a soft expert set over U , where F is mapping given by F : A P ( U ) where P ( U ) denote the power set of U .
Definition 4
([26]). A pair ( F , A ) is called a neutrosophic soft expert set over U , where F is mapping given by
F : A P ( U )
where P ( U ) denotes the power neutrosophic set of U .
Definition 5
([26]). The complement of a neutrosophic soft expert set ( F , A ) denoted by ( F , A ) c and is defined as ( F , A ) c = ( F c , A ) where F c = ¬ A P ( U ) is mapping given by F c ( x ) = neutrosophic soft expert complement with μ F c ( x ) = w F ( x ) ,   v F c ( x ) = v F ( x ) ,   w F c ( x ) = μ F ( x ) .
Definition 6
([26]). The agree-neutrosophic soft expert set ( F , A ) 1 over U is a neutrosophic soft expert subset of ( F , A ) is defined as
( F , A ) 1 = { F 1 ( m ) : m E × X × { 1 } } .
Definition 7
([26]). The disagree-neutrosophic soft expert set ( F , A ) 0 over U is a neutrosophic soft expert subset of ( F , A ) is defined as
( F , A ) 0 = { F 0 ( m ) : m E × X × { 0 } } .
Definition 8
([26]). Let ( H , A ) and ( G , B ) be two NSESs over the common universe U. Then the union of ( H , A ) and ( G , B ) is denoted by “ ( H , A ) ~ ( G , B ) ” and is defined by ( H , A ) ~ ( G , B ) = ( K , C ) , where C = A B and the truth-membership, indeterminacy-membership and falsity-membership of ( K , C ) are as follows:
μ K ( e ) ( m ) = { μ H ( e ) ( m ) , i f   e A B , μ G ( e ) ( m ) , i f   e B A , max ( μ H ( e ) ( m ) , μ G ( e ) ( m ) ) , i f   e A B . v K ( e ) ( m ) = { v H ( e ) ( m ) , i f   e A B , v G ( e ) ( m ) , i f   e B A , v H ( e ) ( m ) + v G ( e ) ( m ) 2 , i f   e A B . w K ( e ) ( m ) = { w H ( e ) ( m ) , i f   e A B , w G ( e ) ( m ) , i f   e B A , min ( w H ( e ) ( m ) , w G ( e ) ( m ) ) , i f   e A B .
Definition 9
([26]). Let ( H , A ) and ( G , B ) be two NSESs over the common universe U . Then the intersection of ( H , A ) and ( G , B ) is denoted by “ ( H , A ) ~ ( G , B ) ” and is defined by ( H , A ) ~ ( G , B ) = ( K , C ) , where C = A B and the truth-membership, indeterminacy-membership and falsity-membership of ( K , C ) are as follows:
μ K ( e ) ( m ) = min ( μ H ( e ) ( m ) , μ G ( e ) ( m ) ) , v K ( e ) ( m ) = v H ( e ) ( m ) + v G ( e ) ( m ) 2 , w K ( e ) ( m ) = max ( w H ( e ) ( m ) , w G ( e ) ( m ) ) ,
i f   e A B .
Definition 10
([29]). Let U be a universe. A neutrosophic multiset set (Nms) A on U can be defined as follows:
A = { u , ( μ A 1 ( u ) , μ A 2 ( u ) , , μ A p ( u ) ) , ( v A 1 ( u ) , v A 2 ( u ) , , v A p ( u ) ) , ( w A 1 ( u ) , w A 2 ( u ) , , w A p ( u ) ) : u U }
where,
μ A 1 ( u ) , μ A 2 ( u ) , , μ A p ( u ) : U [ 0 , 1 ] , v A 1 ( u ) , v A 2 ( u ) , , v A p ( u ) : U [ 0 , 1 ] ,
and
w A 1 ( u ) , w A 2 ( u ) , , w A p ( u ) : U [ 0 , 1 ] ,
such that
0 s u p μ A i ( u ) + s u p v A i ( u ) + s u p w A i ( u ) 3
( i = 1 , 2 , , P ) and
( μ A 1 ( u ) , μ A 2 ( u ) , , μ A p ( u ) ) , ( v A 1 ( u ) , v A 2 ( u ) , , v A p ( u ) )   a n d   ( w A 1 ( u ) , w A 2 ( u ) , , w A p ( u ) )
This is the truth-membership sequence, indeterminacy-membership sequence and falsity-membership sequence of the element u , respectively. Also, P is called the dimension (cardinality) of Nms A , denoted d ( A ) . 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 U is denoted by NMS( U ).
Definition 11
([28]). Let Ψ K NP-soft set. Then an NP-aggregation operator of Ψ K , denoted by Ψ K a g g is defined by
Ψ K a g g = { ( u , T K a g g , I K a g g , F K a g g ) : u U } ,
which is a neutrosophic set over U ,
T K a g g : U [ 0 , 1 ] T K a g g ( u ) = 1 | U | e E u U T K ( u ) . λ f K ( x ) ( u ) , I K a g g : U [ 0 , 1 ] I K a g g ( u ) = 1 | U | e E u U I K ( u ) . λ f K ( x ) ( u ) , F K a g g : U [ 0 , 1 ] F K a g g = 1 | U | e E u U F K ( u ) . λ f K ( x ) ( u )
and where,
λ f K ( x ) ( u ) = { 1 , x f K ( x ) ( u ) , 0 , otherwise .
| U | is the cardinality of U .

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, V is an initial universe, E is a set of parameters X is a set of experts (agents), and O = { agree = 1 , disagree = 0 } a set of opinions. Let Z = E × X × O and G Z and µ is a membership function of G ; that is, : G Ι = [ 0 , 1 ] .
Definition 12.
A pair ( F , G ) is called a neutrosophic soft expert multiset over V , where F is mapping given by
F : G N ( V ) × Ι ,
where N ( V ) be the set of all neutrosophic soft expert subsets of U . For any parameter e G ,   F ( e ) is referred as the neutrosophic value set of parameter e , i.e.,
F ( e ) = { v ( D F ( e ) 1 ( v ) , , D F ( e ) n ) , ( I F ( e ) 1 ( v ) , , I F ( e ) n ) , ( Y F ( e ) 1 ( v ) , , Y F ( e ) n ) } ,
where D i , Ι i , Y i : U [ 0 , 1 ] are the membership sequence of truth, indeterminacy and falsity respectively of the element v V . For any v V , e G and i = 1 , 2 , , n .
0 D i F ( e ) ( v ) + Ι i F ( e ) ( v ) + Y i F ( e ) ( v ) 3
In fact F is a parameterized family of neutrosophic soft expert multisets on V , which has the degree of possibility of the approximate value set which is prepresented by ( e ) for each parameter e . So we can write it as follows:
F ( e ) = { ( v 1 F ( e ) ( v 1 ) , v 2 F ( e ) ( v 2 ) , v 3 F ( e ) ( v 3 ) , , v n F ( e ) ( v n ) ) , ( e ) } .
Example 1.
Suppose that V = { v 1 } is a set of computers and E = { e 1 , e 2 } is a set of decision parameters. Let X = { p , r } be set of experts. Suppose that
F ( e 1 , p , 1 ) = { ( v 1 ( 0.4 , 0.3 , , 0.2 ) , ( 0.5 , 0.7 , , 0.2 ) , ( 0.6 , 0.1 , , 0.3 ) ) , 0.4 } F ( e 1 , r , 1 ) = { ( v 1 ( 0.3 , 0.2 , , 0.5 ) , ( 0.8 , 0.1 , , 0.4 ) , ( 0.5 , 0.6 , , 0.2 ) ) , 0.8 } F ( e 2 , p , 1 ) = { ( v 1 ( 0.7 , 0.3 , , 0.6 ) , ( 0.3 , 0.2 , , 0.6 ) , ( 0.8 , 0.2 , , 0.1 ) ) , 0.5 } F ( e 2 , r , 1 ) = { ( v 1 ( 0.8 , 0.3 , , 0.4 ) , ( 0.3 , 0.1 , , 0.5 ) , ( 0.2 , 0.3 , , 0.4 ) ) , 0.4 } F ( e 1 , p , 0 ) = { ( v 1 ( 0.5 , 0.1 , , 0.2 ) , ( 0.6 , 0.3 , , 0.4 ) , ( 0.7 , 0.2 , , 0.6 ) ) , 0.1 } F ( e 1 , r , 0 ) = { ( v 1 ( 0.4 , 0.2 , , 0.1 ) , ( 0.6 , 0.1 , , 0.3 ) , ( 0.7 , 0.2 , , 0.4 ) ) , 0.4 } F ( e 2 , p , 0 ) = { ( v 1 ( 0.8 , 0.1 , , 0.5 ) , ( 0.2 , 0.1 , , 0.4 ) , ( 0.6 , 0.3 , , 0.1 ) ) , 0.6 } F ( e 2 , r , 0 ) = { ( v 1 ( 0.7 , 0.2 , , 0.3 ) , ( 0.4 , 0.1 , , 0.6 ) , ( 0.3 , 0.2 , , 0.1 ) ) , 0.2 }
The neutrosophic soft expert multiset ( F , Z ) is a parameterized family { F ( e i ) ,   i = 1 , 2 , } of all neutrosophic multisets of V and describes a collection of approximation of an object.
Definition 13.
For two neutrosophic soft expert multisets (NSEMs) ( F , G ) and ( H η , R ) over U , ( F , G ) is called a neutrosophic soft expert subset of ( H η , R ) if
i. 
R G ,
ii. 
for all ε H , H η ( ε ) is neutrosophic soft expert subset F ( ε ) .
Example 2.
Consider Example 1. Suppose that G and R are as follows.
G = { ( e 1 , p , 1 ) , ( e 2 , p , 1 ) , ( e 2 , p , 0 ) , ( e 2 , r , 1 ) } R = { ( e 1 , p , 1 ) , ( e 2 , r , 1 ) }
Since R is a neutrosophic soft expert subset of G , clearly R G . Let ( H η , R ) and ( F , G ) be defined as follows:
( F , G ) = { [ ( e 1 , p , 1 ) , ( v 1 ( 0.4 , 0.3 , , 0.2 ) , ( 0.5 , 0.7 , , 0.2 ) , ( 0.6 , 0.1 , , 0.3 ) ) , 0.4 ] , [ ( e 2 , p , 1 ) , ( v 1 ( 0.7 , 0.3 , , 0.6 ) , ( 0.3 , 0.2 , , 0.6 ) , ( 0.8 , 0.2 , , 0.1 ) ) , 0.5 ] , [ ( e 2 , p , 0 ) , ( v 1 ( 0.8 , 0.1 , , 0.5 ) , ( 0.2 , 0.1 , , 0.4 ) , ( 0.6 , 0.3 , , 0.1 ) ) , 0.6 ] , [ ( e 2 , r , 1 ) , ( v 1 ( 0.8 , 0.3 , , 0.4 ) , ( 0.3 , 0.1 , , 0.5 ) , ( 0.2 , 0.3 , , 0.4 ) ) , 0.4 ] } . ( H η , R ) = { [ ( e 1 , p , 1 ) , ( v 1 ( 0.4 , 0.3 , , 0.2 ) , ( 0.5 , 0.7 , , 0.2 ) , ( 0.6 , 0.1 , , 0.3 ) ) , 0.4 ] , [ ( e 2 , r , 1 ) , ( v 1 ( 0.8 , 0.3 , , 0.4 ) , ( 0.3 , 0.1 , , 0.5 ) , ( 0.2 , 0.3 , , 0.4 ) ) , 0.4 ] } .
Therefore ( H η , R ) ( F , G ) .
Definition 14.
Two NSEMs ( F , G ) and ( G η , B ) over V are said to be equal if ( F , G ) is a NSEM subset of ( H η , R ) and ( H η , R ) is a NSEM subset of ( F , G ) .
Definition 15.
Agree-NSEMs ( F , G ) 1 over V is a NSEM subset of ( F , G ) defined as follows.
( F , G ) 1 = { F 1 ( Δ ) : Δ E × X × { 1 } } .
Example 3.
Consider Example 1. The agree- neutrosophic soft expert multisets ( F , Z ) 1 over V is
( F , Z ) 1 = { [ ( e 1 , p , 1 ) , ( v 1 ( 0.4 , 0.3 , , 0.2 ) , ( 0.5 , 0.7 , , 0.2 ) , ( 0.6 , 0.1 , , 0.3 ) ) , 0.4 ] , [ ( e 1 , r , 1 ) , ( v 1 ( 0.3 , 0.2 , , 0.5 ) , ( 0.8 , 0.1 , , 0.4 ) , ( 0.5 , 0.6 , , 0.2 ) ) , 0.8 ] , [ ( e 2 , p , 1 ) , ( v 1 ( 0.7 , 0.3 , , 0.6 ) , ( 0.3 , 0.2 , , 0.6 ) , ( 0.8 , 0.2 , , 0.1 ) ) , 0.5 ] , [ ( e 2 , r , 1 ) , ( v 1 ( 0.8 , 0.3 , , 0.4 ) , ( 0.3 , 0.1 , , 0.5 ) , ( 0.2 , 0.3 , , 0.4 ) ) , 0.4 ] } .
Definition 16.
A disagree-NSEMs ( F , G ) 0 over V is a NSES subset of ( F , G ) is defined as follows:
( F , A ) 0 = { F 0 ( Δ ) : Δ E × X × { 0 } } .
Example 4.
Consider Example 1. The disagree- neutrosophic soft expert multisets ( F , Z ) 0 over V are
( F , Z ) 0 = { [ ( e 1 , p , 0 ) , ( v 1 ( 0.5 , 0.1 , , 0.2 ) , ( 0.6 , 0.3 , , 0.4 ) , ( 0.7 , 0.2 , , 0.6 ) ) , 0.1 ] , [ ( e 1 , r , 0 ) , ( v 1 ( 0.4 , 0.2 , , 0.1 ) , ( 0.6 , 0.1 , , 0.3 ) , ( 0.7 , 0.2 , , 0.4 ) ) , 0.4 ] , [ ( e 2 , p , 0 ) , ( v 1 ( 0.8 , 0.1 , , 0.5 ) , ( 0.2 , 0.1 , , 0.4 ) , ( 0.6 , 0.3 , , 0.1 ) ) , 0.6 ] , [ ( e 2 , r , 0 ) , ( v 1 ( 0.7 , 0.2 , , 0.3 ) , ( 0.4 , 0.1 , , 0.6 ) , ( 0.3 , 0.2 , , 0.1 ) ) , 0.2 ] } .

4. Basic Operations on NSEMs

Definition 17.
The complement of a neutrosophic soft expert multiset ( F , G ) is denoted by ( F , G ) c and is defined by ( F , G ) c = ( F ( c ) , ¬ G ) where F µ ( c ) : ¬ G N ( V ) × Ι is mapping given by
F ( c ) ( Δ ) = { D i F ( Δ ) ( c ) = Y i F ( Δ ) ,   I i F ( Δ ) ( c ) = 1 ¯ I i F ( Δ ) ,   Y i F ( Δ ) ( c ) = D i F ( Δ )   and   c ( Δ ) = 1 ¯ ( Δ ) }
for each Δ E .
Example 5.
Consider Example 1. The complement of the neutrosophic soft expert multiset F denoted by F ( c ) is given by as follows:
( F ( c ) , Z ) = { [ ( ¬ e 1 , p , 1 ) , ( v 1 ( 0.2 , 0.7 , , 0.4 ) , ( 0.2 , 0.3 , , 0.5 ) , ( 0.3 , 0.9 , , 0.6 ) ) , 0.6 ] , [ ( ¬ e 1 , r , 1 ) , ( v 1 ( 0.5 , 0.8 , , 0.3 ) , ( 0.4 , 0.9 , , 0.8 ) , ( 0.2 , 0.4 , , 0.5 ) ) , 0.2 ] , [ ( ¬ e 2 , p , 1 ) , ( v 1 ( 0.6 , 0.7 , , 0.7 ) , ( 0.6 , 0.8 , , 0.3 ) , ( 0.1 , 0.8 , , 0.8 ) ) , 0.5 ] , [ ( ¬ e 2 , r , 1 ) , ( v 1 ( 0.4 , 0.7 , , 0.8 ) , ( 0.5 , 0.9 , , 0.3 ) , ( 0.4 , 0.7 , , 0.2 ) ) , 0.6 ] , [ ( ¬ e 1 , p , 0 ) , ( v 1 ( 0.2 , 0.9 , , 0.5 ) , ( 0.4 , 0.7 , , 0.6 ) , ( 0.6 , 0.8 , , 0.7 ) ) , 0.9 ] , [ ( ¬ e 1 , r , 0 ) , ( v 1 ( 0.1 , 0.8 , , 0.4 ) , ( 0.3 , 0.9 , , 0.6 ) , ( 0.4 , 0.8 , , 0.7 ) ) , 0.6 ] , [ ( ¬ e 2 , p , 0 ) , ( v 1 ( 0.5 , 0.9 , , 0.8 ) , ( 0.4 , 0.9 , , 0.2 ) , ( 0.1 , 0.7 , , 0.6 ) ) , 0.4 ] , [ ( ¬ e 2 , r , 0 ) , ( v 1 ( 0.3 , 0.8 , , 0.7 ) , ( 0.6 , 0.9 , , 0.4 ) , ( 0.1 , 0.8 , , 0.3 ) ) , 0.8 ] } .
Proposition 1.
If ( F , G ) is a neutrosophic soft expert multiset over V , then
1. 
( ( F , G ) c ) c = ( F , G )
2. 
( ( F , G ) 1 ) c = ( F , G ) 0
3. 
( ( F , G ) 0 ) c = ( F , G ) 1
Proof. 
(1) From Definition 17, we have ( F , G ) c = ( F ( c ) , ¬ G ) where F ( c ) ( Δ ) = D F ( Δ ) ( c ) i = Y F ( Δ ) i , I F ( Δ ) ( c ) i = 1 ¯ I F ( Δ ) i ,   Y F ( Δ ) ( c ) i = D F ( Δ ) i and c ( Δ ) = 1 ¯ ( Δ ) for each Δ E . Now ( ( F , G ) c ) c = ( ( F ( c ) ) c , G ) where
( F ( c ) ) c ( Δ ) = [ D F ( Δ ) ( c ) i = Y F ( Δ ) i , I F ( Δ ) ( c ) i = 1 ¯ I F ( Δ ) i , Y F ( Δ ) ( c ) i = D F ( Δ ) i , ( i ) c ( Δ ) = 1 ¯   i ( Δ ) ] c = D F ( Δ ) i = Y F ( Δ ) ( c ) i , I F ( Δ ) i = 1 ¯ I F ( Δ ) ( c ) i , Y F ( Δ ) i = D F ( Δ ) ( c ) i , i ( Δ ) = 1 ¯ ( i ) ( Δ ) = 1 ¯ ( 1 ¯ I F ( Δ ) i ) = 1 ¯ ( 1 ¯ i ( Δ ) ) = I F ( Δ ) i = i ( Δ )
Thus ( ( F , G ) c ) c = ( ( F ( c ) ) c , G ) = ( F , G ) , for all Δ E .
The Proofs (2) and (3) can proved similarly. □
Definition 18.
The union of two NSEMs ( F , G ) and ( K ρ , L ) over V , denoted by ( F , G ) ~ ( K ρ , L ) is a NSEMs ( H σ , C ) where C = G L and   e C ,
( H σ , C ) = { m a x ( D i ( F ( e ) ( m ) , D i ( K ρ ( e ) ( m ) ) i f   Δ G L m i n ( I i ( F ( e ) ( m ) , I i ( K ρ ( e ) ( m ) ) i f   Δ G L m i n ( Y i ( F ( e ) ( m ) , Y i ( K ρ ( e ) ( m ) ) i f   Δ G L
where σ ( m ) = m a x ( ( e ) ( m ) , ρ ( e ) ( m ) ) .
Example 6.
Suppose that ( F , G ) and ( K ρ , L ) are two NSEMs over V , such that
( F , G ) = { [ ( e 1 , p , 1 ) , ( v 1 ( 0.7 , 0.3 , , 0.6 ) , ( 0.5 , 0.2 , , 0.4 ) , ( 0.7 , 0.6 , , 0.3 ) ) , 0.3 ] , [ ( e 2 , q , 1 ) , ( v 1 ( 0.4 , 0.3 , , 0.6 ) , ( 0.8 , 0.2 , , 0.4 ) , ( 0.5 , 0.1 , , 0.7 ) ) , 0.6 ] , [ ( e 3 , r , 1 ) , ( v 1 ( 0.8 , 0.2 , , 0.3 ) , ( 0.6 , 0.3 , , 0.7 ) , ( 0.4 , 0.2 , , 0.8 ) ) , 0.5 ] } . ( K ρ , L ) = { [ ( e 1 , p , 1 ) , ( v 1 ( 0.4 , 0.3 , , 0.1 ) , ( 0.7 , 0.2 , , 0.3 ) , ( 0.5 , 0.4 , , 0.7 ) ) , 0.6 ] , [ ( e 3 , r , 1 ) , ( v 1 ( 0.8 , 0.3 , , 0.2 ) , ( 0.6 , 0.1 , , 0.2 ) , ( 0.3 , 0.5 , , 0.3 ) ) , 0.7 ] }
Then ( F , G ) ~ ( K ρ , L ) = ( H σ , C ) where
( H σ , C ) = { [ ( e 1 , p , 1 ) , ( v 1 ( 0.7 , 0.3 , , 0.1 ) , ( 0.7 , 0.2 , , 0.3 ) , ( 0.7 , 0.4 , , 0.3 ) ) , 0.6 ] , [ ( e 2 , q , 1 ) , ( v 1 ( 0.4 , 0.3 , , 0.6 ) , ( 0.8 , 0.2 , , 0.4 ) , ( 0.5 , 0.1 , , 0.7 ) ) , 0.6 ] , [ ( e 3 , r , 1 ) , ( v 1 ( 0.8 , 0.2 , , 0.2 ) , ( 0.6 , 0.1 , , 0.2 ) , ( 0.4 , 0.2 , , 0.3 ) ) , 0.7 ] } .
Proposition 2.
If ( F , G ) , ( K ρ , L ) and ( H Ω , C ) are three NSEMs over V , then
1. 
( ( F , G ) ~ ( K ρ , L ) ) ~ ( H σ , C ) = ( F , G ) ~ ( ( K ρ , L ) ~ ( H σ , C ) )
2. 
( F , G ) ( F , G ) ( F , G ) .
Proof. 
(1) We want to prove that
( ( F , G ) ~ ( K ρ , L ) ) ~ ( H σ , C ) = ( F , G ) ~ ( ( K ρ , L ) ~ ( H σ , C ) )
by using Definition 18, we consider the case when if e G L as other cases are trivial. We will have
( F , G ) ~ ( K ρ , L ) = { ( v / m a x ( D i F ( e ) ( m ) , D i G ρ ( e ) ( m ) ) , m i n ( I i F ( e ) ( m ) , I i G ρ ( e ) ( m ) ) , m i n ( Y i F ( e ) ( m ) , Y i G ρ ( e ) ( m ) ) ) , m a x ( ( e ) ( m ) , ρ ( e ) ( m ) ) , v V }
Also consider the case when e H as the other cases are trivial. We will have
( ( F µ , A ) ~ ( G η , B ) ) ~ ( H Ω , C ) = { ( v / m a x ( D i F ( e ) ( m ) , D i G ρ ( e ) ( m ) ) , m i n ( I i F ( e ) ( m ) , I i G ρ ( e ) ( m ) ) , m i n ( Y i F ( e ) ( m ) , Y i G ρ ( e ) ( m ) ) ) , ( v / D i H Ω ( e ) ( m ) , I i H Ω ( e ) ( m ) , Y i H Ω ( e ) ( m ) ) , m a x ( µ ( e ) ( m ) , η ( e ) ( m ) , Ω ( m ) ) , v V } = { ( v / D i F Ω ( e ) ( m ) , I i F Ω ( e ) ( m ) , Y i F Ω ( e ) ( m ) ) , ( v / m a x ( D i G µ ( e ) ( m ) , D i H η ( e ) ( m ) ) , m i n ( I i G µ ( e ) ( m ) , I i ( m ) ) ,   m i n ( Y i G µ ( e ) ( m ) , Y i ( m ) ) ) m a x ( ( e ) ( m ) , ρ ( e ) ( m ) , σ ( m ) ) , v V } = ( F , G ) ~ ( ( K ρ , L ) ~ ( H σ , C ) ) .
(2) The proof is straightforward. □
Definition 19.
The intersection of two NSEMs ( F , G ) and ( K ρ , L ) over V , denoted by ( F , G ) ~ ( K ρ , L ) = ( P δ , C ) where C = G L and   e C ,
( P δ , C ) = { m i n ( D i ( F ( e ) ( m ) , D i ( K ρ ( e ) ( m ) ) i f   e G L m a x ( I i ( F ( e ) ( m ) , I i ( K ρ ( e ) ( m ) ) i f   e G L m a x ( Y i ( F ( e ) ( m ) , Y i ( K ρ ( e ) ( m ) ) i f   e G L
where δ ( m ) = m i n ( ( e ) ( m ) , ρ ( e ) ( m ) ) .
Example 7.
Suppose that ( F , G ) and ( K ρ , L ) are two NSEMs over V , such that
( F , G ) = { [ ( e 3 , r , 1 ) , ( v 1 ( 0.8 , 0.3 , , 0.2 ) , ( 0.6 , 0.1 , , 0.2 ) , ( 0.3 , 0.5 , , 0.3 ) ) , 0.4 ] , [ ( e 1 , q , 1 ) , ( v 1 ( 0.8 , 0.2 , , 0.2 ) , ( 0.7 , 0.3 , , 0.2 ) , ( 0.4 , 0.2 , , 0.3 ) ) , 0.7 ] , [ ( e 3 , q , 0 ) , ( v 1 ( 0.4 , 0.3 , , 0.6 ) , ( 0.8 , 0.2 , , 0.4 ) , ( 0.5 , 0.1 , , 0.7 ) ) , 0.6 ] } . ( K ρ , L ) = { [ ( e 1 , p , 1 ) , ( v 1 ( 0.7 , 0.3 , , 0.1 ) , ( 0.7 , 0.2 , , 0.3 ) , ( 0.7 , 0.4 , , 0.3 ) ) , 0.3 ] , [ ( e 3 , r , 1 ) , ( v 1 ( 0.4 , 0.7 , , 0.8 ) , ( 0.5 , 0.9 , , 0.3 ) , ( 0.4 , 0.7 , , 0.2 ) ) , 0.8 ] }
Then ( F , G ) ~ ( K ρ , L ) = ( P δ , C ) where
( P δ , C ) = { [ ( e 3 , r , 1 ) , ( v 1 ( 0.4 , 0.3 , , 0.2 ) , ( 0.6 , 0.9 , , 0.3 ) , ( 0.4 , 0.7 , , 0.3 ) ) , 0.4 ] } .
Proposition 3.
If ( F , G ) , ( K ρ , L ) and ( H Ω , C ) are three NSEMs over V , then
1. 
( ( F , G ) ~ ( K ρ , L ) ) ~ ( H σ , C ) = ( F , G ) ~ ( ( K ρ , L ) ~ ( H σ , C ) )
2. 
( F , G ) ~ ( F , G ) ( F , G ) .
Proof. 
(1) We want to prove that
( ( F , G ) ~ ( K ρ , L ) ) ~ ( H σ , C ) = ( F , G ) ~ ( ( K ρ , L ) ~ ( H σ , C ) )
by using Definition 19, we consider the case when if e G L as other cases are trivial. We will have
( F , G ) ~ ( K ρ , L ) = { ( v / m i n ( D i F ( e ) ( m ) , D i G ρ ( e ) ( m ) ) , m a x ( I i F ( e ) ( m ) , I i G ρ ( e ) ( m ) ) , m a x ( Y i F ( e ) ( m ) , Y i G ρ ( e ) ( m ) ) ) , m i n ( ( e ) ( m ) , ρ ( e ) ( m ) ) , v V }
Also consider the case when Δ H as the other cases are trivial. We will have
( ( F µ , A ) ~ ( G η , B ) ) ~ ( H Ω , C ) = { ( v / m a x ( D i F ( e ) ( m ) , D i G ρ ( e ) ( m ) ) , m i n ( I i F ( e ) ( m ) , I i G ρ ( e ) ( m ) ) , m i n ( Y i F ( e ) ( m ) , Y i G ρ ( e ) ( m ) ) ) , ( v / D i H Ω ( e ) ( m ) , I i H Ω ( e ) ( m ) , Y i H Ω ( e ) ( m ) ) , m i n ( µ ( e ) ( m ) , η ( e ) ( m ) , Ω ( m ) ) , v V } = { ( v / D i F Ω ( e ) ( m ) , I i F Ω ( e ) ( m ) , Y i F Ω ( e ) ( m ) ) , ( v / m i n ( D i G µ ( e ) ( m ) , D i H η ( e ) ( m ) ) , m a x ( I i G µ ( e ) ( m ) , I i ( m ) ) , m a x ( Y i G µ ( e ) ( m ) , Y i ( m ) ) ) m i n ( ( e ) ( m ) , ρ ( e ) ( m ) , σ ( m ) ) , v V } = ( F , G ) ~ ( ( K ρ , L ) ~ ( H σ , C ) ) .
(2) The proof is straightforward. □
Proposition 4.
If ( F , G ) , ( K ρ , L ) and ( H Ω , C ) are three NSEMs over V . Then
1. 
( ( F , G ) ~ ( K ρ , L ) ) ~ ( H σ , C ) = ( ( F , G ) ~ ( H σ , C ) ) ~ ( ( K ρ , L ) ~ ( H σ , C ) ) .
2. 
( ( F , G ) ~ ( K ρ , L ) ) ~ ( H σ , C ) = ( ( F , G ) ~ ( H σ , C ) ) ~ ( ( K ρ , L ) ~ ( H σ , C ) ) .
Proof. 
The proofs can be easily obtained from Definitions 18 and 19. □

5. AND and OR Operations

Definition 20.
Let ( F , G ) and ( K ρ , L ) be any two NSEMs over V , then ( F , G ) A N D ( K ρ , L ) denoted ( F , G ) ( K ρ , L ) is defined by
( F , G ) ( K ρ , L ) = ( H σ , G × L )
where ( H σ , G × L ) = H σ ( α , β ) such that H σ ( α , β ) = F ( α ) K ρ ( β ) for all ( α , β ) G × L where represent the basic intersection.
Example 8.
Suppose that ( F , G ) and ( K ρ , L ) are two NSEMs over V , such that
( F , G ) = { [ ( e 1 , p , 1 ) , ( v 1 ( 0.2 , 0.3 , , 0.6 ) , ( 0.2 , 0.1 , , 0.8 ) , ( 0.3 , 0.2 , , 0.6 ) ) , 0.1 ] , [ ( e 2 , r , 0 ) , ( v 1 ( 0.5 , 0.3 , , 0.4 ) , ( 0.6 , 0.5 , , 0.4 ) , ( 0.2 , 0.4 , , 0.3 ) ) , 0.5 ] } . ( K ρ , L ) = { [ ( e 1 , p , 1 ) , ( v 1 ( 0.3 , 0.2 , , 0.1 ) , ( 0.5 , 0.2 , , 0.3 ) , ( 0.8 , 0.3 , , 0.4 ) ) , 0.2 ] , [ ( e 2 , q , 0 ) , ( v 1 ( 0.6 , 0.4 , , 0.7 ) , ( 0.3 , 0.4 , , 0.2 ) , ( 0.6 , 0.1 , , 0.5 ) ) , 0.6 ] } .
Then ( F , G ) ( K ρ , L ) = ( H σ , G × L ) where
( H σ , G × L ) = { [ ( e 1 , p , 1 ) , ( e 1 , p , 1 ) ( v 1 ( 0.2 , 0.2 , , 0.1 ) , ( 0.5 , 0.2 , , 0.8 ) , ( 0.8 , 0.3 , , 0.6 ) ) , 0.1 ] , [ ( e 1 , p , 1 ) , ( e 2 , q , 0 ) , ( v 1 ( 0.2 , 0.3 , , 0.6 ) , ( 0.3 , 0.4 , , 0.8 ) , ( 0.6 , 0.2 , , 0.6 ) ) , 0.1 ] , [ ( e 2 , r , 0 ) , ( e 1 , p , 1 ) , ( v 1 ( 0.3 , 0.2 , , 0.1 ) , ( 0.6 , 0.5 , , 0.4 ) , ( 0.8 , 0.4 , , 0.4 ) ) , 0.2 ] , [ ( e 2 , r , 0 ) , ( e 2 , q , 0 ) , ( v 1 ( 0.5 , 0.3 , , 0.4 ) , ( 0.6 , 0.5 , , 0.4 ) , ( 0.6 , 0.4 , , 0.5 ) ) , 0.5 ] } .
Definition 21.
Let ( F , G ) and ( K ρ , L ) be any two NSEMs over V , then ( F , G ) O R ( K ρ , L ) denoted ( F , G ) ( K ρ , L ) is defined by
( F , G ) ( K ρ , L ) = ( H σ , G × L )
where ( H σ , G × L ) = H σ ( α , β ) such that H σ ( α , β ) =   F ( α ) K ρ ( β ) for all ( α , β ) G × L where represent the basic union.
Example 9.
Suppose that ( F , G ) and ( K ρ , L ) are two NSEMs over V , such that
( F , G ) = { [ ( e 1 , p , 1 ) , ( v 1 ( 0.2 , 0.3 , , 0.6 ) , ( 0.2 , 0.1 , , 0.8 ) , ( 0.3 , 0.2 , , 0.6 ) ) , 0.1 ] , [ ( e 2 , r , 0 ) , ( v 1 ( 0.5 , 0.3 , , 0.4 ) , ( 0.6 , 0.5 , , 0.4 ) , ( 0.2 , 0.4 , , 0.3 ) ) , 0.5 ] } . ( K ρ , L ) = { [ ( e 1 , p , 1 ) , ( v 1 ( 0.3 , 0.2 , , 0.1 ) , ( 0.5 , 0.2 , , 0.3 ) , ( 0.8 , 0.3 , , 0.4 ) ) , 0.2 ] , [ ( e 2 , q , 0 ) , ( v 1 ( 0.6 , 0.4 , , 0.7 ) , ( 0.3 , 0.4 , , 0.2 ) , ( 0.6 , 0.1 , , 0.5 ) ) , 0.6 ] } .
Then ( F , G ) ( K ρ , L ) = ( H σ , G × L ) where
( H σ , G × L ) = { [ ( e 1 , p , 1 ) , ( e 1 , p , 1 ) ( v 1 ( 0.3 , 0.3 , , 0.6 ) , ( 0.2 , 0.1 , , 0.3 ) , ( 0.3 , 0.2 , , 0.4 ) ) , 0.2 ] , [ ( e 1 , p , 1 ) , ( e 2 , q , 0 ) , ( v 1 ( 0.6 , 0.4 , , 0.7 ) , ( 0.2 , 0.1 , , 0.2 ) , ( 0.3 , 0.1 , , 0.5 ) ) , 0.6 ] , [ ( e 2 , r , 0 ) , ( e 1 , p , 1 ) , ( v 1 ( 0.5 , 0.3 , , 0.4 ) , ( 0.5 , 0.2 , , 0.3 ) , ( 0.2 , 0.3 , , 0.3 ) ) , 0.2 ] , [ ( e 2 , r , 0 ) , ( e 2 , q , 0 ) , ( v 1 ( 0.6 , 0.4 , , 0.7 ) , ( 0.3 , 0.4 , , 0.2 ) , ( 0.2 , 0.1 , , 0.3 ) ) , 0.6 ] } .
Proposition 5.
Let ( F , G ) and ( K ρ , L ) be NSEMs over V . Then
1. 
( ( F , G ) ( K ρ , L ) ) c = ( F µ , A ) c ( G η , B ) c
2. 
( ( F , G ) ( K ρ , L ) ) c = ( F µ , A ) c ( G η , B ) c
Proof. 
(1) Suppose that ( F , G ) and ( K ρ , L ) be NSEMs over V defined as:
( F , G ) ( K ρ , L ) = ( F ( α ) K ρ ( β ) ) c = ( F ( α ) K ρ ( β ) ) c = ( F ( α ) K ρ ( β ) ) c = ( F ( c ) ( α ) K ρ ( c ) ( β ) ) = ( F ( c ) ( α ) K ρ ( c ) ( β ) ) = ( F µ , A ) c ( G η , B ) c
(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.
Definition 22.
Let Γ G N S E M s . Then NSEMs-aggregation operator of Γ G , denoted by Γ G a g g , is defined by
Γ G a g g = { ( v , ( D i ) G a g g ( v ) , ( I i ) G a g g ( v ) , ( Y i ) G a g g ( v ) ) : v V } ,
which are NSEMs over V ,
( D i ) G a g g : V [ 0 , 1 ] ( D i ) G a g g ( v ) = ( 1 | V | e E v V D i G ( v ) ) . , ( Y i ) G a g g : V [ 0 , 1 ] ( Y i ) G a g g ( v ) = ( 1 | V | e E v V Y i G ( v ) ) . , ( I i ) G a g g : V [ 0 , 1 ] ( I i ) G a g g ( v ) = ( 1 | V | e E v V I i G ( v ) ) .
where | V | is the cardinality of V and i is defined below
= 1 n . i = 1 n ( e i ) . ( e i ,   i = 1 , 2 , 3 , , n )
Definition 23.
Let Γ G N S E M s , Γ G a g g be NSEMs. Then a reduced fuzzy set of Γ G a g g is a fuzzy set over is denoted by
Γ G a g g = { λ Γ G a g g ( v ) v : v V } ,
where λ Γ G a g g ( v ) : V [ 0 , 1 ] and v i = | ( D i ) G i a g g ( Y i ) G i a g g ( I i ) G i a g g | .

7. 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 Γ G a g g of Γ G and the reduced fuzzy set ( D i ) G i a g g , ( Y i ) G i a g g , ( I i ) G i a g g of Γ G a g g
  • Step 4-Score ( v İ ) = ( max a g r e e ( v i ) ) ( min d i s a g r e e ( v i ) )
  • Step 5-Choose the element of v i that has maximum membership. This will be the optimal solution.
Example 10.
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., V = { v 1 , v 2 , v 3 } . Suppose there are three parameters E = { e 1 , e 2 , e 3 } where the parameters e i   ( i = 1 , 2 , 3 ) stand for “time”, “temperature” and “spatial needs” respectively. Let X = { p , q } 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:
    ( F , Z ) = { [ ( e 1 , p , 1 ) , ( v 1 ( 0.3 , 0.1 , 0.4 ) , ( 0.2 , 0.1 , 0.5 ) , ( 0.5 , 0.2 , 0.6 ) ) , ( v 2 ( 0.4 , 0.2 , 0.3 ) , ( 0.7 , 0.1 , 0.6 ) , ( 0.3 , 0.2 , 0.6 ) ) , ( v 3 ( 0.5 , 0.3 , 0.4 ) , ( 0.2 , 0.1 , 0.8 ) , ( 0.4 , 0.2 , 0.3 ) ) , 0.7 ] , [ ( e 1 , q , 1 ) , ( v 1 ( 0.4 , 0.2 , 0.5 ) , ( 0.3 , 0.1 , 0.2 ) , ( 0.6 , 0.3 , 0.4 ) ) , ( v 2 ( 0.5 , 0.3 , 0.2 ) , ( 0.8 , 0.2 , 0.4 ) , ( 0.5 , 0.3 , 0.2 ) ) , ( v 3 ( 0.6 , 0.3 , 0.8 ) , ( 0.3 , 0.2 , 0.1 ) , ( 0.5 , 0.4 , 0.3 ) ) , 0.6 ] , [ ( e 2 , p , 1 ) , ( v 1 ( 0.6 , 0.4 , 0.2 ) , ( 0.3 , 0.1 , 0.4 ) , ( 0.8 , 0.2 , 0.5 ) ) , ( v 2 ( 0.8 , 0.3 , 0.4 ) , ( 0.2 , 0.1 , 0.5 ) , ( 0.4 , 0.3 , 0.5 ) ) , ( v 3 ( 0.8 , 0.3 , 0.2 ) , ( 0.3 , 0.1 , 0.4 ) , ( 0.2 , 0.1 , 0.4 ) ) , 0.8 ] , [ ( e 2 , q , 1 ) , ( v 1 ( 0.5 , 0.2 , 0.4 ) , ( 0.3 , 0.2 , 0.5 ) , ( 0.6 , 0.1 , 0.3 ) ) , ( v 2 ( 0.6 , 0.4 , 0.7 ) , ( 0.5 , 0.3 , 0.2 ) , ( 0.6 , 0.2 , 0.4 ) ) , ( v 3 ( 0.6 , 0.5 , 0.4 ) , ( 0.1 , 0.3 , 0.2 ) , ( 0.6 , 0.2 , 0.3 ) ) , 0.4 ] , [ ( e 3 , p , 1 ) , ( v 1 ( 0.8 , 0.1 , 0.5 ) , ( 0.2 , 0.3 , 0.4 ) , ( 0.5 , 0.2 , 0.3 ) ) , ( v 2 ( 0.7 , 0.2 , 0.5 ) , ( 0.1 , 0.2 , 0.3 ) , ( 0.3 , 0.2 , 0.1 ) ) , ( v 3 ( 0.4 , 0.3 , 0.7 ) , ( 0.3 , 0.1 , 0.4 ) , ( 0.5 , 0.3 , 0.2 ) ) , 0.3 ] , [ ( e 3 , q , 1 ) , ( v 1 ( 0.7 , 0.2 , 0.4 ) , ( 0.3 , 0.1 , 0.5 ) , ( 0.6 , 0.2 , 0.1 ) ) , ( v 2 ( 0.9 , 0.4 , 0.5 ) , ( 0.2 , 0.4 , 0.5 ) , ( 0.1 , 0.2 , 0.3 ) ) , ( v 3 ( 0.6 , 0.8 , 0.9 ) , ( 0.2 , 0.1 , 0.6 ) , ( 0.3 , 0.1 , 0.4 ) ) , 0.4 ] , [ ( e 1 , q , 0 ) , ( v 1 ( 0.7 , 0.1 , 0.4 ) , ( 0.3 , 0.2 , 0.1 ) , ( 0.4 , 0.2 , 0.5 ) ) , ( v 2 ( 0.6 , 0.5 , 0.4 ) , ( 0.4 , 0.2 , 0.1 ) , ( 0.8 , 0.2 , 0.6 ) ) , ( v 3 ( 0.9 , 0.4 , 0.5 ) , ( 0.2 , 0.1 , 0.3 ) , ( 0.6 , 0.2 , 0.3 ) ) , 0.7 ] , [ ( e 2 , p , 0 ) , ( v 1 ( 0.6 , 0.5 , 0.7 ) , ( 0.3 , 0.5 , 0.4 ) , ( 0.6 , 0.3 , 0.4 ) ) , ( v 2 ( 0.5 , 0.2 , 0.3 ) , ( 0.2 , 0.1 , 0.3 ) , ( 0.4 , 0.3 , 0.5 ) ) , ( v 3 ( 0.6 , 0.3 , 0.4 ) , ( 0.1 , 0.2 , 0.4 ) , ( 0.5 , 0.3 , 0.2 ) ) , 0.8 ] , [ ( e 2 , q , 0 ) , ( v 1 ( 0.3 , 0.1 , 0.2 ) , ( 0.4 , 0.1 , 0.3 ) , ( 0.5 , 0.2 , 0.6 ) ) , ( v 2 ( 0.7 , 0.2 , 0.4 ) , ( 0.4 , 0.3 , 0.6 ) , ( 0.5 , 0.1 , 0.6 ) ) , ( v 3 ( 0.7 , 0.3 , 0.5 ) , ( 0.2 , 0.4 , 0.3 ) , ( 0.5 , 0.2 , 0.3 ) ) , 0.4 ] , [ ( e 3 , p , 0 ) , ( v 1 ( 0.8 , 0.5 , 0.4 ) , ( 0.2 , 0.4 , 0.3 ) , ( 0.6 , 0.3 , 0.4 ) ) , ( v 2 ( 0.5 , 0.2 , 0.3 ) , ( 0.4 , 0.1 , 0.2 ) , ( 0.2 , 0.1 , 0.4 ) ) , ( v 3 ( 0.4 , 0.3 , 0.2 ) , ( 0.2 , 0.1 , 0.6 ) , ( 0.7 , 0.3 , 0.2 ) ) , 0.5 ] , [ ( e 3 , q , 0 ) , ( v 1 ( 0.6 , 0.1 , 0.4 ) , ( 0.2 , 0.1 , 0.5 ) , ( 0.4 , 0.2 , 0.3 ) ) , ( v 2 ( 0.7 , 0.2 , 0.5 ) , ( 0.4 , 0.3 , 0.2 ) , ( 0.1 , 0.2 , 0.3 ) ) , ( v 3 ( 0.5 , 0.3 , 0.4 ) , ( 0.3 , 0.2 , 0.4 ) , ( 0.4 , 0.2 , 0.3 ) ) , 0.1 ] } .
  • Step 2-Construct the neutrosophic soft expert tables for each opinion (agree, disagree) of expert.
  • Step 3-Now calculate the score of agree ( v i ) by using the data in Table 1 to obtain values in Table 2.
    ( D 1 ) G 1 a g g = ( D G 1 1 + D G 2 1 + D G 3 1 3 ) . ( 1 + 2 + 3 3 ) = ( 0.3 + 0.6 + 0.8 3 ) . ( 0.7 + 0.8 + 0.3 3 ) = 0.34 ( D 2 ) G 1 a g g = ( D G 1 2 + D G 2 2 + D G 3 2 3 ) . ( 1 + 2 + 3 3 ) = ( 0.1 + 0.4 + 0.1 3 ) . ( 0.7 + 0.8 + 0.3 3 ) = 0.12 ( D 3 ) G 1 a g g = ( D G 1 3 + D G 2 3 + D G 3 3 3 ) . ( 1 + 2 + 3 3 ) = ( 0.4 + 0.2 + 0.5 3 ) . ( 0.7 + 0.8 + 0.3 3 ) = 0.22 ( D ) G 1 a g g ( p , v 1 ) = 0.34 + 0.12 + 0.22 3 = 0.2267 ( I 1 ) G 1 a g g = ( I G 1 1 + I G 2 1 + I G 3 1 3 ) . ( 1 + 2 + 3 3 ) = ( 0.2 + 0.3 + 0.2 3 ) . ( 0.7 + 0.8 + 0.3 3 ) = 0.1404 ( I 2 ) G 1 a g g = ( I G 1 2 + I G 2 2 + I G 3 2 3 ) . ( 1 + 2 + 3 3 ) = ( 0.1 + 0.1 + 0.3 3 ) . ( 0.7 + 0.8 + 0.3 3 ) = 0.1002 ( I 3 ) G 1 a g g = ( I G 1 3 + I G 2 3 + I G 3 3 3 ) . ( 1 + 2 + 3 3 ) = ( 0.5 + 0.4 + 0.4 3 ) . ( 0.7 + 0.8 + 0.3 3 ) = 0.2604 ( I ) G 1 a g g ( p , v 1 ) = 0.1404 + 0.1002 + 0.2604 3 = 0.167 ( Y 1 ) G 1 a g g = ( Y G 1 1 + Y G 2 1 + Y G 3 1 3 ) . ( 1 + 2 + 3 3 ) = ( 0.5 + 0.8 + 0.5 3 ) . ( 0.7 + 0.8 + 0.3 3 ) = 0.36 ( Y 2 ) G 1 a g g = ( Y G 1 2 + Y G 2 2 + Y G 3 2 3 ) . ( 1 + 2 + 3 3 ) = ( 0.2 + 0.2 + 0.2 3 ) . ( 0.7 + 0.8 + 0.3 3 ) = 0.12 ( Y 3 ) G 1 a g g = ( Y G 1 3 + Y G 2 3 + Y G 3 3 3 ) . ( 1 + 2 + 3 3 ) = ( 0.6 + 0.5 + 0.3 3 ) . ( 0.7 + 0.8 + 0.3 3 ) = 0.2802 ( Y ) G 1 a g g ( p , v 1 ) = 0.36 + 0.12 + 0.2802 3 = 0.2534 v 1 = | ( D ) G 1 a g g ( I ) G 1 a g g ( Y ) G 1 a g g | = | 0.2267 0.167 0.2534 | = 0.1937
Now calculate the score of disagree ( v i ) by using the data in Table 3 to obtain values in Table 4.
  • Step 4-The final score of v i is computed as follows:
    • Score ( v 1 ) = 0.1142 0.1155 = 0.0013 ,
    • Score ( v 2 ) = 0.1267 0.0933 = 0.0334 ,
    • Score ( v 3 ) = 0.093 0.04 = 0.053.
  • Step 5-Clearly, the maximum score is the score 0.053, shown in the above for the v 3 . Hence the best decision for the experts is to select worker v 2 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.

References

  1. Atanassov, K. Intuitionistic fuzzy sets. Fuzzy Set Syst. 1986, 20, 87–96. [Google Scholar] [CrossRef]
  2. Molodtsov, D. Soft set theory-first results. Comput. Math. Appl. 1999, 37, 19–31. [Google Scholar] [CrossRef]
  3. Smarandache, F. Neutrosophic set—A generalization of the intuitionistic fuzzy sets. Int. J. Pure Appl. Math. 2005, 24, 287–297. [Google Scholar]
  4. Smarandache, F. Neutrosophy: Neutrosophic Probability, Set, and Logic; American Research Press: Rehoboth, IL, USA, 1998. [Google Scholar]
  5. Medina, J.; Ojeda-Aciego, M. Multi-adjoint t-concept lattices. Inf. Sci. 2010, 180, 712–725. [Google Scholar] [CrossRef]
  6. Pozna, C.; Minculete, N.; Precup, R.E.; Kóczy, L.T.; Ballagi, Á. Signatures: Definitions, operators and applications to fuzzy modelling. Fuzzy Sets Syst. 2012, 201, 86–104. [Google Scholar] [CrossRef]
  7. Moallem, P.; Mousavi, B.S.; Naghibzadeh, S.S. Fuzzy inference system optimized by genetic algorithm for robust face and pose detection. Int. J. Artif. Intell. 2015, 13, 73–88. [Google Scholar]
  8. Jankowski, J.; Kazienko, P.; Wątróbski, J.; Lewandowska, A.; Ziemba, P.; Zioło, M. Fuzzy multi-objective modeling of effectiveness and user experience in online advertising. Expert Syst. Appl. 2016, 65, 315–331. [Google Scholar] [CrossRef]
  9. Alkhazaleh, S.; Salleh, A.R.; Hassan, N. Possibility fuzzy soft set. Adv. Decis. Sci. 2011, 2011, 479756. [Google Scholar] [CrossRef]
  10. Alkhazaleh, S.; Salleh, A.R.; Hassan, N. Soft multisets theory. Appl. Math. Sci. 2011, 5, 3561–3573. [Google Scholar]
  11. Salleh, A.R.; Alkhazaleh, S.; Hassan, N.; Ahmad, A.G. Multiparameterized soft set. J. Math. Stat. 2012, 8, 92–97. [Google Scholar]
  12. Alhazaymeh, K.; Halim, S.A.; Salleh, A.R.; Hassan, N. Soft intuitionistic fuzzy sets. Appl. Math. Sci. 2012, 6, 2669–2680. [Google Scholar]
  13. Adam, F.; Hassan, N. Q-fuzzy soft matrix and its application. AIP Conf. Proc. 2014, 1602, 772–778. [Google Scholar]
  14. Adam, F.; Hassan, N. Q-fuzzy soft set. Appl. Math. Sci. 2014, 8, 8689–8695. [Google Scholar] [CrossRef]
  15. Adam, F.; Hassan, N. Operations on Q-fuzzy soft set. Appl. Math. Sci. 2014, 8, 8697–8701. [Google Scholar] [CrossRef]
  16. Adam, F.; Hassan, N. Multi Q-fuzzy parameterized soft set and its application. J. Intell. Fuzzy Syst. 2014, 27, 419–424. [Google Scholar]
  17. Adam, F.; Hassan, N. Properties on the multi Q-fuzzy soft matrix. AIP Conf. Proc. 2014, 1614, 834–839. [Google Scholar]
  18. Adam, F.; Hassan, N. Multi Q-fuzzy soft set and its application. Far East J. Math. Sci. 2015, 97, 871–881. [Google Scholar] [CrossRef]
  19. Varnamkhasti, M.; Hassan, N. A hybrid of adaptive neurofuzzy inference system and genetic algorithm. J. Intell. Fuzzy Syst. 2013, 25, 793–796. [Google Scholar]
  20. Varnamkhasti, M.; Hassan, N. Neurogenetic algorithm for solving combinatorial engineering problems. J. Appl. Math. 2012, 2012, 253714. [Google Scholar] [CrossRef]
  21. Maji, P.K. Neutrosophic soft set. Ann. Fuzzy Math. Inform. 2013, 5, 157–168. [Google Scholar]
  22. Alkhazaleh, S.; Salleh, A.R. Fuzzy soft expert set and its application. Appl. Math. 2014, 5, 1349. [Google Scholar] [CrossRef]
  23. Hassan, N.; Alhazaymeh, K. Vague soft expert set theory. AIP Conf. Proc. 2013, 1522, 953–958. [Google Scholar]
  24. Alhazaymeh, K.; Hassan, N. Mapping on generalized vague soft expert set. Int. J. Pure Appl. Math. 2014, 93, 369–376. [Google Scholar] [CrossRef]
  25. Adam, F.; Hassan, N. Multi Q-Fuzzy soft expert set and its applications. J. Intell. Fuzzy Syst. 2016, 30, 943–950. [Google Scholar] [CrossRef]
  26. Sahin, M.; Alkhazaleh, S.; Ulucay, V. Neutrosophic soft expert sets. Appl. Math. 2015, 6, 116–127. [Google Scholar] [CrossRef]
  27. Hassan, N.; Uluçay, V.; Şahin, M. Q-neutrosophic soft expert set and its application in decision making. Int. J. Fuzzy Syst. Appl. 2018, 7, 37–61. [Google Scholar] [CrossRef]
  28. Broumi, S.; Deli, I.; Smarandache, F. Neutrosophic parametrized soft set theory and its decision making. Int. Front. Sci. Lett. 2014, 1, 1–11. [Google Scholar] [CrossRef]
  29. Deli, I. Refined Neutrosophic Sets and Refined Neutrosophic Soft Sets: Theory and Applications. In Handbook of Research on Generalized and Hybrid Set Structures and Applications for Soft Computing; IGI Global: Hershey, PA, USA, 2016; p. 321. [Google Scholar]
  30. Syropoulos, A. On generalized fuzzy multisets and their use in computation. Iran. J. Fuzzy Syst. 2012, 9, 113–125. [Google Scholar]
  31. Shinoj, T.K.; John, S.J. Intuitionistic fuzzy multisets and its application in mexdical diagnosis. World Acad. Sci. Eng. Technol. 2012, 6, 1–28. [Google Scholar]
  32. Wang, H.; Smarandache, F.; Zhang, Y.Q.; Sunderraman, R. Single valued neutrosophic sets. Multispace Multistruct. 2010, 4, 410–413. [Google Scholar]
  33. Ye, S.; Ye, J. Dice similarity measure between single valued neutrosophic multisets and its application in medical diagnosis. Neutrosophic Sets Syst. 2014, 6, 48–52. [Google Scholar]
  34. Riesgo, Á.; Alonsoa, P.; Díazb, I.; Montesc, S. Basic operations for fuzzy multisets. Int. J. Approx. Reason. 2018, 101, 107–118. [Google Scholar] [CrossRef]
  35. Sebastian, S.; John, R. Multi-fuzzy sets and their correspondence to other sets. Ann. Fuzzy Math. Inform. 2016, 11, 341–348. [Google Scholar]
  36. Uluçay, V.; Deli, I.; Şahin, M. Intuitionistic trapezoidal fuzzy multi-numbers and its application to multi-criteria decision-making problems. In Complex & Intelligent Systems; Springer: Berlin, Germany, 2018; pp. 1–14. [Google Scholar]
  37. Kunnambath, S.T.; John, S.J. Compactness ın ıntuıtıonıstıc fuzzy multıset topology. J. New Theory 2017, 16, 92–101. [Google Scholar]
  38. Dhivya, J.; Sridevi, B. A New Similarity Measure between Intuitionistic Fuzzy Multisets based on their Cardinality with Applications to Pattern Recognition and Medical Diagnosis. Asian J. Res. Soc. Sci. Humanit. 2017, 7, 764–782. [Google Scholar] [CrossRef]
  39. Ejegwa, P.A. On Intuitionistic fuzzy multisets theory and its application in diagnostic medicine. MAYFEB J. Math. 2017, 4, 13–22. [Google Scholar]
  40. Fan, C.; Fan, E.; Ye, J. The Cosine Measure of Single-Valued Neutrosophic Multisets for Multiple Attribute Decision-Making. Symmetry 2018, 10, 154. [Google Scholar] [CrossRef]
  41. Şahin, M.; Deli, I.; Ulucay, V. Extension principle based on neutrosophic multi-sets and algebraic operations. J. Math. Ext. 2018, 12, 69–90. [Google Scholar]
  42. Al-Quran, A.; Hassan, N. Neutrosophic vague soft multiset for decision under uncertainty. Songklanakarin J. Sci. Technol. 2018, 40, 290–305. [Google Scholar]
  43. Hu, Q.; Zhang, X. New Similarity Measures of Single-Valued Neutrosophic Multisets Based on the Decomposition Theorem and Its Application in Medical Diagnosis. Symmetry 2018, 10, 466. [Google Scholar] [CrossRef]
  44. Şahin, M.; Uluçay, V.; Olgun, N.; Kilicman, A. On neutrosophic soft lattices. Afr. Mat. 2017, 28, 379–388. [Google Scholar]
  45. Şahin, M.; Olgun, N.; Kargın, A.; Uluçay, V. Isomorphism theorems for soft G-modules. Afr. Mat. 2018, 29, 1237–1244. [Google Scholar] [CrossRef]
  46. Ulucay, V.; Şahin, M.; Olgun, N. Time-Neutrosophic Soft Expert Sets and Its Decision Making Problem. Matematika 2018, 34, 246–260. [Google Scholar] [CrossRef]
  47. Uluçay, V.; Kiliç, A.; Yildiz, I.; Sahin, M. A new approach for multi-attribute decision-making problems in bipolar neutrosophic sets. Neutrosophic Sets Syst. 2018, 23, 142–159. [Google Scholar]
  48. Uluçay, V.; Şahin, M.; Hassan, N. Generalized neutrosophic soft expert set for multiple-criteria decision-making. Symmetry 2018, 10, 437. [Google Scholar] [CrossRef]
Table 1. Agree-neutrosophic soft expert multiset.
Table 1. Agree-neutrosophic soft expert multiset.
v 1 v 2 v 3
( e 1 , p ) ( 0.3 , 0.1 , 0.4 ) , ( 0.2 , 0.1 , 0.5 ) , ( 0.5 , 0.2 , 0.6 ) ( 0.4 , 0.2 , 0.3 ) , ( 0.7 , 0.1 , 0.6 ) , ( 0.3 , 0.2 , 0.6 ) ( 0.5 , 0.3 , 0.4 ) , ( 0.2 , 0.1 , 0.8 ) , ( 0.4 , 0.2 , 0.3 ) 0.7
( e 2 , p ) ( 0.6 , 0.4 , 0.2 ) , ( 0.3 , 0.1 , 0.4 ) , ( 0.8 , 0.2 , 0.5 ) ( 0.8 , 0.3 , 0.4 ) , ( 0.2 , 0.1 , 0.5 ) , ( 0.4 , 0.3 , 0.5 ) ( 0.8 , 0.3 , 0.2 ) , ( 0.3 , 0.1 , 0.4 ) , ( 0.2 , 0.1 , 0.4 ) 0.8
( e 3 , p ) ( 0.8 , 0.1 , 0.5 ) , ( 0.2 , 0.3 , 0.4 ) , ( 0.5 , 0.2 , 0.3 ) ( 0.7 , 0.2 , 0.5 ) , ( 0.1 , 0.2 , 0.3 ) , ( 0.3 , 0.2 , 0.1 ) ( 0.4 , 0.3 , 0.7 ) , ( 0.3 , 0.1 , 0.4 ) , ( 0.5 , 0.3 , 0.2 ) 0.3
( e 1 , q ) ( 0.4 , 0.2 , 0.5 ) , ( 0.3 , 0.1 , 0.2 ) , ( 0.6 , 0.3 , 0.4 ) ( 0.5 , 0.3 , 0.2 ) , ( 0.8 , 0.2 , 0.4 ) , ( 0.5 , 0.3 , 0.2 ) ( 0.6 , 0.3 , 0.8 ) , ( 0.3 , 0.2 , 0.1 ) , ( 0.5 , 0.4 , 0.3 ) 0.6
( e 2 , q ) ( 0.5 , 0.2 , 0.4 ) , ( 0.3 , 0.2 , 0.5 ) , ( 0.6 , 0.1 , 0.3 ) ( 0.6 , 0.4 , 0.7 ) , ( 0.5 , 0.3 , 0.2 ) , ( 0.6 , 0.2 , 0.4 ) ( 0.6 , 0.5 , 0.4 ) , ( 0.1 , 0.3 , 0.2 ) , ( 0.6 , 0.2 , 0.3 ) 0.4
( e 3 , q ) ( 0.7 , 0.2 , 0.4 ) , ( 0.3 , 0.1 , 0.5 ) , ( 0.6 , 0.2 , 0.1 ) ( 0.9 , 0.4 , 0.5 ) , ( 0.2 , 0.4 , 0.5 ) , ( 0.1 , 0.2 , 0.3 ) ( 0.6 , 0.8 , 0.9 ) , ( 0.2 , 0.1 , 0.6 ) , ( 0.3 , 0.1 , 0.4 ) 0.4
Table 2. Degree table of agree- neutrosophic soft expert multiset.
Table 2. Degree table of agree- neutrosophic soft expert multiset.
v 1 v 2 v 3
p0.11360.12670.093
q0.11420.09330.015
Table 3. Disagree-neutrosophic soft expert multiset.
Table 3. Disagree-neutrosophic soft expert multiset.
v 1 v 2 v 3
( e 1 , p ) ( 0.5 , 0.1 , 0.7 ) , ( 0.4 , 0.2 , 0.3 ) , ( 0.5 , 0.4 , 0.1 ) ( 0.8 , 0.2 , 0.3 ) , ( 0.2 , 0.1 , 0.4 ) , ( 0.3 , 0.4 , 0.5 ) ( 0.5 , 0.2 , 0.6 ) , ( 0.3 , 0.4 , 0.1 ) , ( 0.2 , 0.3 , 0.1 ) 0.9
( e 2 , p ) ( 0.6 , 0.5 , 0.7 ) , ( 0.3 , 0.5 , 0.4 ) , ( 0.6 , 0.3 , 0.4 ) ( 0.5 , 0.2 , 0.3 ) , ( 0.2 , 0.1 , 0.3 ) , ( 0.4 , 0.3 , 0.5 ) ( 0.6 , 0.3 , 0.4 ) , ( 0.1 , 0.2 , 0.4 ) , ( 0.5 , 0.3 , 0.2 ) 0.8
( e 3 , p ) ( 0.8 , 0.5 , 0.4 ) , ( 0.2 , 0.4 , 0.3 ) , ( 0.6 , 0.3 , 0.4 ) ( 0.5 , 0.2 , 0.3 ) , ( 0.4 , 0.1 , 0.2 ) , ( 0.2 , 0.1 , 0.4 ) ( 0.4 , 0.3 , 0.2 ) , ( 0.2 , 0.1 , 0.6 ) , ( 0.7 , 0.3 , 0.2 ) 0.5
( e 1 , q ) ( 0.7 , 0.1 , 0.4 ) , ( 0.3 , 0.2 , 0.1 ) , ( 0.4 , 0.2 , 0.5 ) ( 0.6 , 0.5 , 0.4 ) , ( 0.4 , 0.2 , 0.1 ) , ( 0.8 , 0.2 , 0.6 ) ( 0.9 , 0.4 , 0.5 ) , ( 0.2 , 0.1 , 0.3 ) , ( 0.6 , 0.2 , 0.3 ) 0.7
( e 2 , q ) ( 0.3 , 0.1 , 0.2 ) , ( 0.4 , 0.1 , 0.3 ) , ( 0.5 , 0.2 , 0.6 ) ( 0.7 , 0.2 , 0.4 ) , ( 0.4 , 0.3 , 0.6 ) , ( 0.5 , 0.1 , 0.6 ) ( 0.7 , 0.3 , 0.5 ) , ( 0.2 , 0.4 , 0.3 ) , ( 0.5 , 0.2 , 0.3 ) 0.4
( e 3 , q ) ( 0.6 , 0.1 , 0.4 ) , ( 0.2 , 0.1 , 0.5 ) , ( 0.4 , 0.2 , 0.3 ) ( 0.7 , 0.2 , 0.5 ) , ( 0.4 , 0.3 , 0.2 ) , ( 0.1 , 0.2 , 0.3 ) ( 0.5 , 0.3 , 0.4 ) , ( 0.3 , 0.2 , 0.4 ) , ( 0.4 , 0.2 , 0.3 ) 0.1
Table 4. Degree table of disagree-neutrosophic soft expert multiset.
Table 4. Degree table of disagree-neutrosophic soft expert multiset.
v 1 v 2 v 3
p0.16310.14680.1386
q0.11550.09330.04
Table 5. Comparison of fuzzy soft set and its extensive set theory.
Table 5. Comparison of fuzzy soft set and its extensive set theory.
Fuzzy Soft ExpertNeutrosophic Soft SetNeutrosophic Soft ExpertQ-Neutrosophic Soft ExpertGeneralized Neutrosophic Soft ExpertNSEMs
MethodsAlkhazaleh and Salleh [22]Maji [21]Sahin et al. [26]Hassan et al. [27]Ulucay et al. [48]Proposed Method in this paper
DomainUniverse of discourseUniverse of discourseUniverse of discourseUniverse of discourseUniverse of discourseUniverse of discourse
TrueYesYesYesYesYesYes
FalsityNoYesYesYesNoNo
IndeterminacyNoYesYesYesNoNo
ExpertYesNoYesYesYesNo
QNoNoNoYesYesYes
Ranking v 1 > v 3 > v 2 v 1 > v 3 > v 2 v 1 > v 2 > v 3 v 1 > v 3 > v 2 v 1 > v 3 > v 2 v 3 > v 2 > v 1
MembershipvaluedMembership-valuedSingle-valuedsingle-valuedSingle-valuedSingle-valuedMulti-valued

Share and Cite

MDPI and ACS Style

Bakbak, D.; Uluçay, V.; Şahin, M. Neutrosophic Soft Expert Multiset and Their Application to Multiple Criteria Decision Making. Mathematics 2019, 7, 50. https://doi.org/10.3390/math7010050

AMA Style

Bakbak D, Uluçay V, Şahin M. Neutrosophic Soft Expert Multiset and Their Application to Multiple Criteria Decision Making. Mathematics. 2019; 7(1):50. https://doi.org/10.3390/math7010050

Chicago/Turabian Style

Bakbak, Derya, Vakkas Uluçay, and Memet Şahin. 2019. "Neutrosophic Soft Expert Multiset and Their Application to Multiple Criteria Decision Making" Mathematics 7, no. 1: 50. https://doi.org/10.3390/math7010050

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop