Next Article in Journal
On Phase-I Monitoring of Process Location Parameter with Auxiliary Information-Based Median Control Charts
Next Article in Special Issue
Global Stability Analysis of Fractional-Order Quaternion-Valued Bidirectional Associative Memory Neural Networks
Previous Article in Journal
Differential Flatness-Based Cascade Energy/Current Control of Battery/Supercapacitor Hybrid Source for Modern e–Vehicle Applications
Previous Article in Special Issue
Inertial Iterative Schemes with Variable Step Sizes for Variational Inequality Problem Involving Pseudomonotone Operator
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Complex Intuitionistic Fuzzy Soft Lattice Ordered Group and Its Weighted Distance Measures

Department of Mathematics, Alagappa University, Karaikudi, Tamil Nadu 630003, India
*
Author to whom correspondence should be addressed.
Mathematics 2020, 8(5), 705; https://doi.org/10.3390/math8050705
Submission received: 23 March 2020 / Revised: 20 April 2020 / Accepted: 26 April 2020 / Published: 2 May 2020

Abstract

:
In recent years, the complex fuzzy set theory has intensified the attention of many researchers. This paper focuses on developing the algebraic structures pertaining to lattice ordered groups and lattice ordered subgroups for complex intuitionistic fuzzy soft set theory. Furthermore, some of their properties and operations are discussed. In addition, the weighted distance measures between two complex intuitionistic fuzzy soft lattice ordered groups such as weighted hamming, weighted normalized hamming, weighted euclidean and weighted normalized euclidean distance measures were introduced and also some of the algebraic properties of the weighted distance measures are verified. Moreover, the application of complex intuitionistic fuzzy soft lattice ordered groups by using the weighted distance measures is analysed.

1. Introduction

Vagueness and various uncertainties are characteristics that are pervasive in problems which occuring in engineering, medical science, economics, environments, etc. To exceed these uncertainties and vagueness, some kinds of theories were given like fuzzy set theory [1], intuitionistic fuzzy set theory [2], soft set theory [3] and intuitionistic fuzzy soft theory [4]. Although all of these theories posed a challenge to handle the periodicity or seasonality that to be in many real life problems. This led to Daniel Ramot [5] to present a new innovative concept called complex fuzzy sets.
Complex fuzzy sets are able to handle the problems that are either very difficult or impossible to address with one-dimensional grades of membership. Since then, Kumar T. [6] found an application in multicriteria decision making problem on the basis of the proposed complex intuitionistic fuzzy soft sets and the notion of complex intuitionistic fuzzy soft sets was conferred by Alkouri [7]. Subsequently, Selvachandran G. and Quek S.G. [8] introduced and developed the notion of complex intuitionistic fuzzy soft groups. Distance measure is a numerical measurement between two objects. Moreover distance measure is an important issue on fuzzy sets, soft sets and other hybrid structures. The distance measure and similarity measure for the hybrid structures of fuzzy sets such as fuzzy soft sets [9], intuitionistic fuzzy sets [10], intuitionistic fuzzy soft sets [11], interval-valued complex fuzzy sets [12], complex vague soft sets [13] and complex intuitionistic fuzzy sets [14] were introduced. On the other hand, the lattice ordered algebraic systems play an important role in algebra. The concept of lattice theory was originated by Birkhoff [15]. Satya Saibaba G.S.V. and Vimala J. [16,17] introduced the study of fuzzy lattice ordered groups in a different manner. The combination of fuzzy sets and lattice ordered stuctrures may provide more new interesting topics [18,19,20] which intensified the attention of many reseachers and decision makers. Here, we introduce and develop the theory of complex intuitionistic fuzzy soft lattice ordered group ( CIFSL G ). The main contribution of this study includes
1.
A concept of lattice ordered algebraic structures of complex intuitionistic fuzzy soft sets is originated.
2.
CIFSL G ’s pertinent properties are obtained with its operations such as union, intersection, complement, AND.
3.
Weighted distance measures between CIFSL G s , namely the weighted hamming, weighted normalized hamming, weighted euclidean and weighted normalized euclidean distance measures are introduced. It is possible to handle the seasonality and two-dimensional problems with membership and non-membership grades through CIFSL G .
4.
The application of weighted distance measures between CIFSL G s to find the best work stream for employees is analysed.
The remaining sections of this paper are organized as follows. In Section 2, the important concepts are recapitulated and presented. In Section 3, we introduced the notion of CIFSL G and find the other supporting properties based lattice ordered group structure. Furthermore explore some operations on CIFSL G . In Section 4, the axiomatic definition of the distance function is presented and also the weighted distance measures between CIFSL G s are introduced. Subsequently, some of the algebraic properties of these weighted distance measures are also utilizied. We find an application of CIFSL G using weighted distance measures on CIFSL G s.

2. Preliminaries

