Next Article in Journal
Distinction of Human and Mechanical Vibrations within Similar Frequency Bands Based on Wavelet Entropy Using Ultrawideband Radar
Previous Article in Journal
Role and Properties of Proteins and Peptides in Foods
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Einstein Aggregation Operators under Bipolar Neutrosophic Environment with Applications in Multi-Criteria Decision-Making

1
Military College of Signal, National University of Sciences and Technology, Islamabad 44000, Pakistan
2
Department of Mathematics, Art and Science Faculty, Siirt University, 56100 Siirt, Turkey
3
Department of Mathematics, Mathematics Research Center, Near East University, Near East Boulevard, Mersin 10, 99138 Nicosia, Turkey
4
Department of Mathematics, Abdul Wali Khan University, Mardan 23200, Pakistan
5
Faculty of Technical Physics, Information Technology and Applied Mathematics, Lodz University of Technology, 90-924 Lodz, Poland
6
Faculty of Mechanical Engineering, Lodz University of Technology, 90-924 Lodz, Poland
*
Authors to whom correspondence should be addressed.
Appl. Sci. 2022, 12(19), 10045; https://doi.org/10.3390/app121910045
Submission received: 4 September 2022 / Revised: 27 September 2022 / Accepted: 29 September 2022 / Published: 6 October 2022

Abstract

:
In this article, we introduce bipolar neutrosophic (BN) aggregation operators (AOs) as a revolutionary notion in aggregation operators (AOs) by applying Einstein operations to bipolar neutrosophic aggregation operators (AOs), with its application related to a real-life problem. The neutrosophic set is able to drawout the incomplete, inconsistent and indeterminate information pretty efficiently. Initially, we present essential definitions along with operations correlated to the neutrosophic set (NS) and its generalization, the bipolar neutrosophic set (BNS). The Einstein aggregation operators are our primary targets, such asthe BN Einstein weighted average (BNEWA), BN Einstein ordered weighted average (BNEOWA), BN Einstein hybrid average (BNEHA), BN Einstein weighted geometric (BNEWG), BN Einstein ordered weighted geometric (BNEOWG) and BN Einstein hybrid geometric (BNEHG), as well as their required properties. The most important benefit of using the suggested approaches is that they provide decision-makers with complete sight of the issue. These techniques, when compared to other methods, provide complete, progressive and precise findings. Lastly, by means of diverse types of newly introduced aggregation operators and a numerical illustration by an example, we suggest an innovative method to be used for multi-criteria community decision-making (DM). This illustrates the utility and applicability of this new strategy when facing real-world problems.

1. Introduction

In the modern age of managerial decision-making (DM), knowledge frequently remains incomplete, undetermined and incompatible. L. A. Zadeh was the first to propose the fuzzy set theory [1], which deals with uncertainty and has applications in a wide range of modern fields of present and future society. Yet, fuzzy set has a problem in that it can simply convey the value of membership butnot non-membership. To address this, Atanassov [2] developed the intuitionistic fuzzy set (IFS), as well as associated theory, in order to summarizethe concept of fuzzy set.A pair of membership values is used to represent each IFS element, truth-membership χ and a non-membership value (falsity-membership) ƒ χ , as well as satisfy the condition χ , ƒ χ 0 , 1 with 0 χ + ƒ χ 1 . IFS can only handle incomplete data, meaningindeterminate data are not an option.
Florentin Smarandache [3] developed the novel concept of NS, which adds an indeterminacy membership value Ι χ to IFS. NS has a strong ability to deal with knowledge that is imperfect, uncertain and contradicting.
When χ + Ι χ + ƒ χ < 1 , the information acquired is indeterminate.
When χ + Ι χ + ƒ χ > 1 , this represents inconsistency in an NS.
Wang and others devised the single-valued neutrosophic set (SVNS) to deal with real-world situations [4], with the conditions χ , Ι χ , ƒ χ 0 , 1 and 0 χ + Ι χ + ƒ χ 3 . Ye [5] proposed a method for comparing SVNS, and defined the correlation coefficient.Wang et al. formulated an interval-valued neutrosophic set [6] and broadened the values of truth, indeterminacy and false memberships, which are all between 0 and 1.
For researchers, aggregation operators (AOs) are extremely important.Since its introduction, several scientists [7,8,9,10,11,12,13,14] have contributed significantly to the theory development of IFS. Xu et al. [15] introduced the concept of distinct IF aggregation operators based on IFS (AOs).Wang et al. and Zhao et al. [16,17] created Einstein aggregation operators (AOs). The Einstein t-norm typically gives the same smooth approximations as the product and sum of algebra.
The algebraic t-norm (product ) and t-conorm (sum ), respectively, are as below:
T a , b = a b = a b T a , b = a b = a + b a b
The Einstein operations t-norm (product ) and t-conorm (sum ), respectively, are as below:
T a , b = a b = a b 1 + 1 a 1 b T a , b = a b = a + b 1 + a b
The bipolar fuzzy set (BFS) [18,19,20] has emerged as a new technique to deal with vagueness in DM situations.The bipolar fuzzy set’s membership degree varies between −1 and 1. Positive as well as negative membership degrees are available in BFS. BFSs are incredibly beneficial for several fields of study, as well as DM [21,22]. Gul [23] defined bipolar averaging and geometric aggregations operators (AOs). The bipolar neutrosophic set was created by Irfan and others [24,25] by using fundamental operations and a comparison mechanism [26,27]. Jamil and others created aggregation operators (AOs) based on BN values and applied them to DM problems. Heronian mean aggregation operators were developed by Fan and others [28]. Abdullah et al. introduced the idea of a bipolar soft set and its application to decision-making [29]. Jafar and other developed a bipolar neutrosophic soft set and applied itto decision-making [30]. Ali et al. introduced complex fuzzy set and its properties [31]. Broumi et al. introduced bipolar complex fuzzy set and its aggregation operators [32]. Jamil and others applieda multi-criteria decision-making approach to the bipolar neutrosophic set [33].
Regardless of the available information, there isa lot of literature related to the subject. The following features of the bipolar neutrosophic set inspired the present research team to perform a systematic and in-depth inquiry into decision analysis. Our findings are given below:
SVNSs deal with ambiguous details easily. This set combines the generalization of prior sets such as the classical set, the FS set and the IFS set.BFSs are highly effective for dealing withunpredictable, unexpected real-world circumstances because these can handle both positive as well as negative membership values.
The current study’s main and most important goals were as follows:
  • To suggest different bipolar neutrosophic Einstein AOs as well as desired properties to study;
  • Based on BNN, establish a multi-criteria DM approach in the direction of real life problem-solving;
  • Give a numerical description of amulti-criteria DM example.
The remainder of the paper is organized at follows. The second segment presents a basic definition as well as its associated properties.The BNEWA and BNEWG aggregation operators are introduced in the Section 3.These innovative AOs are applied to multi-criteria decision-making in Section 4, and a numerical example is also presented.Finally, we offer comparative research, as well as some concluding thoughts, in Section 5.

2. Preliminaries

