Intelligent Automation And Soft Computing, 2019

Copyright © 2019, TSI® Press

Vol. 25, no. 2, 305–311
https://doi.org/10.31209/2018.100000006

A Method for Decision Making Problems by Using Graph

Representation of Soft Set Relations

Nazan Çakmak Polat, Gözde Yaylali, Bekir Tanay

Department of Mathematics, Faculty of Sciences, Muğla Sıtkı Koçman University, 48170, Muğla, TURKEY

ABSTRACT
Soft set theory, which was defined by D. Molodtsov, has a rich potential for
applications in several fields of life. One of the successful application of the soft
set theory is to construct new methods for Decision Making problems. In this
study, we are introducing a method using graph representation of soft set
relations to solve Decision Making problems. We have successfully applied this
method to various examples.

KEY WORDS: Decision Making Problem, Representation of Soft Set Relations, Soft Sets.

Moreover, Çağman and Enginoğlu (2010) defined

1 INTRODUCTION soft matrices, which are representation of soft sets.
THERE are real life problems in engineering, Out of its several advantages, one is to store and
social and medical sciences, economics etc. involving manipulate matrices, hence the soft sets can be entered
imprecise data that can be solved by mathematical in a computer.
principles based on uncertainty and imprecision. Most After these advances, the soft set theory became an
of the times, traditional methods are limited due to important mathematical tool for vagueness. Zhang
their uncertainties. Though theory of probability, (2014) introduced the Interval soft set, which is a
fuzzy set theory, intuitionistic fuzzy sets, vague sets, combination of interval set and soft set, and applied
theory of interval mathematics, rough set theory etc. the interval soft set to construct a decision making
may be utilized as efficient tools to deal with diverse algorithm. In addition, the concept of soft intervals,
types of uncertainties and imprecision embedded in a whose special case is interval soft set, was defined by
system, they have their inherit difficulties as pointed Tanay and Yaylalı (2015) Constructing new Decision
out by Molodtsov (1999). Making Algorithms is very important for social life
Molodtsov (1999) introduced soft set theory and problems involving imprecise data. (Ballı and Turker,
successfully applied it in several directions such as the 2017; Wang and Wang, 2016; Zeinalova, 2014) are
smoothness of the functions, game theory, operation some recent studies on decision making methods that
research, Riemann integration, Perron integration, are based on multi-criteria decision making and
probability, theory of measurement. Maji, Biswas and decision making under Z-information.
Roy (2003) studied equality of two soft sets, soft Representing soft structures in an innovative and
subset and soft super set of a soft set, complement of a effective way is very important to improve the soft set
soft set, null soft set, absolute soft set and soft binary theory. Herein, we have developed a new tool to
operations. Some soft and fuzzy soft algebraic visualize soft set relation using directed graphs and
structures e.g. soft groups, soft rings, fuzzy soft successfully applied it to solve decision making
moduls were also studied by many researchers (Acar, problems given in previous studies (Tanay and
et. al. 2010; Aktaş and Çağman, 2007; Gunduz and Yaylalı, 2015; Zhang, 2014). We have used some
Bayramov, 2011a, 2011b; Ozturk, Gunduz and literature (Grimaldi, 2004) elementary definitions in
Bayramov, 2013). The soft set relation was introduced the graph theory such as graph, subgraph etc.
by Babitha and Sunil (2010). In another study Babitha
and Sunil (2011) transitive closures and orderings on 2 PRELIMINARIES
soft sets were introduced. Later in 2012, some LET’s recall some basic notions in the soft set
properties related to soft set relations were extended theory:
by Park, Kim and Kwun (2012).

CONTACT Nazan Çakmak Polat [email protected]

© 2019 TSI® Press
306 NAZAN ÇAKMAK POLAT,GÖZDE YAYLALI, BEKIR TANAY

