 Open Access
 Authors : A. A. Elshabshery , M. Fattouh
 Paper ID : IJERTV10IS050160
 Volume & Issue : Volume 10, Issue 05 (May 2021)
 Published (First Online): 25052021
 ISSN (Online) : 22780181
 Publisher Name : IJERT
 License: This work is licensed under a Creative Commons Attribution 4.0 International License
On Some Information Measures of SingleValued Neutrosophic Sets and their Application in MCDM Problems
A. A. Elshabshery Instructor, High Institute for Engineering and Technology, Elmahalla Alkobra, Egypt. 
M. Fattouh Professor, Production Engineering and Mechanical Design Department, Faculty of Engineering, Menoufia University, Shebin El Kom, Egypt. 
Abstract: Information measures have received more attention in recent years. In this paper, the multicriteria decisionmaking (MCDM) problem based on SVNS information measures is presented. Some definitions of information measures are first introduced. These include entropy, similarity measure, , crossentropy, Aggregation operators, cosine similarity measure, subtraction operational averaging operator, correlation coefficient and projection measure. A numerical case study (metal stamping layout selection problem) is provided in which the criteria values are described in exact (crisp) values form. Firstly, the decision matrix is fuzzified and then transformed into an SVNS decision matrix. The result of the existing methods used in this work is compared with the published results to validate the accuracy based on the same illustrative example presented in this paper and then highlights the advantages of some methods over another method. The comparative analysis demonstrates the applicability and effectiveness of the used methods.
Keywords: Information measures MCDM problems SVNS Sets Neutrophication – Metal stamping layout selection problem.

INTRODUCTION
A MCDM problem is the process of finding the best alternative from all of the feasible alternatives where all the alternatives can be evaluated according to several criteria. In general, the MCDM problem includes uncertainty, imprecise, incomplete, and inconsistent information that exists in the real world. IFSs and IVIFSs can handle incomplete information, however, in real decision making, decision information is often indeterminate and inconsistent; as such, it cannot be dealt with by IFSs and IVIFSs. Therefore, Smarandache [1] and [2] originally introduced the concept of neutrosophic sets (NSs), largely from a philosophical point of view. The NSs simultaneously take into account the truth membership, the indeterminacy membership, and the falsity membership, and they are independent. However, it is difficult to apply NS in the practice of science and engineering. Therefore, Wang et al.
[3] presented the notion of the singlevalued neutrosophic set (SVNS), which is a subclass of NSs.From the analysis of the literature, the information measures are very useful tools to cope with uncertainty and vagueness. On the one hand, it is known that uncertainty, incomplete, and inconsistent information exist in human
decisionmaking. Therefore, just as FSs, IFSs, and IVIFSs, research on the information measures for SVNSs remain important. On the other hand, more and more MADM methods have been developed based on SVNSs. This paper presents some handling methods for the MCDM problem under an SVNS environment using the information measures of SVNSs.
Recently, some information measures based on the SVNS set are applied to MCDM problems Ye, J. [4], [5], [6], Peng,
J.J. et al [7], Liu, P.D. [8], Xiaohui Wu1 [9].
Entropy, similarity measures, and crossentropy are three important research topics in the fuzzy theory, which have been widely used in information fusion systems. Entropy is very important for measuring uncertain information. Since its appearance, entropy has received great attention. Majumdar et al [10] introduced an entropy function to measure the uncertainty involved in an SVNV. Similarity measures and crossentropy are mainly used to measure the discrimination information. Up to now, a lot of research has been done about these issues based on the Jaccard, Dice, and cosine similarity measures in vector space; Ye, J. [6] proposed three vector similarity measures between SVNSs to obtain the ranking order of all alternatives in MADM problems. To overcome the drawbacks of similarity measure Ye, J. [6] and Ye, J. [11] constructed the modified cosine similarity measures for SVNSs based on the cosine function. With the help of the distance between two SVNSs, Majumdar et al [10] presented several similarity measures for SVNSs and discussed their characteristics. Under the singlevalued neutrosophic environment, Ye, J. [12] proposed acrossentropy to establish a MADM method. Ye, J. [4] presented the correlation coefficient of SVNSs based on the extension of the correlation coefficient of IFSs and then defined the SVNS weighted correlation coefficient between an alternative Ai and the ideal alternative A*.
The aggregation operators are important tools for aggregating fuzzy information in decisionmaking problems. Two of the most common operators for aggregating arguments are the weighted arithmetic average operator and the weighted geometric average operator, which have been wildly applied to decisionmaking problems. Ye, J. [5] extended them to
SVNS sets for aggregating neutrosophic information in decisionmaking problems. Then, the ranking order of alternatives is performed through the cosine similarity measure between an alternative and the ideal alternative and the best choice can be obtained according to the measure values. Haibo Wu et al [13] discussed the relationship among entropy, similarity measure and crossentropy of SVNS sets and their application in MCDM.
As per Rui Yong et al [14], projection measure (PM) is an appropriate method for dealing with between objects evaluated. As mentioned in the existing literature, neutrosophic projection models are useful methods for solving MCDM problems. They proposed three kinds of PM (general PM, bidirectional PM, and harmonic averaging PM) in the SVNS setting. In the introduced multiple attribute projection methods, the ranking order of all alternatives and the best alternative can be efficiently identified by these PMs between the ideal alternative and each alternative in MCDM problems. The bigger the measured value is, the better the alternative. Regarding existing subtraction operations of SVNS number Ye, J. [15] and Shigui Du, et al [16] firstly presented an SVNS number subtraction operational weighted arithmetic averaging operator (SVNSN SOWAAO) as a necessary complement to the existing aggregation operator of SVNS number. Next, they developed an MCDM approach based on the SVNSN SOWAAO for the first time.
Due to its ability to easily reflect the ambiguous nature of subjective judgments, SVNSs are suitable for capturing imprecise, uncertain, and inconsistent information in the multicriteria decision analysis. Therefore, the main purposes of this paper are to present some information measures of SVNSs and to demonstrate the application of the proposed decisionmaking methods. A numerical example is provided to illustrate the application of the proposed method s. Finally, the result of the existing methods used in this work is compared with the published results to validate the accuracy based on the same illustrative example presented in this paper and then highlights the advantages of some methods over another method. Some conclusions and future research possibilities are provided.