In this section, we provide fundamental definitions related to neutrosophic set theory. We define different fuzzy sets, BNS, scorefunctions, accuracyfunctions, and certainty functions, as well as the Einstein operations.
Definition 1 [3]. 
Consider R to represent a fixed set. Then, the neutrosophic set N is defined as:
N =     χ ,   χ , Ι χ , ƒ χ     |   χ R
Now, the mapping for membership functions of truth, indeterminacy and falsity are : N Q , Ι : N Q and ƒ : N Q , respectively; here, Q = 0 , 1 + and 0 χ + Ι χ + ƒ χ 3 + .
Definition 2 [4]. 
Consider P to represent a fixed set; the single-valued neutrosophic set (SVNS) of A is stated as:
A N S = χ , χ , Ι χ , ƒ χ | χ P
Now, here, the mapping for membership functions of truth, indeterminacy and falsity are : A N S L , Ι : A N S L and ƒ : A N S L , respectively; here, L = 0 , 1 and there is the condition 0 χ + Ι χ + ƒ χ 3 .
Some fundamental operations related to single-valued neutrosophic sets (SVNS) are listed below:
A N S = χ , A N S χ , Ι A N S χ , ƒ A N S χ | χ P ,   B N S = χ , B N S χ , Ι B N S χ , ƒ B N S χ | χ P ,  
The subset A N S B N S is represented as
A N S χ B N S χ , Ι A N S χ Ι B N S χ , ƒ A N S χ ƒ B N S χ .
A N S = B N S is represented as
A N S χ = B N S χ , Ι A N S χ = Ι B N S χ , ƒ A N S χ = ƒ B N S χ .
The complement A N S is
A N S = χ , ƒ A N S χ , 1 Ι A N S χ , A N S χ | χ P
A N S B N S is represented as
A N S B N S = χ , min A N S χ , B N S χ , max Ι A N S χ , Ι B N S χ , max ƒ A N S χ , ƒ B N S χ | χ P  
The union is defined by
A N S B N S = χ , max A N S χ , B N S χ , min Ι A N S χ , Ι B N S χ , min ƒ A N S χ , ƒ B N S χ | χ P  
Definition 3 [5]. 
Consider two single-valued neutrosophic numbers (SVNNs) u 1 = 1 , Ι 1 , ƒ 1 and u 2 = 2 , Ι 2 , ƒ 2 . The following are the distinct basic operations for SVNNs:
u 1 + u 2 = 1 + 2 1 2 , Ι 1 Ι 2 , ƒ 1 ƒ 2 ;   u 1 u 2 = 1 + 2 , Ι 1 + Ι 2 Ι 1 Ι 2 , ƒ 1 + ƒ 2 ƒ 1 ƒ 2 ;   λ u 1 = 1 1 1 λ , Ι 1 λ , ƒ 1 λ ;   u 1 λ = 1 λ , 1 1 Ι 1 λ , 1 1 ƒ 1 λ ;  
where λ > 0 .
Definition 4 [5]. 
Let u 1 = 1 , Ι 1 , ƒ 1 be a single-valued neutrosophic number (SVNN). Then, the score function s u 1 is defined below:
s u 1 = 1 + 1 Ι 1 + 1 ƒ 1 3 ;
Definition 5 [5]. 
The accuracy function for an SVNN u 1 = 1 , Ι 1 , ƒ 1 is denoted by u 1 , defined below:
u 1 = 1 ƒ 1 ;    
Definition 6 [5]. 
The certainty function for an SVNN u 1 = 1 , Ι 1 , ƒ 1 is denoted by c u 1 , defined below:
c u 1 = 1
Definition 7 [5]. 
Consider two SVNNs u 1 = 1 , Ι 1 , ƒ 1 and u 2 = 2 , Ι 2 , ƒ 2 . The following is the relationship between them:
i. 
In condition s ( u 1 ) > s ( u 2 ) , then u 1 is greater than u 2 , denoted by u 1 > u 2 ;
ii. 
In condition s ( u 1 ) = s ( u 2 ) and a u 1 > a u 2 , then u 1 is greater than u 2 , denoted by u 1 > u 2 ;
iii. 
In condition s ( u 1 ) = s ( u 2 ) , a u 1 = a u 2 and c ( u 1 ) > c ( u 2 ) , in that case, u 1 is superior to u 2 , denoted by u 1 > u 2 ;
iv. 
In condition s ( u 1 ) = s ( u 2 ) , a u 1 = a u 2 and c ( u 1 ) = c ( u 2 ) , in that case, u 1 is equal to u 2 , denoted by u 1 = u 2 ;
Definition 8 [21]. 
Consider P as a universal set. Then, the bipolar fuzzy set (BFS) is stated below:
F = χ , F + χ , ƒ F χ | χ P
where F + χ : F L + represents a positive membership function and the negative membership function is ƒ F χ : F K , where L + = 0 , 1 and K = 1 , 0 .
Definition 9 [25]. 
Suppose A is a bipolar neutrosophic set contained by universal set P, stated as:
A = χ , + χ , Ι + χ , ƒ + χ , χ , Ι χ , ƒ χ | χ P
Let + χ , Ι + χ , ƒ + χ = B N + as well as χ , Ι χ , ƒ χ = B N .
Here, + χ , Ι + χ , ƒ + χ are positive membership functions representingtrue, indeterminate and false for χ P , and χ , Ι χ , ƒ χ represent true, indeterminate and false for negative membership functions. Now, when mapping B N + : A L + and B N : A L , here, L + = 0 , 1 and L = 1 , 0 . This applies with the condition 0 + χ + Ι + χ + ƒ + χ + χ + Ι χ + ƒ χ 6 .
Example 1. 
Let P = χ 1 , χ 2 , χ 3 , then
A = χ 1 , 0.1 , 0.5 , 0.3 , 0.4 , 0.5 , 0.6 , χ 2 , 0.2 , 0.7 , 0.4 , 0.3 , 0.6 , 0.2 , χ 3 , 0.4 , 0.6 , 0.7 , 0.2 , 0.3 , 0.1
is a subset of universal set P that is BNS.
Some fundamental operations [12] used for BNSs are stated below:
Let A 1 = χ , 1 + χ , Ι 1 + χ , ƒ 1 + χ , 1 χ , Ι 1 χ , ƒ 1 χ | χ P and A 2 = χ , 2 + χ , Ι 2 + χ , ƒ 2 + χ , 2 χ , Ι 2 χ , ƒ 2 χ | χ P be two BNSs.
i.
Then, A 1 A 2 if and only if
1 + χ 2 + χ , Ι 1 + χ Ι 2 + χ , ƒ 1 + χ ƒ 2 + χ ,
and
1 χ 2 χ , Ι 1 χ Ι 2 χ , ƒ 1 χ ƒ 2 χ
ii. 
A 1 = A 2 if and only if
1 + χ = 2 + χ , Ι 1 + χ = Ι 2 + χ , ƒ 1 + χ = ƒ 2 + χ ,
and
1 χ = 2 χ , Ι 1 χ = Ι 2 χ , ƒ 1 χ = ƒ 2 χ
iii. 
The union is defined as below:
A 1 A 2 = max 1 + χ , 2 + χ , Ι 1 + χ + Ι 2 + χ 2 , min ƒ 1 + χ , ƒ 2 + χ , min 1 χ , 2 χ , Ι 1 χ + Ι 2 χ 2 , max ƒ 1 χ , ƒ 2 χ ,
iv. 
The intersection is defined as:
A 1 A 2 = min 1 + χ , 2 + χ , Ι 1 + χ + Ι 2 + χ 2 , max ƒ 1 + χ , ƒ 2 + χ , max 1 χ , 2 χ , Ι 1 χ + Ι 2 χ 2 , min ƒ 1 χ , ƒ 2 χ ,
v. 
Let A = χ , + χ , Ι + χ , ƒ + χ , χ , Ι χ , ƒ χ | χ P be BNSs.
Then, the complement A is defined as:
A + χ = 1 + A + χ , Ι A + χ = 1 + Ι A + χ , ƒ A + χ = 1 + ƒ A + χ ,
and
A χ = 1 A χ , Ι A χ = 1 Ι A χ , ƒ A χ = 1 ƒ A χ ,
Definition 10 [25]. 
Consider two bipolar neutrosophic numbers (BNNs) u 1 = 1 + , Ι 1 + , ƒ 1 + , 1 , Ι 1 , ƒ 1 and u 2 = 2 + , Ι 2 + , ƒ 2 + , 2 , Ι 2 , ƒ 2 . The following are the basic operations between two BNNs:
i . u 1 + u 2 = 1 + + 2 + 1 + 2 + , Ι 1 + Ι 2 + , ƒ 1 + ƒ 2 + , 1 2 , Ι 1 Ι 2 Ι 1 Ι 2 , ƒ 1 ƒ 2 ƒ 1 ƒ 2 ; ii . u 1 u 2 = 1 + 2 + , Ι 1 + + Ι 2 + Ι 1 + Ι 2 + , ƒ 1 + + ƒ 2 + ƒ 1 + ƒ 2 + , 1 2 1 2 , Ι 1 Ι 2 , ƒ 1 ƒ 2 ;   iii . λ u 1 = 1 1 1 + λ , Ι 1 + λ , ƒ 1 + λ , 1 λ , Ι 1 λ , 1 1 ƒ 1 λ ;   iv . u 1 λ = 1 + λ , 1 1 Ι 1 + λ , 1 1 ƒ 1 + λ , 1 1 1 λ , Ι 1 λ , ƒ 1 λ ;  
where λ > 0 .
Definition 11 [25]. 
The score function for a bipolar neutrosophic number u = + , Ι + , ƒ + , , Ι , ƒ denoted by S u is:
S u = 1 6 + + 1 Ι + + 1 ƒ + + 1 + Ι ƒ
Definition 12 [25]. 
The accuracy function defined for a BNN u = + , Ι + , ƒ + , , Ι , ƒ is a u , as below:
a u = + ƒ + + ƒ
Definition 13 [25]. 
Consider u = + , Ι + , ƒ + , , Ι , ƒ to represent the neutrosophic number. Then, thecertainty function is:
c u =   + ƒ
Definition 14 [25]. 
Consider u 1 = 1 + , Ι 1 + , ƒ 1 + , 1 , Ι 1 , ƒ 1 and u 2 = 2 + , Ι 2 + , ƒ 2 + , 2 , Ι 2 , ƒ 2 to represent two BNNs. Then, acomparison method among BNNs is:
i. 
In condition S ( u 1 ) S ( u 2 ) then u 1 is greater than u 2 , denoted by u 1 u 2
ii. 
In condition S ( u 1 ) = S ( u 2 ) and a ( u 1 ) a ( u 2 ) then u 1 is greater than u 2 , denoted by u 1 u 2 ;
iii. 
In condition S ( u 1 ) = S ( u 2 ) , a ( u 1 ) = a ( u 2 ) and c ( u 1 ) c ( u 2 ) in that case, u 1 is superior to u 2 , denote by u 1 u 2 ;
iv. 
In condition S ( u 1 ) = S ( u 2 ) , a ( u 1 ) = a ( u 2 ) and c ( u 1 ) = c ( u 2 ) in that case, u 1 is equal to u 2 , denoted by u 1 = u 2 .
Definition 15.
Consider u = + , Ι + , ƒ + , , Ι , ƒ , u 1 = 1 + , Ι 1 + , ƒ 1 + , 1 , Ι 1 , ƒ 1 and u 2 = 2 + , Ι 2 + , ƒ 2 + , 2 , Ι 2 , ƒ 2 to be BNNs, and λ 0 any real value. Then, the fundamental Einstein operations of BNNs are:
u 1 u 2 = 1 + + 2 + 1 + 1 + 2 + , Ι 1 + Ι 2 + 1 + 1 Ι 1 + 1 Ι 2 + , ƒ 1 + ƒ 2 + 1 + 1 ƒ 1 + 1 ƒ 2 + , 1 2 1 + 1 + 1 1 + 2 , Ι 1 Ι 2 1 + Ι 1 Ι 2 , ƒ 1 ƒ 2 1 + ƒ 1 ƒ 2 u 1 u 2 = 1 + 2 + 1 + 1 1 + 1 2 + , Ι 1 + + Ι 2 + 1 + Ι 1 + Ι 2 + , ƒ 1 + + ƒ 2 + 1 + ƒ 1 + ƒ 2 + , 1 2 1 + 1 2 , Ι 1 Ι 2 1 + 1 + Ι 1 1 + Ι 2 , ƒ 1 ƒ 2 1 + 1 + ƒ 1 1 + ƒ 2 λ u = 1 + + λ 1 + λ 1 + + λ + 1 + λ , 2 Ι + λ 2 Ι + λ + Ι + λ , 2 ƒ + λ 2 ƒ + λ + ƒ + λ , 2 λ 2 + λ + λ , 2 Ι λ 2 + Ι λ + Ι λ , 1 + ƒ λ 1 + ƒ λ 1 + ƒ λ + 1 + ƒ λ u λ = 2 + λ 2 + λ + + λ , 1 + Ι + λ 1 Ι + λ 1 + Ι + λ + 1 Ι + λ , 1 + ƒ + λ 1 ƒ + λ 1 + ƒ + λ + 1 ƒ + λ , 1 + λ 1 + λ 1 + λ + 1 + λ , 2 Ι λ 2 + Ι λ + Ι λ , 2 ƒ λ 2 + ƒ λ + ƒ λ