In this section, we recapitulate some of the important preliminaries pertaining to the development of CIFSL G .
Definition 1
([1]). The fuzzy set X over a set H is a set X = { < h , μ ( h ) > | h H } where μ : H [ 0 , 1 ] which is called the membership function of X and μ ( h ) is called the membership value of H in X.
Definition 2
([15]). A Lattice ordered group is a system G = ( G , + , ) where
(i) 
(G, +) is a group
(ii) 
(G, ≤) is a lattice
(iii) 
x y a + x + b a + y + b , for all a , b , x , y G .
Definition 3
([16]). A fuzzy subset λ of a lattice-ordered group G is said to be a fuzzy lattice-ordered subgroup or briefly, fuzzy ℓ-subgroup if
(i) 
λ ( x y ) λ ( x ) λ ( y )
(ii) 
λ ( x 1 ) λ ( x )
(iii) 
λ ( x y ) λ ( x ) λ ( y )
(iv) 
λ ( x y ) λ ( x ) λ ( y ) , x , y G .
Definition 4
([5]). A complex fuzzy set A defined on a universe of discourse U is characterized by a membership function μ A ( x ) that assigns a complex-valued grade of membership in A to any element x U . By definition, all values of μ A ( x ) lie within the unit circle in the complex plane and are expressed by μ A ( x ) = r A ( x ) e i w A ( x ) , where i = 1 , r A ( x ) and w A ( x ) are both real-valued, r A ( x ) [ 0 , 1 ] and w A ( x ) ( 0 , 2 π ] . A complex fuzzy set A is thus of the form
A = { < x , μ A ( x ) > : x U } = { < x , r A ( x ) e i w A ( x ) > : x U }
Definition 5
([7]). A complex intuitionistic fuzzy set S, defined on U, is characterized by membership and non-membership functions μ S ( x ) and ν S ( x ) respectively, that assign any element x U a complex-valued grade of both membership and non-membership in S. By definition, the values of μ S ( x ) , ν S ( x ) , and their sum may receive all lying within the unit circle in the complex plane, and are on the form μ S ( x ) = r S ( x ) e i w μ S ( x ) for membership function, ν S ( x ) = k S ( x ) e i w ν S ( x ) for non-membership function, where i = 1 each of r S ( x ) and k S ( x ) are real valued and both belong to the interval [ 0 , 1 ] such that 0 r S ( x ) + k S ( x ) 1 also, w μ S ( x ) and w ν S ( x ) are real valued. We represent the complex intuitionistic fuzzy set S as, S = { < x , μ S ( x ) = a , ν S ( x ) = a > : x U } , where μ S : U { a | a C , | a | 1 } , ν S : U { a | a C , | a | 1 } and | μ S ( x ) + ν S ( x ) | 1 .
Definition 6
([6]). Let E be a set of parameters, C I F S ( U ) denote the collection of all complex intuitionistic fuzzy sets on U, and F ˜ be a function from E to C I F S ( U ) . Then the set of ordered pairs { ( ε , F ˜ ( ε ) ) : ε E , F ˜ ( ε ) C I F S ( U ) } , denoted by ( F ˜ , E ) , is called a complex intuitionistic fuzzy soft set ( C I F S S ) on U.
Definition 7
([6]). Let ( F ˜ 1 , E 1 ) and ( F ˜ 2 , E 2 ) be two C I F S S s over the X. Define R = E 1 E 2 and S = E 1 E 2
H ˜ ( a ) = F ˜ 1 ( a ) , a E 1 S F ˜ 2 ( a ) , a E 2 S F ˜ 1 ( a ) F ˜ 2 ( a ) , a S , K ˜ ( a ) = F ˜ 1 ( a ) F ˜ 2 ( a ) , a S
Then
(i) 
( H ˜ , R ) is called the union of ( F ˜ 1 , E 1 ) and ( F ˜ 2 , E 2 ) and is denoted as ( H ˜ , R ) = ( F ˜ 1 , E 1 ) ˜ ( F ˜ 2 , E 2 )
(ii) 
( K ˜ , S ) is called the intersection of ( F ˜ 1 , E 1 ) and ( F ˜ 2 , E 2 ) and is denoted as ( K ˜ , S ) = ( F ˜ 1 , E 1 ) ˜ ( F ˜ 2 , E 2 )
(iii) 
The complement of ( F ˜ 1 , E 1 ) is denoted as ( F ˜ 1 , E 1 ) c = ( F ˜ 1 c , ¬ E 1 ) , where F ˜ 1 c : ¬ E C I F S ( U ) is mapping given by
F ˜ 1 c ( ¬ a ) = { < x , ν F ˜ 1 ( a ) ( x ) , μ F ˜ 1 ( a ) ( x ) > | x X } , ¬ a ¬ E 1
Definition 8
([6]). Let ( F ˜ 1 , E 1 ) and ( F ˜ 2 , E 2 ) be two C I F S S s over the X. Then we say that ( F ˜ 1 , E 1 ) ( F ˜ 2 , E 2 ) , if
(i) 
E 1 E 2
(ii) 
F ˜ 1 ( a 1 ) F ˜ 2 ( a 1 ) , that is μ F ˜ 1 ( a 1 ) ( x ) μ F ˜ 2 ( a 1 ) ( x ) and ν F ˜ 2 ( a 1 ) ( x ) ν F ˜ 1 ( a 1 ) ( x ) , x X , a 1 E 1

3. Complex Intuitionistic Fuzzy Soft Lattice Ordered Group