Definition 2.1. (Molodtsov, 1999) Let U be an initial Definition 2.7. (Yang and Guo, 2011) Let ( F , A ) be a
universal set and E be a set of parameters. Let P (U ) soft set over U and R, Q be a soft set relations on
denote the power set of U and A  E . A pair ( F , A ) ( F , A ) , then:
is called a soft set over U , where F is a mapping 1) The complement of the soft set relation R on a soft
given by F : A  P (U ). set ( F , A ) , denoted as RC , is defined by
Definition 2.2. (Maji, et. al. 2003) For two soft sets
( F , A ) and ( G , B ) over a common universe U , we
RC  {F (a)  F (b) : F (a)  F (b)  R, a, b  A}.
say that ( F , A ) is soft subset of ( G , B ) if: 2) The inverse of the soft set relation R on ( F , A ) ,
i) A  B , and denoted as R1 , is defined by
ii) e  A, F ( e ) and G ( e ) are identical 1
R  {F (b)  F (a) : F (a)  F (b)  R}.
approximations. 3) The union of two soft set relation R and Q on
it is denoted by . ( F , A ) , denoted as on R Q , is defined by
Definition 2.3. (Maji, et. al. 2003) Let ( F , A ) and R  Q  { F ( a )  F ( b ) : F ( a )  F (b )  R
( G , B ) be soft sets over a common universe U . The or F ( a )  F (b)  Q}.
intersection of ( F , A ) and ( G , B ) is defined as the
4) The intersection of two soft set relation R and Q
soft set ( H , C ) satisfying the following conditions:
on ( F , A ) , denoted as on R  Q , is defined by
i) C  A  B .
ii) For all x  C , H ( x )  F ( x ) or G ( x )
R  Q  { F ( a )  F (b ) : F ( a )  F (b )  R
(while two soft sets are the same). and F ( a )  F ( b )  Q }.
in this case, we can write . Definition 2.8. (Yang and Guo, 2011) Let R, Q be two
Definition 2.4. (Maji, et. al. 2003) Let ( F , A ) and soft set relations on ( F , A) . a, b  A,
if
( G , B ) be soft sets over a common universe U . The F ( a )  F (b )  R  F ( a )  F (b )  Q , then we say
union of ( F , A ) and ( G , B ) is defined as the soft set that R  Q.
( H , C ) satisfying the following conditions: Definition 2.9. (Babitha and Sunil, 2010) Let R be a
i) C  A  B . soft set relation on ( F , A ) , then
ii) For all x  C , 1) R is reflexive if F ( a )  F ( a )  R ,  a  A.
 F ( x) if x  A  B, 2) R is symmetric if
 F ( a )  F ( b )  R  F ( b )  F ( a )  R ,  a , b  A.
H ( x)   G ( x) if x  B  A,
3) R is transitive if F ( a )  F (b )  R and
 F ( x)  G( x) if x  A  B.
 F (b )  F ( c )  R  F ( a )  F ( c )  R for every
in that case, we write . a, b, c  A.
Definition 2.5. (Babitha and Sunil, 2010) Let ( F , A ) Definition 2.10. (Babitha and Sunil, 2011)Let R be a
and ( G , B ) be soft sets over a common universe U , soft set relation on ( F , A ) , then R is anti-symmetric
then the Cartesian product of ( F , A ) and ( G , B ) is if F ( a )  F ( b )  R and F ( b )  F ( a )  R imply that
defined as ( F , A )  ( G , B )  ( H , A  B ), where F ( a )  F ( b ), a, b  A.
H : A  B  P (U  U ) and H ( a , b )  F ( a )  G (b ), Definition 2.11. (Yang and Guo, 2011) Let I be a
where ( a , b )  A  B . soft set relation on ( F , A ) . If for all a, b  A and
The Cartesian product of three or more nonempty a  b, F ( a )  F ( a )  I , but F ( a )  F ( b )  I , then
soft sets can be defined by generalizing the definition
I is called as the identity soft set relation.
of the Cartesian product of two soft sets.
Definition 2.12. (Babitha and Sunil, 2010) Let ( F , A ) ,
Definition 2.6. (Babitha and Sunil, 2010) Let ( F , A )
( G , B ) and ( H , C ) be three soft sets. Let R be a soft
and ( G , B ) be soft sets over a common universe U ,
set relation from ( F , A ) to ( G , B ) and S be a soft
then a soft set relation from ( F , A ) to ( G , B ) is a
set relation from ( G , B ) to ( H , C ) . Then, a new soft
soft subset of ( F , A )  ( G , B ) . In an equivalent way,
set relation, the composition of R and S expressed
the soft set relation R on a soft set ( F , A ) can be as S  R from ( F , A ) to ( H , C ) , is defined as
defined as follows in the parameterized form: follows:
if ( F , A )  { F ( a ), F ( b ), ...} , then F ( a ) RF ( b ) iff
F ( a )  F (b )  R .
 INTELLIGENT AUTOMATION AND SOFT COMPUTING 307