3. Bipolar Neutrosophic Einstein Average AOs

Here, we suggest a number of fundamental properties for bipolar Einsteinaverage AOs in the current section of the article, such as BNEWA, BNEOWA and BNEHA.

3.1. Bipolar NeutrosophicEinstein Weighted-Average Aggregation Operators

Consider u l = l + , Ι l + , ƒ l + , l , Ι l , ƒ l to represent a family of BNNs. Here, l 1 , 2 , 3 , , n
Definition 16.
The (BNEWA) aggregation operator is defined as follows:
B N E W A ν u 1 , u 2 , , u n = l = 1 n ν l u l = ν 1 u 1 ν 2 u 2 ν n u n
where ν = ν 1 , ν 2 , , ν n T represents weighted vectors of u l , that is, ν l > 0 and l = 1 n ν l = 1 .
Theorem1. 
The (BNEWA) operator gives in return a (BNV) by
B N E W A ν u 1 , u 2 , , u n = Ђ 1 Ђ 2 Ђ 1 + Ђ 2 , 2 ζ 1 ζ 2 + ζ 1 , 2 f 1 f 2 + f 1 , 2 Ђ 3 Ђ 4 + Ђ 3 , ζ 3 ζ 4 ζ 3 + ζ 4 , f 3 f 4 f 3 + f 4
where
Ђ 1 = l = 1 n 1 + l + ν l , Ђ 2 = l = 1 n 1 l + ν l , Ђ 3 = l = 1 n l ν l   ,   Ђ 4 = l = 1 n 2 + l ν l , ζ 1 = l = 1 n Ι l + ν l , ζ 2 = l = 1 n 2 Ι l + ν l , ζ 3 = l = 1 n 1 + Ι l ν l , ζ 4 = l = 1 n 1 + Ι l ν l , f 1 = l = 1 n ƒ l + ν l , f 2 = l = 1 n 2 ƒ l + ν l , f 3 = l = 1 n 1 + ƒ l ν l , f 4 = l = 1 n 1 + ƒ l ν l .    
where ν = ν 1 , ν 2 , , ν n T is the weighted vector of u l ,such that ν l > 0 and l = 1 n ν l = 1 .
Proof. 
Now, by mathematical induction:
For n = 2 ,
ν 1 u 1 = 1 + 1 + ν 1 1 1 + ν 1 1 + 1 + ν 1 + 1 1 + ν 1 , 2 Ι 1 + ν 1 2 Ι 1 + ν 1 + Ι 1 + ν 1 , 2 ƒ 1 + ν 1 2 ƒ 1 + ν 1 + ƒ 1 + ν 1 , 2 1 ν 1 2 + 1 ν 1 + 1 ν 1 , 2 Ι 1 ν 1 2 + Ι 1 ν 1 + Ι 1 ν 1 , 1 + ƒ 1 ν 1 1 + ƒ 1 ν 1 1 + ƒ 1 ν 1 + 1 + ƒ 1 ν 1
and
ν 2 u 2 = 1 + 2 + ν 2 1 2 + ν 2 1 + 2 + ν 2 + 1 2 + ν 2 , 2 Ι 2 + ν 2 2 Ι 2 + ν 2 + Ι 2 + ν 2 , 2 ƒ 2 + ν 2 2 ƒ 2 + ν 2 + ƒ 2 + ν 2 , 2 2 ν 2 2 + 2 ν 2 + 2 ν 2 , 2 Ι 2 ν 2 2 + Ι 2 ν 2 + Ι 2 ν 2 , 1 + ƒ 2 ν 2 1 + ƒ 2 ν 2 1 + ƒ 2 ν 2 + 1 + ƒ 2 ν 2
and for
ν 1 u 1 = 1 + 1 + 1 1 + 1 + 1 + + 1 1 + , 2 Ι 1 + 2 Ι 1 + + Ι 1 + , 2 ƒ 1 + 2 ƒ 1 + + ƒ 1 + , 2 1 2 + 1 + 1 , 1 + Ι 1 1 + Ι 1 1 + Ι 1 + 1 + Ι 1 , 1 + ƒ 1 1 + ƒ 1 1 + ƒ 1 + 1 + ƒ 1 , ν 1 u 1 = 1 + 1 + 1 1 + 1 + 1 + + 1 1 + , 2 Ι 1 + 2 Ι 1 + + Ι 1 + , 2 ƒ 1 + 2 ƒ 1 + + ƒ 1 + , 2 1 2 + 1 + 1 , 1 + Ι 1 1 + Ι 1 1 + Ι 1 + 1 + Ι 1 , 1 + ƒ 1 1 + ƒ 1 1 + ƒ 1 + 1 + ƒ 1 ,
thus satisfying n = 1 .
We put n = r into Equation (3)
B N E W A ν u 1 , u 2 , , u r = l = 1 r 1 + l + ν l l = 1 r 1 l + ν l l = 1 r 1 + l + ν l + l = 1 r 1 l + ν l , 2 l = 1 r Ι l + ν l l = 1 r 2 Ι l + ν l + l = 1 r Ι l + ν l , 2 l = 1 r ƒ l + ν l l = 1 r 2 ƒ l + ν l + l = 1 r ƒ l + ν l , 2 l = 1 r l ν l l = 1 r 2 + l ν l + l = 1 r l ν l , 2 l = 1 r Ι l ν l l = 1 r 2 + Ι l ν l + l = 1 r Ι l ν l , l = 1 k 1 + ƒ l ν l l = 1 r 1 + ƒ l ν l l = 1 r 1 + ƒ l ν l + l = 1 r 1 + ƒ l ν l ,
Assume it is also satisfied for n = r .
Now, for n = r + 1 ,
B N E W A ν u 1 , u 2 , , u r = l = 1 r 1 + l + ν l l = 1 r 1 l + ν l l = 1 r 1 + l + ν l + l = 1 r 1 l + ν l , 2 l = 1 r Ι l + ν l l = 1 r 2 Ι l + ν l + l = 1 r Ι l + ν l , 2 l = 1 r ƒ l + ν l l = 1 r 2 ƒ l + ν l + l = 1 r ƒ l + ν l , 2 l = 1 r l ν l l = 1 r 2 + l ν l + l = 1 r l ν l , 2 l = 1 r Ι l ν l l = 1 r 2 + Ι l ν l + l = 1 r Ι l ν l , l = 1 r 1 + ƒ l ν l l = 1 r 1 + ƒ l ν l l = 1 r 1 + ƒ l ν l + l = 1 r 1 + ƒ l ν l 1 + r + 1 + ν r + 1 1 r + 1 + ν r + 1 1 + r + 1 + ν r + 1 + 1 r + 1 + ν r + 1 , 2 Ι r + 1 + ν r + 1 2 Ι r + 1 + ν r + 1 + Ι r + 1 + ν r + 1 , 2 ƒ r + 1 + ν r + 1 2 ƒ r + 1 + ν r + 1 + ƒ r + 1 + ν r + 1 , 2 r + 1 ν r + 1 2 + r + 1 ν r + 1 + r + 1 ν r + 1 , 2 Ι r + 1 ν r + 1 2 + Ι r + 1 ν r + 1 + Ι r + 1 ν r + 1 , 1 + ƒ r + 1 ν r + 1 1 + ƒ r + 1 ν r + 1 1 + ƒ r + 1 ν r + 1 + 1 + ƒ r + 1 ν r + 1 = l = 1 r + 1 1 + l + ν l l = 1 r + 1 1 l + ν l l = 1 r + 1 1 + l + ν l + l = 1 r + 1 1 l + ν l , 2 l = 1 r + 1 Ι l + ν l l = 1 r + 1 2 Ι l + ν l + l = 1 r + 1 Ι l + ν l , 2 l = 1 r + 1 ƒ l + ν l l = 1 r + 1 2 ƒ l + ν l + l = 1 r + 1 ƒ l + ν l , 2 l = 1 r + 1 l ν l l = 1 r + 1 2 + l ν l + l = 1 r + 1 l ν l , l = 1 r + 1 1 + Ι l ν l l = 1 r + 1 1 + Ι l ν l l = 1 r + 1 1 + Ι l ν l + l = 1 r + 1 1 + Ι l ν l , l = 1 r + 1 1 + ƒ l ν l l = 1 r + 1 1 + ƒ l ν l l = 1 r + 1 1 + ƒ l ν l + l = 1 r + 1 1 + ƒ l ν l
Hence, Equation (3) is satisfied for all values of n = r + 1 .
Hence, the theorem is proven.□
Theorem 2.
(Idempotency) Let u l = l + , Ι l + , ƒ l + , l , Ι l , ƒ l , where l 1 , 2 , , n 1 , n represents a collection of equal BNNs, that is, u l = u . Then
B N E W A ν u 1 , u 2 , , u n = u
Proof. 
Since
B N E W A ν u 1 , u 2 , , u n = l = 1 n ν l u l = l = 1 n ν l u = u l = 1 n ν l = u
the proof is complete.□
Theorem 3.
(Bounded) Suppose that u + = max l u l and u = min l u l represent the minimum and maximum BNN, respectively
u B N E W A ν u 1 , u 2 , , u n u +
Proof. 
Let
B N E W A ν u 1 , u 2 , , u n = u + , Ι + , ƒ + , , Ι , ƒ
Then,
s u s B N E W A   operator   s u s B N E W A   operator   s u + s B N E W A   operator
Combining both equations, we have
u B N E W A ν u 1 , u 2 , , u n u +
Thus, the proof is complete.□
Theorem 4.
(Monotonicity) Suppose u l = l + , Ι l + , ƒ l + , l , Ι l , ƒ l and u l = l + , Ι l + , ƒ l + , l , Ι l , ƒ l , where l 1 , 2 , , n 1 , n represents BNNs. If u l u l , then
B N E W A ν u 1 , u 2 , , u n B N E W A ν u 1 , u 2 , , u n
Proof. 
Assume that
B N E W A ν u 1 , u 2 , , u n = l = 1 n ν l u l
and
B N E W A ν u 1 , u 2 , , u n = l = 1 n ν l u l
Since u l u l ,then
l = 1 n ν l u l l = 1 n ν l u l
Thus, the proof is complete.□