In this section, we introduce the notion of Complex Intuitionistic Fuzzy Soft Lattice Ordered Group. Throughout this paper G = ( G , . , , ) denotes the lattice ordered group, where ∨ and ∧ are the maximum and minimum operator respectively and also
(i) 
μ ν , if both r τ and w ψ and
(ii) 
μ ν , if both r τ and w ψ , where μ = r e i w and ν = τ e i ψ , with r , τ [ 0 , 1 ] and w , ψ ( 0 , 2 π ] [8].
Definition 9.
Let G be a lattice ordered group and Let N = { < x , μ N ( x ) , ν N ( x ) > | x G } be a complex intuitionistic fuzzy set on G. Then N is said to be a complex intuitionistic fuzzy lattice ordered subgroup ( CIFL S u b g r o u p ) of G, if the following conditions holds for all x , y G :
(i) 
μ N ( x y ) μ N ( x ) μ N ( y )
(ii) 
ν N ( x y ) ν N ( x ) ν N ( y )
(iii) 
μ N ( x 1 ) μ N ( x )
(iv) 
ν N ( x 1 ) ν N ( x )
(v) 
μ N ( x y ) μ N ( x ) μ N ( y )
(vi) 
μ N ( x y ) μ N ( x ) μ N ( y )
(vii) 
ν N ( x y ) ν N ( x ) ν N ( y )
(viii) 
ν N ( x y ) ν N ( x ) ν N ( y ) .
Definition 10.
Let ( F ˜ , E ) C I F S S ( G ) . Then ( F ˜ , E ) is said to be a complex intuitionistic fuzzy soft lattice ordered group ( CIFSL G ) on G if F ˜ ( a ) is a complex intuitionistic fuzzy lattice ordered subgroup of G, for all a ρ ( F ˜ , E ) , Where ρ ( F ˜ , E ) = { a E : F ˜ ( a ) i s n o n n u l l } is the support set of ( F ˜ , E ) .
Example 1.
Consider the g r o u p G = ( Z , + , , ) and the parameters E = { a , b } . Next Consider the two C I F S S of G, which are defined below.
(i) 
( F ˜ , E ) = { < x , μ F ˜ ( a ) ( x ) , ν F ˜ ( a ) ( x ) > , < x , μ F ˜ ( b ) ( x ) , ν F ˜ ( b ) ( x ) > : x G } , where
μ F ˜ ( a ) ( x ) = 0.4 e i π 2 , if x = 2 k ; k Z / { 0 } 0.7 e i 4 π 3 , x = 0 0.2 e i π 3 , otherwise , ν F ˜ ( a ) ( x ) = 0.6 e i π , if x = 2 k ; k Z / { 0 } 0.3 e i π 2 , x = 0 0.8 e i 3 π 2 , otherwise and μ F ˜ ( b ) ( x ) = 0.5 e i π , if x = 2 k ; k Z / { 0 } 0.8 e i 3 π 2 , if x = 0 0 e i π 2 , otherwise , ν F ˜ ( b ) ( x ) = 0.5 e i π , if x = 2 k ; k Z / { 0 } 0.2 e i π 2 , if x = 0 1 e i π , otherwise
(ii) 
( G ˜ , E ) = { < x , μ G ˜ ( a ) ( x ) , ν G ˜ ( a ) ( x ) > , < x , μ G ˜ ( b ) ( x ) , ν G ˜ ( b ) ( x ) > : x G } ,
where
μ G ˜ ( a ) ( x ) = 0.5 e i π , if x = 0 1 e i π 2 , otherwise , ν G ˜ ( a ) ( x ) = 0.5 e i π 2 , if x = 0 0 e i π , otherwise
and G ˜ ( b ) = F ˜ ( b ) .
From the above ( F ˜ , E ) CIFSL G ( G ) , Whereas ( G ˜ , E ) CIFSL G ( G ) .
Proposition 1.
Let ( F ˜ , E ) C I F S S ( G ) and e G be the identity element of G. Then ( F ˜ , E ) CIFSL G ( G ) if and only if the following conditions are satisfied, for all a E and x , y , e G G ,
(i) 
μ F ˜ ( a ) ( x y 1 ) μ F ˜ ( a ) ( x ) μ F ˜ ( a ) ( y )
(ii) 
ν F ˜ ( a ) ( x y 1 ) ν F ˜ ( a ) ( x ) ν F ˜ ( a ) ( y )
(iii) 
μ F ˜ ( a ) ( x e G ) μ F ˜ ( a ) ( x )
(iv) 
ν F ˜ ( a ) ( x e G ) ν F ˜ ( a ) ( x ) .
Proposition 2.
Let ( F ˜ , E ) C I F S S ( G ) . Then for all a E and x , y G the following are equivalent,
(i) 
μ F ˜ ( a ) ( x ) μ F ˜ ( a ) ( y ) and ν F ˜ ( a ) ( x ) ν F ˜ ( a ) ( y ) whenever x y
(ii) 
μ F ˜ ( a ) ( x y ) μ F ˜ ( a ) ( x ) μ F ˜ ( a ) ( y ) and ν F ˜ ( a ) ( x y ) ν F ˜ ( a ) ( x ) ν F ˜ ( a ) ( y )
(iii) 
μ F ˜ ( a ) ( x y ) μ F ˜ ( a ) ( x ) μ F ˜ ( a ) ( y ) and ν F ˜ ( a ) ( x y ) ν F ˜ ( a ) ( x ) ν F ˜ ( a ) ( y )
Proof. (i) ⇔ (ii) For x , y G ,
x y x μ F ˜ ( a ) ( x y ) μ F ˜ ( a ) ( x ) a n d ν F ˜ ( a ) ( x y ) ν F ˜ ( a ) ( x ) x y y μ F ˜ ( a ) ( x y ) μ F ˜ ( a ) ( y ) a n d ν F ˜ ( a ) ( x y ) ν F ˜ ( a ) ( y ) H e n c e μ F ˜ ( a ) ( x y ) μ F ˜ ( a ) ( x ) μ F ˜ ( a ) ( y ) a n d ν F ˜ ( a ) ( x y ) ν F ˜ ( a ) ( x ) ν F ˜ ( a ) ( y )
On the other hand if x y , then x y = x
μ F ˜ ( a ) ( x ) = μ F ˜ ( a ) ( x y ) μ F ˜ ( a ) ( x ) μ F ˜ ( a ) ( y ) μ F ˜ ( a ) ( y ) ν F ˜ ( a ) ( x ) = ν F ˜ ( a ) ( x y ) ν F ˜ ( a ) ( x ) ν F ˜ ( a ) ( y ) ν F ˜ ( a ) ( y ) H e n c e μ F ˜ ( a ) ( x ) μ F ˜ ( a ) ( y ) a n d ν F ˜ ( a ) ( x ) ν F ˜ ( a ) ( y )
(i) ⇔ (iii) For x , y G ,
x y x μ F ˜ ( a ) ( x ) μ F ˜ ( a ) ( x y ) a n d ν F ˜ ( a ) ( x y ) ν F ˜ ( a ) ( x ) x y y μ F ˜ ( a ) ( y ) μ F ˜ ( a ) ( x y ) a n d ν F ˜ ( a ) ( x y ) ν F ˜ ( a ) ( y ) a n d H e n c e μ F ˜ ( a ) ( x ) μ F ˜ ( a ) ( y ) μ F ˜ ( a ) ( x y ) a n d ν F ˜ ( a ) ( x ) ν F ˜ ( a ) ( y ) ν F ˜ ( a ) ( x y )
On the other hand if x y , then x y = y
μ F ˜ ( a ) ( y ) = μ F ˜ ( a ) ( x y ) μ F ˜ ( a ) ( x ) μ F ˜ ( a ) ( y ) μ F ˜ ( a ) ( x ) ν F ˜ ( a ) ( y ) = ν F ˜ ( a ) ( x y ) ν F ˜ ( a ) ( x ) ν F ˜ ( a ) ( y ) ν F ˜ ( a ) ( x ) H e n c e μ F ˜ ( a ) ( y ) μ F ˜ ( a ) ( x ) a n d ν F ˜ ( a ) ( y ) ν F ˜ ( a ) ( x )
 □