if F ( a ) is in ( F , A ) and H ( c ) is in ( H , C ) , then E  {( F (e1 ), F (e1 )), ( F (e1 ), F (e2 )),

F ( a ) S  RH ( c ) iff there is some G ( b ) in ( G , B ) ( F (e2 ), F (e2 )), ( F (e2 ), F (e3 )), ( F (e3 ),
such that F ( a ) RG (b ) and G (b ) SH ( c ). F (e3 )), ( F (e4 ), F (e4 )), ( F (e4 ), F (e1 ))},
௧௛
We use the notation R for the ݊ n
composition of respectively
the relation R .
then the graph G R  (V , E ) will be the Graph
3 REPRESENTING A SOFT SET RELATION Representation of R .
USING A DIRECTED GRAPH An edge of the form ( F ( ei ), F ( ei )) is illustrated by
THIS section states about some basic definitions in arc from the vertex F ( ei ) back to itself. Such an edge
the graph theory, following the book named Discrete is called a loop.
and Combinatorial Mathematics (Grimaldi, 2004). The directed graph GR for the soft set relation R
Definition 3.1. (Grimaldi, 2004) A directed graph can be illustrated as below:
G  (V , E ), or digraph, consists of a set V of
vertices (or nodes) together with a set E of edges (or
arcs). The vertex a  V is called the initial vertex of
the edge ( a , b )  E , while the vertex b  V is called
the terminal vertex of this edge. The edge ( a , a ) is
called a loop. When a graph G  (V , E ) contains no
loop, it is called loop-free. There is a path starting at
a  V and ending at b  V ( a  b ). Such a path
consists of a finite sequence of directed edges.
Definition 3.2. (Grimaldi, 2004) If G  (V , E ) is a
graph, then G1  (V1 , E1 ) is called a subgraph of G if
  V1  V and   E1  E , where each edge in Graph 1. Graph representation of soft set relation R .
E1 is incident with vertices in V1 .
Definition 3.3. (Grimaldi, 2004) Let V be a set of n 3.1 A method for decision making problems
vertices. The complete graph on V , denoted by K n , using the graph representation of soft set
relation
is a loop free undirected graph, where for all
Zhang defined interval soft sets and used it to solve
a, b V , a  b, there is an edge ( a , b ). a decision making problem (Zhang, 2014). In his
Definition 3.4. (Grimaldi, 2004) Let G be a loop-free paper, interval soft sets are represented by a table from
undirected graph on n vertices. The complement of which, he derived an interval choice value. Based on
G , denoted G , is the subgraph on K n consisting of his idea, we resolved same decision making problems
as previously reported (Tanay and Yaylalı, 2015;
the n vertices in G and all edges that are not in G .
Zhang, 2014) using the graph representation of soft set
Example 3.5. Let ( F , A ) be a soft set over U where relations. Our method is discussed below with
U  { h1 , h2 , h3 , h4 , h5 }, A  {e1 , e 2 , e3 , e 4 } and examples:
F (e1 )  {h1 , h2 , h5 }, F (e2 )  {h3 , h4 }, Example 3.6. A soft set ( F , E ) describes the
attractiveness of the houses that Mr. X is going to buy.
F (e3 )  {h2 , h4 }, F (e4 )  {h1 , h4 }.
Let U be the set of houses under consideration,
Let the soft set relation R on ( F , A ) is given as: U  {h1 , h2 , h3 , h4 , h5 , h6 } be the universal set:
R  {F (e1 )  F (e1 ), F (e1 )  F (e2 ), F (e2 )  F (e2 ), E  {e1  expensive, e2  beautiful, e3  wooden,
F (e2 )  F (e3 ), F (e3 )  F (e3 ), F (e4 )  F (e4 ), We e4  cheap, e5  in green surrounding}
F (e4 )  F (e1 )}. be the parameter set. Let’s define a soft set ( F , E )
can represent R with a directed graph, named G R , as such that:
follows: if we consider the set of vertices V and set of F (e1 )  {h2 , h3 }, F (e2 )  {h2 , h3 , h5 },
edges E as:
V  { F ( e1 ), F ( e 2 ), F ( e3 ), F ( e 4 )} and
F (e3 )  {h1 , h4 }, F (e4 )  {h1}, F (e5 )  {h1 , h2 , h6 }.
Let Mr. X priorities are ranked as beautiful, in
green surrounding, cheap, expensive and wooden
houses. According to this priority ranking, we can
define a soft set relation on ( F , E ) as follows:
308 NAZAN ÇAKMAK POLAT,GÖZDE YAYLALI, BEKIR TANAY