3.2. BN Einstein OrderedWeighted Average Aggregation Operators

Definition 17.
The (BNEOWA)BN Einstein ordered weighted-average AOis stated as:
B N E O W A ν u 1 , u 2 , , u n = l = 1 n ν l u ρ l = ν 1 u ρ 1 ν 2 u ρ 2 ν 3 u σ 3 ν n u ρ n ,
where ρ 1 , ρ 2 , ρ 3 , , ρ n represents a permutation with u ρ l 1 u ρ l , l Z , Z = 1 , 2 , , n 1 , n and ν = ν 1 , ν 2 , , ν n T representing associated weighting vectors for u l with ν l > 0 , l = 1 n ν l = 1 .
Theorem 5.
The (BNEOWA) operator gives, in return, a BNV, by
B N E O W A ν u 1 , u 2 , , u n = Ђ 1 Ђ 2 Ђ 1 + Ђ 2 , 2 ζ 1 ζ 2 + ζ 1 , 2 f 1 f 2 + f 1 , 2 Ђ 3 Ђ 4 + Ђ 3 , ζ 3 ζ 4 ζ 3 + ζ 4 , f 3 f 4 f 3 + f 4  
where,
Ђ 1 = l = 1 n 1 + ρ l + ν l , Ђ 2 = l = 1 n 1 ρ l + ν l , Ђ 3 = l = 1 n ρ l ν l   ,   Ђ 4 = l = 1 n 2 + ρ l ν l , ζ 1 = l = 1 n Ι ρ l + ν l , ζ 2 = l = 1 n 2 Ι ρ l + ν l , ζ 3 = l = 1 n 1 + Ι ρ l ν l , ζ 4 = l = 1 n 1 + Ι ρ l ν l , f 1 = l = 1 n ƒ ρ l + ν l , f 2 = l = 1 n 2 ƒ ρ l + ν l , f 3 = l = 1 n 1 + ƒ ρ l ν l , f 4 = l = 1 n 1 + ƒ ρ l ν l .  
where ρ 1 , ρ 2 , , ρ n represents a permutation with u ρ l 1 u ρ l , l Z , Z = 1 , 2 , , n 1 , n and ν = ν 1 , ν 2 , , ν n T representing associated weighting vectors for u l with ν l > 0 and l = 1 n ν l = 1 .
Proof. 
The proof follows from Theorem 1.□
Theorem 6. 
(Commutativity) Let u l = l + , Ι l + , ƒ l + , l , Ι l , ƒ l , as well as u l = l + , Ι l + , ƒ l + , l , Ι l , ƒ l , where l Z represents two BNNs.
B N E O W A ϖ u 1 , u 2 , , u n = B N E O W A ϖ u 1 , u 2 , , u n
where u 1 , u 2 , , u n is any permutation of u 1 , u 2 , , u n .
Proof. 
Assume that
B N E O W A ν u 1 , u 2 , , u n = l = 1 n ν l u ρ l
and
B N E O W A ν u 1 , u 2 , , u n = l = 1 n ν l u ρ l
Since u 1 , u 2 , , u n is any permutation of u 1 , u 2 , , u n , then
l = 1 n ν l u ρ l = l = 1 n ν l u ρ l
The proof is complete.□
Theorem 7.
(Idempotency) Let u l = l + , Ι l + , ƒ l + , l , Ι l , ƒ l , where l Z . Z = 1 , 2 , , n 1 , n is a collection of all equal BNNs, i.e., u l = u :
B N E O W A ν u 1 , u 2 , u 3 , , u n = u
Proof. 
The prooffollows from Theorem 2.□
Theorem 8.
(Bounded) Consider u = min l u l , u + = max l u l to represent the minimum and maximum BNN, respectively
u B N E O W A ν u 1 , u 2 , , u n u +
Proof. 
The proof follows from Theorem 3.□
Theorem 9.
(Monotonicity) Let u l = l + , Ι l + , ƒ l + , l , Ι l , ƒ l , and u l = l + , Ι l + , ƒ l + , l , Ι l , ƒ l , where l Z represents BNNs. If u l u l ,
B N E O W A ϖ u 1 , u 2 , , u n B N E O W A ϖ u 1 , u 2 , , u n
Proof. 
The proof follows from Theorem 4.□

3.3. BN Einstein Hybrid Average Aggregation Operators