BASIC PRELIMINARIES RELATED TO SVNS SETS
In this section, some important concepts about the theory of SVNSs, and some of the recent developments related to SVNS based decision making are recapitulated, which will be
Definition 1. An SVNS set is an object having the form
= {, (), (), (): }, where the functions , ,
]0, 1+ [ denote the truth, indeterminacy, and falsity membership functions,
respectively, of the element concerning . The membership functions must satisfy the condition 0 () + () + () 3+.
Definition 2. An SVNS set is contained in another SVNS set , if () (), () (), and () (), for all . This relationship is denoted as .
Definition 3. An SVNS is an NS set that is characterized by a truthmembership function (), an indeterminacymembership function (), and a falsity membership function (), where (), (), () [0, 1]. This set can thus be written as
= {, (), (), (): }
The sum of (), () and () must fulfill the condition
0 () + () + () 3. For an SVNS in , the triplet ((), (), ()) is called an SVN number.

Convert Crisp Data into SVNS Numbers (Neutrophication)
In MCDM problems, the initial information consists of the evaluations concerning the ratings of the alternatives concerning the criteria and the criterion weights. It can be presented by the decision matrix, which is the expert evaluation of the ith alternative by the jth criterion. Therefore, the decision matrix will have the following form:
11 12 1
X = [ 21 22 2 ]
1 2
Any datasets sourced from unverified sources may contain wrong information and this will affect the accuracy of the results obtained.

Step 1: At this step, qualitative information xij is transformed into fuzzy numbers employing the vector normalization method ( fuzzy decision matrix), which can be expressed as NXij:
utilized in the later analysis.
NXij
(1)
=
=
SVNS set model is a special case of the general NS set where the range of each of the three membership functions
(
(
=1
2
)
are in the standard unit of the interval of [0, 1], instead of the nonstandard interval of] 0, 1+ [. The SVNS model is one of the most commonly used versions of the NS model, and a lot of research related to SVNS based decision making can be found in the literature. The formal definition of the SVNS is presented below, and this is followed by the definitions of some of the important concepts and settheoretic operations of the SVNS. Let be a universe of discourse, with a class of elements in denoted by .

Step 2: At the neutrophication step, the fuzzy decision matrix (NXij) in the crisp form is converted into the SVNS decision matrix consisting of the degree of truthiness , indeterminacy , and falsehood . Therefore, the neutrosophic decision matrix is calculated. To perform this action, the rela tionships between normalized values of the criteria NXij and SVNS number can be utilized. The
conversion rule between NXij and SVNS numbers are shown in Table (1).
SVNS numberij = (Fij, , ) = (NXij, 1 NXij, 1NXij)
Table 1. Neutrosophic conversion terms to rate the importance of the alternatives (Edmundas K. et al [17])
Crisp Normalized Terms SVNS Numbers
Where is the calculated entropy value for criterion ,
Step 2: Calculation of the degree of divergence:
The degree of divergence dj of the average intrinsic information provided by the corresponding performance ratings on criterion Cj can be defined by using Equation (4) as:
= (1 Ej) (4)
Step 3: Calculation of the criteria weights:
The criteria weights are then calculated depending on the values of the entropy by Eqn. (5).
1Ej
Extremely good (EG)/1.0
(1.00, 0.00, 0.00)
Very very good (VVG)/0.9
(0.90, 0.10, 0.10)
Very good (VG )/0.8
(0.80, 0.15, 0.20)
Good (G)/0.7
(0.70, 0.25, 0.30)
Medium good (MG)/0.6
(0.60, 0.35, 0.40)
Medium (M)/0.5
(0.50, 0.50, 0.50)
Medium bad (MB)/0.4
(0.40, 0.65, 0.60)
Bad (B)/0.3
(0.30, 0.75, 0.70)
Very bad (VB)/0.2
(0.20, 0.85, 0.80)
Very very bad (VVB)/0.1
(0.10, 0.90, 0.90)
Extremely bad (EB)/0.0
(0.00, 1.00, 1.00)
Extremely good (EG)/1.0
(1.00, 0.00, 0.00)
Very very good (VVG)/0.9
(0.90, 0.10, 0.10)
Very good (VG )/0.8
(0.80, 0.15, 0.20)
Good (G)/0.7
(0.70, 0.25, 0.30)
Medium good (MG)/0.6
(0.60, 0.35, 0.40)
Medium (M)/0.5
(0.50, 0.50, 0.50)
Medium bad (MB)/0.4
(0.40, 0.65, 0.60)
Bad (B)/0.3
(0.30, 0.75, 0.70)
Very bad (VB)/0.2
(0.20, 0.85, 0.80)
Very very bad (VVB)/0.1
(0.10, 0.90, 0.90)
Extremely bad (EB)/0.0
(0.00, 1.00, 1.00)
Wj = n j=1
(1Ej)
(5)
Step 3: Normalize the SVNS decision matrix.
Since the attributes are of the cost and benefit types, then one can transform the SVNS decision matrix into the normalized SVNS decision matrix by transforming the cost attributes into the benefit attributes using the complement set. The complement of a neutrosophic set is denoted by and is defined by:
X = (, 1 , ) (2)



Determine the Weights of Criteria
Due to the complexity and uncertainty of realworld decisionmaking problems, the information about criteria weights is usually completely unknown. Therefore, it is necessary to determine reasonable attribute weight for making a reasonable decision. Many methods are available to determine the completely unknown criteria weights in the MCDM problems under the SVNS environment namely, entropy method, maximizing deviation method, and

Information Measures of SVNS Sets
Recently, some information measures based on the SVNS set are applied to MCDM problems. In this subsection, some definitions of SVNS information measures are presented.

CrossEntropy Measure of SVNS Sets:
Cross entropy is used to judge the relation between two objects. Therefore, it can be defined as an SVNS cross entropy for measuring the deviation of SVNS variables from an a priori one.
Ye, J. [5] extended the intuitionistic fuzzy crossentropy to the SVNS set and proposed an SVNS crossentropy measure In MCDM environments, the concept of ideal point has been used to help identify the best alternative in the deciding set. Although the ideal alternative does not exist in the real world, it does provide a useful theoretical construct against which to evaluate alternatives. Hence, an ideal benefit criterion value can be defined as:
j j j
j j j
j* = T, I, F = 1, 0, 0 (6)
(j = 1, 2, , n) in the ideal alternative A*.
Ye, J. [5] defined the following SVNS weighted cross entropy measure between each alternative and the ideal alternative Di (A*, Ai) as the following:
2
2
2
2
(, ) = [log 1 + log 1 +
optimization method. This work presents the entropy method.
=1
2 1(1+)
1
1 ( )
2
2
2
log
1 ] +
[
log
+

Entropy WeightsBased Technique:
2 11()
=1
2 1(1+)
2
2
This methodis integrated with the SVNS information
(1
) log
1 ] +
[
+ (1
measures and the MCDM methods for solving the problem
1
2
2
1 (1+ )
2
=1
and ranking the given alternatives. The main steps of this
) log
1
] + [
+ (1
technique are summarized as follows:
1
2
2
1 ( )
2
=1
) log
1
] (7)
Step 1: Calculation of the Entropy Values:
2 1 1( )
2
2
Based on the decision matrix, the value of the entropy for each criterion is calculated using Eqn. (3).
m
m
Ej = 11/n (Tij (Xi) + Fij (Xi)) 2 (Iij (Xi)) – 1 (3)
i=1
Therefore, the smaller the value of Di (A*, Ai) is, the better the alternative Ai is. In this case, alternative Ai is close to the ideal alternative A*. Through the weighted
cross entropy Di (A*, Ai) (i = 1, 2, . . ., m) between each (1, 2, , ) =
alternative and the ideal alternative, the ranking order of
(),
(),
() (10)
all alternatives can be determined and the best one can be
=1
=1
=1
easily identified as well.

Correlation Coefficients Measure of SVNS Sets
Correlation coefficients are an important tool to judge the relation between two objects. Ye, J. [4] defined the following SVNS weighted correlation coefficient between an alternative Ai and the ideal alternative A* as the following:
Step 2: Ranking the Alternatives
Step 21: Ranking by the Cosine Similarity Measure
Calculate the cosine similarity measure between SVNSs proposed by Ye, J. [4], the cosine similarity measure between each alternative and the ideal alternative can be defined as follows:
( , ) =
(11)
(, ) =
2+2+2
[
+
+
]
=1
(8)
[2 +2 +2 ]
2 2 2
[() +() +() ]
The bigger the measured value Si (i, ) is, the better the
=1
=1
alternative Ai is, because the alternative Ai is close to the ideal alternative. Through the cosine similarity measure between
The bigger the value of the weighted correlation
coefficient Wi (Ai, A*) is, the better the alternative Ai is. Through the weighted correlation coefficient Wi (Ai, A*) between each alternative and the ideal alternative, the ranking order of all alternatives can be determined and the best one can be easily identified as well.

Aggregation Operators of SVNS Sets
each alternative and the ideal alternative, the ranking order of all alternatives can be determined and the best one can be easily identified as well.
Step 22: Ranking by the Score Function
Calculate the score function for each alternative, the score function for each alternative can be defined as follows:
The aggregation operators are important tools for aggregating fuzzy information in MCDM problems. Two of the most common operators for aggregating arguments
S (a) = 2 + Ta Ia Fa
3
(12)
are the weighted arithmetic average operator and the weighted geometric average operator, which have been wildly applied to decisionmaking problems. Ye, J. [5] extended them to SVNS sets for aggregating neutrosophic information in the MCDM problems. The ranking order of alternatives can be performed through the cosine similarity measure between an alternative and the ideal alternative or by score function and the best choice can be obtained according to the measure values. The bigger the measured value of cosine similarity is, the better the alternative Ai is, because the alternative Ai is close to the ideal alternative. The ranking order of alternatives can also be performed through the score function.
In summary, the decision procedure can be summarized as follows:
Step 1: Calculate the weighted arithmetic average values by using the following Equation:
The bigger the score function of the alternative Ai is, the
better the alternative Ai is.

Subtraction Operational Weighted Arithmetic Averaging of SVNS Sets
Shigui Du, et al [16] firstly presented an SVNS number subtraction operational weighted arithmetic averaging operator (SVNSN SOWAAO) as a necessary complement to the existing aggregation operator of SVNS number. Next, they developed an MCDM approach based on the SVNSN – SOWAAO for the first time:
Regarding the DM problem with the SVNS number, the decision steps are indicated as follows
Step 1: From the SVNS decision matrix, the jth SVNS positive ideal solution can be determined by:
a + = max (T ), min (I ), min (F ) (13)
j ij ij ij
(1, 2, , ) = 1 (1 ()) ,
=1
While the jth SVNSN negative ideal solution can be determined by:
1
(1 ())
, 1
(1 ())
(9)
a – = min (T ), max (I ), max (F ) (14)
=1
=1
j ij ij ij
Or the weighted geometric average values by using the
Step 2: Two collective values d + and d – for each alternative
i i
following Equation:
can be obtained by the SVNSSOWAA operator:
+ = 1
(1 + ) ,
( + ) ,
( + )
By applying Eq. (24) or Eq. (25) the weighted
(15)
=1
=1
=1
bidirectional PM or weighted harmonic averaging PM between the ideal alternative A* and an alternative Ai are given, respectively, by
= 1 =1 (1 )
, =1 ( )
, =1 ( )
BProjw (S , S*) =
(24)
(16) i
+ ( )
Where wj (j = 1, 2, , n) is the attribute weight for wj [0, 1]
P (S
S) = 2( )
(25)
and
=1
= 1, and the components in the SVNNs Cij and
w i +
Cij contain the following forms:
= 2(2 + 2 + 2 )
+
1
, + 1
=1
+ = {
(17)
2
2
= 2 [()
+ ()2
+ () ] ,
( )
+
0,
, + 0
2
2
=1
+ = {
(18)
= 2( +
+ )
+
1,
=1
+ = {
, + 0
1,
(19)



CASE STUDY ILLUSTRATION
In this section, a metal stamping layout selection problem is
+
used to illustrate the validity and effectiveness of the
= { 1 , 1
(20)
developed method. The following case study is adapted from
0,
Singh et al [18]. They presented a striplayout selection methodology using the digraph and matrix approach. They
, 0
considered an annual production of 400,000 numbers of a
= { (21)
1,
blank, shown in Figure 1. Six alternative striplayouts, shown
in Figure 2, are synthesized. Five striplayout selection
, 0
attributes are identified relevant to the case, and these are:
= {
(22)
economical material utilization, die cost, stamping operational
1,
cost, required production rate, and job accuracy. Table (2) presents the alternative striplayout data
+ –
+ –
Step 3: For (di ) and (di ) calculate the score function using Eq. (12)
Step 4: The relative closeness degree of each alternative concerning the ideal solution is calculated by:
()
= + [0,1] (23)
( )+( )
The larger value of Ci reveals that an alternative is closer to the ideal solution and farther from the negative ideal solution simultaneously. Therefore, all the alternatives can be ranked in descending order according to the values of Ci. The alternative with the largest value is chosen as the best one.

Ranking of the Alternatives Based on Projection Measure:
Rui Yong et al [14] proposed three kinds of PM (general PM, bidirectional PM, and harmonic averaging PM) in the SVNS setting. In the introduced multiple attribute projection methods, the ranking order of all alternatives and the best alternative can be efficiently identified by these PMs between the ideal alternative and each alternative in MCDM problems. The bigger the measured value is, the better the alternative. We can rank all alternatives and easily select the best one according to the measured values.
Fig. 1, Blank profile (from reference [18])
Fig. 2, Six alternative striplayouts (from Singh and Sekhon [18])
Table 2. Alternative striplayout data from (Singh and Sekhon [18]; reprinted with permission from Elsevier)
Layout 
C1 
C2 
C3 
C4 
C5 
A1 
0.26 
25000 
130 
80 
4 
A2 
0.4 
28560 
138 
120 
3 
A3 
0.33 
31109 
90 
150 
3 
A4 
0.32 
31702 
150 
125 
2 
A5 
0.31 
32390 
160 
110 
2 
A6 
0.31 
32663 
116 
108 
2 
C1: economical material utilization, C2:die cost, C3: stamping operational cost , C4: required production rate , and C3: job accuracy.

Solving the Case Study (Ranking Order of the Alternatives)

Convert crisp Data into SVNS Numbers (Neutrosophication)

Due to high volume computing, only the final values are listed and all computations are cared out with the Microsoft Excel.
Step 1. Normalization of the decision matrix
The crisp decision matrix Table (2) needs to be converted into SVNS numbers is performed applying a vector normalization approach by using Equation (1).
Step 2. The obtained normalized decision matrix is con verted into the SVNS numbers using the relationships between normalized values and SVNS numbers as presented in Table (1).
Step 3. Normalizing SVNS Decision Matrix
Since the criteria C2 and C3 are of the cost types, one can transform the SVNS decision matrix into the normalized SVNS decision matrix by transforming the cost attributes into the benefit attributes using Eq. (2).
The normalized SVNS decision matrix is listed in Table (3).
Table 3. Normalized SVNS Decision Matrix
E1=1(1/6)((0.3273+0.6727)2(0.7227)1+
(0.5035+ 0.4965) 2 (0.4965) – 1+ (0.4154+ 0.5846)
2 (0.6346)1+ (0.4028+0.5972) 2 (0.6472) 1+(0.3902+0.6098)2(0.6598)1+ (0.3902+0.6098)2(0.6598)1= 06690.
The degree of divergence d1 of the average intrinsic information provided by the corresponding performance ratings on criterion C1 can be defined by using Equation (4) as:
1 = (1 E1) = ( 1 0.6690)
The same calculation steps can be performed for all criteria
d2 = (1 0.6559) , d3 = (1 0.6850), d4 = (1 0.6467) and d5 = (1 0.5518)
Then the entropy weight of the 1 can be calculated with the help of Equation (5) as follows:
W1= (10.6690) / ((10.6690) + (10.6559) + (10.6850) + (1
0.6467) + (10.5518)) = 0.1848
The same calculation steps can be performed for all criteria Therefore, the weight vector of the criteria is
(W1= 0.1848, W2 = 0.1921, W3 = 0.1758, W4= 0.1972 and
W5 = 0.2502)
3. Applying the Information Measures – Based Technique:
In this stage, some information measures are applied for solving the case study based on the normalized SVNS numbers.

Ranking the Alternatives Based on CrossEntropy Measure (CEM):
With the help of Eq. (7), the crossentropy values between an alternative Ai and the ideal alternative A* can be calculated. Due to high volume computing, only the final values are listed as follows:
CEM 1(A*; A1) = 1.9652, CEM 2(A*, A2) =1.8730,
CEM (A*, A ) =1.7759, CEM (A*, A ) = 2.2575,
A1 (0.3273, 0.7227, 0.6727) (0.6638, 0.2862, 0.3362) (0.6000, 0.3500, 0.4000) 3 3 4 4
A2 (0.5035, 0.4965, 0.4965) (0.6159, 0.3341, 0.3841) (0.5753, 0.3747, 0.4247)
A3 (0.4154, 0.6346, 0.5846) (0.5816, 0.3684, 0.4184) (0.7230, 0.2270, 0.2270)
A4 (0.4028, 0.6472, 0.5972) (0.5737, 0.3763, 0.4263) (0.5384, 0.4616, 0.4616)
A5 (0.3902, 0.6598, 0.6098) (0.5644, 0.3856, 0.4356) (0.5076, 0.4924, 0.4924)
A6 (0.3902, 0.6598, 0.6098) (0.5607, 0.3893, 0.4393) (0.6430, 0.3070, 0.3570)
CEM 5(A*, A5) =2.3599 and CEM 6(A*, A6) =2.2552
The smaller the value of CEMi (A*, Ai) is, the better the alternative Ai is. In this case, the alternative Ai is close to the ideal alternative A*.
According to the crossentropy values, thus the ranking
(0.2782, 0.7718, 0.7218)
(0.5898, 0.3602, 0.4102)
(0.4173, 0.6327, 0.5827)
(0.4423, 0.6077, 0.5577)
(0.5216, 0.4784, 0.4784)
(0.4423, 0.6077, 0.5577)
(0.4347, 0.6153, 0.5653)
(0.2949, 0.7551, 0.7051)
(0.3825, 0.6675, 0.6175)
(0.2949, 0.7551, 0.7051)
(0.3756, 0.6744, 0.6244)
(0.2949, 0.7551, 0.7051)
(0.2782, 0.7718, 0.7218)
(0.5898, 0.3602, 0.4102)
(0.4173, 0.6327, 0.5827)
(0.4423, 0.6077, 0.5577)
(0.5216, 0.4784, 0.4784)
(0.4423, 0.6077, 0.5577)
(0.4347, 0.6153, 0.5653)
(0.2949, 0.7551, 0.7051)
(0.3825, 0.6675, 0.6175)
(0.2949, 0.7551, 0.7051)
(0.3756, 0.6744, 0.6244)
(0.2949, 0.7551, 0.7051)
order of the alternatives is A3, A2, A1, A6, A4, and A5. Hence, the best alternative is A3 and the worst alternative is A5.

Determine the Weigts of Criteria using Entropy Weights Method
For the normalized SVNS decision matrix, the entropy value of criterion C1 can be calculated with the help of Eqn. (3):

Ranking the Alternatives Based on Weighted Correlation Coefficient (WCC)
By using Equation (8), one can obtain the value of the weighted correlation coefficient for each alternative as shown:
WCC1(A1,A*) = 0.5436 , WCC2(A2,A*) = 0.4399 , WCC3(A3,A*) = 0.6023 , WCC4(A4,A*) = 0.4656 , WCC5(A5,A*) = 0.4380 and WCC6(A6,A*) = 0.4649
The bigger the value of WCCi (Ai, A*) is, the better the alternative Ai is. In this case, the alternative Ai is connected to the ideal alternative A*.
Therefore, the ranking order of the alternatives is A3, A1, A4, A6, A2, and A5. Clearly, amongst them, A3 is the best alternative and the worst alternative is A5.

Ranking by Weighted Cosine Similarity Measure (WCSM)
By applying Equation (11), one can give the value of WCSM for all alternatives
WCSM (A1, A*) = 0.5835 , WCSM(A2,A*) = 0.5854 , WCSM(A3,A*) = 0.6150 , WCSM(A4,A*) = 0.4849 , WCSM(A5,A*) = 0.4561 and WCSM (A6, A*) = 0.4914
The bigger the value of WCCi (Ai, A*) is, the better the alternative Ai is.
Therefore, the ranking order of the alternatives is A3, A1, A4, A6, A2, and A5. Obviously, amongst them, A3 is the best alternative and the worst alternative is A5.

Ranking of the Alternatives Based on Aggregation Operators
The proposed method is applied to solve this problem
Step 2 2 Ranking by Score Function (SF):
With the help of Equation (12), the SF for alternative Ai can be computed as follow:
SF1 = (2 + 0.5185 – 0.5419 – 0.5320)/ 3 = 0.4816
SF2 = 0.4995, SF3 = 0.5226, SF4 = 0.4226, SF5 = 0.4033, and
SF6 = 4245
The bigger the value of SFi is, the better the alternative Ai is. From the SF, the ranking order of six alternatives is A3,
A2, A1, A6, A4, and A5. Therefore, it can be seen that the alternative A3 is the best choice among all the alternatives.
4b Weighted Geometric Average Operator
On the other hand, one can also utilize the Weighted Geometric Average Operator (WGAO). The WGAO for Ai can be computed by applying Equation (10):
WGAOA1 (1) = (0.4680, 0.4532, 0.4814)
WGAOA2 (2) = (0.4998, 0.4831, 0.4885)
WGAOA3 (3) = (0.5190, 0.4464, 0.4567)
WGAOA4 (4) = (0.4259, 0.5655, 0.5516)
WGAOA5 (5) = (0.4074, 0.5860, 0.5723)
according to the following computational procedure:
4a . Weighted Arithmetic Average Operator
WGAOA6
(6) = (0.4226, 0.5414, 0.5429)
Step 1: The Weighted Arithmetic Average Operator (WAAO) for Ai can be calculated with the help of Equation (9):
WAAOA1 = 1= (0.5186, 0.5419, 0.5320), WAAOA2 = 2 = (0.5115, 0.5128, 0.5002), WAAOA3 = 3 = (0.5433, 0.4944,
0.4810), WAAOA4 = 4= (0.4484, 0.6064, 0.5741),
WAAOA5= 5 = (0.4277, 0.6251, 0.5926), WAAOA6 = 6 = (0.4571, 0.6061, 0.5774)
Step 2 Ranking the Alternative
The ranking order of alternatives can be performed through the cosine similarity measure between an alternative and the ideal alternative or by score function and the best choice can be obtained according to the measure values.
Step 2 1 – Ranking by Weighted Cosine Similarity Measure (WCSM):
By applying Equation (11), one can compute WCSM between an alternative Ai and the ideal alternative as follows:
WCSM1 (1, *) = 0.5639, WCSM 2(2, *) = 0.5811, WCSM 3(3, *) = 0.6187, WCSM 4(4, *) = 0.4731, WCSM 5(5, *) = 0.4447 and WCSM 6(6, *) = 0.4792
The bigger the value of WCSM i (Ai, A*) is, the better the alternative Ai is.
Therefore the ranking order of six alternatives is A3, A2, A1, A6, A4, and A5. It can be seen that the alternative A3 is the best choice among all the alternatives.
With the help of Equation (11), the WCSM for alternative Ai can be used as a ranking method and computed as follows:
WCSM1 (1, *) = 0.5777, WCSM2 (2, *) = 0.5883, WCSM3 (3, *) = 0.6307, WCSM4 (4, *) = 0.4746, WCSM5 (5, *) = 0.4453 and WCSM6 (6, *) = 0.4827
Thus, the ranking order of six alternatives is A3, A2, A1, A6, A4, and A5. Accordingly, it can be seen that alternative A3 is still the best choice among all the alternatives.
With the help of Equation (12), the score function for alternative Ai can be can be used as a ranking method and computed as following:
SF1 = (2 + 0.4680 – 0.4532 – 0.4814)/ 3 = 0.5111, SF2 =
0.5094, SF3 = 0.5386, SF4 = 0.4363, SF5 = 0.4164 and SF6 =
0.4461
The greater the value of SFi (Ai, A*) is, the better the alternative Ai is.
From the SF, the ranking order of six alternatives is A3, A1, A2, A6, A4, and A5. Therefore, it can be seen that the alternative A3 is the best choice among all the alternatives.
It can be seen that the above two kinds of ranking orders and the best alternative are the same.

Ranking of the Alternatives Based on Subtraction Operational Aggregation Operators:
Due to high volume computing, only the final values are listed.
Step 1: The SVNS positive ideal solution and negative ideal solution can be determined using decision matrix Table
(3) and Equations (13) and (14):
PIS = [(0.5035, 0.4965, 0.4965), (0.6638, 0.2862, 0.3362),
(0.7230, 0.2270, 0.2770), (0.5216, 0.4784, 0.4784), (0.5898,
0.3602, 0.4102)]
NIS = [(0.3273, 0.7227, 0.6727), (0.5607, 0.3893, 0.4393),
(0.5076, 0.4924, 0.4924), (0.2782, 0.7718, 0.7218), (0.2949,
0.7551, 0.7051)]
Step 2: The two collective values for the first alternative d1+, d1 can be obtained by using the Equations (15) and (16) as the following:
– The components of Equations (15) and (16) can be calculated using the forms (1722) as follows:
C1
C1
C1
C1
TC1+ = 0.2620, IC1+ = 0.6870, FC1+ = 0.7380, TC1 = 0.0 I – = 1.0, F – = 1.0
Substituting these components in Equations (15) and (16), the two collective values for the first alternative d +, d – can be
First, from the normalized SVNS decision matrix Table (3), the following ideal alternative can be determined:
A {(0.9, 0.1, 0.2), (0.85, 0.1, 0.1), (0.9, 0.1, 0.1), (0.85,
0.1, 0.1), (0.9, 0.1, 0.2)}.
Second, based on Eq. (24) and (25), the measure values between an alternative Ai and the ideal alternative A* can be calculated. For example, the calculations for A1 are as follows:
BProjw (A1, A*) = (0.40880.3713) = 0.9652
(0.40880.3713)+(0.40880.3713)0.1459
Pw (A1, A*) = (20.1459) = 0.3740
0.4088+0.3713
Where;
(A1 . A*) (0.1848^2) * ( 0.3273*0.5035 + 0.7227*0.4965 + 0.6727*0.4965)+ (0.1921^2)*(0.6638*0.6638 +
0.2862*0.2862
+0.3362*0.4393)+(0.1758^2)*(0.6000*0.7230+0.3500*0.227 0
+0.4000*0.2770)+(0.1972^2)*(0.2782*0.5216+0.7718*0.478 4
obtained as the following:
1 1
+0.7218*0.4784)+(0.2502^2)*(0.5898*0.5898+0.3602*0.360
2 + 0.4102*0.4102) ^0.5 = 0.1459
T d + = 0.1828, I d + = 0.7867, F d += 0.8172
1 1 1
– – –
– – –
T d1 = 0.2002, I d1 = 0.7377, F d1 = 0.7998
Hens, d += (0.1828, 0.7867, 0.8172) and d – = (0.2002,
A*w = (0.1848^2)*(0.5035^2 + 0.4965^2 + 0.4965^2)
+(0.1921^2)*(0.6638^2+0.2862^2+0.3362^2)+(0.1758^2)*(0. 7230^2 + 0.2270^2 + 0.2770^2) + (0.1972^2)*(0.5216^2 +
1
0.7377, 0.7998)
1
0.4784^2 + 0.4784^2) + (0.2502^2)*(0.5898^2 + 0.3602^2 +
0.4102^2) ^0.5 = 0.3713
Step 3: By applying Equation (12), the score values of the first alternative S (di+) and S (di) can be calculated as the following:
+
+
S (d1 ) = (2 + 0.1828 – 0.7867 0.8172) /3 = 0.1930
1
1
S (d ) = (2+ 0.2002 0.7377 0.7998) /3 = 0.2209
Step 4: By using Equation (23), the relative closeness degree of the first alternative RCD1 can be calculated as the following:
1 = 0.2209 / (0.2209+0.1930) = 0.5337
The same calculatio steps can be performed to obtain the
for each alternative as shown:
2 = 0.4756, 3= 0.6127, 4 = 0.2074, 5 = 0.1247 and 6 = 0.2610
Since the ranking order of the relative closeness degrees is
3, 1, 2, 6, 4, and 5, the ranking order of all alternatives is A3, A1, A2, A6, A4, and A5. Hence the best alternative is A3.

Ranking of the Alternatives Based on Projection Measure:
The bidirectional PM (BProjw (A1, A*)) and harmonic averaging PM (Pw (A1, A*)) are applied to solve the case study.
A1w = (0.1848^2)*(0.3273^2 + 0.7227^2 + 0.6727^2)
+ (0.1921^2)*(0.6638^2+0.2862^2+0.3362^2)+(0.1758^2)*(0.6 000^2 + 0.3500^2 + 0.4000^2) + (0.1972^2)*(0.2782^2 +
0.7718^2 + 0.7218^2) + (0.2502^2)*(0.5898^2 + 0.3602^2 +
0.4102^2) ^0.5 = 0.4088
Thus, all the measure values between an alternative Ai and the ideal alternative A* are obtained by similar calculations and shown in Table (4). The bigger the measured value, the better the alternative. One can rank all alternatives and easily select the best one according to the measured values.
Table 4. Decision Results of two PMs
A1 A2 A3 A4 A5 A6 Ranking
BProjw 0.9652 0.9735 0.9745 0.9486 0.9441 0.9461 A3>A2>A1>A4>A6>A5
Pw 0.3740 0.3721 0.3742 0.3677 0.3672 0.3703
A3>A1>A2>A6>A4>A5

COMPARATIVE ANALYSIS
This section presents and performs a brief comparative analysis of the results that are conducted in this work and achieved using ten SVNS information measures to solving the metal stamping layout selection problem. The result of the existing methods used in this work is compared with the published results to validate the accuracy based on the same
illustrative example presented in this paper and then highlights the advantages of some methods over another method. The same case study is considered by Rao [19] with some traditional MCDM methods (GTMA, SAW, WPM, AHP, TOPSIS, and modified TOPSIS). Das and Srinivas [20] is demonstrated the same problem with traditional TOPSIS combined with the AHP method. The same case study is considered by Nirmal Nital [21] with three SVNS information measures The ranking order obtained is compared with the ranking order published in the literature, and the result is shown in Table (5).
The result comparisons presented in the Table show that the results obtained by the proposed methods used in this work are relatively similar to the results reported in the literature. All methods suggested alternative A3 is the first choice and alternative A5 is the poorest choice except in the TOPSIS obtained by Rao [19] where alternative A6 outranks alternative A5.
The results show that the two topranked alternatives A3 and A2 remain unchanged in almost all the methods applied except in the WCC and Pw methods where alternative A2 outranks alternative A1 as compared to the other methods.
In Table 5, all the ranking orders of the sex alternatives given by the three different SVNS information measures applied by Nirmal Nital [21] are identical, and two methodologies (i) alternative weight and (ii) advance correlation coefficient function of alternative, work without calculating attribute weight among three proposed methodology, whereas entropy weight of alterative works with calculating attribute weight.
It can be seen that the ranking largely remains unchanged especially among the first 2 ideal alternatives and the last 2 poorest choices. The comparative analysis, therefore, confirms that no matter the changes made to the MCDM methods (crisp and/or SVNS) and weights of the criteria (traditional and/or SVNSentropy weight method), alternatives A5 and A2 remains the best alternatives in the selection problems, but it is reflecting on the ranking order of alternatives. However, since the ultimate aim of the decisionmaking framework is to select the best alternative, changes occurring outside the best alternative are not of utmost importance.
However, it is noticed that one alternative outranks another alternative obtained by another approach. The main reason is that the one approach determines a solution that is the closest to the positive ideal solution (PIS), while the other approach determines a solution with the shortest distance from the PIS and the farthest from the NIS.
It shows that the weight criteria make a change in rank position in further ranking results, but it holds well for the first ranking purpose. Minor change occurs due to entropy weight criteria and due to different weight criteria calculation/ assumption/ expert opinion. Some methodologies work without calculating any kind of relative importance of attributes among the other methodology. Whereas all methods work with calculating attribute weight. Some methodologies work with minimum calculations. These methods show also gives better result for the last ranking solution.
From the result of the existing information measures used in this work, it is noted that:

Some existing approaches used the information measures based technique proposed an SVNS weighted arithmetic average operator, subtraction operational aggregation operator, and an SVNS weighted geometric average operator, these methods need to perform an aggregation on the input SVNS arguments, which may increase the computational complexity and therefore lead to the loss of information. In contrast, some approaches do not need to perform such an aggregation but directly deal with the input SVNS arguments; thereby can retain the original decision information as much as possible.

Some existing approaches proposed the similarity measures between each alternative and the ideal alternative to establishing an MCDM method. In contrast, some approaches utilize the score function. Although the same ranking results are obtained here, some information measures have less calculation and it is more flexible and more sustainable for the MCDM with SVNS information. The score function has extremely important for the process of MCDM.
Table 5. Ranking Obtained using Existing Methods
Ranking of alternatives
Information Measures
Ranking from Existing Methods
CE
A3 > A2> A1> A6> A4> A5
WCC
A3 > A1> A4> A6> A2> A5
WCS
A3 > A2> A1> A6> A4> A5
WA
AO
WCS
A3 > A2> A1> A6> A4> A5
SF
A3 > A2> A1> A6> A4> A5
WG
AO
WCS
A3 > A2> A1> A6> A4> A5
SF
A3 > A1> A2> A6> A4> A5
Sub.AO
A3 > A1> A2> A6> A4> A5
Proje ction
BProjw
A3 > A2> A1> A4> A6> A5
Pw
A3 > A1> A2> A6> A4> A5
Ranking collected from (Rao [19])
GTMA
A3 > A2> A1> A6> A4> A5
SAW
A3 > A2> A1> A4> A6> A5
WPM
A3 > A2> A1> A4> A6> A5
AHP
A3 > A2> A1> A4> A6> A5
TOPSIS
A3 > A2> A1> A4> A5> A6
Modified TOPSIS
A3 > A2> A1> A4> A6> A5
Ranking collected from Das and Srinivas [20]
W of Ai
A3 > A2> A1> A5> A6> A4
E.W of Ai
A3 > A2> A1> A5> A6> A4
ACC of Ai
A3 > A2> A1> A5> A6> A4
Ranking collected from Nirmal Nital [21]
TOPSIS combined with the AHP
A3 > A2> A1> A5> A6> A4
CE: Cross Entropy, WCC: Weighted Correlation Coefficient, WCS: Weighted Cosine Similarity, WAAO: Weighted Arithmetic Average Operator, WGAO: Weighted Geometric Average Operator, SF: Score Function, Sub.AO:
Subtraction Operational Aggregation Operator, BProjw: bidirectional PM, Pw: harmonic averaging PM.


CONCLUSIONS
SVNSs can be utilized to solve the indeterminate and inconsistent information that exists in the real world but which FSs and IFSs cannot deal with. Considering the advantages of SVNSs, several methods of SVNSs are put forward and used to solve MCDM problems.
However, there are existing information measures as discussed in the kinds of literature to solve the MCDM problems. In this paper, the main contributions are to solve a numerical case study (metal stamping layout selection problem) in which the criteria values are described in exact (crisp) values form and to use some existing information measures to rank the alternatives. Firstly, the decision matrix is fuzzified and then transformed into an SVNS decision matrix the result of the existing methods used in this work is compared with the published results to validate the accuracy based on the same illustrative example presented in this paper and then highlights the advantages of some methods over another method. The comparative analysis demonstrates the applicability, effectiveness, and rationality of the used methods.
In the future, according to the different requirements in the realworld applications, how to optimize some information measures could form the scope of discussion and further detailed study.

REFERENCES

Smarandache F (1999) A unifying field in logics neutrosophic logic.Neutrosophic probability, set, and logic. American Research Press, Rehoboth.

Smarandache F (2003) A unifying field in logics neutrosophic logic.Neutrosophy, neutrosophic set, neutrosophic probability. American Research Press, Rehoboth.

Wang H, Smarandache F, Zhang YQ, Sunderraman R (2010) Single valued neutrosophic sets. Multistep Multistruct 4:410413.

Ye, J (2013) Multicriteria decisionmaking method using the correlation coefficient under a singlevalued neutrosophic environment. Int. J. Gen Syst 42(4), 386394.

Ye, J (2014) A multicriteria decisionmaking method using aggregation
operators for simplified neutrosophic sets. J. Intell. Fuzzy Syst. 26(5), 24592466.

Ye, J (2014a) Vector similarity measures of simplified neutrosophic sets and their application in multicriteria decisionmaking. Int J Fuzzy Syst 16(2):204215.

Peng, J.J., Wang, J., Zhang, H.Y., Chen, X.H. (2014) An outranking approach for multicriteria decisionmaking problems with simplified neutrosophic sets. Appl. Soft Comput. 25, 336346 .

Liu, P.D., Wang, Y.M. (2014) Multiple attribute decisionmaking the method based on singlevalued neutrosophic normalized weighted Bonferroni mean. Neural Comput. Appl. 25(78), 20012010.

Xiaohui Wu1 JianQiang Wang JuanJuan Peng1, Xiaohong Chen (2016) CrossEntropy and Prioritized Aggregation Operator with Simplified Neutrosophic Sets and Their Application in MultiCriteria DecisionMaking Problems Int. J. Fuzzy Syst. 18(6):11041116.

Majumdar P, Samanta SK (2014) On similarity and entropy of neutrosophic sets. J Intell Fuzzy Syst 26(3):12451252.

Ye, J, (2015) Improved cosine similarity measures of simplified neutrosophic sets for medical diagnoses. Artif Intell Med 63(3):171 179.

Ye, J, (2014b) Singlevalued neutrosophic crossentropy for multicriteria decisionmaking problems. Appl Math Model 38(3):1170 1175.

Haibo Wu Â· Ye Yuan Â· Lijun Wei Â· Lidan Pei (2018) On entropy, similaritymeasure and crossentropy of singlevalued neutrosophic sets and their application inmultiattribute decision making Soft Computing SpringerVerlag GmbH Germany, part of Springer Nature.

Rui Yong and Jun Ye (2019) Multiple Attribute Projection Methods with Neutrosophic Sets , Fuzzy Multicriteria DecisionMaking Using Neutrosophic Sets , pp. 603622, Springer Nature Switzerland AG.

Ye, J, (2017) Singlevalued neutrosophic similarity measures based on cotangent function and their application in the fault diagnosis of the steam turbine. Soft Comput 21(3):817825.

Shigui Du Rui Yong Jun Ye (2020) Subtraction Operational Aggregation Operators of Simplified Neutrosophic Numbers and Their MultiAttribute Decision Making Approach Neutrosophic Sets and Systems, Vol. 33, 157168.

Edmundas Kazimieras Zavadskas , Romualdas Bauys and Marius Lazauskas (2015) Sustainable Assessment of Alternative Sites for the Construction of a waste Incineration Plant by Applying WASPAS Method with SingleValued Neutrosophic Set Sustainability 7, 15923 15936.

Singh R, Sekhon GS, (1996), A computerized digraph and matrix approach for evaluation of metal stamping layouts, International Journal of Materials Processing Technology, Vol 59, pp. 285292.

Rao RV, (2007), Decision making in the manufacturing environment: using graph theory and fuzzy multiple attribute decision making methods. Springer Science & Business Media, ISBN: 1846288193.

Das C, Srinivas C, (2013), Evaluation of metal striplayout selection using AHP and TOPSIS Method, International Journal of Advanced Materials Manufacturing & Characterization, Vol 3, pp. 425429C. Kahraman, U. Cebeci, and Z. Ulukan, "Multicriteria supplier selection using fuzzy AHP", Logistics information management, Vol. 16, No. 6, pp. 382394, 2003.

Nirmal Nital Pravinbhai Development of Multiattribute Decision Making Technique for Improved Performance in Manufacturing and Supply Chain Function a thesis submitted to Gujarat Technological University for the Award of Doctor of Philosophy in Mechanical Engineering September, 2019.