R  {F (e3 )  F (e1 ), F (e3 )  F (e4 ), F (e3 )  F (e5 ), vectors represent incoming values while the second
represent outgoing values for h1 , h2 , h3 , h4 , h5 and h6 in
F (e3 )  F (e2 ), F (e1 )  F (e4 ), F (e1 )  F (e5 ),
F ( e1 ) , F ( e 2 ) , F ( e3 ) , F ( e 4 ) , and F ( e5 )
F (e1 )  F (e2 ), F (e4 )  F (e5 ), F (e4 )  F (e2 ),
respectively:
F (e5 )  F (e2 )}.
F (e1 ) (0, 2, 2, 0, 0, 0) (0, 4, 4, 0, 0, 0)
And the graph representation of R is as follows: F (e2 ) (0,5,5, 0,5, 0) (0,1,1, 0,1, 0)
F (e3 ) (1, 0, 0,1, 0, 0) (5, 0, 0,5, 0, 0)
F (e4 ) (3, 0, 0, 0, 0, 0) (3, 0, 0, 0, 0, 0)
F (e5 ) (4, 4, 0, 0, 0, 4) (2, 2, 0, 0, 0, 2)
Step 4: Compute the total incoming and outgoing
values for each hi . The Maximum incoming value
provides us the choice. If there are more than one
objects that have maximal incoming value, then the
maximum outgoing value of the objects that have
Graph 2. Graph representation of soft set relation R . maximal incoming values will give us the choice.
Total incoming and outgoing values for
Step 1: Count the incoming and outgoing paths to h1 , h2 , h3 , h4 , h5 and h6 are
each vertex and represent them with ordered pairs (8,10), (11,7), (7,5), (1,5), (5,1) and (4,2) ,
where first component is the number of incoming respectively. Hence the house will be h2 according to
ways, while second component is the number of
our algorithm.
outgoing ways.
The previous results that we have obtained in the
For the node F ( e1 ) in Example 3.6, we have 1
stated steps can be summarized in Table 1, where
incoming and 3 outgoing ways. Thus, we get the pair vertices of graph are given in the first column while
(1, 3) for the node F ( e1 ) . In this example, all ways the elements of universal set are in the first row.
are listed below: Entries in the table show the existence, the change and
the total values for each hi in the sets F ( ei ) . Left
F (e1 ) (1,3)
subscript of F ( ei ) symbolizes the number of
F (e2 ) (4, 0) incoming ways while the right subscript symbolizes
F (e3 ) (0, 4) the number of outgoing ways. We can also use both
F (e4 ) (2, 2) subscripts of the entries to represent the effects of
incoming and outgoing ways to each element of
F (e5 ) (3,1) universal set which were found in Step 3.
Step 2: Examine the images of each F ( ei ) to Table 1. Summarized Algorithm for Example 3.6.
determine the existence of the elements of universal
set. For this purpose, we will see the images F ( ei ) as h1 h2 h3 h4 h5 h6
vectors and each of its element represents the
1 F ( e1 ) 3 0 00 2 14 2 14 0 00 0 00 0 00
existence of elements of universal set in same order.
F ( e2 ) 0 00 1 1 00 1 00
After applying the method to Example 3.6, the 4 0 5 1 5 1 0 5 1 0

existence vectors are as follows: 0 F ( e3 ) 4 5 11 0 00 0 00 5 11 0 00 0 00