Definition 18.
The (BNEHA) BN Einstein hybrid average AO is stated as:
B N E H A w , ν u 1 , u 2 , , u n = l = 1 n ν l u ˙ ρ l = ν 1 u ˙ ρ 1 ν 2 u ˙ ρ 2 ν 3 u ˙ ρ 3 ν n u ˙ ρ n ,
where w = w 1 , w 2 , w 3 , , w n 1 , w n is a weighting vector of u l , such that w l 0 , 1 , l = 1 n w l = 1 and u ˙ ρ l are the l -th biggest component of the BN argument u ˙ l u ˙ l = n ν l u l , l = 1 , 2 , , n , and ν = ν 1 , ν 2 , , ν n is the weighting vector of BN argument u l ,along with ν l 0 , 1 , l = 1 n ν l = 1 . Here, n represents a balancing coefficient.
Note that BNEHA reduces to BNEWA if w = 1 n , 1 n , , 1 n T or the BNEOWA operator if ν = 1 n , 1 n , , 1 n .
Theorem 10.
The (BNEHA) operator precedesa BN number with
B N E H A w , ν u 1 , u 2 , , u n = Ђ 1 Ђ 2 Ђ 1 + Ђ 2 , 2 ζ 1 ζ 2 + ζ 1 , 2 f 1 f 2 + f 1 , 2 Ђ 3 Ђ 4 + Ђ 3 , ζ 3 ζ 4 ζ 3 + ζ 4 , f 3 f 4 f 3 + f 4  
where,
Ђ 1 = l = 1 n 1 + ˙ ρ l + ν l , Ђ 2 = l = 1 n 1 ˙ ρ l + ν l , Ђ 3 = l = 1 n ˙ ρ l ν l   ,   Ђ 4 = l = 1 n 2 + ˙ ρ l ν l , ζ 1 = l = 1 n Ι ˙ ρ l + ν l , ζ 2 = l = 1 n 2 Ι ˙ ρ l + ν l , ζ 3 = l = 1 n 1 + Ι ˙ ρ l ν l , ζ 4 = l = 1 n 1 + Ι ˙ ρ l ν l , f 1 = l = 1 n ƒ ˙ ρ l + ν l , f 2 = l = 1 n 2 ƒ ˙ ρ l + ν l , f 3 = l = 1 n 1 + ƒ ˙ ρ l ν l , f 4 = l = 1 n 1 + ƒ ˙ ρ l ν l .  
where w = w 1 , w 2 , w 3 , , w n 1 , w n is a weighting vector for u l , by means of w l 0 , 1 , l = 1 n w l = 1 , and u ˙ ρ l is the l -th biggest component of BN argument u ˙ l u ˙ l = n ν l u l , l = 1 , 2 , , n . Moreover, ν = ν 1 , ν 2 , , ν n is the weighting vector of BN argument u l ,with ν l 0 , 1 , l = 1 n ν l = 1 .
Proof. 
The theorem is straightforward.□

4. Bipolar Neutrosophic Einstein Geometric AOs

In the current section, we extend our study to bipolar neutrosophic Einstein geometric AOs, such as BNEWG, BNEOWG and BNHA, as well as their required properties.

4.1. Bipolar Neutrosophic EinsteinWeighted Geometric AO

Let u l = l + , Ι l + , ƒ l + , l , Ι l , ƒ l l = 1 , 2 , , n represent a family of bipolar neutrosophic values.
Definition 19. 
The (BNEWG) bipolar neutrosophic Einstein weighted geometric operator is defined as:
B N E W G ν u 1 , u 2 , u 3 , , u n = l = 1 n ν l u l = ν 1 u 1 ν 2 u 2 ν n u n
where ν = ν 1 , ν 2 , ν 3 , , ν n T is a weighting vector of u l , with ν l > 0 and l = 1 n ν l = 1 .
Theorem 11. 
The (BNEWG) operators return a BN value with
B N E W G ν u 1 , u 2 , u 3 , , u n = 2 Ђ 1 ˜ Ђ 2 ˜ + Ђ 1 ˜ , ζ 1 ˜ ζ 2 ˜ ζ 1 ˜ + ζ 2 ˜ , f 1 ˜ f 2 ˜ f 1 ˜ + f 2 ˜ , Ђ 3 ˜ Ђ 4 ˜ Ђ 3 ˜ + Ђ 4 ˜ , 2 ζ 3 ˜ ζ 4 ˜ + ζ 3 ˜ , 2 f 3 ˜ f 4 ˜ + f 3 ˜
where
Ђ 1 ˜ = l = 1 n l + ν l , Ђ 2 ˜ = l = 1 n 2 l + ν l , Ђ 3 ˜ = l = 1 n 1 + l ν l   ,   Ђ 4 ˜ = l = 1 n 1 + l ν l , ζ 1 ˜ = l = 1 n 1 + Ι l + ν l , ζ 2 ˜ = l = 1 n 1 Ι l + ν l , ζ 3 ˜ = l = 1 n Ι l ν l , ζ 4 ˜ = l = 1 n 2 + Ι l ν l , f 1 ˜ = l = 1 n 1 + ƒ l + ν l , f 2 ˜ = l = 1 n 1 ƒ l + ν l , f 3 ˜ = l = 1 n ƒ l ν l , f 4 ˜ = l = 1 n 2 + ƒ l ν l .
where ν = ν 1 , ν 2 , ν 3 , , ν n T is a weighting vector of u l , with ν l > 0 as well as l = 1 n ν l = 1 .
Proof. 
The proof follows from Theorem 1.□
Theorem 12.
(Idempotency) Let u l = l + , Ι l + , ƒ l + , l , Ι l , ƒ l l = 1 , 2 , 3 , , n be a set of equal BNVs, that is, u l = u
B N E W G ν u 1 , u 2 , u 3 , , u n = u
Proof. 
Since
B N E W G ν u 1 , u 2 , , u n = l = 1 n ν l u l = l = 1 n ν l u = u l = 1 n ν l = u
The proof is complete.□
Theorem 13.
(Bounded) Suppose that u = min l u l , u + = max l u l , then
u B N E W G ν u 1 , u 2 , , u n u +
Proof. 
Let
B N E W G ν u 1 , u 2 , , u n = u + , Ι + , ƒ + , , Ι , ƒ
Then
s u s B N E W G   operator   s u + s B N E W G   operator
Combining both equations, we have
u B N E W G ν u 1 , u 2 , , u n u +
Thus, the proof is complete.□
Theorem 14. 
(Monotonicity) Let u l = l + , Ι l + , ƒ l + , l , Ι l , ƒ l l = 1 , 2 , , n and u l = l + , Ι l + , ƒ l + , l , Ι l , ƒ l l = 1 , 2 , , n be a collection of BNVs. If u l u l , then
B N E W G ν u 1 , u 2 , , u n B N E W G ν u 1 , u 2 , , u n
Proof. 
Assume that
B N E W G ν u 1 , u 2 , , u n = l = 1 n ν l u l
and
B N E W G ν u 1 , u 2 , , u n = l = 1 n ν l u l
Since u l u l , then
l = 1 n ν l u l l = 1 n ν l u l
Thus, the proof is complete.□

4.2. BN Einstein OrderedWeighted Geometric Aggregation Operators

Definition 20.
The (BNEOWG) BN Einstein ordered weighted geometric AO is stated as:
B N E O W G ν u 1 , u 2 , , u n 1 , u n = l = 1 n ν l u σ l = ν 1 u σ 1 ν 2 u σ 2 ν 3 u σ 3 ν l u σ l ,
where σ 1 , , σ n 1 , σ n represents permutation ( 1 , 2 , 3 , , n 1 , n ) , that is, u σ l 1 u σ l and ( j = 2 , , n 1 , n ) , and ν = ν 1 , ν 2 , ν 3 , , ν n T is a weighting vector of u l , with ν l > 0 and l = 1 n ν l = 1 .
Theorem 15.
The (BNEOWG) operators return a BN value with
B N E O W G ν u 1 , u 2 , , u n = 2 Ђ 1 ˜ Ђ 2 ˜ + Ђ 1 ˜ , ζ 1 ˜ ζ 2 ˜ ζ 1 ˜ + ζ 2 ˜ , f 1 ˜ f 2 ˜ f 1 ˜ + f 2 ˜ , Ђ 3 ˜ Ђ 4 ˜ Ђ 3 ˜ + Ђ 4 ˜ , 2 ζ 3 ˜ ζ 4 ˜ + ζ 3 ˜ , 2 f 3 ˜ f 4 ˜ + f 3 ˜
where,
Ђ 1 ˜ = j = 1 n σ j + ω j , Ђ 2 ˜ = j = 1 n 2 σ j + ω j , Ђ 3 ˜ = j = 1 n 1 + σ j ω j   ,   Ђ 4 ˜ = j = 1 n 1 + σ j ω j , ζ 1 ˜ = j = 1 n 1 + Ι σ j + ω j , ζ 2 ˜ = j = 1 n 1 Ι σ j + ω j , ζ 3 ˜ = j = 1 n Ι σ j ω j , ζ 4 ˜ = j = 1 n 2 + Ι σ j ω j , f 1 ˜ = j = 1 n 1 + ƒ σ j + ω j , f 2 ˜ = j = 1 n 1 ƒ σ j + ω j , f 3 ˜ = j = 1 n ƒ σ j ω j , f 4 ˜ = j = 1 n 2 + ƒ σ j ω j .
where σ 1 , σ 2 , σ 3 , , σ n represents a permutation of ( 1 , 2 , , n ) with u σ l 1 u σ l and ( l = 2 , 3 , , n ) , and ν = ν 1 , ν 2 , ν 3 , , ν n T is a weighting vector of u l , with ν l > 0 and l = 1 n ν l = 1 .
Proof. 
The theorem is simple to understand.□
Theorem 16.
(Commutativity) Let u l = l + , Ι l + , ƒ l + , l , Ι l , ƒ l , as well as u l = l + , Ι l + , ƒ l + , l , Ι l , ƒ l , where l Z represents two BNNs.
B N E O W G ϖ u 1 , u 2 , , u n = B N E O W G ϖ u 1 , u 2 , , u n
where u 1 , u 2 , , u n is any permutation of u 1 , u 2 , , u n .
Proof. 
Assume that
B N E O W G ν u 1 , u 2 , , u n = l = 1 n ν l u ρ l
and
B N E O W G ν u 1 , u 2 , , u n = l = 1 n ν l u ρ l
Since u 1 , u 2 , , u n is any permutation of u 1 , u 2 , , u n , then
l = 1 n ν l u ρ l = l = 1 n ν l u ρ l
The proof is complete.□
Theorem 17.
(Idempotency) Let u l = l + , Ι l + , ƒ l + , l , Ι l , ƒ l l = 1 , 2 , , n represent a set of all equal BNVs, that is, u l = u
B N E O W G ν u 1 , u 2 , u 3 , , u n 1 , u n = u
Theorem 18.
(Bounded) Consider u = min l u l , u + = max l u l ; then,
u B N E O W G ν u 1 , u 2 , , u n u +
Theorem 19.
(Monotonicity) Let u l = l + , Ι l + , ƒ l + , l , Ι l , ƒ l l = 1 , 2 , , n and u l = l + , Ι l + , ƒ l + , l , Ι l , ƒ l l = 1 , 2 , , n be a collection of two BNVs. If u l u l ,
B N E O W G ν u 1 , u 2 , u 3 , , u n B N E O W G ν u 1 , u 2 , u 3 , , u n