Proposition 3.
Let ( F ˜ , E ) C I F S S ( G ) . Then for all a E and x , y G the following are equivalent,
(i) 
μ F ˜ ( a ) ( x ) μ F ˜ ( a ) ( y ) and ν F ˜ ( a ) ( x ) ν F ˜ ( a ) ( y ) whenever x y
(ii) 
μ F ˜ ( a ) ( x y ) μ F ˜ ( a ) ( x ) μ F ˜ ( a ) ( y ) and ν F ˜ ( a ) ( x y ) ν F ˜ ( a ) ( x ) ν F ˜ ( a ) ( y )
(iii) 
μ F ˜ ( a ) ( x y ) μ F ˜ ( a ) ( x ) μ F ˜ ( a ) ( y ) and ν F ˜ ( a ) ( x y ) ν F ˜ ( a ) ( x ) ν F ˜ ( a ) ( y )
Proof. 
The proof is similar to Proposition 2. □
Proposition 4.
Let ( F ˜ , E ) CIFSL G ( G ) . Then for all x G , a E
(i) 
μ F ˜ ( a ) ( x + ) μ F ˜ ( a ) ( x ) and ν F ˜ ( a ) ( x + ) ν F ˜ ( a ) ( x )
(ii) 
μ F ˜ ( a ) ( x ) μ F ˜ ( a ) ( x ) and ν F ˜ ( a ) ( x ) ν F ˜ ( a ) ( x )
(iii) 
μ F ˜ ( a ) ( | x | ) μ F ˜ ( a ) ( x ) and ν F ˜ ( a ) ( | x | ) ν F ˜ ( a ) ( x )
(iv) 
μ F ˜ ( a ) ( ( x 1 ) + ) μ F ˜ ( a ) ( x ) and ν F ˜ ( a ) ( ( x 1 ) + ) ν F ˜ ( a ) ( x )
Proof. 
Since G is lattice ordered group. For all x , e G G , x + = x e G , x = x e G , | x | = x x 1 a n d ( x 1 ) + = ( x ) 1 .
From the above, result is obvious. □
Proposition 5.
Let ( F ˜ , E ) CIFSL G ( G ) and e G be the identity element of G. Then the following results holds for all x G , a E
(i) 
μ F ˜ ( a ) ( x 1 ) = μ F ˜ ( a ) ( x ) and ν F ˜ ( a ) ( x 1 ) = ν F ˜ ( a ) ( x )
(ii) 
μ F ˜ ( a ) ( e G ) μ F ˜ ( a ) ( x ) and ν F ˜ ( a ) ( e G ) ν F ˜ ( a ) ( x ) .
Theorem 1.
Let ( F ˜ 1 , E 1 ) and ( F ˜ 2 , E 2 ) CIFSL G ( G ) . If E 1 E 2 = , then ( F ˜ 1 , E 1 ) ˜ ( F ˜ 2 , E 2 ) CIFSL G ( G ) .
Proof. 
By Definition 7 ( F ˜ 1 , E 1 ) ˜ ( F ˜ 2 , E 2 ) = ( H ˜ , R ) , where R = E 1 E 2 .
Since E 1 E 2 = , then a E 1 S or a E 2 S where S = E 1 E 2 and for all a R .
Case: 1 If a E 1 S then H ˜ ( a ) = F ˜ 1 ( a ) is CIFSL G ( G )
Case: 2 If a E 2 S then H ˜ ( a ) = F ˜ 2 ( a ) is CIFSL G ( G ) .
Thus ( F ˜ 1 , E 1 ) ˜ ( F ˜ 2 , E 2 ) CIFSL G ( G ) . □
Theorem 2.
Let ( F ˜ 1 , E 1 ) and ( F ˜ 2 , E 2 ) CIFSL G ( G ) . Then ( F ˜ 1 , E 1 ) ˜ ( F ˜ 2 , E 2 ) CIFSL G ( G ) .
Proof. 
By Definition 7, ( F ˜ 1 , E 1 ) ˜ ( F ˜ 2 , E 2 ) = ( K ˜ , S ) where S = E 1 E 2 and K ˜ ( a ) = F ˜ 1 ( a ) F ˜ 2 ( a ) , for all a E 1 E 2 .
To prove: F ˜ 1 ( a ) F ˜ 2 ( a ) = { < x , μ F ˜ 1 ( a ) ( x ) μ F ˜ 2 ( a ) ( x ) , ν F ˜ 1 ( a ) ( x ) μ F ˜ 2 ( a ) ( x ) > | x G } , is CIFL S u b g r o u p .
For x , y , e G G and a E 1 E 2
( i ) μ F ˜ 1 ( a ) F ˜ 2 ( a ) ( x e G ) = [ r F ˜ 1 ( a ) ( x e G ) r F ˜ 2 ( a ) ( x e G ) ] e i [ w F ˜ 1 ( a ) ( x e G ) w F ˜ 2 ( a ) ( x e G ) ] [ ( r F ˜ 1 ( a ) ( x ) r F ˜ 1 ( a ) ( e G ) ) ( r F ˜ 2 ( a ) ( x ) r F ˜ 2 ( a ) ( e G ) ) ] e i [ ( w F ˜ 1 ( a ) ( x ) w F ˜ 1 ( a ) ( e G ) ) ( w F ˜ 2 ( a ) ( x ) w F ˜ 2 ( a ) ( e G ) ) ] [ r F ˜ 1 ( a ) ( x ) r F ˜ 2 ( a ) ( x ) ] e i [ w F ˜ 1 ( a ) ( x ) w F ˜ 2 ( a ) ( x ) ] [ B y P r o p o s i t i o n 5 ( i i ) ] = μ F ˜ 1 ( a ) F ˜ 2 ( a ) ( x ) . ( i i ) ν F ˜ 1 ( a ) F ˜ 2 ( a ) ( x e G ) = [ τ F ˜ 1 ( a ) ( x e G ) τ F ˜ 2 ( a ) ( x e G ) ] e i [ ψ F ˜ 1 ( a ) ( x e G ) ψ F ˜ 2 ( a ) ( x e G ) ] [ ( τ F ˜ 1 ( a ) ( x ) τ F ˜ 1 ( a ) ( e G ) ) ( τ F ˜ 2 ( a ) ( x ) τ F ˜ 2 ( a ) ( e G ) ) ] e i [ ( ψ F ˜ 1 ( a ) ( x ) ψ F ˜ 1 ( a ) ( e G ) ) ( ψ F ˜ 2 ( a ) ( x ) ψ F ˜ 2 ( a ) ( e G ) ) ] [ τ F ˜ 1 ( a ) ( x ) τ F ˜ 2 ( a ) ( x ) ] e i [ ψ F ˜ 1 ( a ) ( x ) ψ F ˜ 2 ( a ) ( x ) ] [ B y P r o p o s i t i o n 5 ( i i ) ] = ν F ˜ 1 ( a ) F ˜ 2 ( a ) ( x ) .
Similarly, we can prove
(iii) μ F ˜ 1 ( a ) F ˜ 2 ( a ) ( x y 1 ) μ F ˜ 1 ( a ) F ˜ 2 ( a ) ( x ) ν F ˜ 1 ( a ) F ˜ 2 ( a ) ( y ) and
(iv) ν F ˜ 1 ( a ) F ˜ 2 ( a ) ( x y 1 ) ν F ˜ 1 ( a ) F ˜ 2 ( a ) ( x ) ν F ˜ 1 ( a ) F ˜ 2 ( a ) ( y )
Thus, by Proposition 1 ( F ˜ 1 , E 1 ) ˜ ( F ˜ 2 , E 2 ) CIFSL G ( G ) . □
Theorem 3.
Let ( F ˜ , E ) CIFSL G ( G ) . Then ( F ˜ , E ) c CIFSL G ( G ) .
Proof. 
By Definition 7
( F ˜ , E ) c = ( F ˜ c , ¬ E ) , where F ˜ c : ¬ E C I F S ( U ) is mapping given by F ˜ c ( ¬ a ) = { < x , ν F ˜ ( a ) ( x ) , μ F ˜ ( a ) ( x ) > | x X } , ¬ a ¬ E
ν F ˜ ( a ) ( x y ) = τ F ˜ ( a ) ( x y ) e i ψ F ˜ ( a ) ( x y ) = ( 1 r F ˜ ( a ) ( x y ) ) e i ( 2 π w F ˜ ( a ) ( x y ) ) τ F ˜ ( a ) ( x ) τ F ˜ ( a ) ( y ) e i ( ψ F ˜ ( a ) ( x ) ψ F ˜ ( a ) ( y ) ) = ν F ˜ ( a ) ( x ) ν F ˜ ( a ) ( y )
( F ˜ , E ) c CIFSL G ( G )  □
Theorem 4.
Let ( F ˜ 1 , E 1 ) and ( F ˜ 2 , E 2 ) CIFSL G ( G ) . Then ( F ˜ 1 , E 1 ) ( F ˜ 2 , E 2 ) CIFSL G ( G ) .
Proof. 
Let ( F ˜ 1 , E 1 ) and ( F ˜ 2 , E 2 ) CIFSL G and let ( F ˜ 1 , E 1 ) ( F ˜ 2 , E 2 ) = ( G ˜ , C ) where C = E 1 × E 2 ( a , b ) E 1 × E 2 and G ˜ ( a , b ) = F ˜ 1 ( a ) F ˜ 2 ( b ) .
We know that F ˜ 1 ( a ) , a E 1 and F ˜ 2 ( b ) , b E 2 are CIFL S u b g r o u p ( G ) and then G ˜ ( a , b ) CIFL S u b g r o u p ( G ) , ( a , b ) E 1 × E 2 , since by Theorem 2.
Then ( F ˜ 1 , E 1 ) ( F ˜ 2 , E 2 ) CIFSL G ( G ) . □
Definition 11.
Let ( F ˜ 1 , E 1 ) and ( F ˜ 2 , E 2 ) CIFSL G ( G ) . Then we say that
(i) 
( F ˜ 1 , E 1 ) is a complex intuitionistic fuzzy soft l-subgroup of ( F ˜ 2 , E 2 ) and write ( F ˜ 1 , E 1 ) ˜ ( F ˜ 2 , E 2 ) if the following conditions are satisfied:
(a) 
E 1 E 2
(b) 
For all a E 1 , F ˜ 1 ( a ) is a complex intuitionistic fuzzy l-subgroup of F ˜ 2 ( a )
(ii) 
( F ˜ 1 , E 1 ) = ( F ˜ 2 , E 2 ) if and only if ( F ˜ 1 , E 1 ) ˜ ( F ˜ 2 , E 2 ) and ( F ˜ 1 , E 1 ) ˜ ( F ˜ 2 , E 2 )
Theorem 5.
Let ( F ˜ 1 , E 1 ) and ( F ˜ 2 , E 2 ) CIFSL G ( G ) . Then the following holds,
(i) 
If F ˜ 2 ( a ) F ˜ 1 ( a ) , for all a E 2 E 1 , then ( F ˜ 2 , E 2 ) ˜ ( F ˜ 1 , E 1 )
(ii) 
( F ˜ 1 , E 1 ) ˜ ( F ˜ 2 , E 2 ) is a complex intuitionistic fuzzy soft l-subgroup of both ( F ˜ 1 , E 1 ) and ( F ˜ 2 , E 2 ) if it is non-null
Proof.
(i) 
Straight forward from Definition 11.
(ii) 
Let ( F ˜ 1 , E 1 ) ˜ ( F ˜ 2 , E 2 ) = ( K ˜ , C ) , where C = E 1 E 2 .
Since E 1 E 2 E 1 and by Theorem 2 K ˜ ( a ) = F ˜ 1 ( a ) F ˜ 2 ( a ) CIFL S u b g r o u p ( G ) , for every a E 1 E 2 . Therefore ( K ˜ , C ) ˜ ( F ˜ 1 , E 1 ) .
Similarly, We see that ( K ˜ , C ) ˜ ( F ˜ 2 , E 2 )  □