F ( e4 ) 2 1 00 00 00 00 00
(0,1,1, 0, 0, 0) for F (e1 )  {h2 , h3 } 2 3 3 0 0 0 0 0

F ( e5 ) 1 12 12 00 00 00 12
(0,1,1, 0,1, 0) for F (e2 )  {h2 , h3 , h5 } 3 4 4 0 0 0 4

(8,10) (11,7) (7,5) (1,5) (5,1) (4,2)

(1, 0, 0,1, 0, 0) for F (e3 )  {h1 , h4 }
(1, 0, 0, 0, 0, 0) for F (e4 )  {h1} Example 3.7. Let U be the set of cars under
(1,1, 0, 0, 0,1) for F (e5 )  {h1 , h2 , h6 } consideration, U  {c1 , c 2 , c 3 , c 4 , c 5 , c 6 , c 7 } and let E
be the parameter set such that:
Step 3: Find the incoming and outgoing values for
each F ( ei ) . One can find these values by adding the E  {e1  diesel, e2  gasoline, e3  light color,
numbers of incoming and outgoing ways of F ( ei ) to e4  dark color, e5  manuel, e7  new,
each component of vectors. Incoming and outgoing e8  second hand}.
values are evaluated below for Example 3.6. First
 INTELLIGENT AUTOMATION AND SOFT COMPUTING 309

Let a soft set ( F , A ) describes the attractiveness of F (e1 ) (4, 0, 4, 0, 4, 0, 0) (2, 0, 2, 0, 2, 0, 0)

the cars that Mr. X is going to buy. Consider F (e3 ) (0,1,1,1, 0, 0, 0) (0,5,5,5, 0, 0, 0)
A={e1 =diesel, e2 =gasoline, e3 =light color, F (e5 ) (0, 0, 0, 0,5,5,5) (0, 0, 0, 0,5,5,5)
e4 =dark color,e5 =manuel, e7 =new, e8 =second hand} F (e7 ) (3,3, 0, 0, 0, 0,3) (3,3, 0, 0, 0, 0,3)
and F (e8 ) (0, 0, 2, 2, 2, 2, 0) (0, 0, 4, 4, 4, 4, 0)
F (e1 )  {c1 , c3 , c5}, F (e2 )  {c2 , c4 , c6 , c7 },
Step 4: Total incoming and outgoing values
F (e3 )  {c1 , c3 , c4 }, F (e4 )  {c1 , c7 }, c1 , c 2 , c 3 , c 4 , c 5 , c 6 and c 7 are (7,5), (4,8), (7,11),
F (e5 )  {c5 , c6 , c7 }, F (e7 )  {c1 , c2 , c7 }, (3,9), (11,7), (7,5) and (8,4), respectively. Hence the
F (e8 )  {c3 , c4 , c5 , c6 }. car will be c5 according to our algorithm.
Let Mr. X has priority ranking in getting manual, Same results obtained in the above steps are
diesel, new, second hand and light color cars. summarized in Table 2.
According to this priority, we can define a soft set
Table 2. Summarized Algorithm for Example 3.7.
relation on ( F , E ) as follows:
R  {F(e1)  F(e5 ), F(e7 )  F(e5 ), F(e8 )  F(e5 ), c1 c2 c3 c4 c5 c6 c7
F(e3 )  F(e5 ), F(e7 )  F(e1), F(e8 )  F(e1), F(e3 ) 3 F ( e1 )1 4 12 0 00 4 12 0 00 4 12 0 00 0 00
F(e1), F(e8 )  F(e7 ), F(e3 )  F(e7 ), F(e3 )  F(e8 )}. 0 F ( e2 ) 4 0 00 1 5 1 1 5 1 1 51 0 00 0 00 0 00
Graph of this relation R is given in Graph 3. 4 F ( e5 ) 0 0 00 0 00 0 00 0 00 5 11 5 11 5 1 1
2 F ( e7 ) 2 3 3 1 3 3 1 0 00 0 00 0 00 0 00 3 3 1
1 F ( e8 ) 3 0 00 0 00 1 4 1 1 41 1 4 1 1 4 1 0 00
(7,5) (4,8) (7,11) (3,9) (11,7) (7,5) (8,4)

The following example is about Information