4.3. BN Einstein HybridGeometric Aggregation Operators

Definition 21.
The BN Einstein hybrid geometric (BNEHG) aggregation operator is stated as follows:
B N E H G w , ν u 1 , u 2 , u 3 , , u n 1 , u n = l = 1 n ν l u ˙ σ l = ν 1 u ˙ σ 1 ν 2 u ˙ σ 2 ν 3 u ˙ σ 3 ν l u ˙ σ l ,
where w = w 1 , w 2 , w 3 , , w n 1 , w n is a weighting vector of u l , such that w l 0 , 1 , l = 1 n w l = 1 and u ˙ ρ l represent the l -th biggest component of the BN argument u ˙ l u ˙ l = n ν l u l , l = 1 , 2 , , n , and ν = ν 1 , ν 2 , , ν n is the weighting vector of BN arguments u l ,along with ν l 0 , 1 , l = 1 n ν l = 1 .
Note that BNEHG reduces to BNEWG if w = 1 n , 1 n , , 1 n T or the BNEOWG operator if ν = 1 n , 1 n , , 1 n .
Theorem 20.
The (BNEHG) operator gives in return a BNV with
B N E H G w , ν u 1 , u 2 , u 3 , , u n = 2 Ђ ˙ 1 ˜ Ђ ˙ 2 ˜ + Ђ ˙ 1 ˜ , ζ ˙ 1 ˜ ζ ˙ 2 ˜ ζ ˙ 1 ˜ + ζ ˙ 2 ˜ , f ˙ 1 ˜ f ˙ 2 ˜ f ˙ 1 ˜ + f ˙ 2 ˜ , Ђ ˙ 3 ˜ Ђ ˙ 4 ˜ Ђ ˙ 3 ˜ + Ђ ˙ 4 ˜ , 2 ζ ˙ 3 ˜ ζ ˙ 4 ˜ + ζ ˙ 3 ˜ , 2 f ˙ 3 ˜ f ˙ 4 ˜ + f ˙ 3 ˜
where
Ђ ˙ 1 ˜ = j = 1 n ˙ σ j + ω j , Ђ ˙ 2 ˜ = j = 1 n 2 ˙ σ j + ω j , Ђ ˙ 3 ˜ = j = 1 n 1 + ˙ σ j ω j   ,   Ђ ˙ 4 ˜ = j = 1 n 1 + ˙ σ j ω j , ζ ˙ 1 ˜ = j = 1 n 1 + Ι ˙ σ j + ω j , ζ ˙ 2 ˜ = j = 1 n 1 Ι ˙ σ j + ω j , ζ ˙ 3 ˜ = j = 1 n Ι ˙ σ j ω j , ζ ˙ 4 ˜ = j = 1 n 2 + Ι ˙ σ j ω j , f ˙ 1 ˜ = j = 1 n 1 + ƒ ˙ σ j + ω j , f ˙ 2 ˜ = j = 1 n 1 ƒ ˙ σ j + ω j , f ˙ 3 ˜ = j = 1 n ƒ ˙ σ j ω j , f ˙ 4 ˜ = j = 1 n 2 + ƒ ˙ σ j ω j .
where w = w 1 , w 2 , w 3 , , w n 1 , w n is a weighting vector of u l , such that w l 0 , 1 , l = 1 n w l = 1 and u ˙ ρ l represent the l -th biggest component of the BN argument u ˙ l u ˙ l = n ν l u l , l = 1 , 2 , , n , and ν = ν 1 , ν 2 , , ν n is the weighting vector of BN arguments u l ,along with ν l 0 , 1 , l = 1 n ν l = 1 . Here, n represents a balancing coefficient.
Proof. 
The theorem is straightforward.□

5. Multi-Criteria Group DM Problem Based on BN Einstein Aggregation Operators

This section includes a multi-criteria application based on BN Einstein aggregation operators (AOs), along with crisp numbers serving as attributes’ weights and BN numbers serving as attributes’ values.

5.1. Algorithm

Consider G = G 1 , G 2 , , G m to represent a collection of finite m alternatives, L = L 1 , L 2 , L 3 , , L n to represent a collection of finite n attributes and D = D 1 , D 2 , D 3 , , D k to be a finite number of k decision-makers. Suppose ν = ν 1 , ν 2 , , ν n T is the weighted vector for decision-makers D s ¯ s = 1 , 2 , 3 , , k 1 , k , with ν l 0 , 1 and l = 1 n ν l = 1 . Suppose w = w 1 , w 2 , w 3 , , w n T is the weighted vector representing the set of attributes L = L 1 , L 2 , L 3 , , L n , with w l 0 , 1 and l = 1 n w l = 1 . The decision-maker assesses an option based on a set of criteria, the values of which are defined by BNVs. Let u i j s = i j + , Ι i j + , ƒ i j + , i j , Ι i j , ƒ i j m × n be the decision matrices provided by an expert decision-maker, and u i j s be a BNN for L i attribute associated with alternatives. We have i j + , Ι i j + , ƒ i j + , i j , Ι i j and ƒ i j 0 , 1 with condition 0 i j + + Ι i j + + ƒ i j + + i j + Ι i j + ƒ i j 6 , where i = 1 , 2 , 3 , , m 1 , m and j = 1 , 2 , 3 , , n . (Figure 1)
Step 1: Matrix construction (Table 1Table 2Table 3) for decision-making D s ¯ = u i j s m × n s = 1 , 2 , 3 , , k 1 , k .
Step 2: Computing B N E W A ν r i 1 , r i 2 , , r i n (Table 4) for every i = 1 , 2 , 3 , , m . r i = i + , Ι i + , ƒ i + , i , Ι i , ƒ i = B N E W A ν r i 1 , r i 2 , , r i n = l = 1 n ν l r i l = Ђ 1 Ђ 2 Ђ 1 + Ђ 2 , 2 ζ 1 ζ 2 + ζ 1 , 2 f 1 f 2 + f 1 , 2 Ђ 3 Ђ 4 + Ђ 3 , ζ 3 ζ 4 ζ 3 + ζ 4 , f 3 f 4 f 3 + f 4
Step 3: Computing the scores values S r i .
Step 4: Various software systems are ranked for B N E W A ν u i 1 , u i 2 , , u i n in accordance with their scores.
Step 5: Picking the best option.

5.2. Illustrative Example