4. Weighted Distance Measures between CIFSL G s

In this section, we introduce the distance function and several weighted distance measures on CIFSL G . And also we present an application of weighted distance measures on CIFSL G s .
Definition 12.
Let ( F ˜ , A ) , ( G ˜ , B ) , ( H ˜ , C ) CIFSL G ( G ) . A real valued non-negative function d : CIFSL G ( G ) × CIFSL G ( G ) [ 0 , 1 ] is the distance function between CIFSL G ( G ) s if
(i) 
0 d ( ( F ˜ , A ) , ( G ˜ , B ) ) 1
(ii) 
d ( ( F ˜ , A ) , ( G ˜ , B ) ) = d ( ( G ˜ , B ) , ( F ˜ , A ) )
(iii) 
d ( ( F ˜ , E ) , ( G ˜ , B ) ) = 0 iff ( F ˜ , A ) = ( G ˜ , B )
(iv) 
If ( F ˜ , A ) ( G ˜ , B ) ( H ˜ , C ) , then d ( ( F ˜ , A ) , ( H ˜ , C ) ) m a x { d ( ( F ˜ , A ) , ( G ˜ , B ) ) , d ( ( G ˜ , B ) , ( H ˜ , C ) ) }
Definition 13.
Let G = { x 1 , , x n } be a ℓ- group and let ( F ˜ , A ) , ( G ˜ , B ) CIFSL G over G and d a distance measure between CIFSL G ( G ) . We define some weighted distance measures between CIFSL G s which are as given below,
(i) 
The Weighted Hamming Distance:
d w H ( ( F ˜ , A ) , ( G ˜ , B ) ) = 1 2 i = 1 n w i i = 1 n j = 1 m w i [ α 1 | r F ˜ ( a j ) ( x i ) r G ˜ ( b j ) ( x i ) | + β 1 | τ F ˜ ( a j ) ( x i ) τ G ˜ ( b j ) ( x i ) | . + σ 1 m a x { | r F ˜ ( a j ) ( x i ) r G ˜ ( b j ) ( x i ) | , | τ F ˜ ( a j ) ( x i ) τ G ˜ ( b j ) ( x i ) | } + 1 2 π ( α 2 . | w F ˜ ( a j ) ( x i ) w G ˜ ( b j ) ( x i ) | + β 2 | ψ F ˜ ( a j ) ( x i ) ψ G ˜ ( b j ) ( x i ) | . . + σ 2 m a x { | w F ˜ ( a j ) ( x i ) w G ˜ ( b j ) ( x i ) | , | ψ F ˜ ( a j ) ( x i ) ψ G ˜ ( b j ) ( x i ) | } ) ]
(ii) 
The Weighted Normalized Hamming Distance:
d w N H ( ( F ˜ , A ) , ( G ˜ , B ) ) = d w H ( ( F ˜ , A ) , ( G ˜ , B ) ) m n
(iii) 
The Weighted Euclidean Distance Measure:
d w E ( ( F ˜ , A ) , ( G ˜ , B ) ) = [ . 1 2 i = 1 n w i i = 1 n j = 1 m w i [ . α 1 ( r F ˜ ( a j ) ( x i ) r G ˜ ( b j ) ( x i ) ) 2 + β 1 ( τ F ˜ ( a j ) ( x i ) τ G ˜ ( b j ) ( x i ) ) 2 + σ 1 m a x { ( r F ˜ ( a j ) ( x i ) r G ˜ ( b j ) ( x i ) ) 2 , ( τ F ˜ ( a j ) ( x i ) τ G ˜ ( b j ) ( x i ) ) 2 } + 1 2 π ( . α 2 ( w F ˜ ( a j ) ( x i ) w G ˜ ( b j ) ( x i ) ) 2 + β 2 ( ψ F ˜ ( a j ) ( x i ) ψ G ˜ ( b j ) ( x i ) ) 2 + σ 2 m a x { ( w F ˜ ( a j ) ( x i ) w G ˜ ( b j ) ( x i ) ) 2 , ( ψ F ˜ ( a j ) ( x i ) ψ G ˜ ( b j ) ( x i ) ) 2 } ) . ] . ] 1 / 2 .
(iv) 
The Weighted Normalized Euclidean Distance:
d w N E ( ( F ˜ , A ) , ( G ˜ , B ) ) = d w E ( ( F ˜ , A ) , ( G ˜ , B ) ) m n
where α 1 , β 1 , α 2 , β 2 , σ 1 , σ 2 [ 0 , 1 ] , α 1 + β 1 + σ 1 = 1 a n d α 2 + β 2 + σ 2 = 1 , w i [ 0 , 1 ] , i = 1 , 2 , , n a n d a j A , b j B , j = 1 , 2 , , m
Proposition 6.
All the weighted distance measures defined in Definition 13 are distance function between CIFSL G s .
Proof. 
It is obvious that all the weighted distance measures given in Definition 13 satisfy conditions (i)–(iii) of Definition 12. We have to prove the condition ( i v ) for the weighted Hamming distance.
By Using Definition 8
0 r F ˜ ( a j ) ( x i ) r G ˜ ( b j ) ( x i ) r H ˜ ( c j ) ( x i ) 1 a n d 0 τ H ˜ ( c j ) ( x i ) τ G ˜ ( b j ) ( x i ) τ F ˜ ( a j ) ( x i ) 1 0 w F ˜ ( a j ) ( x i ) w G ˜ ( b j ) ( x i ) w H ˜ ( c j ) ( x i ) 2 π a n d 0 ψ H ˜ ( c j ) ( x i ) ψ G ˜ ( b j ) ( x i ) ψ F ˜ ( a j ) ( x i ) 2 π
d w H ( ( F ˜ , A ) , ( G ˜ , B ) ) = 1 2 i = 1 n w i i = 1 n j = 1 m w i [ . α 1 | r F ˜ ( a j ) ( x i ) r G ˜ ( b j ) ( x i ) | + β 1 | τ F ˜ ( a j ) ( x i ) τ G ˜ ( b j ) ( x i ) | . + σ 1 m a x { | r F ˜ ( a j ) ( x i ) r G ˜ ( b j ) ( x i ) | , | τ F ˜ ( a j ) ( x i ) τ G ˜ ( b j ) ( x i ) | } ) . + 1 2 π ( α 2 . | w F ˜ ( a j ) ( x i ) w G ˜ ( b j ) ( x i ) | + β 2 | ψ F ˜ ( a j ) ( x i ) ψ G ˜ ( b j ) ( x i ) | + σ 2 m a x { | w F ˜ ( a j ) ( x i ) w G ˜ ( b j ) ( x i ) | , | ψ F ˜ ( a j ) ( x i ) ψ G ˜ ( b j ) ( x i ) | } ) ] . 1 2 i = 1 n w i i = 1 n j = 1 m w i [ α 1 | r F ˜ ( a j ) ( x i ) r H ˜ ( c j ) ( x i ) | + β 1 | τ F ˜ ( a j ) ( x i ) τ H ˜ ( c j ) ( x i ) | . + σ 1 m a x { | r F ˜ ( a j ) ( x i ) r H ˜ ( c j ) ( x i ) | , | τ F ˜ ( a j ) ( x i ) τ H ˜ ( c j ) ( x i ) | } + 1 2 π ( α 2 . | w F ˜ ( a j ) ( x i ) w H ˜ ( c j ) ( x i ) | + β 2 | ψ F ˜ ( a j ) ( x i ) ψ H ˜ ( c j ) ( x i ) | + σ 2 m a x { | w F ˜ ( a j ) ( x i ) w H ˜ ( c j ) ( x i ) | , | ψ F ˜ ( a j ) ( x i ) ψ H ˜ ( c j ) ( x i ) | } ) ] . = d w H ( ( F ˜ , A ) , ( H ˜ , C ) )
d w H ( ( F ˜ , A ) , ( G ˜ , B ) ) d w H ( ( F ˜ , A ) , ( H ˜ , C ) )
Similarly, we can get d w H ( ( G ˜ , B ) , ( H ˜ , C ) ) d w H ( ( F ˜ , A ) , ( H ˜ , C ) )
Then d w H ( ( F ˜ , A ) , ( H ˜ , C ) ) m a x { d w H ( ( F ˜ , A ) , ( G ˜ , B ) ) , d w H ( ( G ˜ , B ) , ( H ˜ , C ) ) }  □
Proposition 7.
Let d be a weighted distance measure between CIFSL G s . Then for any ( F ˜ , E ) , ( G ˜ , B ) , ( H ˜ , C ) CIFSL G
1.
d ( ( F ˜ , A ) , ( G ˜ , B ) ) = d ( ( F ˜ , A ) ˜ ( G ˜ , B ) , ( F ˜ , A ) ˜ ( G ˜ , B ) )
2.
d ( ( F ˜ , A ) , ( F ˜ , A ) ˜ ( G ˜ , B ) ) = d ( ( G ˜ , B ) , ( F ˜ , A ) ˜ ( G ˜ , B ) )
3.
d ( ( F ˜ , A ) , ( F ˜ , A ) ˜ ( G ˜ , B ) ) = d ( ( G ˜ , B ) , ( F ˜ , A ) ˜ ( G ˜ , B ) )
4.
d ( ( F ˜ , A ) , ( G ˜ , B ) ˜ ( H ˜ , C ) ) d ( ( F ˜ , A ) , ( G ˜ , B ) ) + d ( ( F ˜ , A ) , ( H ˜ , C ) )
5.
d ( ( F ˜ , A ) , ( G ˜ , B ) ˜ ( H ˜ , C ) ) d ( ( F ˜ , A ) , ( G ˜ , B ) ) + d ( ( F ˜ , A ) , ( H ˜ , C ) )