Systems (IS) that was given by Jiang, et. al. (2011).
We have successfully applied our designed Decision
Making method to this example.
Example 3.8: Suppose that there are six papers
p1 , p 2 , p 3 , p 4 , p 5 , p 6 in IS (Table 3) and four
Graph 3. Graph representation of relation R . keywords a1 , a 2 , a 3 , a 4 stand for “keyword 1=
Semantic web”, “keyword 2”=Description logics”,
Let’s apply the above method to this problem. “keyword 3=Web Ontology Language”, and “keyword
Step 1: Counting paths for each node: 4=Reasoning Rule”, respectively.
F (e1 ) (3,1)
Table 3. Information system (IS).
F (e3 ) (0, 4)
F (e5 ) (4, 0) U a1 a2 a3 a4
F (e7 ) (2, 2) Decision
p1 DLs Soft Sets Ontology
Making
F (e8 ) (1,3) Data Data Machine
p2 Rule
mining bases learning
Step 2: Images of F ( ei ) s and the existence vectors:
p3 Ontology Rule DLs OWL
F (e1 )  {c1 , c3 , c5 } (1, 0,1, 0,1, 0, 0) p4 OWL Ontology KR DLs
First Order
F (e3 )  {c2 , c3 , c4 } (0,1,1,1, 0, 0, 0) p5 LP ASP Prolog
Logic
F (e5 )  {c5 , c6 , c7 } (0, 0, 0, 0,1,1,1) p6 ASP Prolog LP KR
F (e7 )  {c1 , c2 , c7 } (1,1, 0, 0, 0, 0,1)
F (e8 )  {c3 , c4 , c5 , c6 } (0, 0,1,1,1,1, 0) Assume that Mr. X wants to obtain a closely
related research paper in the area of “Semantic web”
Step 3: Change of images: using the following query:
“Keyword 1”=Semantic web, “keyword
2”=Description logics, “keyword 3”=Web Ontology
Language, and “keyword 4” =Reasoning Rule.
310 NAZAN ÇAKMAK POLAT,GÖZDE YAYLALI, BEKIR TANAY

