Contents

1 INTRODUCTION 3
1.0.1 Objectives . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4

2 REVIEW OF LITERATURE 6
2.1 BASIC CONCEPTS . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8
2.1.1 Fuzzy set (FS), interval valued fuzzy set (IVFS) . . . . . . . . . . . . . . 8
2.1.2 Intuitionistic fuzzy set (IFS), interval valued intuitionistic fuzzy set (IVIFS) 8
2.1.3 Neutrosophic set (NS), interval valued neutrosophic set (IVNS) . . . . . . 8
2.1.4 Cubic set (CS), internal cubic set (ICS), external cubic set (ECS) . . . . 9
2.1.5 Soft set,neutrosophic soft set (NSS), neutrosophic cubic set (NCS), neu-
trosophic cubic soft set (NCSS) . . . . . . . . . . . . . . . . . . . . . . . . 9

3 MATERIAL AND METHODS 11

3.1 TOPSIS METHOD IN THE ENVIRONMENT OF NEUTROSOPHIC
SOFT SET . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11
3.1.1 Extension of neutrosophic soft TOPSIS method . . . . . . . . . . . . . . . 12
3.1.2 Numerical problem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 14
3.1.3 Comparison Analysis . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 17
3.2 Application of S-boxes image encryption in the environment of neutrosophic soft
set . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 19

4 The MULTIMOORA method extension in the environment of neutro-

sophic cubic soft set(NCSS) 24

1
 4.1 Einstein operations on neutrosophic cubic soft sets . . . . . . . . . . . . . . . . . 24
4.1.1 Extension of the MULTIMOORA method . . . . . . . . . . . . . . . . . . 30
4.2 Application of MULTIMOORA method in the environment of NCSs . . . . 34
4.3 S-boxes image encryption analysis in the environment of NCSs using MUL-
TIMOORA method . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 40

5 DISCUSSIONS 47
5.1 CONCLUSIONS AND FUTURE WORK . . . . . . . . . . . . . . . . . . . . . . 47
5.1.1 Conclusions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 47
5.1.2 Future Work . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 48

2
Chapter 1

INTRODUCTION

Procedure for the sequence of foundness with ideal solution similarity is the multi-conditions
method of assessment analysis initially established by Von Hwang et al. in 1981[23]. With
more improvements by Hwang et al. in 1993 [24], and Yoon in 1987 [46] . TOPSIS method is
based on the idea which preferred alternatives must have the shortest distance positive ideal
solution (PIS) from longest distance negative ideal solution (NIS) [11]. This is compensatory
selection approach which matches alternatives by isolating weights for every condition, normal-
ize scores for every principle and measuring the distance between ideal alternatives and every
alternatives which is superlative score in all criterions. A supposition of TOPSIS is that the
criterion decreases or increases monotonically. Normalization is frequently important as the pa-
rameters in multi-criteria problems are often inconsistent [47], [51], compensatory techniques,
e.g. TOPSIS, require trade-o¤s between criteria where a bad outcome can be invalidated by a
good outcome in additional criterion. This allows modeling to be used more e¤ectively than
non-compensatory approaches that include or reject alternatives based on hard cuto¤s [21]. A
utilization model for nuclear power plants is given in [27].
TOPSIS method which we have used in this thesis is consist of some steps which is under-
study as follows …rst of all we have set of alternatives and parameters in the form of matrix with
corresponding weights. And in second step we compute maximum and minimum ideal solution
of neutrosophic soft ideal solution with the help of presented formula. In third step determine
the neutrosophic separation measure for every alternative from maximum and minimum neu-
trsosphic soft ideal solution. And in fourth step we measure relative closeness coe¢ cient to the

3
neutrosophic soft ideal solution neutrosophic soft numbers and at the end, we arrange the data
in increasing order and select the alternative which have maximum value.
The aim of using MULTIMOORA method to solve such type of problems which is consist
of very wide range of information or data. MULTIMOORA method have parts which is the
reference point (RP), ratio system (RS) and full multiplicative form (FMF). And its concept
is given by Zavadskas and Brauers [16] in 2010. MULTIMOORA method has been de…ned
for crisp and as well as for interval number in decision making problems. In 2011; Brauers
et al. [15] give the idea of extension of MULTIMOORA method for fuzzy set. In 2013; the
extension of MULTIMOORA method for interval valued fuzzy set was de…ned by Balezentis
et al. [14] . And after that the extension of MULTIMOORA of an intuitionistic fuzzy (IF)
was introduced by Balezentis et al. [13]. The perception of extension of the MULTIMOORA
method of interval-valued intuitionistic fuzzy set given by Zavadskas et al. [50], and extension
of the MULTIMOORA method of neutrosophic set was introduced by Stanujkic et al. [41], in
2017.
The overall study is the result of …ve chapters. Chapter 1, named of thesis introduction.
In chapter 2, we overview some helping material like some basic de…nitions which helps us to
improve our knowledge and this concept is already exist. In chapter 3, material and methods are
presented. Chapter 4 and 5; named as results and discussions. We established seven sections.
First section is made of some basic de…nitions. Section 2; is the results of some topics i.e.
TOPSIS method in the environment of neutrosophic soft set. Section 3; is made of application
of S-boxes image encryption in the environment of neutrosophic soft set. Section 4; contain
Einstein operations on neutrosophic cubic soft sets. Application of MULTIMOORA method
in the environment of NCSs is presented in section 5: Section 6; is made of S-boxes image
encryption analysis in the environment of NCSs using MULTIMOORA method and at the end
section 7; named as conclusions and future work.

1.0.1 Objectives

There are three main objectives of this thesis.

To de…ne and gave the idea of a new technique for the S-boxes image encryption analysis
in the environment of neutrosophic soft sets.

4
To de…ne and gave a new technique for the S-boxes image encryption analysis in the
environment of neutrosophic cubic soft sets.

We provided a comprehensive comparison analysis between the already existing methods

and our proposed techniques.

5
Chapter 2

REVIEW OF LITERATURE

In this chapter, we have given few basic de…nitions and history of study. With the help of such
de…nitions we are able to de…ne next chapter.
L. A. Zadeh [48], was the …rst mathematician who introduces the model of fuzzy sets in 1965,
because in uncertain ambiguous environment, L. A. Zadeh applied the fuzzy set and fuzzy logic
in many real life problems. Fuzzy set (FS) is a mapping from any universe of discourse to [0; 1]:
Sometimes it becomes tricky to choose the membership value for a fuzzy value. So to handle
such type of problem interval valued fuzzy sets was proposed by Turksen [43]. We must take the
falsity-membership and truth-membership value for suitable explanation of an item in unsure,
unclear atmosphere like in information fusion, expert system, belief system etc. To handle such
type of problems we cannot use both the interval valued fuzzy set (IVFS) and fuzzy set (FS).
Intended for this purpose Atanassov [1], provide the idea of an intuitionistic fuzzy set (IFS).
These fuzzy sets (FS) are appropriate to complete in a row considering the falsity-membership
value and truth-membership value. But in belief system vague and unpredictable information
exists and to avoid such problem Smarandache [38], o¤ered the idea of neutrosophic set (NS).
The idea of cubic set combine with interval valued fuzzy set (IVFS) and fuzzy set (FS) were
given in 2012 by Jun et al. [25]. And neutrosophic sets is appropriate to handle the problem
consist of indeterminacy and changeable data. Smarandache give the theory of indeterminacy
and recognized the idea of neutrosophic set in 1999. Neutrosophic set have components which
are truth, indeterminacy and falsity value and these components are independent of each other.

6
For further study about such problems Molodtsov [29], proposed the soft set theory and the
idea about di¤erent operations on soft sets see ([2], [30], and [31]). Its properties and algebra
are discussed in [3]. The perception of fuzzy soft sets (FSS) anticipated by Maji et al. [32], as
well as soon after on applied such ideas in decision making problems ([31], [37]). To study fuzzy
soft set in making decision with the help of soft sets was presented by Feng et al. in [19]. Soft
set theory is rising incredibly quickly since its introduction [29]. The nobel perception of soft
set theory acting a vital responsibility to remove doubts as a mathematical instrument. Finally
combining soft set with neutrosophic set we get a new generalization and using this in decision
making by Maji [33].
And using the soft set by Maji et al.[33], and Feng et al.[19], with intutionistic fuzzy sets
(IFS) and fuzzy sets (FS) and presented the intuitionistic fuzzy soft sets (IFSS), fuzzy soft
sets (FSS) and also used in problems of decision making. The generalization of the fuzzy
soft sets(FSS), classical sets, conventional fuzzy set and interval valued fuzzy set (IVFS) is
neutrosophic set theory. This idea has in recent times irritated new research in some instructions
such as databases ([12], [42]), decision making problems [26], topology [28], medical analysis
problems [20] and control theory [6] etc. Their applications and di¤erent algebraic structures
also studied in soft set and fuzzy soft set ([7], [40]). The idea of cubic set in multi-criterion
decision making is given by Mahmood et al. [34]. The model of neutrosophic soft set is projected
Maji et al. [35], and also in decision making problems applied such ideas. After that cubic soft
sets in generalized form and its applications in algebraic structure was used by Ali et al. [8].
Impression of interval neutrosophic set was de…ned by great person Wang et al. [44]. Ali et
al.[9], o¤ered thoughts of neutrosophic cubic set (NCS) by using notion of interval neutrosophic
set (INS) and neutrosophic set (NS). Maji [35], gives the purpose of neutrosophic soft set (NSS)
in problems of decision making. Zhan et al. [49], used the idea of neutrosophic cubic (NC) in
problems of decision making and at the end of this theory the concept of neutrosophic cubic
soft set(NCSS) was planned by Chinnadurai et al. [18] and gives various properties. S-boxes
image encryption analysis in the environment of fuzzy sets is proposed by Rehman et al. [36].
Abdullah et al.[10] used the interval valued intuitionistic fuzzy sets in S-boxes image encryption
analysis. Mahmood et al. [34], worked on cubic sets and introduced S-boxes image encryption
analysis on the basis of cubic sets.

7
2.1 BASIC CONCEPTS

2.1.1 Fuzzy set (FS), interval valued fuzzy set (IVFS)

De…nition 1 [48] Fuzzy set(FS) is a mapping from any universe of discourse to [0; 1]. Let
X 6= ; is an universe of discourse then the mapping given as follows f : X ! [0; 1] is called
fuzzy set.