4.1. Application

Suppose the team of analysts decides to analyse the best work stream for employees based on the employees own experience. The following work streams are taken into consideration
Let us define the binary operation ‘*’ by x 1 * x 2 which means the ‘need’ of x 1 and x 2 . In Table 1, x 2 is the identity element and all the attributes have their own inverse.
Let us take G = { x 1 , x 2 , x 3 , x 4 } . Here, the lattice structure comes under the team’s personal preference to the work stream in the decision as well as indicate their equal degree of importance defined by x i x j x i = x j for i , j { 1 , , 4 } . Hence ( G , * ) is a -group. The parameters are taken as
A = { a 1 = S p e c i a l a n d u n i q u e b e n e f i t s , a 2 = F r i e n d l y p l a c e t o w o r k , a 3 = C o n t r i b u t i o n t o t h e c o m m u n i t y , a 4 = A c c o m p l i s h a n d p r i d e , a 5 = H o n e s t m a n a g e m e n t }
For instance, suppose the team of analysts surveys that 70 % of the employees of x 1 believe that x 1 is suitable for the first attribute; and 10 % of the them believe that x 1 is poor for the first attribute, in which this process is utilized to calculate the amplitude terms for both membership and non membership functions respectively. The phase terms that the range of attribute for the present date for first attribute of x 1 can be given as follows: if 40 % employees of x 1 believe that the present date of x 1 is suitable for the first attribute; and 30 % of them believe that it is poor. So the first attribute for x 1 can be represented as ( 0 . 7 e i 2 π ( 0 . 4 ) , 0 . 1 e i 2 π ( 0 . 3 ) ) . The weight vector of the each attribute is w j = { 0 . 2 , 0 . 4 , 0 . 2 , 0 . 2 , 0 . 5 } which is based on the employees priorities to the attribute in the decision making.
Next, we list the detailed steps involved in the weighted distance measures based decision making process.
Step 1:
The employees reports about their own experience are given in Table 2. From Table 2 ( F ˜ , A ) forms CIFSL G .
Step 2:
In Table 3, we obtain the weighted distance measures between ( F ˜ , A ) and I, i.e., ideal choice (each rating value is ( 1 e i 2 π , 0 e i 0 π ) ) by using the Definition 13 with the weight for each attribute w j = { 0 . 2 , 0 . 4 , 0 . 2 , 0 . 2 , 0 . 5 } and the weights α 1 = 0 . 3 , β 1 = 0 . 4 , σ 1 = 0 . 3 for the amplitude term, while α 2 = 0 . 1 , β 2 = 0 . 5 , σ 2 = 0 . 4 for the phase term.
Step 3:
The Table 4 involves the ranking of the weighted distance measures obtained.