It is reported Jiang, et. al. (2011) that the problems in different areas can be solved effectively.
approximately resultant soft set, where { a1 , a 2 , a 3 , a 4 } This method can be also used in various decision
is the parameter set and { p1 , p 2 , p 3 , p 4 , p 5 , p 6 } is the making methods including artificial intelligence.
universal set, is obtained from certain semantic
relations between the information system and the 5 ACKNOWLEDGEMENTS
query as follows: THE authors deeply thank to editor and referees for
their valuable comments and special thanks to Said
F(a1 )  { p1, p3 , p4 , p5 , p6}, F(a2 )  {p3 , p4 , p5}, Nadeem, (Assistant Professor, Muğla Sıtkı Koçman
F(a3 )  { p1, p3 , p4 , p5 , p6}, F(a4 )  {p2 , p3 , p4 , p6} University) for grammatical corrections.
.
Now, let’s find the choice object for Mr. X using 6 REFERENCES
our Decision Making method. Acar, U., Koyuncu, F., & Tanay B. (2010). Soft sets
A soft set relation R can be obtained by given and soft rings. Computer & Mathematics with
query as: Applications, 59, 3458–3463
Aktaş, H. & Çağman, (2007). N. Soft sets and soft
groups. Information Sciences, 117, 2726-2735.
 R  {F (a1 )  F (a2 ), F (a1 )  F (a3 ), F (a1 )  F (a4 ), Babitha, K.V. & Sunil, J.J. (2010). Soft set relations
F (a2 )  F (a3 ), F (a2 )  F (a4 ), F (a3 )  F (a4 )}. and functions, Computer & Mathematics with
Applications, 60, 1840-1849.
Babitha, K.V. & Sunil, J.J. (2011). Transitive closures
Hence, the graph representation of R is: and ordering on soft sets. Computer &
Mathematics with Applications, 62, 2235-2239.
Ballı, S. & Turker, M. (2017). A Fuzzy Multi-Criteria
Decision Analysis Approach for the Evaluation of
the Network Service Providers in Turkey.
Intelligent Automation & Soft Computing, 1-7.
Çağman, N. & Enginoğlu, S. (2010). Soft matrix
theory and its decision making. Computer &
Mathematics with Applications, 59, 3308-3314.
Dauda, M.K., Aliyu I., & Ibrahim A. M. (2013).
Partial Ordering in Soft Set Context. Mathematical
Theory and Modeling, 3, No.8.
Grimaldi, R. P. (2004) Discrete and Combinatorial
Mathematics (an Applied Introduction), United
Graph 4. Graph representation of relation R .
States of America, Addison-Wesley, Fifth Edition.
Gunduz, C. & Bayramov, S. (2011a). Fuzzy soft
After applying our Decision Making method to this modules. International Mathematical Forum, 6,
example, we obtain the choice objects as p3 and p 4 No.11, 517-527.
(Table 4). These choice objects are the same as stated Gunduz, (Aras) C. & Bayramov, S. (2011b).
by Jiang, et. al. (2011). Intuitionistic fuzzy soft modules. Computer &
Mathematics with Applications, 62, 2480-2486.
Table 4. Summarized Algorithm for Example 3.8. Ibrahim, A.M., Dauda, M.K., & Singh, D. (2012).
Composition of soft set relations and construction
p1 p2 p3 p4 p5 p6 of transitive closure. Mathematical Theory and
Modeling, 2 No.7.
0 F ( e1 ) 3 114 0 00 114 114 114 1 4 1
Jiang, Y., Liu, H., Tang, Y., & Chen Q. (2011).
1 F ( e2 ) 2 0 00 0 00 2 13 2 13 2 13 00
0
Semantic decision making using ontology-based
2 F ( e3 )1 3 12 0 0 0 3 12 3 12 3 12 3 12 soft sets, Mathematical and Computer Modelling,
F ( e4 ) 3 00 14 14 14 00 14 53, 1140-1149.
3 0 4 4 4 0 4
Maji, P.K., Biswas, R., & Roy, A.R. (2003). Soft set
(4,6) (4,4) (10,13) (10,13) (6,9) (8,10) theory. Computers and Mathematics with
Applications, 45, 555-562.
Molodtsov, D. (1999). Soft Set Theory-First Result.
4 CONCLUSIONS Computers and Mathematics with Applications,
IN this study, we have designed a Decision Making 37, 19-31.
Method by using graph representation of soft set Ozturk, T.Y., Gunduz, C.A., & Bayramov S. (2013).
relations that is a new perspective for the soft set Inverse and direct systems of soft modules. Annals
relations. By utilizing this method, complex social life
 INTELLIGENT AUTOMATION AND SOFT COMPUTING 311

of Fuzzy Mathematics and Informatics, 5, No.1, 7 NOTES ON CONTRIBUTORS

73-85. Nazan ÇAKMAK POLAT is a
Park, J.H., Kim, O.H., & Kwun, Y.C. (2012). Some Research Assistant for Department of
properties of equivalence soft set relations. Mathematics. Her major is Topology,
Computers & Mathematics with Applications 63, Soft Set theory and Algebra.
6, 1079-1088.
Tanay, B. & Yaylalı, G. (2015). A Method for
Decision Making by Using Soft Intervals.
International Conference on Recent Advances in Gözde YAYLALI is Research
Pure and Applied Mathematics (Icrapam). Assistant for Department of
Wang, C. & Wang, J. (2016). A multi-criteria Mathematics. Her major is Topology,
decision-making method based on triangular Soft Set Theory and Fuzzy Set Theory.
intuitionistic fuzzy preference information. Email: [email protected]
Intelligent Automation & Soft Computing, 22:3,
473-482.
Yang, H. & Guo, Z. (2011). Kernels and closures of Bekir TANAY is a Associated
soft set relations and soft set relation mappings. Professor at Muğla Sıtkı Koçman
Computers and Mathematics with Applications, University. His main research interests
61, 651-662. include Topology, Algebraic
Zeinalova, L.M. (2014). Expected Utility Based Topology, Soft Set theory and Fuzzy
Decision Making Under Z-Information. Intelligent Set Theory.
Automation & Soft Computing, 20:3, 420-431. Email: [email protected]
Zhang, X. (2014). On Interval Soft Sets with
Applications. International Journal of
Computational Intelligence Systems, 7:1, 186-196.