We believe that a medicine business company should hire a professional manager. For this reason, the organization formsa working group with three decision-makers in weighting vectors ν = ( 0.1 , 0.5 , 0.4 ) T . When choosing the most knowledgeable management approach, there are various factors to evaluate, but in this situation, the committee just analyses the four criteriamentioned below, along with associated weighted vector ν = ( 0.1 , 0.4 , 0.2 , 0.3 ) T . Four managers G j j = 1 , 2 , 3 , 4 will advance to the next round of the procedure after passing the first screening exam.
L1: Salary;
L2: Experience;
L3: Working skill;
L4: Dealing with public.
Step 1. Matrices construction for decisions.
Step 2: Compute B N E W A ν r i 1 , r i 2 , , r i n
r i = i + , Ι i + , ƒ i + , i , Ι i , ƒ i = B N E W A ν r i 1 , r i 2 , , r i n = l = 1 n ν l r i l = Ђ 1 Ђ 2 Ђ 1 + Ђ 2 , 2 ζ 1 ζ 2 + ζ 1 , 2 f 1 f 2 + f 1 , 2 Ђ 3 Ђ 4 + Ђ 3 , ζ 3 ζ 4 ζ 3 + ζ 4 , f 3 f 4 f 3 + f 4  
Step 3: Now, compute the scoring function of
r 1 = 0 . 3029 , 0 . 5336 , 0 . 4445 , 0 . 5839 , 0 . 4416 , 0 . 4277 , r 2 = 0 . 2934 , 0 . 4068 , 0 . 4501 , 0 . 6059 , 0 . 3806 , 0 . 3667 , r 3 = 0 . 3556 , 0 . 4435 , 0 . 5882 , 0 . 3867 , 0 . 3570 , 0 . 4616 , r 4 = 0 . 4670 , 0 . 4341 , 0 . 5578 , 0 . 5236 , 0 . 4085 , 0 . 4405 , S r i = 1 6 + + 1 Ι + + 1 ƒ + + 1 + Ι ƒ ,   S r 1 = . 4350 , S r 2 = 0.4296 , S r 3 = . 4593 , S r 4 = 0.4668
Step 4: We have arrived at a conclusion by calculating the scores:
G 4 G 3 G 1 G 2
Step 5: The best option is G4.

6. Comparison

Different researchers have used a wide range of DM approaches so far. Chen et al. [28] used FSs, Atanassov [2] used IFSs, Zavadskas et al. [21] used NSs, Dubois et al. [34] used BFSsand Irfan et al. [25] used BNSs, among other study approaches.We employed Einstein operators to apply bipolarity to neutrosophic sets in this paper.
The aggregation operators in this study were broader and more versatile, representing an advantage of our proposed method, which led us to determine that G4 was the best manager for the job.

7. Conclusions

The goal of this research was to look at different BN aggregation operators developed with the help of Einstein t-norms/t-conorms for multi-criteria community DM using BNVs as the criteria. The Einstein t-norm typically gives the same smooth approximations as the product and sum of an algebraic t-norm. Motivated by Einstein operations, we suggested bipolar neutrosophic Einstein aggregation operators for decision-making problems. To begin with, we looked at BN Einstein aggregation operators and the properties that they must have. Along with their attributes, these AOs were (BNEWA),(BNEOWA), (BNEHWA), (BNEWG), (BNEOWG)and (BNEHWG). Finally, we showed how to make multi-criteria decisions using such a framework. A descriptive case of manager selection was studied. The outcomes of the present paper show that the proposed approaches are accurate and practical when put into practice. We plan to extend the proposed approach to other domains and employ it in future research projects, such as pattern identification and risk analysis.

Author Contributions

Conceptualization, S.A.; Formal analysis, A.M.; Funding acquisition, A.R. and J.A.; Investigation, A.A. and J.A.; Methodology, M.J.; Project administration, F.A.; Validation, M.B.R.; Writing—review & editing, M.J. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

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. Smarandache, F. A Unifying Field in Logics Neutrosophy and Neutrosophic Probability, Set and Logic; American Research Press: Rehoboth, DE, USA, 1999. [Google Scholar]
  4. Wang, H.; Smarandache, F.; Zhan, Y.; Sunderraman, R. Single valued neutrosophic sets. In Proceedings of the 10th 476 International Conference on Fuzzy theory and Technology, Salt Lake City, UT, USA, 21–26 July2005. [Google Scholar]
  5. Ye, J. Multicriteria decision-making method using the correlation coefficient under single valued neutrosophic environment. Int. J. Gen. Syst. 2013, 42, 386–394. [Google Scholar] [CrossRef]
  6. Wang, H.; Smarandache, F.; Zhan, Y.Q. Interval Neutrosophic Sets and Logic; Theory and Applications in Computing; Hexis: Phoenix, AZ, USA, 2005. [Google Scholar]
  7. Yu, D.J. Group decision making based on generalized intuitionistic fuzzy prioritized geometric operator. Int. J. Intell. Syst. 2012, 27, 635–661. [Google Scholar] [CrossRef]
  8. Shakeel, M.; Aslam, M.; Amin, N.; Jamil, M. Method of MAGDM based on Pythagorean trapezoidal uncertain linguistic hesitant fuzzy aggregation operatorwith Einstein operations. J. Intell. Fuzzy Syst. 2020, 38, 2211–2230. [Google Scholar] [CrossRef]
  9. Wang, W.; Liu, X. Intuitionistic Fuzzy Geometric Aggregation Operators Based on Einstein Operations. Int. J. Intell. Syst. 2011, 26, 1049–1075. [Google Scholar] [CrossRef]
  10. Xu, Z.S. Multi-person multi-attribute decision making models under intuitionistic fuzzy environment. Fuzzy Optim. Decis. Mak. 2007, 6, 221–236. [Google Scholar] [CrossRef]
  11. Qun, W.; Peng, W.; Ligang, Z.; Huayou, C.; Xianjun, G. Some new Hamacher aggregation operators under single-valued neutrosophic 2-tuple linguistic environment and their applications to multi-attribute group decision making. Comput. Ind. Eng. 2018, 116, 144–162. [Google Scholar]
  12. Hamacher, H. Uber logischeverknunpfungennunssharferAussagen und derenZugenhorigeBewetungsfunktione. In Progress in Cybernatics and Systems Research; Riccardi, K., Ed.; Hemisphere: Washington, DC, USA, 1978; Volume 3, pp. 276–288. [Google Scholar]
  13. Xu, Z.S. Intuitionistic fuzzy aggregation operators. IEEE Trans. Fuzzy Syst. 2007, 15, 1179–1187. [Google Scholar]
  14. Zhao, X.; Wei, G. Some intuitionistic fuzzy Einstein hybrid aggregation operators and their application to multiple attribute decision making. Knowl. Based Syst. 2013, 37, 472–479. [Google Scholar] [CrossRef]
  15. Xu, Z.S.; Yager, R.R. Some geometric aggregation operators based on intuitionistic fuzzy sets. Int. J. Gen. Syst. 2006, 35, 417–433. [Google Scholar] [CrossRef]
  16. Wang, W.; Liu, X. Intuitionistic Fuzzy Information Aggregation Using Einstein Operations. IEEE Trans. Fuzzy Syst. 2012, 20, 923–938. [Google Scholar] [CrossRef]
  17. Chen, S.M. A new approach to handling fuzzy decision-making problems. IEEE Trans. Syst. ManCybern. 1998, 18, 1012–1016. [Google Scholar] [CrossRef]
  18. Zhang, W.R. Bipolar fuzzy sets and relations: A computational frame work for cognitive modeling and multiagent decision analysis. In Proceedings of theNAFIPS/IFIS/NASA’94, the First International Joint Conference of The North American Fuzzy Information Processing Society Biannual Conference, The Industrial Fuzzy Control and Intelligence, San Antonio, TX, USA, 18–21 December 1994; pp. 305–309. [Google Scholar]
  19. Zhang, W.R. Bipolar fuzzy sets. In Proceedings of the 1998 IEEE International Conference on Fuzzy Systems Proceedings, IEEE World Congress on Computational Intelligence (Cat. No.98CH36228), Anchorage, AK, USA, 4–9 May 1998; pp. 835–840. [Google Scholar]
  20. Zhang, W.R.; Zhang, L. Bipolar logic and Bipolar fuzzy logic. Inf. Sci. 2004, 165, 265–287. [Google Scholar] [CrossRef]
  21. Zavadskas, E.K.; Bausys, R.; Kaklauskas, A.; Ubarte, I.; Kuzminske, A.; Gudience, N. Sustainable market valuation of buildings by the single-valued neutrosophic MAMVA method. Appl. Soft Comput. 2017, 57, 74–87. [Google Scholar] [CrossRef] [Green Version]
  22. Zhang, W.R. Bipolar quantum logic gates and quantum cellular combinatorics-a logical extension to quantum entanglement. J. QuantumInf. Sci. 2013, 3, 93–105. [Google Scholar] [CrossRef] [Green Version]
  23. Gul, Z. Some Bipolar Fuzzy Aggregations Operators and Their Applications in Multicriteria Group Decision Making. Ph.D. Thesis, Hazara University, Mansehra, Pakistan, 2015. [Google Scholar]
  24. Deli, I.; Subas, Y.; Smarandache, F.; Ali, M. Interval valued bipolar neutrosophic sets and their application in pattern recognition. Conference Paper. arXiv 2016, arXiv:289587637. [Google Scholar]
  25. Deli, I.; Ali, M.; Smarandache, F. Bipolar neutrosophic sets and their application based on multi-criteria decision making problems. In Proceedings of the 2015 International Conference on Advanced Mechatronic System, Beijing, China, 22–24 August 2015. [Google Scholar]
  26. Jamil, M.; Abdullah, S.; Khan, M.Y.; Smarandache, F.; Ghani, F. Application of the Bipolar NeutrosophicHamacher Averaging Aggregation Operators to Group Decision Making: An Illustrative Example. Symmetry 2019, 11, 698. [Google Scholar] [CrossRef] [Green Version]
  27. Jamil, M.; Rahman, K.; Abdullah, S.; Khan, M.Y. The induced generalized interval-valued intuitionistic fuzzyeinstein hybrid geometric aggregation operator and their application to group decision-making. J. Intell. Fuzzy Syst. 2020, 38, 1737–1752. [Google Scholar] [CrossRef]
  28. Fan, C.; Ye, J.; Fen, S.; Fan, E.; Hu, K. Multi-criteria decision-making method using heronian mean operators under a bipolar neutrosophic environment. Mathematics 2019, 7, 97. [Google Scholar] [CrossRef] [Green Version]
  29. Abdullah, S.; Aslam, M.; Ullah, K. Bipolar fuzzy soft sets and its applications in decision making problem. J. Intell. Fuzzy Syst. 2014, 27, 729–742. [Google Scholar] [CrossRef] [Green Version]
  30. Jafar, M.N.; Zia, M.; Saeed, A.; Yaqoob, M.; Habib, S. Aggregation operators of bipolar neutrosophic soft sets and it’s applications in auto car selection. Int. J. NeutrosophicSci. 2020, 9, 37–46. [Google Scholar]
  31. Ali, M.; Smarandache, F. Complex neutrosophicset. NeuralComput. Applic 2017, 28, 1817–1834. [Google Scholar] [CrossRef]
  32. Broumi, S.; Bakali, A.; Talea, M.; Smarandache, F. Bipolar complex neutrosophic sets and its application in decision making problem. In Studies in Fuzziness and Soft Computing; Springer: Berlin/Heidelberg, Germany, 2018; pp. 677–710. [Google Scholar]
  33. Jamil, M.; Afzal, F.; Afzal, D.; Thapa, D.K.; Maqbool, A. Multicriteria Decision-Making Methods Using Bipolar NeutrosophicHamacher Geometric Aggregation Operators. J. Funct. Spaces 2022, 2022, 5052867. [Google Scholar]
  34. Dubois, D.; Kaci, S.; Prade, H. Bipolarity in reasoning and decision, an introduction. Info. Process. Manag. Uncertain. 2004, 4, 959–966. [Google Scholar]