4.2. Discussion of the Results and Comparative Study

We obtained the weighted distance measures from Table 4. Clearly, the best alternative is x 2 , which is the one with the lowest distance to the ideal choice. It is determined that x 2 is graded as first, x 4 is graded as second, x 1 is graded as third and x 3 is graded as fourth. The result is shown in Figure 1.
In Table 2, the phase term of the membership and non-membership values gives the ability to consider values in more accurate compared to fuzzy sets and soft sets and other hybrid structures. The amplitude term gives the ability to deal with periodicity information of membership and non-membership function. On the other hand, different weights lead to different results. In this application, employee indicate their degree of importance to the attributes through the weights. Hence the results obtained by using Definition 13 taken into account the preference to the parameters with the CIFSL G structure. The results of this application help to identify the gaps and improve their work place culture.
Among the existing methods in literature that is closed to the weighted distance measure on CIFSL G is the distance measure on complex intuitionistic fuzzy soft sets (CIFSS) [6]. However, using the distance measure on CIFSSs is unfeasible which is discussed above. For instance, in our scenario, intuitionistic fuzzy soft sets (IFSS) [4] and generalized intuitionistic fuzzy soft sets (GIFSS) [9] can not represent the phase term, which is range at the present date. From this analysis, the weighted distance measure and CIFSL G structure enables to overcome the problems afflicting in CIFSS, IFSS and GIFSS.

5. Conclusions

The complex intuitionistic fuzzy soft lattice ordered groups ( CIFSL G ) is a hybrid structure of CIFSS and Lattice ordered group. We found the notion of CIFSL G and its supporting properties. Furthermore, examined the operations on CIFSL G . Furthermore, we introduced the weighted distance measures and verified some properties. In addition, we demonstrated an application of CIFSL G to find the best work stream for employees which is accomplished by weighted distance measure between CIFSL G s. As a future work, we plan to extend the theory by introducing morphisms and some more operations on CIFSL G and conjointly planned to contribute some real life applications.

Author Contributions

Conceptualization, methodology, writing S.R.; review, editing and investigation J.V.; investigation and validation D.P. All authors have read and agreed to the published version of the manuscript.

Funding

The article has been written with the joint financial support of RUSA-Phase 2.0 grant sanctioned vide letter No. F 24-51/2014-U, Policy (TN Multi-Gen), Dept. of Edn. Govt. of India, Dt. 09.10.2018, UGC-SAP (DRS-I) vide letter No. F.510/8/DRS-I/2016(SAP-I) Dt. 23.08.2016, DST-PURSE 2nd Phase programme vide letter No. SR/PURSE Phase 2/38 (G) Dt. 21.02.2017 and DST (FST—level I) 657876570 vide letter No. SR/FIST/MS-I/2018/17 Dt. 20.12.2018.

Acknowledgments

The authors would like to thank in advance the Editor-in-Chief and the anonymous reviewers for their valuable comments and suggestions.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Zadeh, L.A. Fuzzy sets. Inf. Control 1965, 8, 338–353. [Google Scholar] [CrossRef] [Green Version]
  2. Atanassov, K.T. Intuitionistic fuzzy sets. Fuzzy Sets Syst. 1986, 20, 87–96. [Google Scholar] [CrossRef]
  3. Molodtsov, D. Soft set theory—First results. Comput. Math. Appl. 1999, 37, 19–31. [Google Scholar] [CrossRef] [Green Version]
  4. Maji, P.K.; Biswas, R.; Roy, A.R. Intuitionistic fuzzy soft sets. J. Fuzzy Math. 2001, 9, 677–692. [Google Scholar]
  5. Ramot, D.; Milo, R.; Friedman, M.; Kandel, A. Complex fuzzy sets. IEEE Trans. Fuzzy Syst. 2002, 10, 171–186. [Google Scholar] [CrossRef]
  6. Kumar, T.; Bajaj, R.K. On complex intuitionistic fuzzy soft sets with distance measures and entropies. J. Math. 2014, 2014. [Google Scholar] [CrossRef] [Green Version]
  7. Alkouri, A.U.M.; Salleh, A.R. Complex Intuitionistic Fuzzy Sets. AIP Conf. Proc. 2012, 1482, 464–470. [Google Scholar]
  8. Quek, S.G.; Selvachandran, G.; Davvaz, B.; Pal, M. The algebraic structures of complex intuitonistic fuzzy soft sets associated with groups and subgroups. Sci. Iran. 2019, 26, 1898–1912. [Google Scholar]
  9. Liu, Z.; Qin, K.; Pei, Z. A Method for Fuzzy Soft Sets in Decision-Making Based on an Ideal Solution. Symmetry 2017, 9, 246. [Google Scholar] [CrossRef] [Green Version]
  10. Wang, W.; Xin, X. Distance measure between intuitionistic fuzzy sets. Pattern Recogn. Lett. 2005, 26, 2063–2069. [Google Scholar] [CrossRef]
  11. Selvachandran, G.; Maji, P.K.; Faisal, R.Q.; Salleh, A.R. Distance and distance induced intuitionistic entropy of generalized intutionistic fuzzy soft sets. Appl. Intell. 2017, 47, 132–147. [Google Scholar] [CrossRef]
  12. Dai, S.; Bi, L.; Hu, B. Distance Measures between the Interval-Valued Complex Fuzzy Sets. Mathematics 2019, 7, 549. [Google Scholar] [CrossRef] [Green Version]
  13. Selvachandran, G.; Maji, P.K.; Abed, I.E.; Salleh, A.R. Complex vague soft sets and its distance measures. J. Intell. Fuzzy Syst. 2016, 31, 55–68. [Google Scholar] [CrossRef]
  14. Rani, D.; Garg, H. Distance measures between the complex intuitionistic fuzzy sets and its applications to the decision-making process. Int. J. Uncertain. Quantif. 2017, 7, 423–439. [Google Scholar] [CrossRef]
  15. Birkhoff, G. Lattice Ordered Group. JSTOR Ann. Math. Second Ser. 1942, 43, 298–331. [Google Scholar] [CrossRef]
  16. Satya Saibaba, G.S.V. Fuzzy Lattice Ordered Groups. Southeast Asian Bull. Math. 2008, 32, 749–766. [Google Scholar]
  17. Vimala, J. Fuzzy Lattice Ordered Group. Int. J. Sci. Eng. Res. 2014, 5, 58–60. [Google Scholar]
  18. Vimala, J.; Reeta, J.A.; Ilamathi, V.S. A study on fuzzy soft cardinality in lattice ordered fuzzy soft group and its application in decision making problems. J. Intell. Fuzzy Syst. 2018, 34, 1535–1542. [Google Scholar] [CrossRef]
  19. Sabeena Begam, S.; Vimala, J. Application of lattice ordered multi-fuzzy soft set in forecasting process. J. Intell. Fuzzy Syst. 2019, 36, 2323–2331. [Google Scholar] [CrossRef]
  20. Vimala, J.; Anusuya Ilamathi, V.S.; Rajareega, S. Implicative and positive implicative filters of residuated lattices in multiset context. J. Discret. Math. Sci. Cryptogr. 2019, 22, 869–882. [Google Scholar] [CrossRef]