De…nition 2 [43] Let X 6= ; is an universe of discourse then the mapping given as

f : X ! [0; 1] [0; 1] is called Interval valued fuzzy set.

2.1.2 Intuitionistic fuzzy set (IFS), interval valued intuitionistic fuzzy set
(IVIFS)

De…nition 3 [1] Let U 6= ;. The structure of an intuitionistic fuzzy set(IFS) C in U is a

set C = fh{; C ({); C ({)i : { 2 U g :Where C ({) is non membership function and C ({) is
membership function of the fuzzy set C is de…ned as C ({); C ({) : U ! [0; 1]: And for every
element { 2 U; 0 C ({) + C ({) 1;and C ({) =1 C ({) C ({) is called hesitation
margin.

De…nition 4 [1] Let U 6= ;. The structure of an interval valued intuitionistic fuzzy set(IVIFS)
C in U is a set C = fh{; C ({); C ({)i : { 2 U g :Where C ({) is interval membership func-
tion and C ({) is interval non membership function of the fuzzy set C and C ({); C ({)

[0; 1]: C ({) = [inf C ({); sup C ({)] and C ({) = [inf C ({); sup C ({)] where sup C ({) +
sup C ({) 1:

2.1.3 Neutrosophic set (NS), interval valued neutrosophic set (IVNS)

De…nition 5 [38] Let we have universe of discourse X 6= ; then neutrosophic set(NS) N is

identify as follows
N = f< {; TN ({); IN ({); FN ({) >; { 2 Xg; (2.1)

and T; I; F : X ! (0; 1) but 0 TN ({) + IN ({) + FN ({) 3. The neutrosophic set (NS)
get the value from real standard or non-standard subsets of (0; 1) according to the philosophical

8
point of view. But it is not easy to use neutrosophic set(NS) with value from real standard or
non-standard subset of (0; 1)in scienti…c and engineering problems. For this reason we think
about the neutrosophic set (NS) which receipts the value from the set [0; 1]:

De…nition 6 [38] Assume that X is an universe of discourse. An interval neutrosophic set(INS)

A consist of truth membership value, falsity membership value and indeterminacy membership
value. Where truth, falsity and indeterminacy membership values are subset of [0; 1] and is
de…ned as

A = f< {; [TA ({); TA+ ({)]; [IA ({); IA

+
({)]; [FA ({); FA+ ({)] >; { 2 Xg (2.2)

2.1.4 Cubic set (CS), internal cubic set (ICS), external cubic set (ECS)

De…nition 7 [25] Let U 6= ;:The structure of cubic set is de…ned as C = fh{; B({); ({)j{ 2 U ig ;
where B({) is interval valued fuzzy set(IVFS) and ({) is fuzzy set(FS). It is denoted by
C = hB; i .

De…nition 8 [25] Let U 6= ;:A cubic set C = hB; i is called internal cubic set if B ({)
({) B + ({) for every { 2 U:

De…nition 9 [25] Let U 6= ;:A cubic set C = hB; i is called external cubic set if ({) 2
=
(B ({); B + ({)) for every { 2 U:

2.1.5 Soft set,neutrosophic soft set (NSS), neutrosophic cubic set (NCS),
neutrosophic cubic soft set (NCSS)

De…nition 10 [29] Let an universe of discourse is X and E is a set of parameters. The

power set of X is denoted by P (X): Let A is the non empty subset of E i.e. A E; and
F : A ! P (X) then pair (F; A) is called a soft set over X: A soft set on the universe of
discourse X is a parameterized family of subsets of X: F (e)
_ perhaps measured as the set of
e_ approximate elements of the soft set (F; A) 8 e_ A:

De…nition 11 [35] Assume that an universe of discourse is X and E is a set of parameters.

Let P (X) denote the collection of all neutrosophic set of X and A is a non empty subset of E.
The set (F; A) is called neutrosophic soft set over X; and F is de…ned as F : A ! P (X):

9
De…nition 12 [49] Assume that an universe of discourse is X then neutrosophic cubic set(NCS)
:::
is the given as N ({) = fh{; B({); ({)j{ 2 U ig ;where B({) is interval valued neutrosophic
:::
set(IVNS) and ({) is neutrosophic set(NS). And denoted as N = hB; i

De…nition 13 [18] A soft set FA is called neutrosophic cubic soft set (NCSS) if and only if
:::
F : A ! C N (X):Where an universe of discourse is X and A is subset of E:The structure
of neutrosophic cubic soft set(NCSS) is given as FA = f{; hB(%i ); (%i )ij%i A; { Xg, but here
B(%i ) is an interval valued neutrosophic soft set(IVNSS) and (%i ) is neutrosophic soft set(NSS).

10
Chapter 3

MATERIAL AND METHODS

In this chapter, we de…ne some de…nitions that is Chebyshev distance for neutrosophic soft
numbers, separation measure from maximum and minimum neutrosophic soft ideal solution,
extension of neutrosophic soft TOPSIS method, numerical example, comparison analysis, and
at the end, we use application of S-boxes image encryption in the environment of neutrosophic
soft set.

3.1 TOPSIS METHOD IN THE ENVIRONMENT OF NEU-

TROSOPHIC SOFT SET

De…nition 14 Chebyshev distance for neutrosophic soft numbers Let

F (x1 ) = f({1 ; hT ~ (e1 ) (x1 ) ; I ~ (e1 ) (x1 ) ; F ~ (e1 ) (x1 )i)j%i A; { Xg

F F F

and
F (x2 ) = f({2 ; hT ~ (e2 ) (x2 ) ; I ~ (e2 ) (x2 ) ; F ~ (e2 ) (x2 )i)j%i A; { Xg
F F F

be the two neutrosophic soft numbers. Separation measure between F (x1 ) and F (x2 ) based on
Chebyshev Distance can be de…ned as follows:

11
 8 9
>
>* +>
< T ~ (e1 ) (x1 ) T ~ (e2 ) (x2 ) ; I ~ (e1 ) (x1 ) I ~ (e2 ) (x2 ) ; >
=
F F F F
DChebyshev (F (x1 ; x2 )) = max
>
> >
>
: F ~ (e1 ) (x1 ) F ~ (e2 ) (x2 ) ;
F F

De…nition 15 Separation measure from maximum neutrosophic soft ideal solution

8* +9
< w w w w =
j+ w wj Tij j (ei ) (x) Tij + (ei ) (x) ; Iij j (ei ) (x) Iij + (ei ) (x) ;
DChebyshev dijj ; dij + = max
: w
Fij j (ei ) (x)
w
Fij + (ei ) (x) ;
(3.1)
n
X w wj
8 j = 1; 2; ::n:and N S + = DjChebyshev
+ dijj ; dij + for i = 1; 2; 3; ::m:
j=1

De…nition 16 Separation measure from minimum neutrosophic soft ideal solution

8* +9
< w w =
j+ w wj Tijwj (ei ) (x) wj
Tij (ei ) (x) ; Iij (ei ) (x) Iij (ei ) (x) ;
DChebyshev dijj ; dij = max
: Fijwj (ei ) (x) Fijw (ei ) (x) ;
(3.2)
n
X
j+ w wj
8 j = 1; 2; ::n:and N S = DChebyshev dijj ; dij for i = 1; 2; 3; ::m:
j=1

3.1.1 Extension of neutrosophic soft TOPSIS method

Let we have set of alternatives A = fA1 ; A2 ; A3 ; :; :; Am g and set of parameters C = fC1 ; C2 ; C3 ; :; :; Cn g

and also its respective weights are given. The performance of alternatives are determined by
neutrosophic soft set using the following steps:
step 1 First of all we calculate weighted decision matrix by multiplying corresponding
weights to each alternatives. Multiplication is de…ned as follows

!
DW = D W = dw
ij = wj dij = T ~w ; Iw
~ ; F ~w
F (e F (e F (e
ij ) ij ) ij )

!
wj dij = aj + T ~ aj T ~ ; bj I ~ ; cj F ~ (3.3)
F (eij ) F (eij ) F (eij ) F (eij )

Step 2 Compute maximum and minimum ideal solution of neutrosophic soft ideal solution

12
with the help of following formula

A+
N = dw+ w+ w+ w+
1 ; d2 ; d3 ; :; :; dn (3.4)
0 1

dw+
j = @T ~w+ ; I w+
~
; F ~w+ A
F
(ej ) F (ej ) F (ej )
8 08 919
< < = =
w
where T ~w+ = max @ T ~ j j j = 1; :::; n A
F : i : F ; ;
(ej ) (eij )
8 08 919
< < = =
@ wj A
I w+ = max I j j = 1; :::; n
F
~
: i : F~ ; ;
(ej ) (eij )
8 08 919
< < = =
w
F ~w+ = min @ F ~ j j j = 1; :::; n A
F : i : F ; ;
(ej ) (eij )

AN = dw ; d w w w
2 ; d3 ; :; :; dn (3.5)
01 1

dw
j = @T ~w ; I w ~
; F ~w A
F
(ej ) F (ej ) F (ej )
8 08 919
< < = =
@ wj
T ~w = min T j j = 1; :::; n A
F : i : F~ ; ;
(ej ) (eij )
8 08 919
< < = =
w
Iw = min @ I ~ j j j = 1; :::; n A
~
F : i : F ; ;
(ej ) (eij )
8 08 919
< < = =
w
F ~w = max @ F ~ j j j = 1; :::; n A
F : i : F ; ;
(ej ) (eij )

Step 3 gives the neutrosophic separation measure for every alternatives from maximum
and minimum neutrsosphic soft ideal solution. We proposed new distance measure of two
neutrosophic soft number in place of Manhattan distance or Euclidean distance.
Step 4: And in this step, we calculate relative closeness coe¢ cient to neutrosophic soft
ideal solution neutrosophic soft numbers, formula is given below

13
 NS
NTi = NS +NS +
i
where i = 1; 2; 3; :::m
i i
and …nally the decision will be taken on the base of highest value of NTi .

3.1.2 Numerical problem

Let we have four di¤erent alternatives with given parameters and also corresponding weights
which are given below in the form of table and we choose the best alternative.
Step 1

TABLE 1 CRITERIA WEIGHTS

C1 C2 C3
Wi (0:755; 0:222; 0:217) (0:887; 0:113; 0:107) (0:765; 0:226; 0:182)

C4 C5 C6
Wi (0:692; 0:277; 0:251) (0:788; 0:200; 0:180) (0:700; 0:272; 0:244)

TABLE 2 NEUTROSOPHIC SOFT DECISION MATRIX

C1 C2 C3
A1 (0:864; 0:136; 0:081) (0:853; 0:147; 0:092) (0:800; 0:200; 0:150)
A2 (0:667; 0:333; 0:277) (0:727; 0:2730:219) (0:667; 0:333; 0:277)
A3 (0:880; 0:120; 0:067) (0:887; 0:113; 0:064) (0:834; 0:166; 0:112)
A4 (0:667; 0:333; 0:277) (0:735; 0:265; 0:195) (0:768; 0:232; 0:180)

C4 C5 C6
A1 (0:704; 0:296; 0:241) (0:823; 0:177; 0:123) (0:864; 0:136; 0:081)
A1 0:744; 0:256; 0:204 0:652; 0:348; 0:293 0:608; 0:392; 0:336
A1 0:779; 0:256; 0:204 0:811; 0:189; 0:109 0:850; 0:150; 0:092
A1 0:727; 0:273; 0:221 0:791; 0:209; 0:148 0:808; 0:192; 0:127

Step 2 Now we compute neutrosophic weighted decision matrix by using equation 3.3 we get
table 3 given below.

14
 TABLE 3 WEIGHTED MATRIX

dw
ij C1 C2 C3
A1 (0:9666; 0:0301; 0:0175) (0:9833; 0:0166; 0:0098) (0:953; 0:0452; 0:0273)
A2 (0:9184; 0:0739; 0:0601) (0:9691; 0:0308; 0:0234) (0:9217; 0:0752; 0:0504)
A3 (0:9706; 0:0266; 0:0145) (0:9872; 0:0127; 0:0068) (0:9609; 0:0375; 0:0203)
A4 (0:9184; 0:0739; 0:0601) (0:9700; 0:0299; 0:0208) (0:9454; 0:0524; 0:0327)

dw
ij C4 C5 C6
A1 (0:9088; 0:0819; 0:0604) (0:9624; 0:0354; 0:0221) (0:9592; 0:0369; 0:0197)
A2 (0:9211; 0:0709; 0:0512) (0:9262; 0:0696; 0:0527) (0:8824; 0:1066; 0:0819)
A3 (0:9319; 0:0709; 0:0512) (0:9599; 0:0378; 0:0196) (0:955; 0:0408; 0:0224)
A4 (0:9159; 0:0756; 0:0554) (0:9556; 0:0418; 0:0266) (0:9424; 0:0522; 0:0309)

Step 3 Now by using equation 3.4 and 3.5 we calculate maximum and minimum neutro-
sophic soft ideal solution given below

TABLE 4 MAXIMUM NEUTROSOPHIC SOFT IDEAL SOLUTION

C1 C2 C3
dw+
i (0:9706; 0:0739; 0:0145) (0:9872; 0:0308; 0:0068) (0:9609; 0:0752; 0:0203)

C4 C5 C6
dw+
i (0:9319; 0:0819; 0:0512) (0:9624; 0:0696; 0:0196) (0:9592; 0:1066; 0:0197)

Graphical presentation of table 4 is given

15
 TABLE 5 MINIMUM NEUTROSOPHIC SOFT IDEAL SOLUTION

C1 C2 C3
dw
i (0:9184; 0:0266; 0:0601) (0:9691; 0:0127; 0:0234) (0:9217; 0:0375; 0:0504)

C4 C5 C6
dw
i (0:9088; 0:0709; 0:0604) (0:9262; 0:0354; 0:0527) (0:8824; 0:0369; 0:0819)

Graphical view of table 5 is given as follows

Step 4 To calculate neutrosophic soft separation measures for every alternatives from the

16
minimum neutrosophic soft ideal solution and maximum neutrosophic soft ideal solution. For
this purpose we use equation 3.1 and 3.2 so we get following table.

TABLE 6 NEUTROSOPHIC SOFT SEPARATION MEASURES AND NEUTROSOPHIC SOFT MEASURE RANKING

N Si+ N Si N Ti
A1 0:215 0:2177 0:5031
A2 0:2335 0:2188 0:4837
A3 0:2117 0:2389 0:5301
A4 0:1904 0:1864 0:4173

Graphical view of …nal ranking is given as

To observe the above table, we get the result that A3 A1 A2 A4 So we get the same
result like neutrosophic TOPSIS [12] and simpli…ed-TOPSIS method and neutrosophic.

3.1.3 Comparison Analysis

We compare our presented method to other two already proposed method named as single
valued neutrosophic TOPSIS method and simpli…ed neutrosophic TOPSIS method. Graphical
comparison is already presented in this section which is given below

17
 TABLE 7

Alternatives M (Ai ) Grades based on Method-1 Method-2 Method-3

A1 0:8190; 0:8645; 0:5031 A3 A3 A3
A2 0:1158; 0:0352; 0:4837 A1 A1 A1
A3 0:8605; 0:9802; 0:5301 A4 A4 A4
A4 0:4801; 0:4598; 0:4173 A2 A2 A2

Graphical view of grading based on Method-1

Graphical view of grading based on Method-2

18
 Graphical view of grading based on Method-3

3.2 Application of S-boxes image encryption in the environ-

ment of neutrosophic soft set

In this section, we are trying to know that how and which one block cipher S-box image
encryption is best to choose among the other under study S-boxes which protect the data in
safe mode. The way of selection step wise is given below.
Let we have set of S-boxes that is S = fB1 ; B2 ; B3 ; B4 ; B5 ; B6 g where B1 is stand for Plain
Image B2 is stand for AES similarly B3; B4; B5; B6 is stand for APA, Lui, Gray, and Prime re-
spectively. We make the selection on the basis of set of criteria i.e. C = fC1 ; C2 ; C3 ; C4 ; C5 ; C6 g
where C1 shows entropy, C2 tells about contrast and C3 ; C4 ; C5 ; C6 is used for an average
correlation, energy, and homogeneity respectively. Decision matrix is given below

19
 Step 1

TABLE 8 DECISION MATRIX

C1 C2 C3 C4 C5 C6
B1 (0:1; 0:2; 0:3) (0:2; 0:3; 0:4) (0:1; 0:9; 0:7) (0:6; 0:4; 0:2) (0:4; 0:1; 0:2) (0:6; 0:5; 0:1)
B2 (0:2; 0:5; 0:4) (0:2; 0:7; 0:9) (0:5; 0:1; 0:3) (0:5; 0:2; 0:3) (0:3; 0:1; 0:7) (0:9; 0:8; 0:7)
B3 (0:1; 0:6; 0:9) (0:7; 0:8; 0:2) (0:4; 0:1; 0:7) (0:2; 0:2; 0:1) (0:6; 0:8; 0:9) (0:7; 0:3; 0:2)
B4 (0:2; 0:3; 0:6) (0:5; 0:4; 0:3) (0:1; 0:8; 0:4) (0:5; 0:2; 0:6) (0:7; 0:4; 0:3) (0:7; 0:9; 0:5)
B5 (0:5; 0:3; 0:5) (0:6; 0:7; 0:4) (0:9; 0:6; 0:2) (0:3; 0:4; 0:5) (0:6; 0:1; 0:4) (0:8; 0:1; 0:4)
B6 (0:1; 0:1; 0:3) (0:3; 0:2; 0:7) (0:4; 0:6; 0:8) (0:2; 0:6; 0:4) (0:5; 0:2; 0:4) (0:4; 0:8; 0:5)

TABLE 9 CRITERIA WEIGHTS

C1 C2 C3 C4 C5 C6
Wi (0:4; 0:6; 0:8) (0:2; 0:5; 0:3) (0:5; 0:7; 0:9) (0:7; 0:9; 0:4) (0:9; 0:2; 0:3) (0:4; 0:1; 0:2)

Step 2 Now we compute neutrosophic weighted decision matrix by using equation 3.3 we get
table 10 given below.

20
 TABLE 10 WEIGHTED MATRIX

C1 C2 C3
B1 (0:46; 0:12; 0:24) (0:36; 0:15; 0:12) (0:55; 0:63; 0:63)
B2 (0:52; 0:30; 0:32) (0:36; 0:35; 0:63) (0:75; 0:07; 0:63)
B3 (0:46; 0:36; 0:72) (0:76; 0:40; 0:06) (0:7; 0:07; 0:63)
B4 (0:52; 0:18; 0:48) (0:6; 0:20; 0:09) (0:55; 0:56; 0:36)
B5 (0:7; 0:18; 0:40) (0:68; 0:35; 0:12) (0:95; 0:63; 0:18)
B6 (0:46; 0:06; 0:24) (0:44; 0:10; 0:21) (0:7; 0:42; 0:72)

C4 C5 C6
B1 (0:88; 0:36; 0:08) (0:94; 0:02; 0:06) (0:76; 0:05; 0:02)
B2 (0:85; 0:18:0:12) (0:93; 0:02; 0:21) (0:94; 0:08; 0:14)
B3 (0:76; 0:18; 0:05) (0:96; 0:16; 0:27) (0:82; 0:03; 0:04)
B4 (0:85; 0:18; 0:24) (0:97; 0:08; 0:09) (0:82; 0:03; 0:04)
B5 (0:79; 0:36; 0:20) (0:96; 0:02; 0:12) (0:88; 0:01; 0:08)
B6 (0:76; 0:54; 0:16) (0:95; 0:04; 0:12) (0:64; 0:05; 0:16)

Step 3 now by using equations 3.4 and 3.5, we calculate maximum and minimum neutrosophic
soft ideal solution given below

TABLE 11 MAXIMUM NEUTROSOPHIC SOFT IDEAL SOLUTION

C1 C2 C3
dw+
i 0:52; 0:36; 0:24 0:76; 0:40; 0:06 0:95; 0:63; 0:18

C4 C5 C6
dw+
i 0:88; 0:54; 0:04 0:97; 0:16; 0:06 0:94; 0:08; 0:02

Graph of maximum neutrosophic soft ideal solution is given as follows

21
 TABLE 12 MINIMUM NEUTROSOPHIC SOFT IDEAL SOLUTION

C1 C2 C3
dw
i 0:7; 0:06; 0:72 0:6; 0:10; 0:63 0:7; 0:07; 0:72

C4 C5 C6
dw
i 0:76; 0:18; 0:24 0:93; 0:02; 0:27 0:64; 0:01; 0:16

Graph of minimum neutrosophic soft ideal solution is given below

Step 4 determine neutrosophic soft separation measures for every alternatives from maximum
neutrosophic soft ideal solution and minimum neutrosophic soft ideal solution. For this purpose

22
we use equations 3.1 and 3.2, so we get following table

TABLE 13 NEUTROSOPHIC SOFT SEPARATION MEASURES AND NEUTROSOPHIC SOFT MEASURE RANKING

N Si+ N Si N Ti
B1 1:59 2:08 0:56
B2 1:84 0:83 0:31
B3 1:73 1:42 0:45
B4 1:14 1:72 0:60
B5 0:63 1:96 0:75
B6 1:7 1:8 0:51

Final ranking in the form of graph is given below

Here we see that, B5 B4 B1 B6 B3 B2 so …nally we conclude that Gray S-box is

best according to the given data.

23
Chapter 4
The MULTIMOORA method extension in the environment of neutrosophic
cubic soft set(NCSS)

In this chapter we present extension of MULTIMOORA method using the neutrosophic cubic
soft set(NCSS). We …rst de…ned some Einstein operations on neutrosophic cubic soft set.

4.1 Einstein operations on neutrosophic cubic soft sets

Let FA = f({; hB1 (%i ); 1 (%i )i)j%i A; { Xg and FB = f({; hB2 (%i ); 2 (%i )i)j%i B; { Xg be two
neutrosophic cubic soft sets.

De…nition 17 The Einstein addition is given by FA FB = FC ; where C = A [ B de…ned as

follows 8
>
> F (x) = f({; hB1 (%i ); 1 (%i )i)j%i A; { Xg if %i 2 A B
>
< A
FC (x) = FB (x) = f({; hB2 (%i ); 2 (%i )i)j%i B; { Xg if %i 2 B A
>
>
>
: FA (x) FB (x) if %i 2 A \ B

24
where FA (x) FB (x) =
0 2 3 1
T ~L +T ~L T ~U +T ~U
B 4 F (%i ) F (%i ) F
; 1+T(%Ui )
F (% )
i 5; C
B 1+T ~L T ~L T ~U C
B ~ C
B F (%i ) F (%i ) F (% ) F (% ) C
B i i
C
B C
B 2 3 C
B IL +I L IU +I U
C
B ~ ~ ~ ~ C
B 4 F (%i ) F (%i ) F (%i ) F (%i )
5; C
B1 (%i ) B2 (%i ) = B 1+I L IL
; 1+I U IU
C
B ~ ~ ~ ~ C
B F (%i ) F (%i ) F (%i ) F (%i ) C
B C
B C
B 2 3 C
B C
B F ~L F ~L F ~U F ~U C
B 6 7 C
B 4 F (%i ) F (%i )
! !; F (%i ) F (%i )
! !5 ; C
@ A
1+ 1 F ~L 1 F ~L 1+ 1 F ~U 1 F ~U
F (%i ) F (%i ) F (%i ) F (%i )

and
* T~ T~ I~ I~ F~ + F~ +
F (%i ) F (%i ) F (%i ) F (%i ) F (%i ) F (%i )
1 (%i ) 2 (%i ) = ; ;
1 + (1 T~ )(1 T~ ) 1 + (1 I~ )(1 I~ ) 1 + F~ F~
F (%i ) F (%i ) F (%i ) F (%i ) F (%i ) F (%i )

De…nition 18 The Einstein product is given by FA FB = FC ; where C = A [ B de…ned as

follows 8
>
> F (x) = f({; hB1 (%i ); 1 (%i )i)j%i A; { Xg if %i 2 A B
>
< A
FC (x) = FB (x) = f({; hB2 (%i ); 2 (%i )i)j%i B; { Xg if %i 2 B A
>
>
>
: F (x) F (x) if % 2 A \ B
A B i

25
where FA FB =
0 2 3 1
6 T ~L T ~L T ~U T ~U 7
B 6 7 C
B 6
F (%i ) F (%i )
! !; 0
F (% ) F (% )
i 10i 17 ; C
B C
B 4 1+ 1 T ~L 1 T ~L
5 C
B 1+@1 T ~U A@1 T U A C
B F (%i ) F (%i ) F (% )
~
F (% ) C
B i i C
B C
B C
B 2 3 C
B C
B IL IL IU IU C
B1 (%i ) B2 (%i ) = B
B
6
6 ~ ~
F (%i ) F (%i )
~ ~
F (% ) F (% )
7
7
C
C (4.1)
B 6 ! !; 0 i 10i 17 C
B 4 1+ 1 IL 1 IL
5 C
B ~ ~ 1+@1 I U A@1 I U A C
B F (%i ) F (%i ) ~ ~ C
B F (% )
i
F (% )
i C
B C
B C
B 2 3 C
B F ~L +F ~L F ~U +F ~U C
B C
@ 4 F (%i ) F (%i ) F (%i )
; 1+F F (%i )
5; A
1+F ~L F ~L U
~
F ~U
F (%i ) F (%i ) F (%i ) F (%i )

and
* T~ + T~ I~ + I~ F~ F~ +
F (%i ) F (%i ) F (%i ) F (%i ) F (%i ) F (%i )
1 (%i ) 2 (%i ) = ; ;
1 + T~ T~ 1 + I~ I~
F (%i ) F (%i ) F (%i ) F (%i ) 1+ 1 F~ 1 F~
F (%i ) F (%i )

~ ~
De…nition 19 The scalar multiplication is given by kE F (%i ) = F C de…ned as follows
8 9
> ~
< F (% )j% A; { X if k = 1 >
=
~ i i
F C (x) = ~
>
: kE F (% )j% A; { X if k > 1 >
;
i i

26
where
0 2 0 1k 0 1k 3 1
!k !k
B @1+T U A @1 T ~U A C
6 1+T ~L 1 T ~L ~ 7
B 6 F (% ) F (% ) 7 C
B 6
F (%i )
!k
F (%i )
!k ; 0 i
1k 0 i
1k 7; C
B 4 5 C
B 1+T ~ L + 1 T~ L
@1+T U A +@1 T U A C
B ~ ~ C
B F (%i ) F (%i ) F (% ) F (% ) C
B i i C
B C
B C
B 2 0 1k 0 1k 3 C
B !k !k C
B @1+I U A @1 I U A C
B 6 1+I L~ 1 IL ~ ~ 7 C
B 6 F (%i )
~
F (%i ) F (%i ) F (%i ) 7 C
B 6 !k !k ; 0 1k 0 1k 7 ; C
B 4 5 C
B 1+I ~ L + 1 I~ L
@1+I U A +@1 I U A C
~ B ~ ~ C
B F (%i ) F (%i ) F (% ) F (% ) C
kE F (%i ) = B i i
C
B C
B 2 3 C
B !k !k C
B C
B 6 2 F~ L 2 F~ U
7 C
B 6 7 C
B 4
F (%i )
!k !k ;
F (%i )
!k !k ;
5 C
B C
B 2 F ~L + F ~L 2 F ~U + F ~U C
B C
B F (%i ) F (%i ) F (%i ) F (%i ) C
B C
B C
B !k !k !k C
B * + C
B 2 T~ 2(I ~ )k 1+F ~ 1 F~ C
B C
B F (%i )
!k !k ;
F (%i )
!k !k ;
F (%i )
!k
F (%i )
!k C
@ A
2 T~ + T~ 2 I~ + I~ 1+F ~ + 1 F~
F (%i ) F (%i ) F (%i ) F (%i ) F (%i ) F (%i )
(4.2)

~ K ~
De…nition 20 The scalar power F (%i )E = F C de…ned as follows
8 9
> ~
< F (% )j% A; { X if k = 1 >
=
~ i i
F C (x) = ~
>
: F (% ) j% A; { X if k > 1
E K >
;
i i

27
where
0 2 !k !k 3 1
2 T ~L 2 T ~U
B 6 7 C
B 6 F (% )
!k i !k ;
F (% )
!k i !k 7 ; C
B 4 5 C
B 2 T ~L + T ~L 2 T ~L + T ~L C
B C
B F (%i ) F (%i ) F (%i ) F (%i ) C
B C
B C
B 2 !k !k 3 C
B C
B IL IU
C
B 6 2 ~
2 ~ 7 C
B 6 C
!k 7 ;
F (% ) F (% )
B !k i !k ; !k i C
B 4 5 C
B 2 IL + IL 2 IU + IU C
B ~
F (%i )
~
F (%i )
~
F (%i )
~
F (%i ) C
~
EK
B C
F (%i ) =B
B
C
C
B 2 !k !k !k !k 3 C
B C
B 6 1+F ~L 1 F ~L 1+F ~U 1 F ~U
7 C
B 6 C
B !k 7 ; C
F (%i ) F (%i ) F (%i ) F (%i )
!k !k ; !k
B 4 5 C
B 1+F ~L + 1 F ~L 1+F ~U + 1 F ~U C
B C
B F (%i ) F (%i ) F (%i ) F (%i ) C
B C
B C
B !k !k !k !k !k C
B * + C
B 1+T ~ 1 T~ 1+I ~ 1 I~ 2 F~ C
B C
B F (%i )
!k
F (%i )
!k ;
F (%i )
!k
F (%i )
!k ;
F (%i )
!k !k C
@ A
1+T ~ + 1 T~ 1+I ~ + 1 I~ 2 F~ + F~
F (%i ) F (%i ) F (%i ) F (%i ) F (%i ) F (%i )
(4.3)

~
De…nition 21 Suppose F (e)(x) = fhB(%); (%)ig be neutrosophic cubic soft number where B(%)
is an interval neutrosophic soft number and (%) is neutrosophic soft number then the score
function of (NCSNs) is given by

S = T ~L F ~L + T ~U F ~U + T~ F~ : (4.4)
F (e) F (e) F (e) F (e) F (e) F (e)

Let
FA = fhB1 (%i ); 1 (%i )ig

and
FB = fhB2 (%i ); 2 (%i )ig

then the maximum distance between FA and FB can be determine with the help of following
formula
~ ~
dmax F (%i ); F (%i ) = (4.5)

28
 8 v !2 !2 9
> u >
>
> u ~ ~ >
>
>
> t TL T ~L T ~U T ~U >
> + + T~ T~ ; F (%i ); F (%i ) max ; >
>
>
>
~
F (%i ) F (%i ) >
>
>
<
F (%i ) F (%i ) F (%i ) F (%i ) >
=
>
> v >
>
>
> u !2 !2 >
>
>
> u ~ ~ >
>
>
> t FL F ~L + F ~U F ~U + F~ F~ ; F (%i ); F (%i ) >
>
>
: ~ min >
;
F (%i ) F (%i ) F (%i ) F (%i ) F (%i ) F (%i )

~
De…nition 22 Let F (ej ) = f{; hB(%j ); (%j )ij%j A; { Xg be a NCSN and its weighted vector
P
n
is given as W = (w1 ; w2 ; w3 ; ::wn )T and wj = 1 where wj 2 [0; 1] then neutrosophic cubic
j=1
~
soft weighted averaging operator of F (ej ) de…ned as follows

~ ~ ~
N CSW A F (%i ); F (%i ); :::F (ej ) =

0 2 !w !w
0 1w
j
0 1w
j
3 1
n j n j n n
@1+T U A @1 T U A
B 6 j=1 1+T ~L 1 T ~L j=1 ~ j=1 ~ 7 C
B 6 F (%i )
j=1
F (%i ) F (% ) F (% ) 7 C
B 6 n !w
j
! wj ; 0 i 1
wj 0 i 1
wj 7; C
B 4 1+T ~L
n
1 T ~L
n n 5 C
B + @1+T U A + @1 T U A C
B j=1
F (%i )
j=1
F (%i ) j=1 ~ j=1 ~ C
B F (% )
i
F (% )
i C
B C
B C
B 2 0 1w 0 1w 3 C
B !w !w j j C
B n j n j n
@1+I U A
n
@1 I U A C
B 6 j=1 1+I L 1 IL ~ ~ 7 C
B 6 ~ j=1 ~ j=1
F (% )
j=1
F (% ) 7 C
B 6 n
F (%i )
!w F (%i )
!w ; 0 i 1
wj 0 i 1
wj 7; C
B 4 j n j
n n 5 C
B 1+I L + 1 IL @1+I U A + @1 I U A C
B j=1 ~ j=1 ~
j=1 ~ j=1 ~ C
B F (%i ) F (%i ) F (% ) F (% ) C
B i i
C
B C
B 2 3 C
B !w
j
!w
j C
B n n C
B 6 2 F ~L 2 F ~U
7 C
B 6
j=1
!wF (%i )
j=1
!wF (%i ) 7; C
B 4 j
!w
j ; j
!w
j 5 C
B n
2 F ~L
n
F ~L
n
2 F ~U
n
F ~U
C
B + + C
B j=1
F (%i )
j=1
F (%i )
j=1
F (%i )
j=1
F (%i ) C
B C
B C
B C
B !w
j
!w
j
!w
j C
B n n n C
B 2 T~ 2 n (I
j=1 ~ ) wj 1+F ~ 1 F~ C
B j=1 F (% )
!w i !w ; !w F (%i ) !w ;
j=1 F (%i )
!w
j=1 F (%i )
!w C
@ n j n j n j n j n j n j A
2 T~ + T~ 2 I~ + I~ 1+F ~ + 1 F~
j=1 F (%i ) j=1 F (%i ) j=1 F (%i ) j=1 F (%i ) j=1 F (%i ) j=1 F (%i )

~
De…nition 23 Assume that F (ej ) = f{; hB(%j ); (%j )ij%j A; { Xg is a NCSN with associated
P
n
weighted vector W = (w1 ; w2 ; w3 ; ::wn )T and wj = 1 where wj 2 [0; 1] then neutrosophic
j=1
~
cubic soft weighted geometric operator of F (ej ) is given as

29
 0 " # 1
n n
B (T L )wj ; (T U )wj C ;
B j=1
~
F (ej ) j=1
~
F (ej ) C
B C
B C
B C
B " # C
B C
B n
L w
n
U w C
B (I ~ ) ; j (I ~ ) j ; C
B j=1 F (e ) j=1 F (e ) C
B j j C
B C
~ ~ ~ B C
N CSW GA F (%i ); F (%i ); :::F (ej ) =B
B " # CC
B n
L w
n
U w C
B 1 (1 F ~ ) ; 1 j (1 F ~ ) j ; C
B j=1 j=1 C
B F (ej ) F (ej ) C
B C
B C
B C
B * n n
+ C
B 1 (1 T ~ ) ; 1 w j (1 I ~ ) ; w j C
B C
B j=1 F (ej ) j=1 F (ej ) C
@ n
w
A
(F ~ ) j
j=1 F (ej )

4.1.1 Extension of the MULTIMOORA method

Let we have alternatives m and n parameters in multicriteria decision making problems and we
want to …nd out the performance of alternatives are determined in the structure of neutrosophic
cubic soft set(NCSS) then we use the below steps.
Step 1. To calculate the rank of alternatives according to the Reference Ap-
proach
To …nd the rank of alternative and to choose the best alternative we need to use the sub
steps given below.
step 1.1. First we …nd Yi+ and Yi through the following aggregation operators.

30
 0 2 0 1w 0 1w
0 1w
j 0 1w
j
3 1
j j
B C @1 T U A
B 6 @1+T L A @1 T L A @1+T ~U A C ~ 7
B 6 j2 max ~
F (ej )
j2 max ~
F (ej )
j2 max
F (e )
j2 max
CF (ej) 7
B 6 0 1w 0
j ;
1w 0 j
1w0 C 1w 7 ;
B 6 j j C j 7
B 4 @1+T L A + @1 T L A B C @1 T U C A
5
B j2 max ~ j2 max ~ @ 1+T U
A + C
B F (ej ) F (ej ) j2 max ~
F (e )
j2 max ~
F (ej) C
B j C
B C
B C
B 2 0 1w 0 1w 3 C
B 0 1w 0 1w j j C
B j j
B C B C C
B 6 @1+I L A @1 I L A @1+I ~U
A @1 I ~ U
A 7 C
B 6 j2 max ~ j2 max ~ j2 max j2 max
7 C
B 6 0
F (ej )
1w 0
F (ej )
1w ;
F (e )
j
0
F (e )
j
1w 7 ; C
B 6 j j 0 1 wj j 7 C
B 4 5 C
B @1+I L A + @1 I L A @1+I U A + B
@1 I U
C
A C
B j2 max ~ j2 max ~
j2 max ~ j2 max ~ C
B F (ej ) F (ej ) F (ej) F (e ) C
B j
C
B C
B 2 3 C
B 0 1w 0 1w C
B j j
C
Yi+ =B 2 @F L A 2 @F U A C
B 6 j2 max ~ j2 max ~ 7 C
B 6 F (ej ) F (ej ) 7 C
B 6 0 1w
j
0 1w ;
j
0 1w
j
0 1w 7 ;
j C
B 4 @2 F L A + @F L A @2 F U A + @F U A
5 C
B C
B j2 max ~
F (ej )
j2 max ~
F (ej )
j2 max ~
F (ej )
j2 max ~
F (ej ) C
B C
B C
B C
B !w C
B j C
B 2 T~ 2 (I ~ ) wj C
B j2 max F (ej ) j2 max F (e ) C
B !w !w ; !w j !w ; C
B j j j j
C
B * j2 max 2 T~ + T~ 2 I~ + I~
+ C
B F (ej ) j2 max F (ej ) j2 max F (ej ) j2 max F (ej ) C
B C
B C
B C
B !w
j
!w
j C
B C
B 1+F ~ 1 F~ C
B j2 max F (ej )
!w
j2 max F (ej )
!w
C
@ j j A
1+F ~ + 1 F~
j2 max F (ej ) j2 max F (ej )

(R)

31
 0 2 0 1w 0 1w 0 1w
j
0 1w
j 3 1
j j
@1+T U A B C
B 6 @1+T L A @1 T L A ~ @1 T ~U C A 7
B 6 j2 min ~
F (ej )
j2 min ~
F (ej )
j2 min
F (ej)
j2 min
C
F (e ) 7
B 6 0 1w 0
j ;
1w 0 1w 0 C j
1w 7
j 7;
B 6 j j C
B 4 @1+T L A + @1 T L A B C B C C 5
B j2 min ~ j2 min ~ @ 1+T U
A + @ 1 T U
A C
B F (ej ) F (ej ) j2 min ~
F (e )
j2 min ~
F (e ) C
B j j C
B C
B C
B 2 0 1w 0 1w 3 C
B 0 1w 0 1w j j C
B j j
B C B C C
B 6 @1+I L A @1 I L A @ 1+I U
A @ 1 I U
A 7 C
B 6 j2 min ~ j2 min ~ j2 min ~ j2 min ~
7 C
B 6 0
F (ej )
1w 0
F (ej )
1w ; 0
F (e )
j
1w 0
F (e )
j C
1w 7 ; C
B 6 j j j j 7
B 4 C 5
C
B @1+I L A + @1 I L A B
@1+I U
C
A +
B
@1 I U A C
B j2 min ~ j2 min ~
j2 min ~ j2 min ~ C
B F (ej ) F (ej ) F (e ) F (e ) C
B j j
C
B C
B C
B 2 0 1w 0 1w 3 C
B j j
C
Yi =B 2 @F L A 2 @F U A C
B 6 j2 min ~ j2 min ~ 7 C
B 6 F (ej ) F (ej ) 7 C
B 6 0 1w
j
0 1w ;
j
0 1w
j
0 1w 7 ;
j C
B 4 5 C
B @2 F L A + @F L A @2 F U A + @F U A C
B j2 min ~
F (ej )
j2 min ~
F (ej )
j2 min ~
F (ej )
j2 min ~
F (ej ) C
B C
B C
B C
B !w C
B j C
B 2 T~ 2 (I ~ )wj C
B j2 min F (ej ) j2 min F (e ) C
B !w !w ; !w j !w ; C
B j j j j
C
B * j2 min 2 TF~ (ej ) + T~ 2 I~ + I~
+ C
B j2 min F (ej ) j2 min F (ej ) j2 min F (ej ) C
B C
B C
B C
B !w !w C
B j j
C
B 1+F ~ 1 F~ C
B j2 min F (ej ) j2 min F (ej ) C
@ !w
j
!w
j A
1+F ~ + 1 F~
j2 min F (ej) j2 min F (ej)
(4.6)
where Yi+ and Yi are also NCSNs.
step 1.2 Determine following score functions

y^i+ = s(Yi+ ); (4.7)

y^i = s(Yi ); (4.8)

step 1.3 To determine the whole importance of alternative i with the help of following formula

Zi = y^i+ y^i (4.9)

step 1.4. And at end to …nd the best alternative we rank all the alternatives.

32
 Step 2 Calculate the ranking of alternatives using RP approach
Step 2.1 Every coordinate of reference point r = (r1 ; r2 ; :::rn ) is NCSN. rj = f{; hBj (%j ); j (%j )ij%j A; { X
and can be calculated with the following method

8 9
>
> hmax Bj (%j ); max max >
>
>
< j (%j )ij%j A; j 2 >
=
rj = (4.10)
>
> >
>
>
: hmin B (% ); min >
j j j (%j )ij%j A; j 2 min ;

Step 2.2 Find the maximum distance of every alternative to all coordinates of the reference
point(RP) using below formula
dmax
ij = dmax (rij ; rj )wj (4.11)

Step 2.3 Now by ranking all the alternatives to choose the best alternative.
Step 3 According to FMF select the best alternative
Step 3.1 First we …nd Ai and Bi by following formulae
0 " # 1
B (T ~L )wj ; (T ~U )wj ; C
B j2 max F (ej ) j2 max F (ej ) C
B C
B C
B C
B " # C
B C
B C
B (I L~ )wj ; (I U~ )wj ; C
B j2 max F (ej ) j2 max F (ej ) C
B C
Ai = B
B
C
C (4.12)
B " # C
B C
B C
B 1 (1 F ~L )wj ; 1 (1 F ~U )wj ; C
B j2 max F (ej ) j2 max F (ej ) C
B C
B C
B C
B C
@ A
1 (1 T~ )wj ; 1 (1 I~ )wj ; (F ~ )wj
j2 max F (ej ) j2 max F (ej ) j2 max F (ej )

33
 0 " # 1
B (T L~ )wj ; (T U
~ )wj ; C
B j2 min F (ej ) j2 min F (ej ) C
B C
B C
B C
B " # C
B C
B C
B (I L~ )wj ; (I U~ )wj ; C
B j2 min F (ej ) j2 min F (ej ) C
B C
Bi = B
B
C
C (4.13)
B " # C
B C
B C
B 1 (1 F ~L )wj ; 1 (1 F ~U )wj ; C
B j2 min F (ej ) j2 min F (ej ) C
B C
B C
B C
B C
@ A
1 (1 T~ )wj ; 1 (1 I~ )wj ; (F ~ )wj
j2 min F (ej ) j2 min F (ej ) j2 min F (ej )

where Ai and Bi are NCSNs.

Step 3.2 using score function which is given as follows …nd the values of i and bi

i = s(Ai ); (4.14)

bi = s(Bi ): (4.15)

Step 3.3 Calculate the whole importance of all alternatives is given below

i
fi = (4.16)
bi

Step 3.4 Now by ranking of alternatives we choose the best one.

Step 4 Calculate the …nal ranking of alternatives
Finally the alternatives can be ranking according to the theory of dominance.

4.2 Application of MULTIMOORA method in the environment of NCSs

Use the above mentioned algorithm to …nd the solution of the following problem. Let O =
fM1 ; M2 ; M3 ; M4 g be the set of distinct mobile and Mr. Y wants to choose the best mobile
among these mobiles based on the set of parameters given as E = fBattery charging, Look,
Price, Memoryg the numerical presentation of the neutrosophic soft set (O; E) is given below
where M1 is stand for …rst mobile and similarly M2 ; M3 ; M4 used for 2nd ; 3rd and 4th mobile

34
respectively. And C1 ; C2 ; C3 and C4 shows the parameters Battery charging, Look, Price,
Memory respectively.

Table 14
Data about di¤erent mobiles given by experts
C1 C2
M1 f[0:1; 0:2] [0:2; 0:5] [0:3; 0:4] h0:1; 0:5; 0:3ig f[0:3; 0:4] [0:7; 0:8] [0:7; 0:9] h0:2; 0:1; 0:4ig
M2 f[0:5; 0:6] [0:8; 0:9] [0:2; 0:5] h0:2; 0:4; 0:6ig f[0:4; 0:6] [0:6; 0:9] [0:4; 0:8] h0:6; 0:1; 0:3ig
M3 f[0:7; 0:8] [0:6; 0:9] [0:1; 0:2] h0:5; 0:8; 0:7ig f[0:1; 0:3] [0:2; 0:4] [0:3; 0:6] h0:4; 0:5; 0:2ig
M4 f[0:3; 0:5] [0:4; 0:6] [0:6; 0:9] h0:2; 0:3; 0:4ig f[0:3; 0:6] [0:1; 0:5] [0:4; 0:7] h0:3; 0:5; 0:6ig
C3 C4
M1 f[0:5; 0:8] [0:7; 0:8] [0:5; 0:9] h0:4; 0:2; 0:6ig f[0:2; 0:3] [0:4; 0:7] [0:3; 0:5] h0:4; 0:2; 0:1ig
M2 f[0:1; 0:9] [0:6; 0:7] [0:7; 0:8] h0:6; 0:1; 0:3ig f[0:6; 0:9] [0:8; 0:9] [0:2; 0:4] h0:8; 0:4; 0:1ig
M3 f[0:8; 0:9] [0:3; 0:5] [0:5; 0:7] h0:4; 0:5; 0:2ig f[0:1; 0:4] [0:2; 0:6] [0:6; 0:9] h0:9; 0:6; 0:5ig
M4 f[0:5; 0:6] [0:6; 0:9] [0:5; 0:7] h0:3; 0:2; 0:3ig f[0:2; 0:3] [0:5; 0:8] [0:3; 0:7] h0:2; 0:1; 0:3ig

35
 Table 15
Table constructed with the help of RS approach.
Yi+
M1 f[0:12; 0:18] [0:31; 0:45] [0:66; 0:76] h0:35; 0:45; 0:21ig
M2 f[0:28; 0:40] [0:49; 0:70] [0:50; 0:77] h0:54; 0:42; 0:13ig
M3 f[0:28; 0:39] [0:14; 0:51] [0:21; 0:57] h0:64; 0:77; 0:31ig
M4 f[0:19; 0:35] [0:18; 0:35] [0:67; 0:87] h0:47; 0:59; 0:32ig
Yi
M1 f[0:22; 0:39] [0:36; 0:53] [0:59; 0:80] h0:60; 0:42; 0:23ig
M2 f[0:23; 0:70] [0:49; 0:64] [0:60; 0:73] h0:81; 0:42; 0:12ig
M3 f[0:34; 0:51] [0:15; 0:35] [0:71; 0:87] h0:76; 0:71; 0:22ig
M4 f[0:22; 0:29] [0:35; 0:67] [0:59; 0:81] h0:47; 0:35; 0:18ig
y^i+ y^i Zi Ranking
M1 0:97 0:41 0:56 4
M2 0:18 0:29 0:47 3
M3 0:22 0:18 0:41 1
M4 0:86 0:61 0:25 2

The above table is constructed by using equations 4.7, 4.8 and 4.9, on the basis of ratio system
approach.
The score of di¤erent mobiles on the basis of RS approach graphically presented as follows.

36
 Table 16
Reference point table
C1 C2
rj f[0:7; 0:8] [0:8; 0:9] [0:6; 0:9] h0:5; 0:8; 0:7ig f[0:4; 0:6] [0:7; 0:9] [0:7; 0:9] h0:6; 0:5; 0:6ig
C3 C4
rj f[0:1; 0:6] [0:3; 0:5] [0:5; 0:7] h0:3; 0:1; 0:2ig f[0:1; 0:3] [0:2; 0:6] [0:2; 0:4] h0:2; 0:1; 0:1ig

Utilizing equation 4:10; we construct the table 17.

37
 Table 17
RP approach
r1 r2 r3 r5 dmax
i Ranking
M1 0:37 0:19 0:18 0:04 0:37 4
M2 0:17 0 0:10 0 0:17 1
M3 0 0:19 0 0:31 0:31 3
M4 0:24 0:12 0:03 0:15 0:24 2

We get the table 17 according to reference point (RP) approach also with the help of equation
4.11.
Graph of table 17 is given below

38
 Table 18
Ranking based on FMF
Ai
M1 f[0:34; 0:46] [0:55; 0:75] [0:37; 0:57] h0:09; 0:24; 0:52ig
M2 f[0:61; 0:73] [0:80; 0:93] [0:19; 0:49] h0:28; 0:16; 0:59ig
M3 f[0:45; 0:65] [0:52; 0:73] [0:12; 0:28] h0:30; 0:49; 0:55ig
M4 f[0:48; 0:69] [0:38; 0:69] [0:34; 0:65] h0:15; 0:27; 0:65ig
Bi
M1 f[0:50; 0:65] [0:68; 0:84] [0:27; 0:59] h0:26; 0:12; 0:42ig
M2 f[0:42; 0:93] [0:80; 0:87] [0:34; 0:47] h0:53; 0:16; 0:34ig
M3 f[0:46; 0:73] [0:42; 0:69] [0:38; 0:65] h0:57; 0:38; 0:50ig
M4 f[0:50; 0:59] [0:69; 0:90] [0:27; 0:51] h0:15; 0:09; 0:48ig
ai bi ui Ranking
M1 0:562 0:124 4:532 4
M2 0:35 0:731 0:478 3
M3 0:432 0:241 1:792 2
M4 0:309 0:012 25:75 1

The ranking of alternatives which is mentioned in table 18 according to FMF by using equations
4.14, 4.15 and 4.16.
The …nal score of mobiles according to FMF approach is given by

39
 Table 19
Final ranking of alternatives based on MULTIMOORA method
RS RP FMF Ranking
M1 4 4 4 4
M2 3 1 3 3
M3 1 3 2 1
M4 2 2 1 2

The ranking order of alternatives by reference point (RP), ratio system (RS) approach, full
multiplicative form (FMF) and at the last also the …nal ranking of alternatives by MULTI-
MOORA is given in table 19.

4.3 S-boxes image encryption analysis in the environment of NCSs using

MULTIMOORA method

Now we talk about an another problem related to S boxes image encryption analysis in NCSs
which is given below. We have di¤erent image encryption substitution boxes named as plain
image,Advanced Encryption Standard, A¢ ne Power A¢ ne,Gray,S8 ;Lui,Prime,Xyi, Skipjack.
But in this problem we are going to discuss …st …ve S boxes. Let us consider we have dissimilar
S boxes where 1 is stand for plain image, 2 is Advanced Encryption Standard, 3 is A¢ ne
Power A¢ ne, 4 is Gray, 5 is S8 . We build a decision with respect to the parameters e_ 1
shows the entropy analysis, e_ 2 is contrast analysis, e_ 3 is average correlation analysis, e_ 4 is
energy analysis, e_ 5 is homogeneity analysis and e_ 6 shows absolute deviation analysis. Using the
algorithm which is used in above example we assume set of S boxes is B = f 1; 2; 3; 4; 5; g

and E = fe_ 1 ; e_ 2 ; e_ 3 ; e_ 4 ; e_ 5 ; e_ 6 g is set of parameters. The tabular or mathematical form of NCSs

(B; E) is given as follows

40
 Table 20
Given data by expert about di¤erent S-boxes
e_ 1 e_ 2

1 f[0:1; 0:2] [0:2; 0:3] [0:3; 0:4] h0:1; 0:2; 0:3ig f[0:7; 0:9] [0:5; 0:6] [0:6; 0:8] h0:9; 0:1; 0:3ig

2 f[0:3; 0:4] [0:5; 0:6] [0:7; 0:8] h0:2; 0:3; 0:4ig f[0:3; 0:5] [0:6; 0:8] [0:4; 0:7] h0:5; 0:7; 0:8ig

3 f[0:1; 0:8] [0:2; 0:7] [0:3; 0:5] h0:3; 0:5; 0:6ig f[0:1; 0:7] [0:2; 0:5] [0:3; 0:4] h0:5; 0:3; 0:1ig

4 f[0:5; 0:6] [0:4; 0:6] [0:3; 0:8] h0:5; 0:6; 0:7ig f[0:8; 0:9] [0:3; 0:7] [0:5; 0:6] h0:5; 0:5; 0:3ig

5 f[0:5; 0:7] [0:3; 0:9] [0:4; 0:9] h0:5; 0:7; 0:8ig f[0:5; 0:9] [0:7; 0:9] [0:2; 0:5] h0:3; 0:7; 0:1ig
e_ 3 e_ 4

1 f[0:1; 0:9] [0:7; 0:8] [0:4; 0:6] h0:4; 0:1; 0:2ig f[0:2; 0:3] [0:5; 0:7] [0:3; 0:5] h0:2; 0:2; 0:1ig

2 f[0:2; 0:8] [0:3; 0:6] [0:5; 0:7] h0:9; 0:3; 0:4ig f[0:3; 0:7] [0:4; 0:8] [0:2; 0:4] h0:3; 0:8; 0:2ig

3 f[0:6; 0:9] [0:5; 0:7] [0:3; 0:5] h0:7; 0:6; 0:3ig f[0:4; 0:5] [0:5; 0:8] [0:7; 0:9] h0:5; 0:1; 0:3ig

4 f[0:4; 0:7] [0:5; 0:9] [0:7; 0:8] h0:1; 0:9; 0:2ig f[0:7; 0:9] [0:1; 0:3] [0:1; 0:4] h0:3; 0:6; 0:1ig

5 f[0:5; 0:8] [0:7; 0:8] [0:5; 0:9] h0:4; 0:2; 0:6ig f[0:3; 0:6] [0:6; 0:8] [0:4; 0:5] h0:6; 0:1; 0:3ig

41
 Table 21
Ranking order of alternatives according to RS approach

Yi+

1 f[0:31; 0:74] [0:35; 0:56] [0:47; 0:62] h0:33; 0:16; 0:24ig

2 f[0:24; 0:55] [0:44; 0:63] [0:56; 0:76] h0:52; 0:46; 0:53ig

3 f[0:26; 0:77] [0:28; 0:60] [0:35; 0:51] h0:53; 0:50; 0:32ig

4 f[0:55; 0:71] [0:36; 0:72] [0:53; 0:76] h0:35; 0:69; 0:39ig

5 f[0:45; 0:78] [0:54; 0:84] [0:39; 0:78] h0:44; 0:60; 0:52ig

Yi

1 f[0:30; 0:53] [0:52; 0:81] [0:49; 0:72] h0:23; 0:37; 0:36ig

2 f[0:35; 0:57] [0:54; 0:80] [0:31; 0:60] h0:30; 0:81; 0:45ig

3 f[0:44; 0:58] [0:23; 0:55] [0:37; 0:55] h0:58; 0:34; 0:21ig

4 f[0:36; 0:63] [0:31; 0:51] [0:30; 0:51] h0:55; 0:64; 0:25ig

5 f[0:33; 0:52] [0:47; 0:68] [0:40; 0:67] h0:45; 0:42; 0:42ig

y^i+ y^i Zi Ranking

1 0:05 0:5 0:56 1

2 0:54 0:14 0:4 4

3 0:38 0:47 0:09 3

4 0:07 0:48 0:55 5

5 0:02 0:19 0:17 2

By using the equations 4.7, 4.8 and 4.9, we get the above table. Ranking order of S-boxes
according to RS approach graphically is given below

42
 Table 22
Reference point table
e_ 1 e_ 2
rj f[0:7; 0:8] [0:8; 0:9] [0:7; 0:9] h0:5; 0:8; 0:8ig f[0:7; 0:9] [0:7; 0:9] [0:7; 0:9] h0:9; 0:7; 0:8ig
e_ 3 e_ 4
rj f[0:8; 0:9] [0:7; 0:9] [0:7; 0:9] h0:9; 0:9; 0:6ig f[0:2; 0:3] [0:1; 0:3] [0:1; 0:4] h0:2; 0:1; 0:1ig
e_ 5 e_ 6
rj f[0:2; 0:3] [0:2; 0:5] [0:2; 0:3] h0:1; 0:2; 0:1ig f[0:1; 0:4] [0:2; 0:4] [0:1; 0:2] h0:1; 0:2; 0:2ig

With the help of equation 4:10 we construct the table 22:

Table 23
Ranking of alternatives according to RP approach
r1 r2 r3 r4 r5 r6 dmax
i Ranking

1 0:37 0 0:36 0:07 0:39 0:23 0:39 5

2 0:23 0:29 0:18 0:06 0:18 0:31 0:31 3

3 0:24 0:30 0:12 0:29 0:14 0 0:30 2

4 0:08 0:15 0:40 0 0:13 0:17 0:40 4

5 0:06 0:24 0:24 0:15 0:3 0:22 0:24 1

43
We get the ranking of alternatives given in table 23 with the help of equation 4.11:
Graphically presentation of ranking order of S-boxes according to RP approach is given as

44
 Table 24
Ranking order of alternatives calculated by FMF

Ai

1 f[0:23; 0:58] [0:45; 0:56] [0:41; 0:60] h0:59; 0:12; 0:30ig

2 f[0:30; 0:58] [0:49; 0:69] [0:51; 0:70] h0:62; 0:44; 0:54ig

3 f[0:22; 0:81] [0:31; 0:66] [0:27; 0:43] h0:49; 0:45; 0:30ig

4 f[0:58; 0:75] [0:43; 0:75] [0:49; 0:71] h0:36; 0:69; 0:39ig

5 f[0:54; 0:81] [0:56; 0:88] [0:35; 0:80] h0:37; 0:55; 0:40ig

Bi

1 f[0:36; 0:53] [0:60; 0:84] [0:46; 0:69] h0:18; 0:31; 0:31ig

2 f[0:36; 0:61] [0:59; 0:85] [0:24; 0:55] h0:29; 0:78; 0:40ig

3 f[0:48; 0:62] [0:31; 0:58] [0:42; 0:64] h0:63; 0:55; 0:27ig

4 f[0:34; 0:58] [0:31; 0:54] [0:29; 0:44] h0:55; 0:56; 0:23ig

5 f[0:39; 0:69] [0:51; 0:71] [0:35; 0:61] h0:42; 0:51; 0:44ig

i bi ui Ranking

1 0:08 0:39 0:21 4

2 0:25 0:07 3:57 5

3 0:52 0:4 1:3 2

4 0:1 0:51 0:20 3

5 0:17 0:1 1:7 1

The ranking of alternatives which is mentioned in table 24; according to FMF by using
equations 4.14,4.15 and 4.16.
Graph of table 24; is given below

45
 Table 25
Final ranking of boxes on the base of MULTIMOORA method
RS RP FMF Ranking

1 1 4 4 4

2 4 3 5 3

3 3 2 2 2

4 5 5 3 5

5 2 1 1 1

The …nal ranking of S-boxes based on MULTIMOORA method is given in table 5. From this
table we conclude that 5 is best S-box because it is ranked at very …rst position and then 3

is best to select and its ranking position is second similarly remaining boxes are ranked which
is given in table 25:

46
Chapter 5

DISCUSSIONS

This is the last chapter of our thesis. In this chapter, we discussed our conclusions, and at the
end we determined our future work.

5.1 CONCLUSIONS AND FUTURE WORK

5.1.1 Conclusions

The whole thesis is the combination of …ve chapters. In which we study that how and when
the work done by di¤erent mathematician and such history is start from fuzzy set and end on
neutrosophic cubic soft set that why we feel the necessity of such sets and then how apply it in
decision making problem and which sets or method is better than others. In this thesis we de…ne
some de…nitions, that is Chebyshev distance for neutrosophic soft numbers, separation measure
from maximum and minimum neutrosophic soft ideal solution, extension of neutrosophic soft
TOPSIS method, numerical example, comparison analysis, and at the end we use application
of S-boxes image encryption in the environment of neutrosophic soft set. And also we present
an extension of MULTIMOORA method using the neutrosophic cubic soft set (NCSS). We …rst
de…ned some Einstein operations on neutrosophic cubic soft set (NCSS) i.e. Einstein addition,
Einstein product, Einstein scalar multiplication, scalar power. The score function of (NC-
SNs), maximum distance between two neutrosophic cubic soft numbers (NCSNs), neutrosophic
cubic soft weighted averaging operator, neutrosophic cubic soft weighted geometric operator.
The MULTIMOORA method extension in the environment of neutrosophic cubic soft set and

47
also numerical example. S-boxes image encryption analysis in the environment of NCSs using
MULTIMOORA method.

5.1.2 Future Work

After studying of these thesis, we are able to implement the idea of soft set to investigate the
following terms.
Hybrid weighted arithmetic (HWA) and geometric aggregation operator (GAO) of neutro-
sophic cubic soft sets (NCSS), MULTIMOORA method extension, S-boxes image encryption
analysis.

48
Bibliography

[1] K. Atanassov, Intuitionistic fuzzy sets, Fuzzy Sets Syst, 20; (1986); 87 96:

[2] M. I. Ali, F. Feng, X. Liu, W. K. M and M. Shabir, on some new operations in soft set
theory, Comput. Math. Appl, 57; (2009); (9); 1547 1553:

[3] H. Aktas and N. Cagman, Soft sets and soft groups, Inform. Sci, 177; (2007); (3); 2726
2735:

[4] M. Arora, R. Biswas,U. S. Pandy, Neutrosophic Relational Database Decomposition, Int.

J. Adv. Comput. Sci. Appl, 2; (2011); (8); 121 125:

[5] M. Arora and R. Biswas, Deployment of Neutrosophic technology to retrieve answers for
queries posed in natural language, in 3rd International Conference on Computer Science
and Information Technology ICCSIT, 3; (2010); 435 439:

[6] S. Aggarwal, R. Biswas, A. Q. Ansari, Neutrosophic Modeling and Control, International

Conference on Computer and Communication Technology, (2010); 718 723:

[7] M. I. Ali, M. Shabir and M. Naz, Algebraic structures of soft sets associated with new
operations, Comput. Math. With Appl, (2011); 2647 2654

[8] A. Ali, Y. B Jun, M. Khan, F.G. Shi, S. Anis ,Generalized cubic soft sets and their
applications to algebraic structures, Ital. J. Pure. Appl Math, 35; (2015); 393 414:

[9] M. Ali, I. Deli, F. Smarandache, The theory of neutrosophic cubic sets and their applica-
tions in pattern recognition, J. Intell. Fuzzy Syst, 30; (2016); 1957 1963:

49
[10] S. Abdullah, S. Ayub, I. Hussain, B. Bedregal, and M. Y. Khan, Analyses of S-boxes based
on interval valued intuitionistic fuzzy sets and image encryption, Int. J. Comput. Intell.
Syst, 10; (2017); 851 865:

[11] A. Assari, T. Mahesh, and E. Assari. Role of public participation in sustainability of

historical city: usage of TOPSIS method. Indian J. Sci. Technol, 5; (2012b); (3); 2289 2294.

[12] P. Biswas, S. Pramanik, and B. C. Giri, TOPSIS method for multi-attribute group decision-
making under single-valued Neutrosophicenvironment. Neural. Comput. Appl,(2015); 1
11.

[13] T.Balezentis, S. Zeng, A. Balezentis, MULTIMOORA-IFN: a MCDM method based on

intuitionistic fuzzy number for performance management. Econ. Comput. Econ Cybern
Stud Res, 48; (2014); (4); 85 102:

[14] T. Balezentis, S. Zeng, Groupmulti-criteria decision making based upon interval-valued

fuzzy numbers an extension of the MULTIMOORA method. Expert. Syst. Appl,
40; (2013); (2); 543 550:

[15] W. K. M.Brauers, A. Balezentis,T. Balezentis, MULTIMOORA for the EU Member States

updated with fuzzy number theory. Technol. Econ. Dev. Econ, 17; (2011); (2); 259 290:

[16] W. K. M. Brauers, E.K. Zavadskas. Project management by MULTIMOORA as an insition

economies, Technol. Econ. Dev. Econ, 16; (2010); (1); 5 24:

[17] M. Bhowmik and M. Pal , Intuitionistic Neutrosophic Set Relations and Some of Its Prop-
erties , J. Inf. Comput. Sci, 5; (2010); (3); 183 192:

[18] V. Chinnadurai, A. Swaminathan, B. Anu, Some properties of Neutrosophic cubic soft set,
Int. J. Comput. Res. Dev, 1; (2016); 113 119:

[19] F. Feng, Y. B. Jun, X. Y. Liu and L. F. Li, An adjustable approach to fuzzy soft set based
decision making, J. Comput. Appl. Math, 234; (2010); 10 20:

[20] F. Feng, C. Li, B. Davvaz and M. I. Ali, Soft sets combined with fuzzy sets and rough sets
a tentative approach, Soft Comput, 14; (2010); 899 911:

50
[21] R. Greene, R. Devillers, J.E. Luther, B.G. Eddy, GIS-based multicriteria analysis, Geogr.
Compass, 5=6; (2011); (6); 412 432.

[22] S. Husain, Y. Ahmad, M. A. Alam, A study on the Role of Intuitionistic Fuzzy Set in
Decision making problems, Int. J. Comput. Appl, 48; (2012); 35 41:

[23] C. L. Hwang, K. Yoon. Multiple Attribute Decision Making: Methods and Applications.
New York: Springer-Verlag, (1981):

[24] C. L. Hwang, Y. J. Lai, T.Y. Liu, A new approach for multiple objective decision making,
Comput. Oper. Res, 20; (1993); (8); 889 899:

[25] Y. B. Jun, C. S. Kim and K. O. Yang, Cubic sets, Annal. Fuzzy Math. Inform,
4; (2012); (3); 83 98:

[26] A. Kharal, A Neutrosophic Multicriteria Decision Making Method, New Math. Nat. Com-
putat, 10; (2014); 2; 143 162:

[27] Locatelli, Giorgio; Mancini, Mauro, A framework for the selection of the right nuclear
power plant, Int. J. Prod. Res, 50(2012); (17); 4753 4766:

[28] F. G. Lupiáñez, On neutrosophic topology, Kybernetes, 37; (2008); (6); 797 800:

[29] D. Molodtsov, Soft Set Theory-First Results, Comput. Math. Appl, 37; (1999); 19 31:

[30] P. K. Maji, R. Biswas, and A. R. Roy, Soft Set Theory, Comput. Math. Appl,
45; (2003); 555 562:

[31] P. K. Maji, R. Biswas, and A. R. Roy, An application of soft sets in a decision making
problem, Comput. Math. Appl, 44; (2002); 1077 1083:

[32] P. K. Maji, R. Biswas and A.R. Roy, Fuzzy soft sets. The J. Fuzzy Math. 9; (2001); 589 602:

[33] P. K. Maji, R. Biswas, A. R. Roy, Intuitionistic fuzzy soft sets, The J. Fuzzy Math,
9; (2001); (3); 677 692:

[34] T. Mehmood, S. Abdullah, S. U. Rashid and M. Bilal, Multicriteria Decision Making Based
On Cubic Set, J. New Theory 16; (2017); 01 09:

51
[35] P. K. Maji, Neutrosophic soft set, Annal. Fuzzy Math. Inform, 5; (2013); 157 168.

[36] I. Rehman, T. Shah and I. Hussain, Analysis of S-box in Image Encryption Applications
Based on Fuzzy Decision Making Criterion, Z. Naturforsch, 69a,(2014); 207 214

[37] A. R. Roy and P.K. Maji, A fuzzy soft set theoretic approach to decision making problems.
J. Comput. Appl. Math, 203; (2007); 412 418:

[38] F. Smarandache, Neutrosophic set, a demineralization of the intuitionistic fuzzy sets, Inter.
J. Pure Appl. Math, 24; (2005); 287 297:

[39] A. A. Salama, S. A. Alblowi, Generalized Neutrosophic Set and Generalized Neutrosophic

Topological Spaces, J. Comput. Sci. Eng, 2; (2012); (7); 129 132:

[40] M. Shabir and M. Naz, On soft topological spaces, Comp. and Math. With App,
61; (2011); 1786 1799:

[41] D. Stanujkic, E. K. Zavadskas, F. Smarandache, W. K. M. Brauers and D. Karabasevic, A

Neutrosophic Extension of the MULTIMOORA Method, Informatica, 28; (2017); (1); 1 12:

[42] F. Smarandache, Multi-Criteria Decision-Making using combined Simpli…ed-TOPSIS

method and Neutrosophics, IEEE International Conference on Fuzzy Systems (FUZZ),
University of New Mexico Gallup, New Mexico, USA, (2016);.

[43] I. Turksen, Interval valued fuzzy sets based on normal forms, Fuzzy Sets Syst,
20; (1986); 191 210:

[44] H. Wang, F. Smarandache, Y.Q. Zhang, R. Sunderraman, Interval Neutrosophic Sets and
logic, Theory and Applications in Computing. Hexis, Neutrosophic book series (2005).

[45] H. Wang, F. Smarandache, Y. Q. Zhang, R. Sunderraman, Single valued neutrosophic sets,

Multispace and Multistructure, 4; (2010); 410 413:

[46] K. Yoon, A reconciliation among discrete compromise situations, J. Oper. Res. Soc,
38(1987); (3) : 277 286

[47] K.P. Yoon, C. Hwang, Multiple Attribute Decision Making, An Introduction, California:
SAGE publications, (1995):

52
[48] L. A. Zadeh, Fuzzy sets, Inf. Control, 8; (1965); 338 353:

[49] J. Zhan, M. Khan,M. Gulistan and A. Ali, Applications of neutrosophic cubic sets in
multi-criteria decision making, Int. j. Uncertain Quan, 7; (2017); 5; 377 394:

[50] E. K. Zavadskas, J. Antucheviciene, S. H. Razavi Hajiagha, S. S. Hashemi, The interval-

valued intuitionistic fuzzy MULTIMOORA method for group decision making in engineer-
ing, Math. Probl. Eng, (2015), 1–13.

[51] E.K Zavadskas, A. Zakarevicius, J. Antucheviciene, Evaluation of Ranking Accuracy in

Multi-Criteria Decisions, Informatica. 17; (2006); (4); 601 618:

53