Figure 1. Flow Chart for MCGDM.
Figure 1. Flow Chart for MCGDM.
Applsci 12 10045 g001
Table 1. BN decision matrix by decision-maker D1.
Table 1. BN decision matrix by decision-maker D1.
L1L2L3L4
G1(0.2,0.6,0.5,−0.3,−0.9,−0.6)(0.4,0.6,0.7,−0.5,−0.4,−0.3)(0.8,0.3,0.5,−0.6,−0.1,−0.9)(0.5,0.4,0.6,−0.8,−0.5,−0.4)
G2(0.5,0.7,0.3,−0.8,−0.5,−0.7)(0.3,0.4,0.6,−0.8,−0.7,−0.6)(0.4,0.6,0.9,−0.5,−0.4,−0.5)(0.3,0.8,0.9,−0.1,−0.4−0.3)
G3(0.5,0.7,0.8,−0.4,−0.7,−0.4)(0.3,0.7,0.7,−0.5,−0.3,−0.2)(0.5,0.3,0.4,−0.6,−0.7,−0.9)(0.4,0.6,0.5,−0.3,−0.5,−0.8)
G4(0.8,0.5,0.4,−0.7,−0.6,−0.5)(0.2,0.4,0.5,−0.8,−0.6,−0.3)(0.3,0.7,0.4,−0.5,−0.7,−0.5)(0.9,0.4,0.6,−0.5,−0.4,−0.7)
Table 2. BN decision matrix by decision-maker D2.
Table 2. BN decision matrix by decision-maker D2.
L1L2L3L4
G1(0.4,0.6,0.5,−0.7,−0.4,−0.8)(0.5,0.4,0.6,−0.8,−0.5,−0.7)(0.4,0.6,0.5,−0.4,−0.8,−0.5)(0.5,0.6,0.3,−0.4,−0.6,−0.8)
G2(0.4,0.7,0.5,−0.6,−0.3,−0.9)(0.4,0.7,0.8,−0.3,−0.5,−0.4)(0.2,0.5,0.7,−0.6,−0.5,−0.4)(0.8,0.4,0.2,−0.8,−0.1,−0.4)
G3(0.6,0.3,0.6,−0.3,−0.7,−0.8)(0.6,0.4,0.6,−0.7,−0.5,−0.8)(0.6,0.3,0.2,−0.1,−0.4,−0.7)(0.5,0.6,0.7,−0.3,−0.5,−0.6)
G4(0.2,0.3,0.4,−0.7,−0.6,−0.8)(0.8,0.5,0.4,−0.7,−0.4,−0.6)(0.8,0.4,0.5,−0.7,−0.5,−0.1)(0.6,0.5,0.8,−0.7,−0.6,−0.4)
Table 3. BN decision matrix by decision-maker D3.
Table 3. BN decision matrix by decision-maker D3.
L1L2L3L4
G1(0.5,0.6,0.4,−0.7,−0.4,−0.3)(0.2,0.5,0.6,−0.4,−0.7,−05)(0.5,0.7,0.2,−0.9,−0.5,−0.3)(0.5,0.6,0.3,−0.7,−0.5,−0.2)
G2(0.9,0.2,0.4,−0.5,−0.4,−0.8)(0.5,0.1,0.2,−0.9,−0.6,−0.4)(0.1,0.4,0.8,−0.6,−0.5,−0.3)(0.6,0.5,0.3,−0.9,−0.3,−0.5)
G3(0.4,0.5,0.6,−0.1,−0.6,−0.5)(0.3,0.4,0.8,−0.5,−0.4,−0.3)(0.4,0.6,0.3,−0.4,−0.5,−0.3)(0.5,0.4,0.9,−0.5,−0.4,−0.7)
G4(0.1,0.4,0.5,−0.4,−0.8,−0.7)(0.4,0.3,0.6,−0.2,−0.7,−0.5)(0.7,0.5,0.6,−0.4,−0.3−0.9)(0.1,0.5,0.7,−0.5,−0.8,−0.3)
Table 4. A collective BN decision matrix R.
Table 4. A collective BN decision matrix R.
L1L2
G1(0.4234,0.6000,0.4581,−0.6501,−0.4842,−0.6306)(0.3783,0.4568,0.6096,−0.5917,−0.5810,−0.5943)
G2(0.6940,0.4453,0.4360,−0.5766,−0.3620,−0.8517)(0.4219,0.3288,0.4750,−0.5426,−0.5640,−0.4224)
G3(0.5161,0.4057,0.6187,−0.2024,−0.6627,−0.6704)(0.4632,0.4251,0.6870,−0.5952,−0.4423,−0.6001)
G4(0.2462,0.3555,0.4381,−0.5675,−0.6938,−0.7403)(0.6286,0.4014,0.4839,−0.4527,−0.5567,−0.5351)
L3L4
G1(0.4940,0.6011,0.3536,−0.5954,−0.6522,−0.4973)(0.5000,0.5776,0.3233,−0.5453,−0.5520,−0.5868)
G2(0.1818,0.4670,0.7589,−0.5895,−0.4905,−0.3718)(0.6950,0.4726,0.2807,−0.7190,−0.2130,−0.4321)
G3(0.5161,0.4021,0.2533,−0.2160,−0.4764,−0.6073)(0.4905,0.5135,0.7552,−0.3708,−0.4614,−0.6659)
G4(0.7293,0.4649,0.5274,−0.5482,−0.4504,−0.6005)(0.4884,0.4893,0.7387,−0.5952,−0.6796,−0.3989)
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Jamil, M.; Afzal, F.; Akgül, A.; Abdullah, S.; Maqbool, A.; Razzaque, A.; Riaz, M.B.; Awrejcewicz, J. Einstein Aggregation Operators under Bipolar Neutrosophic Environment with Applications in Multi-Criteria Decision-Making. Appl. Sci. 2022, 12, 10045. https://doi.org/10.3390/app121910045

AMA Style

Jamil M, Afzal F, Akgül A, Abdullah S, Maqbool A, Razzaque A, Riaz MB, Awrejcewicz J. Einstein Aggregation Operators under Bipolar Neutrosophic Environment with Applications in Multi-Criteria Decision-Making. Applied Sciences. 2022; 12(19):10045. https://doi.org/10.3390/app121910045

Chicago/Turabian Style

Jamil, Muhammad, Farkhanda Afzal, Ali Akgül, Saleem Abdullah, Ayesha Maqbool, Abdul Razzaque, Muhammad Bilal Riaz, and Jan Awrejcewicz. 2022. "Einstein Aggregation Operators under Bipolar Neutrosophic Environment with Applications in Multi-Criteria Decision-Making" Applied Sciences 12, no. 19: 10045. https://doi.org/10.3390/app121910045

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