Figure 1. Weighted distance measure results on CIFSL G .
Figure 1. Weighted distance measure results on CIFSL G .
Mathematics 08 00705 g001
Table 1. Binary operation output. x 1 = Information Technology, x 2 = Professional Consulting, x 3 = Financial Services, x 4 = Health Care.
Table 1. Binary operation output. x 1 = Information Technology, x 2 = Professional Consulting, x 3 = Financial Services, x 4 = Health Care.
* x 1 x 2 x 3 x 4
x 1 x 2 x 1 x 4 x 3
x 2 x 1 x 2 x 3 x 4
x 3 x 4 x 3 x 2 x 1
x 4 x 3 x 4 x 1 x 2
Table 2. CIFSL G information about the employees experience.
Table 2. CIFSL G information about the employees experience.
( F ˜ , A ) x 1 x 2 x 3 x 4
a 1 ( 0 . 7 e i 2 π ( 0 . 4 ) , 0 . 1 e i 2 π ( 0 . 3 ) ) ( 0 . 9 e i 2 π ( 0 . 8 ) , 0 . 1 e i 2 π ( 0 . 1 ) ) ( 0 . 8 e i 2 π ( 0 . 4 ) , 0 . 26 e i 2 π ( 0 . 5 ) ) ( 0 . 3 e i 2 π ( 0 . 7 ) , 0 . 5 e i 2 π ( 0 . 25 ) )
a 2 ( 0 . 6 e i 2 π ( 0 . 7 ) , 0 . 32 e i 2 π ( 0 . 3 ) ) ( 0 . 7 e i 2 π ( 0 . 8 ) , 0 . 23 e i 2 π ( 0 . 01 ) ) ( 0 . 4 e i 2 π ( 0 . 6 ) , 0 . 3 e i 2 π ( 0 . 2 ) ) ( 0 . 7 e i 2 π ( 0 . 7 ) , 0 . 2 e i 2 π ( 0 . 1 ) )
a 3 ( 0 . 4 e i 2 π ( 0 . 6 ) , 0 . 5 e i 2 π ( 0 . 39 ) ) ( 0 . 8 e i 2 π ( 0 . 9 ) , 0 . 01 e i 2 π ( 0 . 02 ) ) ( 0 . 6 e i 2 π ( 0 . 5 ) , 0 . 35 e i 2 π ( 0 . 4 ) ) ( 0 . 7 e i 2 π ( 0 . 9 ) , 0 . 2 e i 2 π ( 0 . 1 ) )
a 4 ( 0 . 8 e i 2 π ( 0 . 5 ) , 0 . 19 e i 2 π ( 0 . 4 ) ) ( 0 . 95 e i 2 π ( 0 . 9 ) , 0 e i 2 π ( 0 . 1 ) ) ( 0 . 8 e i 2 π ( 0 . 2 ) , 0 . 15 e i 2 π ( 0 . 7 ) ) ( 0 . 9 e i 2 π ( 0 . 8 ) , 0 e i 2 π ( 0 . 05 ) )
a 5 ( 0 . 5 e i 2 π ( 0 . 2 ) , 0 . 4 e i 2 π ( 0 . 6 ) ) ( 0 . 8 e i 2 π ( 0 . 8 ) , 0 . 1 e i 2 π ( 0 . 2 ) ) ( 0 . 75 e i 2 π ( 0 . 6 ) , 0 . 1 e i 2 π ( 0 . 6 ) ) ( 0 . 75 e i 2 π ( 0 . 8 ) , 0.05 e i 2 π ( 0.2 ) )
Table 3. Weighted distance measure of ( F ˜ , A ) and I using Definition 13.
Table 3. Weighted distance measure of ( F ˜ , A ) and I using Definition 13.
x 1 x 2 x 3 x 4
d w H ( ( F ˜ , A ) , I ) 0.3050.1430.3690.22
d w N H ( ( F ˜ , A ) , I ) 0.0160.0070.0180.011
d w E ( ( F ˜ , A ) , I ) 0.4490.1680.4520.268
d w N E ( ( F ˜ , A ) , I ) 0.0680.0310.10.059
Table 4. Ordering the alternatives.
Table 4. Ordering the alternatives.
Ordering
d w H ( ( F ˜ , A ) , I ) x 2 x 4 x 1 x 3
d w N H ( ( F ˜ , A ) , I ) x 2 x 4 x 1 x 3
d w E ( ( F ˜ , A ) , I ) x 2 x 4 x 1 x 3
d w N E ( ( F ˜ , A ) , I ) x 2 x 4 x 1 x 3

Share and Cite

MDPI and ACS Style

Rajareega, S.; Vimala, J.; Preethi, D. Complex Intuitionistic Fuzzy Soft Lattice Ordered Group and Its Weighted Distance Measures. Mathematics 2020, 8, 705. https://doi.org/10.3390/math8050705

AMA Style

Rajareega S, Vimala J, Preethi D. Complex Intuitionistic Fuzzy Soft Lattice Ordered Group and Its Weighted Distance Measures. Mathematics. 2020; 8(5):705. https://doi.org/10.3390/math8050705

Chicago/Turabian Style

Rajareega, S., J. Vimala, and D. Preethi. 2020. "Complex Intuitionistic Fuzzy Soft Lattice Ordered Group and Its Weighted Distance Measures" Mathematics 8, no. 5: 705. https://doi.org/10.3390/math8050705

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

Article Metrics

Back to TopTop