Next Article in Journal
Application of Optimization to Select Contractors to Develop Strategies and Policies for the Development of Transport Infrastructure
Next Article in Special Issue
Neutrosophic Cubic Einstein Hybrid Geometric Aggregation Operators with Application in Prioritization Using Multiple Attribute Decision-Making Method
Previous Article in Journal
Two Classes of Entropy Measures for Complex Fuzzy Sets
Previous Article in Special Issue
Neutrosophic Multigroups and Applications
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Multi-Criteria Decision-Making Method Using Heronian Mean Operators under a Bipolar Neutrosophic Environment

1
Department of Computer Science, Shaoxing University, 508 Huancheng West Road, Shaoxing 312000, China
2
Department of Electrical and Information Engineering, Shaoxing University, 508 Huancheng West Road, Shaoxing 312000, China
*
Author to whom correspondence should be addressed.
Mathematics 2019, 7(1), 97; https://doi.org/10.3390/math7010097
Submission received: 23 November 2018 / Revised: 9 January 2019 / Accepted: 11 January 2019 / Published: 17 January 2019
(This article belongs to the Special Issue New Challenges in Neutrosophic Theory and Applications)

Abstract

:
In real applications, most decisions are fuzzy decisions, and the decision results mainly depend on the choice of aggregation operators. In order to aggregate information more scientifically and reasonably, the Heronian mean operator was studied in this paper. Considering the advantages and limitations of the Heronian mean (HM) operator, four Heronian mean operators for bipolar neutrosophic number (BNN) are proposed: the BNN generalized weighted HM (BNNGWHM) operator, the BNN improved generalized weighted HM (BNNIGWHM) operator, the BNN generalized weighted geometry HM (BNNGWGHM) operator, and the BNN improved generalized weighted geometry HM (BNNIGWGHM) operator. Then, their propositions were examined. Furthermore, two multi-criteria decision methods based on the proposed BNNIGWHM and BNNIGWGHM operator are introduced under a BNN environment. Lastly, the effectiveness of the new methods was verified with an example.

1. Introduction

In the real world, there is lots of uncertain information in science, technology, daily life, and so on. Particularly under the background of big data, the uncertainty of information is more complex and diverse. Now, how to make use of mathematical tools to deal with the uncertain information is an urgent problem for researchers. In order to describe uncertain information, Zadeh [1] put forward the concept of fuzzy sets. Considering the complexities and changes of uncertainty in the real environment, there was a certain limit on fuzzy sets to describe complex uncertainty; then, some extension theories [2,3,4] were put forward. Afterword, the neutrosophic set (NS) containing three neutrosophic components and the single-valued neutrosophic set were proposed by Smarandache [5], and the single-valued neutrosophic set was also mentioned by Wang and Smarandache [6]. Wang and Zhang [7] put forward an interval neutrosophic set (INS) theory. Furthermore, an n-value neutrosophic set [8] theory was proposed by Smarandache. The fuzzy set theory changed the binary view of people, but ignored the bipolarity of things. Under the background of big data, the confliction between data became more and more obvious. Traditional fuzzy sets could not do well in analyzing and handing uncertain information with incompatible bipolarity; this phenomenon was identified in 1994. For the first time, Zhang [9] introduced incompatible bipolarity into the fuzzy set theory, and put forward the bipolar fuzzy set (BFS). The founder of the fuzzy set theory, Zadeh, also affirmed that the bipolar fuzzy set theory was a breakthrough in traditional fuzzy set theory [10]. Then, Zemankova et al. [11] discussed a more generalized multipolar fuzzy problem, and pointed out that the multipolar fuzzy problem can be divided into multiple bipolar fuzzy problems. Chen et al. [12] studied m-polar fuzzy sets. Bosc and Pivert [13] introduced a study on fuzzy bipolar relational algebra. Manemaran and Chellappa [14] gave some applications of bipolar fuzzy groups. Zhou and Li [15] introduced some applications of bipolar fuzzy sets in semiring. Deli et al. [16] put forward a bipolar neutrosophic set (BNS), which can describe bipolar information. Later, some studies about BNS were put forward [17,18,19,20]. In this paper, we propose four Heronian mean operators for bipolar neutrosophic number (BNN). Compared with the literature [17,18,19], the HM operator can embody the interaction between attributes to avoid unreasonable situations in information aggregation. Compared with the literature [20], the Bonferroni mean (BM) aggregation operator not only neglects the relationship between each attribute and itself, but also considers the relationship between each attribute and other attributes repeatedly. However, the BM aggregation operator has large computational complexity, but the Heronian mean (HM) can overcome these two shortcomings.
The remaining sections are organized as follows: some related concepts are reviewed in Section 2. The four operators are defined and their properties are investigated in Section 3; these four operators are BNN generalized weighted HM (BNNGWHM), BNN improved generalized weighted HM (BNNIGWHM), BNN generalized weighted geometry HM (BNNGWGHM), and BNN improved generalized weighted geometry HM (BNNIGWGHM). Multi-criteria decision-making (MCDM) methods based on the BNNIGWHM and BNNIGWGHM operators are established in Section 4. A numerical example is provided and the effects of parameters p and q are analyzed in Section 5. The conclusion of this paper is given in Section 6.

2. Some Basic Concepts

2.1. BNN and Its Operational Laws

Definition 1 
[16].Let U = { u 1 , u 2 , , u n } be a universe; a BNS Γ in U is defined as follows:
Γ = { u , α Γ + ( u ) , β Γ + ( u ) , γ Γ + ( u ) , α Γ ( u ) , β Γ ( u ) , γ Γ ( u ) | u U } ,
in which α Γ + ( u ) : U [ 0 , 1 ] means a truth-membership function, γ Γ + ( u ) : U [ 0 , 1 ] means a falsity-membership function and β Γ + ( u ) : U [ 0 , 1 ] means an indeterminacy-membership function, corresponding to a BNS Γ and α Γ ( u ) , γ Γ ( u ) , β Γ ( u )   :   U [ 1 , 0 ] mean, respectively, the truth membership, false membership, and indeterminate membership to some implicit counter-property corresponding to a BNS Γ .
Definition 2 
[16].Let U be a universe, and Γ 1 and Γ 2 be two BNSs.
Γ 1 = { u , α Γ 1 + ( u ) , β Γ 1 + ( u ) , γ Γ 1 + ( u ) , α Γ 1 ( u ) , β Γ 1 ( u ) , γ Γ 1 ( u ) | u U } ,
Γ 2 = { u , α Γ 2 + ( u ) , β Γ 2 + ( u ) , γ Γ 2 + ( u ) , α Γ 2 ( u ) , β Γ 2 ( u ) , γ Γ 2 ( u ) | u U } .
Then, the operations of Γ 1 and Γ 2 are defined as follows [16]:
Γ 1   Γ 2 , if and only if α Γ 1 + ( u ) α Γ 2 + ( u ) , β Γ 1 + ( u ) β Γ 2 + ( u ) , γ Γ 1 + ( u ) γ Γ 2 + ( u ) , and α Γ 1 ( u ) α Γ 2 ( u ) , β Γ 1 ( u ) β Γ 2 ( u ) , γ Γ 1 ( u ) γ Γ 2 ( u ) ;
Γ 1 =   Γ 2 , if and only if α Γ 1 + ( u ) = α Γ 2 + ( u ) , β Γ 1 + ( u ) = β Γ 2 + ( u ) , γ Γ 1 + ( u ) = γ Γ 2 + ( u ) , and α Γ 1 ( u ) = α Γ 2 ( u ) , β Γ 1 ( u ) = β Γ 2 ( u ) , γ Γ 1 ( u ) = γ Γ 2 ( u ) ;
Γ 1   Γ 2 = { u , max ( α Γ 1 + ( u ) , α Γ 2 + ( u ) ) ,   β Γ 1 + ( u ) + β Γ 2 + ( u ) 2 , min ( γ Γ 1 + ( u ) , γ Γ 2 + ( u ) ) , min ( α Γ 1 ( u ) , α Γ 2 ( u ) ) ,   β Γ 1 ( u ) + β Γ 2 ( u ) 2 , m a x ( γ Γ 1 ( u ) , γ Γ 2 ( u ) ) | u U } ;
Γ 1   Γ 2 = { u , min ( α Γ 1 + ( u ) , α Γ 2 + ( u ) ) ,   β Γ 1 + ( u ) + β Γ 2 + ( u ) 2 , max ( γ Γ 1 + ( u ) , γ Γ 2 + ( u ) ) , max ( α Γ 1 ( u ) , α Γ 2 ( u ) ) ,   β Γ 1 ( u ) + β Γ 2 ( u ) 2 , m i n ( γ Γ 1 ( u ) , γ Γ 2 ( u ) ) | u U } ;
For convenience, we denote a bipolar neutrosophic number (BNN) by τ = α τ + , β τ + , γ τ + , α τ , β τ , γ τ .
Definition 3 
[16].Let τ 1 and τ 2 be two BNNs, τ 1 = α τ 1 + , β τ 1 + , γ τ 1 + , α τ 1 , β τ 1 , γ τ 1 and τ 2 = α τ 2 + , β τ 2 + , γ τ 2 + , α τ 2 , β τ 2 , γ τ 2 , and δ > 0 ; then, the operations for BNNs are defined as follows [16]:
τ 1   τ 2 = α τ 1 + + α τ 2 + α τ 1 + α τ 2 + , β τ 1 + β τ 2 + , γ τ 1 + γ τ 2 + , α τ 1 α τ 2 , ( β τ 1 β τ 2 β τ 1 β τ 2 ) , ( γ τ 1 γ τ 2 γ τ 1 γ τ 2 ) ;
τ 1   τ 2 = α τ 1 + α τ 2 + , β τ 1 + + β τ 2 + β τ 1 + β τ 2 + , γ τ 1 + + γ τ 2 + γ τ 1 + γ τ 2 + , ( α τ 1 α τ 2 α τ 1 α τ 2 ) , β τ 1 β τ 2 , γ τ 1 γ τ 2 ;
δ τ 1 = 1 ( 1 α τ 1 + ) δ , ( β τ 1 + ) δ , ( γ τ 1 + ) δ , ( α τ 1 ) δ , ( 1 ( 1 ( β τ 1 ) ) δ ) , ( 1 ( 1 ( γ τ 1 ) ) δ ) ;
τ 1 δ = ( α τ 1 + ) δ , 1 ( 1 β τ 1 + ) δ , 1 ( 1 γ τ 1 + ) δ , ( 1 ( 1 ( α τ 1 ) ) δ ) , ( β τ 1 ) δ , ( γ τ 1 ) δ .
Definition 4 
[16].Let τ = α τ + , β τ + , γ τ + , α τ , β τ , γ τ be a BNN; then, we define s ( τ ) , a ( τ ) , and c ( τ ) as the score, accuracy, and certain functions, respectively; they are as follows:
s ( τ ) = 1 6 ( α τ + + 1 β τ + + 1 γ τ + + 1 + α τ β τ γ τ ) ;
a ( τ ) = α τ + γ τ + + α τ γ τ ;
c ( τ ) =   α τ + γ τ + .
Definition 5 
[16].Let τ 1 and τ 2 be two BNNs, τ 1 = α τ 1 + , β τ 1 + , γ τ 1 + , α τ 1 , β τ 1 , γ τ 1 and τ 2 = α τ 2 + , β τ 2 + , γ τ 2 + , α τ 2 , β τ 2 , γ τ 2 ; then, we can get Figure 1.

2.2. Generalized Weighted HM (GWHM), Improved Generalized Weighted HM (IGWHM), Generalized Weighted Geometry HM (GWGHM), and Improved Generalized Weighted Geometry HM (IGWGHM) Operators

Definition 6 
[21].Let ε =   ( ε 1 , ε 2 , , ε k ) be the weight vector of a collection of non-negative real numbers ( τ 1 ,     τ 2 , ,     τ k ) , j = 1 k ε j = 1   and ε j [ 0 , 1 ] , and t, s ≥ 0. Then,
G W H M   t ,   s ( τ 1 ,     τ 2 , ,     τ k ) =   ( 2 k ( k + 1 ) j = 1 k i = j k ( ε j τ j ) t ( ε i τ i ) s ) 1 t + s ,
which is called a GWHM operator.
Definition 7 
[22].Let ε =   ( ε 1 , ε 2 , , ε k ) be the weight vector of a collection of non-negative real numbers ( τ 1 ,     τ 2 , ,     τ k ) , j = 1 k ε j = 1   and ε j [ 0 , 1 ] , and t, s ≥ 0. Then,
G W H M   t ,   s ( τ 1 ,     τ 2 , ,     τ k ) = ( 1 λ k j = 1 k i = j ( ε j t ε i s τ j t τ i s ) ) 1 t + s ,
where λ = j = 1 k i = j k ε j t ε i s is called an IGWHM operator.
Definition 8 
[21].Let ε =   ( ε 1 , ε 2 , , ε k ) be the weight vector of a collection of non-negative real numbers ( τ 1 ,     τ 2 , ,     τ k ) , j = 1 k ε j = 1 and ε j [ 0 , 1 ] , and t, s ≥ 0. Then,
G W G H M   t ,   s ( τ 1 ,     τ 2 , ,     τ k ) = 1 t + s k j = 1 k i = j ( ( t τ j ) ε j ( s τ i ) ε i ) 2 k ( k + 1 ) ,
which is called a GWGHM operator.
Definition 9 
[22].Let ε =   ( ε 1 , ε 2 , , ε k ) be the weight vector of a collection of non-negative real numbers ( τ 1 ,     τ 2 , ,     τ k ) , j = 1 k ε j = 1 and ε j [ 0 , 1 ] , and t, s ≥ 0. Then,
I G W G H M   t ,   s ( τ 1 ,     τ 2 , ,     τ k ) = 1 t + s ( k j = 1 k i = j ( t τ j s τ i ) 2 ( k + 1 j ) k ( k + 1 ) ε i m = j k ε m ) ,
which is called an IGWGHM operator.

3. Some BNN Aggregation Operators

3.1. GWHM Operators for BNNs

Definition 10.
Let t, s ≥ 0, and t + s 0 , a collection τ j = α τ j + , β τ j + , γ τ j + , α τ j , β τ j , γ τ j   ( j = 1 , 2 , , k ) of BNN; then, we define the BNNGWHM operator as follows:
B N N G W H M t ,   s ( τ 1 ,     τ 2 , ,     τ k ) =       ( 2 k ( k + 1 ) j = 1 k i = j k ( ε j τ j ) t ( ε i τ i ) s ) 1 t + s ,
where j = 1 k ε j = 1 and ε j [ 0 , 1 ] .
According to Definitions 3 and 10, the following theorem can be attained:
Theorem 1.
Set a collection τ j = α τ j + , β τ j + , γ τ j + , α τ j , β τ j , γ τ j   ( j = 1 , 2 , , k ) of BNNs, using the BNNGWHM operator; then, the aggregation result is still a BNN, which is given by the following form:
B N N G W H M t ,   s ( τ 1 , τ 2 , , τ k ) = ( 2 k ( k + 1 ) j = 1 k i = j k ( ε j τ j ) t ( ε i τ i ) s ) 1 t + s = ( 1 j = 1 k i = j k ( 1 ( 1 ( 1 α τ j + ) ε j ) t ( 1 ( 1 α τ i + ) ε i ) s ) 1 λ ) 1 t + s , 1 ( 1 j = 1 k i = j k ( 1 ( 1 ( β τ j + ) ε j ) t ( 1 ( β τ i + ) ε i ) s ) 1 λ ) 1 t + s , 1 ( 1 j = 1 k i = j k ( 1 ( 1 ( γ τ j + ) ε j ) t ( 1 ( γ τ i + ) ε i ) s ) 1 λ ) 1 t + s , ( 1 ( 1 j = 1 k i = j k ( 1 ( 1 ( α τ j ) ε j ) t ( 1 ( α τ i ) ε i ) s ) 1 λ ) 1 t + s ) , ( 1 j = 1 k i = j k ( 1 ( 1 ( 1 ( β τ j ) ) ε j ) t ( 1 ( 1 ( β τ i ) ) ε i ) s ) 1 λ ) 1 t + s , ( 1 j = 1 k i = j k ( 1 ( 1 ( 1 ( γ τ j ) ) ε j ) t ( 1 ( 1 ( γ τ i ) ) ε i ) s ) 1 λ ) 1 t + s
where 1 λ = 2 k ( k + 1 ) , j = 1 k ε j = 1 and   ε j [ 0 , 1 ] .
Proof. 
( 1 )   ε j τ j = 1 ( 1 α τ j + ) ε j , ( β τ j + ) ε j , ( γ τ j + ) ε j , ( α τ j ) ε j , ( 1 ( 1 ( β τ j ) ) ε j ) , ( 1 ( 1 ( γ τ j ) ) ε j ) ;
( 2 )   ε i τ i = 1 ( 1 α τ i + ) ε i , ( β τ i + ) ε i , ( γ τ i + ) ε i , ( α τ i ) ε i , ( 1 ( 1 ( β τ i ) ) ε i ) , ( 1 ( 1 ( γ τ i ) ) ε i ) ;
( 3 ) ( ε j τ j ) t = ( 1 ( 1 α τ j + ) ε j ) t , 1 ( 1 ( β τ j + ) ε j ) t , 1 ( 1 ( γ τ j + ) ε j ) t , ( 1 ( 1 ( α τ j ) ε j ) t ) , ( 1 ( 1 ( β τ j ) ) ε j ) t , ( 1 ( 1 ( γ τ j ) ) ε j ) t ;
( 4 )   ( ε i τ i ) s = ( 1 ( 1 α τ i + ) ε i ) s , 1 ( 1 ( β τ i + ) ε i ) s , 1 ( 1 ( γ τ i + ) ε i ) s , ( 1 ( 1 ( α τ i ) ε i ) s ) , ( 1 ( 1 ( β τ i ) ) ε i ) s , ( 1 ( 1 ( γ τ i ) ) ε i ) s ;
( 5 )   ( ε j τ j ) t ( ε i τ i ) s = ( 1 ( 1 α τ j + ) ε j ) t ( 1 ( 1 α τ i + ) ε i ) s , 1 ( 1 ( β τ j + ) ε j ) t + 1 ( 1 ( β τ i + ) ε i ) s ( 1 ( 1 ( β τ j + ) ε j ) t ) ( 1 ( 1 ( β τ i + ) ε i ) s ) , 1 ( 1 ( γ τ j + ) ε j ) t + 1 ( 1 ( γ τ i + ) ε i ) s ( 1 ( 1 ( γ τ j + ) ε j ) t ) ( 1 ( 1 ( γ τ i + ) ε i ) s ) , ( ( 1 ( 1 ( α τ j ) ε j ) t ) + ( 1 ( 1 ( α τ i ) ε i ) s ) ( 1 ( 1 ( α τ j ) ε j ) t ) ( 1 ( 1 ( α τ i ) ε i ) s ) ) , ( 1 ( 1 ( β τ j ) ) ε j ) t ( 1 ( 1 ( β τ i ) ) ε i ) s , ( 1 ( 1 ( γ τ j ) ) ε j ) t ( 1 ( 1 ( γ τ i ) ) ε i ) s
( 6 ) j = 1 k i = j k ( ε j τ j ) t ( ε i τ i ) s = 1 j = 1 k i = j k ( 1 ( 1 ( 1 α τ j + ) ε j ) t ( 1 ( 1 α τ i + ) ε i ) s ) , j = 1 k i = j k ( 1 ( 1 ( β τ j + ) ε j ) t ( 1 ( β τ i + ) ε i ) s ) , j = 1 n i = j n ( 1 ( 1 ( γ τ j + ) ε j ) t ( 1 ( γ τ i + ) ε i ) s ) , j = 1 k i = j k ( 1 ( 1 ( α τ j ) ε j ) t ( 1 ( α τ i ) ε i ) s ) , ( 1 j = 1 k i = j k ( 1 ( 1 ( 1 ( β τ j ) ) ε j ) t ( 1 ( 1 ( β τ i ) ) ε i ) s ) ) , ( 1 j = 1 k i = j k ( 1 ( 1 ( 1 ( γ τ j ) ) ε j ) t ( 1 ( 1 ( γ τ i ) ) ε i ) s ) ) ;
( 7 ) 2 k ( k + 1 ) j = 1 k i = j k ( ε j τ j ) t ( ε i τ i ) s = 1 λ j = 1 k i = j k ( ε j τ j ) t ( ε i τ i ) s = 1 j = 1 k i = j k ( 1 ( 1 ( 1 α τ j + ) ε j ) t ( 1 ( 1 α τ i + ) ε i ) s ) 1 λ , j = 1 k i = j k ( 1 ( 1 ( β τ j + ) ε j ) t ( 1 ( β τ i + ) ε i ) s ) 1 λ , j = 1 k i = j k ( 1 ( 1 ( γ τ j + ) ε j ) t ( 1 ( γ τ i + ) ε i ) s ) 1 λ , j = 1 k i = j k ( 1 ( 1 ( α τ j ) ε j ) t ( 1 ( α τ i ) ε i ) s ) 1 λ , ( 1 j = 1 k i = j k ( 1 ( 1 ( 1 ( β τ j ) ) ε j ) t ( 1 ( 1 ( β τ i ) ) ε i ) s ) 1 λ ) , ( 1 j = 1 k i = j k ( 1 ( 1 ( 1 ( γ τ j ) ) ε j ) t ( 1 ( 1 ( γ τ i ) ) ε i ) s ) 1 λ ) ;
( 8 )   ( 1 λ j = 1 k i = j k ( ε j τ j ) t ( ε i τ i ) s ) 1 t + s = ( 1 j = 1 k i = j k ( 1 ( 1 ( 1 α τ j + ) ε j ) t ( 1 ( 1 α τ i + ) ε i ) s ) 1 λ ) 1 t + s , 1 ( 1 j = 1 k i = j k ( 1 ( 1 ( β τ j + ) ε j ) t ( 1 ( β τ i + ) ε i ) s ) 1 λ ) 1 t + s , 1 ( 1 j = 1 k i = j k ( 1 ( 1 ( γ τ j + ) ε j ) t ( 1 ( γ τ i + ) ε i ) s ) 1 λ ) 1 t + s , ( 1 ( 1 j = 1 k i = j k ( 1 ( 1 ( α τ j ) ε j ) t ( 1 ( α τ i ) ε i ) s ) 1 λ ) 1 t + s ) , ( 1 j = 1 k i = j k ( 1 ( 1 ( 1 ( β τ j ) ) ε j ) t ( 1 ( 1 ( β τ i ) ) ε i ) s ) 1 λ ) 1 t + s , ( 1 j = 1 k i = j k ( 1 ( 1 ( 1 ( γ τ j ) ) ε j ) t ( 1 ( 1 ( γ τ i ) ) ε i ) s ) 1 λ ) 1 t + s .
This proves Theorem 1. □
Theorem 2.
(Monotonicity). Set τ j = α τ j + , β τ j + , γ τ j + , α τ j , β τ j , γ τ j   ( j = 1 , 2 , , k ) and σ j = α   σ j + , β   σ j + , γ   σ j + , α   σ j , β   σ j , γ   σ j   ( j = 1 , 2 , , k ) as two collections of BNNs; if α τ j + α   σ j + , β τ j + β   σ j + , γ τ j + γ   σ j +   a n d   α τ j α   σ j , β τ j β   σ j , γ τ j γ   σ j   , then
B N N G W H M   t ,   s ( τ 1 ,     τ 2 , ,     τ k ) B N N G W H M   t ,   s ( σ 1 ,     σ 2 , ,     σ k ) .
Proof. 
For α τ j + α   σ j + , β τ j + β   σ j + , γ τ j + γ   σ j +   and   α τ j α   σ j , β τ j β   σ j , γ τ j γ   σ j , it is obvious that
( 1 ( 1 α τ j + ) ε j ) t ( 1 ( 1 α τ i + ) ε i ) s ( 1 ( 1 α σ j + ) ε j ) t ( 1 ( 1 α σ i + ) ε i ) s ,
( 1 j = 1 k i = j k ( 1 ( 1 ( 1 α τ j + ) ε j ) t ( 1 ( 1 α τ i + ) ε i ) s ) 1 λ ) 1 t + s ( 1 j = 1 k i = j k ( 1 ( 1 ( 1 α σ j + ) ε j ) t ( 1 ( 1 α σ i + ) ε i ) s ) 1 λ ) 1 t + s .
Similarly
1 ( 1 j = 1 k i = j k ( 1 ( 1 ( β τ j + ) ε j ) t ( 1 ( β τ i + ) ε i ) s ) 1 λ ) 1 t + s 1 ( 1 j = 1 k i = j k ( 1 ( 1 ( β σ j + ) ε j ) t ( 1 ( β σ i + ) ε i ) s ) 1 λ ) 1 t + s , 1 ( 1 j = 1 k i = j k ( 1 ( 1 ( γ τ j + ) ε j ) t ( 1 ( γ τ i + ) ε i ) s ) 1 λ ) 1 t + s 1 ( 1 j = 1 k i = j k ( 1 ( 1 ( γ σ j + ) ε j ) t ( 1 ( γ σ i + ) ε i ) s ) 1 λ ) 1 t + s , ( 1 ( 1 j = 1 k i = j k ( 1 ( 1 ( α τ j ) ε j ) t ( 1 ( α τ i ) ε i ) s ) 1 λ ) 1 t + s ) ( 1 ( 1 j = 1 k i = j k ( 1 ( 1 ( α σ j ) ε j ) t ( 1 ( α σ i ) ε i ) s ) 1 λ ) 1 t + s ) , ( 1 j = 1 k i = j k ( 1 ( 1 ( 1 ( β τ j ) ) ε j ) t ( 1 ( 1 ( β τ i ) ) ε i ) s ) 1 λ ) 1 t + s ( 1 j = 1 k i = j k ( 1 ( 1 ( 1 ( β σ j ) ) ε j ) t ( 1 ( 1 ( β σ i ) ) ε i ) s ) 1 λ ) 1 t + s ,
and
( 1 j = 1 k i = j k ( 1 ( 1 ( 1 ( γ τ j ) ) ε j ) t ( 1 ( 1 ( γ τ i ) ) ε i ) s ) 1 λ ) 1 s + t ( 1 j = 1 k i = j k ( 1 ( 1 ( 1 ( γ σ j ) ) ε j ) t ( 1 ( 1 ( γ σ i ) ) ε i ) s ) 1 λ ) 1 s + t .
Thus, B N N G W H M t ,   s ( τ 1 , τ 2 , , τ k ) B N N G W H M t ,   s ( σ 1 , σ 2 , , σ k ) ; this proves Theorem 2. □

3.2. Improved Generalized Weighted HM Operators for BNNs

Definition 11.
Let t, s ≥ 0, and t + s 0 , a collection τ j = α τ j + , β τ j + , γ τ j + , α τ j , β τ j , γ τ j   ( j = 1 , 2 , , k ) of BNN; then, we define the BNNIGWHM operator as follows:
B N N I G W H M   t ,   s ( τ 1 ,     τ 2 , ,     τ k ) =   ( 1 j = 1 k i = j k ε j ε i k j = 1 k i = j ( ε j ε i τ j t τ i s ) ) 1 t + s ,
where j = 1 k ε j = 1 and ε j [ 0 , 1 ] .
According to Definitions 3 and 11, the following theorem can be attained:
Theorem 3.
Set a collection τ j = α τ j + , β τ j + , γ τ j + , α τ j , β τ j , γ τ j   ( j = 1 , 2 , , k ) of BNNs, using BNNIGWHM operator; then, the aggregation result is still a BNN, which is given by the following form:
BNNIGWHM t ,   s ( τ 1 ,   τ 2 , ,   τ k ) =   ( 1 j = 1 k i = j k ε j ε i k j = 1 k i = j ( ε j ε i τ j t τ i s ) ) 1 t + s = ( 1 ( j = 1 k i = j k ( 1 ( α τ j + ) t ( α τ i + ) s ) ε j ε i ) 1 λ ) 1 t + s 1 ( 1 ( j = 1 k i = j k ( 1 ( 1 β τ j + ) t ( 1 β τ i + ) s ) ε j ε i ) 1 λ ) 1 t + s , 1 ( 1 ( j = 1 k i = j k ( 1 ( 1 γ τ j + ) t ( 1 γ τ i + ) s ) ε j ε i ) 1 λ ) 1 t + s , ( 1 ( 1 ( j = 1 k i = j k ( 1 ( 1 ( α τ j ) ) t ( 1 ( α τ i ) ) s ) ε j ε i ) 1 λ ) 1 t + s ) , ( 1 ( j = 1 k i = j k ( 1 ( β τ j ) t ( β τ i ) s ) ε j ε i ) 1 λ ) 1 t + s , ( 1 ( j = 1 k i = j k ( 1 ( γ τ j ) t ( γ τ i ) s ) ε j ε i ) 1 λ ) 1 t + s ,
where λ = j = 1 k i = j k ε j ε i ,     j = 1 k ε j = 1   and   ε j [ 0 , 1 ] .
The proof of Theorem 3 can be achieved according to the proof of Theorem 1; thus, we omit it here.
Theorem 4.
(Idempotency). Set a collection τ j = α τ j + , β τ j + , γ τ j + , α τ j , β τ j , γ τ j   ( j = 1 , 2 , , k ) of BNNs; if τ j = τ , then
B N N I G W H M   t ,   s ( τ 1 , τ 2 , , τ k ) = B N N I G W H M   t ,   s ( τ , τ , τ ) =   τ .
Proof. 
For τ j = τ ( j   =   1 ,   2 ,   ,   k ) , the following result can be easily attained:
B N N I G W H M   t ,   s ( τ 1 ,     τ 2 , ,     τ k ) = B N N I G W H M   t ,   s ( τ , τ , τ ) = = ( 1 ( j = 1 k i = j k ( 1 ( α τ + ) t ( α τ + ) s ) ε j ε i ) 1 λ ) 1 t + s 1 ( 1 ( j = 1 k i = j k ( 1 ( 1 β τ + ) t ( 1 β τ + ) s ) ε j ε i ) 1 λ ) 1 t + s , 1 ( 1 ( j = 1 k i = j k ( 1 ( 1 γ τ + ) t ( 1 γ τ + ) s ) ε j ε i ) 1 λ ) 1 t + s , ( 1 ( 1 ( j = 1 k i = j k ( 1 ( 1 ( α τ ) ) t ( 1 ( α τ ) ) s ) ε j ε i ) 1 λ ) 1 t + s ) , ( 1 ( j = 1 k i = j k ( 1 ( β τ ) t ( β τ ) s ) ε j ε i ) 1 λ ) 1 t + s , ( 1 ( j = 1 k i = j k ( 1 ( γ τ ) t ( γ τ ) s ) ε j ε i ) 1 λ ) 1 t + s ( ( α τ + ) t + s ) 1 t + s , 1 ( ( 1 β τ + ) t + s ) 1 t + s , = 1 ( ( 1 γ τ + ) t + s ) 1 t + s , ( 1 ( ( 1 ( α τ ) ) t + s ) 1 t + s ) , = α τ + , β τ + , γ τ + , α τ , β τ , γ τ = τ ( ( β τ ) t + s ) 1 t + s , ( ( γ τ ) t + s ) 1 t + s .
This proves Theorem 4. □
Theorem 5.
(Monotonicity). Set τ j = α τ j + , β τ j + , γ τ j + , α τ j , β τ j , γ τ j   ( j = 1 , 2 , , k ) and   σ j = α   σ j + , β   σ j + , γ   σ j + , α   σ j , β   σ j , γ   σ j   ( j = 1 , 2 , , k ) as two collections of BNNs; if α τ j + α   σ j + , β τ j + β   σ j + , γ τ j + γ   σ j +   a n d   α τ j α   σ j , β τ j β   σ j , γ τ j γ   σ j   , then,
B N N I G W H M   t ,   s ( τ 1 , τ 2 , , τ k ) B N N I G W H M   t ,   s ( σ 1 ,     σ 2 , ,     σ k ) .
The proof of Theorem 5 is similar to Theorem 2; thus, we omit it.
Theorem 6.
(Boundedness). Set a collection τ j = α τ j + , β τ j + , γ τ j + , α τ j , β τ j , γ τ j   ( j = 1 , 2 , , k ) of BNNs, and let τ = min ( α τ j + ) , max ( β τ j + ) , max ( γ τ j + ) , m a x ( α τ j ) , m i n ( β τ j ) , m i n ( γ τ j ) and τ + = m a x ( α τ j + ) , m i n ( β τ j + ) , m i n ( γ τ j + ) , m i n ( α τ j ) , m a x ( β τ j ) , m a x ( γ τ j ) ; then,
τ   B N N I G W H M t ,   s ( τ 1 ,     τ 2 , ,     τ k ) τ + .
Based on Theorems 4 and 5, the following can be obtained:
τ = BNNIGWHM t ,   s     ( τ , τ , , τ ) a n d   τ + = B N N I G W H M t ,   s     ( τ + , τ + , , τ + ) .
B N N I G W H M t ,   s ( τ , τ , , τ ) B N N I G W H M t , s     ( τ 1 ,     τ 2 , ,     τ k ) B N N I G W H M t ,   s     ( τ + , τ + , , τ + ) .
Then , τ   B N N I G W H M t ,   s     ( τ 1 ,     τ 2 , ,     τ k ) τ + .
This proves Theorem 6.

3.3. GWGHM Operators of BNNs

Definition 12.
Let t, s ≥ 0, t + s 0 ,a collection τ j = α τ j + , β τ j + , γ τ j + , α τ j , β τ j , γ τ j   ( j = 1 , 2 , , k ) of BNNs; then, we define the BNNGWGHM operator as follows:
B N N G W G H M t ,   s ( τ 1 ,     τ 2 , ,     τ k ) =       1 t + s k j = 1 k i = j ( ( t τ j ) ε j ( s τ i ) ε i ) 2 k ( k + 1 ) ,
where j = 1 k ε j = 1   and   ε j [ 0 , 1 ] .
According to Definitions 3 and 12, the following theorem can be attained:
Theorem 7.
Set a collection τ j = α τ j + , β τ j + , γ τ j + , α τ j , β τ j , γ τ j   ( j = 1 , 2 , , k ) of BNNs, using the BNNGWGHM operator; then, the aggregation result is still a BNN, which is given by the following form:
BNNGWGHM t ,   s ( τ 1 ,   τ 2 , ,   τ k ) = 1 t + s k j = 1 k i = j ( ( t τ j ) ε j ( s τ i ) ε i ) 2 k ( k + 1 ) = 1 ( 1 j = 1 k i = j k ( 1 ( 1 ( 1 ( 1 ( α τ j + ) ) t ) ε j ) ( 1 ( 1 ( 1 ( α τ i + ) ) s ) ε i ) ) 1 λ ) 1 t + s , ( 1 j = 1 k i = j k ( 1 ( 1 ( 1 ( β τ j + ) t ) ε j ) ( 1 ( 1 ( β τ i + ) s ) ε i ) ) 1 λ ) 1 t + s , ( 1 j = 1 k i = j k ( 1 ( 1 ( 1 ( γ τ j + ) t ) ε j ) ( 1 ( 1 ( γ τ i + ) s ) ε i ) ) 1 λ ) 1 t + s , ( 1 j = 1 k i = j k ( 1 ( 1 ( 1 ( α τ j ) t ) ε j ) ( 1 ( 1 ( α τ i ) s ) ε i ) ) 1 λ ) 1 t + s , ( 1 ( 1 j = 1 k i = j k ( 1 ( 1 ( 1 ( 1 ( β τ j ) ) t ) ε j ) ( 1 ( 1 ( 1 ( β τ i ) ) s ) ε i ) ) 1 λ ) 1 t + s ) , ( 1 ( 1 j = 1 k i = j k ( 1 ( 1 ( 1 ( 1 ( γ τ j ) ) t ) ε j ) ( 1 ( 1 ( 1 ( γ τ i ) ) s ) ε i ) ) 1 λ ) 1 t + s ) ,
where 1 λ = 2 k ( k + 1 ) ,     j = 1 k ε j = 1   and   ε j [ 0 , 1 ] .
Theorem 8.
(Monotonicity). Set τ j = α τ j + , β τ j + , γ τ j + , α τ j , β τ j , γ τ j   ( j = 1 , 2 , , k ) and σ j = α   σ j + , β   σ j + , γ   σ j + , α   σ j , β   σ j , γ   σ j   ( j = 1 , 2 , , k ) as two collections of BNNs; if α τ j + α   σ j + , β τ j + β   σ j + , γ τ j + γ   σ j +   a n d   α τ j α   σ j , β τ j β   σ j , γ τ j γ   σ j   , then,
B N N G W G H M t ,   s ( τ 1 ,     τ 2 , ,     τ k ) B N N G W G H M t ,   s ( σ 1 ,     σ 2 , ,     σ k ) .
The proofs of theorems about BNNGWGHM are similar to those about BNNGWHM; thus, we omit them.

3.4. IGWGHM Operators of BNNs

Definition 13.
Let t, s ≥ 0, and t + s 0 , a collection τ j = α τ j + , β τ j + , γ τ j + , α τ j , β τ j , γ τ j   ( j = 1 , 2 , , k ) of BNNs; then, we define the BNNIGWGHM operator as follows:
B N N I G W G H M t ,   s   ( τ 1 ,     τ 2 , ,     τ k ) =       1 t + s ( k j = 1 k i = j ( t τ j s τ i ) 2 ( k + 1 j ) k ( k + 1 ) ε i m = j k ε m ) ,
where j = 1 k ε j = 1   and ε j [ 0 , 1 ] .
According to Definitions 3 and 13, the following theorem can be attained:
Theorem 9.
Set a collection   τ j = α τ j + , β τ j + , γ τ j + , α τ j , β τ j , γ τ j   ( j = 1 , 2 , , k ) of BNNs, using the BNNIGWGHM operator; then, the aggregation result is still a BNN, which is given by the following form:
B N N I G W G H M t ,   s   ( τ 1 ,     τ 2 , ,     τ k ) =           1 t + s ( k j = 1 k i = j ( t τ j s τ i ) 2 ( k + 1 j ) k ( k + 1 ) ε i m = j k ε m ) = 1 ( 1 j = 1 k i = j k ( 1 ( 1 ( α τ j + ) ) t ( 1 ( α τ i + ) ) s ) 1 λ ) 1 t + s , ( 1 j = 1 k i = j k ( 1 ( β τ j + ) t ( β τ i + ) s ) 1 λ ) 1 t + s , ( 1 j = 1 k i = j k ( 1 ( γ τ j + ) t ( γ τ i + ) s ) 1 λ ) 1 t + s ( 1 j = 1 k i = j k ( 1 ( α τ j ) t ( α τ i ) s ) 1 λ ) 1 t + s , ( 1 ( 1 j = 1 k i = j k ( 1 ( 1 ( β τ j ) ) t ( 1 ( β τ i ) ) s ) 1 λ ) 1 t + s ) , ( 1 ( 1 j = 1 k i = j k ( 1 ( 1 ( γ τ j ) ) t ( 1 ( γ τ i ) ) s ) 1 λ ) 1 t + s ) ,
where 1 λ = 2 ( k + 1 j ) k ( k + 1 ) ε i m = j k ε m ,     j = 1 k ε j = 1   and ε j [ 0 , 1 ] .
Theorem 10.
(Monotonicity). Set τ j = α τ j + , β τ j + , γ τ j + , α τ j , β τ j , γ τ j   ( j = 1 , 2 , , k ) and σ j = α   σ j + , β   σ j + , γ   σ j + , α   σ j , β   σ j , γ   σ j   ( j = 1 , 2 , , k ) as two collections of BNNs; if α τ j + α   σ j + , β τ j + β   σ j + , γ τ j + γ   σ j +   a n d   α τ j α   σ j , β τ j β   σ j , γ τ j γ   σ j ,   then,
B N N I G W G H M t ,   s   ( τ 1 ,     τ 2 , ,     τ k ) B N N I G W G H M t ,   s ( σ 1 ,     σ 2 , ,     σ k ) .
Theorem 11.
(Idempotency). Set a collection τ j = α τ j + , β τ j + , γ τ j + , α τ j , β τ j , γ τ j   ( j = 1 , 2 , , k ) of BNNs; if τ j = τ , then,
B N N I G W G H M t ,   s   ( τ 1 ,     τ 2 , ,     τ k ) = B N N I G W G H M t ,   s ( τ , τ , τ ) =   τ .
Theorem 12.
(Boundedness). Set a collection τ j = α τ j + , β τ j + , γ τ j + , α τ j , β τ j , γ τ j   ( j = 1 , 2 , , k ) of BNN, and let τ = min ( α τ j + ) , max ( β τ j + ) , max ( γ τ j + ) , m a x ( α τ j ) , m i n ( β τ j ) , m i n ( γ τ j )   , and τ + = m a x ( α τ j + ) , m i n ( β τ j + ) , m i n ( γ τ j + ) , m i n ( α τ j ) , m a x ( β τ j ) , m a x ( γ τ j ) ; then,
τ   B N N I G W H M t ,   s ( τ 1 ,     τ 2 , ,     τ k ) τ + .
The proofs of theorems about BNNIGWGHM are similar to those about BNNIGWHM; thus, we omit them.

4. MCDM Methods Based on the BNNIGWHM and BNNIGWGHM Operator

We applied the BNNIGWHM and BNNIGWGHM operator to manage MCDM problems within BNN information in this section.
Suppose that a set Γ = { Γ 1 , Γ 2 , , Γ n } of alternatives and a set Φ = { Φ 1 , Φ 2 , , Φ m } of attributes, with the weight vector ε = ( ε 1 , ε 2 , , ε m ) of Φ j ( j = 1 , 2 , , m ) , in which j = 1 n ε j = 1 and ε j [ 0 , 1 ] . Decision-makers use BNNs to evaluate the alternatives. The evaluation values τ i j for Γ i associated with the attribute Φ j are represented by the form of BNNs. Assume that ( τ i j ) n × m = ( α τ i j + , β τ i j + , γ τ i j + , α τ i j , β τ i j , γ τ i j ) n × m is the BNN decision matrix.
Now, based on the BNNIGWHM and BNNIGWGHM operator, we can develop some decision algorithms:
Step 1: Construct the decision matrix:
( τ i j ) n × m = ( α τ i j + , β τ i j + , γ τ i j + , α τ i j , β τ i j , γ τ i j ) n × m .
Step 2: According to Definition 11 or Definition 13, calculate τ i .
Step 3: According to the Equation (5), calculate the score value of s ( τ i ) for τ i ( i = 1 , 2 , , n ) .
Step 4: According to Definition 5, rank all the alternatives corresponding to the values of s ( τ i ) .

5. Illustrative Example

In this section, we used a numerical example adapted from the literature [16]. A woman wants to buy a car. Now, four kinds of cars Γ 1 , Γ 2 , Γ 3 ,   and   Γ 4 are taken into account according to gasoline consumption ( Φ 1 ) , aerodynamics ( Φ 2 ) , comfort ( Φ 3 ) , and safety performances ( Φ 4 ) . The importance of these four attributes is given as ε = ( 0.5 , 0.25 , 0.125 , 0.125 ) T . Then, she evaluates four alternatives under the above four attributes in the form of BNNs.

5.1. The Decision-Making Process Based on the BNNIGWHM Operator or BNNIGWGHM Operator

Step 1: Establish the BNN decision matrix ( τ i j ) 4 × 4 provided by customer, as shown in Table 1.
Step 2: According to Definition 11 (suppose p = q = 1) and ε of attributes, calculate τ i ( i =   1 , 2 , 3 , 4 ) :
τ 1 = 0.4656 , 0.5984 , 0.3248 , 0.6874 , 0.4906 , 0.5832 ,
τ 2 = 0.8362 , 0.5751 , 0.5918 , 0.5868 , 0.6108 , 0.2872 ,
τ 3 = 0.4212 , 0.3684 , 0.2341 , 0.5268 , 0.4254 , 0.5540 ,
τ 4 = 0.7456 , 0.5504 , 0.2669 , 0.5838 , 0.5793 , 0.2006 .
Step 3: According to Equation (5), calculate thscore value of s ( τ i ) for τ i ( i = 1 ,   2 ,   3 ,   4 ) :
s ( τ 1 ) = 0.4881 ; s ( τ 2 ) = 0.4968 ;   s ( τ 3 ) = 0.5458 ;   s ( τ 4 ) = 0.5207 .
Step 4: According to Definition 5, rank Γ 3 Γ 4 Γ 2 Γ 1   corresponding to s ( τ i ) ; thus, Γ 3 is the best choice among all the alternatives.
Now, we use the BNNIGWGHM operator (set p =1, q = 1) to deal with this problem.
Step 1’: Just as described in step 1.
Step 2’: According to Definition 13 (suppose p = q = 1) and ε of attributes, calculate τ i ( i =   1 ,   2 ,   3 ,   4 ) :
τ 1 = 0.3834 , 0.5909 , 0.4846 , 0.6881 , 0.4467 , 0.5722 ,
τ 2 = 0.7371 , 0.5369 , 0.6627 , 0.5747 , 0.4484 , 0.2381 ,
τ 3 = 0.4112 , 0.3994 , 0.2991 , 0.5106 , 0.3982 , 0.3551 ,
τ 4 = 0.4922 , 0.5086 , 0.4579 , 0.5674 , 0.5684 , 0.2139 .
Step 3’: According to Equation (5), calculate the score value of s ( τ i ) . for τ i ( i = 1 ,   2 ,   3 ,   4 ) :
s ( τ 1 ) = 0.4398 ;   s ( τ 2 ) = 0.4416 ;   s ( τ 3 ) = 0.4926 ;   s ( τ 4 ) = 0.4568 .
Step 4’: According to Definition 5, rank Γ 3 Γ 4 Γ 2 Γ 1 corresponding to s ( τ i ) ; thus, Γ 3 is the best choice among all the alternatives.

5.2. Analyzing the Effects of the Parameters p and q

In this section, we took different parameters p and q for calculating τ i ( i = 1 ,   2 ,   3 ,   4 ) for the alternative Γ i , and then we analyzed the influence of the parameters p and q for the ranking result. Table 2 and Table 3 show the values of s ( τ 1 ) to s ( τ 4 ) and the ranking results.
From the decision results based on BNNIGWHM in Table 2, we can see that all the ranking orders are Γ 3 Γ 4 Γ 1 Γ 2 in No. 1–2 and all the ranking orders are Γ 3 Γ 4 Γ 2 Γ 1 in No. 3–7; thus, the best choice is   Γ 3 . From the decision results based on BNNIGWGHM in Table 3, we can see that the ranking order is Γ 3 Γ 4 Γ 1 Γ 2 in No. 6 and the others are Γ 3 Γ 4 Γ 2 Γ 1 ; thus, the best choice is also Γ 3 .
IGWHM and IGWGHM aggregation operators can take into account the correlation between attribute values and can better reflect the preferences of decision-makers and make the decision results more reasonable and reliable. A BNS has two fully independent parts, one part has three independent positive membership functions and the other has three independent negative membership functions, which can deal with uncertain information containing incompatible polarity. Here, we used the BNNIGWHM and BNNIGWGHM operators to solve real problems and analyze the influences of parameters p and q on the results of decisions, using different parameter values for sorting and comparing the corresponding results. Then, it could be found that the influences of parameters p and q on the results of decisions were small in these both methods. Comparing the results of the two methods, it can be found that their results were consistent; therefore, the proposed methods in this paper have feasibility and generality.

5.3. Comparison with Related Methods

In this section, we compared the methods proposed in this paper with other related methods proposed in the literature [16,19]. Table 4 lists the ranking results.
In Table 4, we can see that the ranking results were different; Γ 3 was obtained as the optimal alternative except the method in Reference [19] with λ = 0.9. Compared with these related methods, the BNNIGWHM and BNNIGWGHM operators considered the correlation between attribute values and could better reflect the preferences of decision-makers and make the decision results more reasonable and reliable while dealing with uncertain information containing incompatible polarity. Thus, we think the proposed methods in this paper are more suitable to handle these decision-making problems.

6. Conclusions

This paper firstly proposed the BNNGWHM, BNNIGWHM, BNNGWGHM, and BNNIGWGHM operators for BNNs and discussed the related properties of these four operators. Furthermore, we developed two methods of MCDM in a BNN environment based on the BNNIGWHM and BNNIGWGHM operators. Finally, these two methods were used for a numerical example to establish their effectiveness and application. Dealing with the calculation, we took different values for p and q to observe the sorting results and found that both parameters had little influence on the decision results. Furthermore, we compared the proposed methods with related methods and discovered that the selection result using the proposed methods was the same as the majority of existing methods. In the future, we will make further research bipolar neutrosophic sets, using, e.g., the technique for order preference by similarity to an ideal solution (TOPSIS) and VIKOR (VIseKriterijumska Optimizacija I Kompromisno Resenje, that means: multicriteria optimization and compromise solution, with pronunciation: vikor) methods with BNS [23], the weighted aggregated sum product assessment (WASPAS) method with BNS [24], the Multi-Attribute Market Value Assessment ( MAMVA) method with BNS [25], and so on [26,27,28].

Author Contributions

C.F. proposed the BNNIGWHM and BNNIGWGHM operators and investigated their properties, C.F., S.F. and K.H. presented the organization and decision making method of this paper, J.Y. and E.F. provided the calculation and analysis of the illustrative example; All authors wrote the paper together.

Funding

This research was funded by [the National Natural Science Foundation of China] grant number [61703280, 61603258], [the Science and Technology Planning Project of Shaoxing City of China] grant number [2017B70056, 2018C10013], [the General Research Project of Zhejiang Provincial Department of Education] grant number [Y201839944], and [the Public Welfare Technology Research Project of Zhejiang Province] grant number [LGG19F020007].

Conflicts of Interest

The author declares no conflict of interest.

References

  1. Zadeh, L.A. Fuzzy sets. Inf. Control 1965, 8, 338–356. [Google Scholar] [CrossRef]
  2. Atanassov, K.T. Intuitionistic fuzzy sets. Fuzzy Sets Syst. 1986, 20, 87–96. [Google Scholar] [CrossRef]
  3. Chen, T.Y.; Han, Y.; Liao, S.Z. The largest sub-algebra and its generalized tautology in disturbing fuzzy propositional logic. Chin. J. Eng. Math. 2003, 20, 118–120. [Google Scholar]
  4. Zadeh, L.A. The concept of a linguistic variable and its application to approximate reasoning-I. Inf. Sci. 1975, 8, 199–249. [Google Scholar] [CrossRef]
  5. Smarandache, F. Neutrosophy: Neutrosophic Probability, Set, and Logic; American Research Press: Rehoboth, MA, USA, 1998. [Google Scholar]
  6. Wang, H.; Smarandache, F.; Zhang, Y.Q.; Sunderraman, R. Single valued neutrosophic sets. Rev. Air Acad. 2010, 17, 1–10. [Google Scholar]
  7. Wang, H.; Smarandache, F.; Zhang, Y.Q.; Sunderraman, R. Interval neutrosophic sets and logic: Theory and applications in computing. Int. Conf. Comput. Sci. 2006, 3991, 920–923. [Google Scholar]
  8. Smarandache, F. n-Valued Refined Neutrosophic Logic and Its Applications in Physics. Prog. Phys. 2013, 4, 143–146. [Google Scholar]
  9. Zhang, W.R. Bipolar fuzzy sets and relations: A computational framework for cognitive modeling and multiagent decision analysis. In Proceedings of the The Workshop on Fuzzy Information Processing Society Bi Conference, San Antonio, TX, USA, 18–21 December 1994; pp. 305–309. [Google Scholar]
  10. Zhang, W.R. Yin Yang Bipolar Relativity: A Unifying Theory of Nature, Agents and Causality with Applications in Quantum Computing, Cognitive Informatics and Life Sciences; IGI Global: Hershey, PA, USA, 2011. [Google Scholar]
  11. Mesiarova-Zemankova, A.; Ahmad, K. Extended multi-polarity and multi-polar-valued fuzzy sets. Fuzzy Sets Syst. 2014, 234, 61–78. [Google Scholar] [CrossRef]
  12. Chen, J.J.; Li, S.G.; Ma, S.Q.; Wang, X.P. m-polar fuzzy sets: An extension of bipolar fuzzy sets. Sci. World J. 2014, 3, 1–8. [Google Scholar]
  13. Bosc, P.; Pivert, O. On a fuzzy bipolar relational algebra. Inf. Sci. 2013, 219, 1–16. [Google Scholar] [CrossRef]
  14. Manemaran, S.V.; Chellappa, B. Structures on bipolar fuzzy groups and bipolar fuzzy ideals under (T, S) Norms. Int. J. Comput. Appl. 2012, 9, 24–28. [Google Scholar] [CrossRef]
  15. Zhou, M.; Li, S. Application of bipolar fuzzy sets in semirings. J. Math. Res. Appl. 2014, 34, 61–72. [Google Scholar]
  16. Deli, I.; Ali, M.; Smarandache, F. Bipolar neutrosophic sets and their application based on multi-criteria decision making problems. In Proceedings of the International Conference on Advanced Mechatronic Systems, Beijing, China, 22–24 August 2015; pp. 249–254. [Google Scholar]
  17. Pramanik, S.; Dey, P.P.; Giri, B.C.; Smarandache, F. Bipolar neutrosophic projection based models for solving multi-attribute decision making problems. Neutrosophic Sets Syst. 2017, 15, 70–79. [Google Scholar]
  18. Dey, P.P.; Pramanik, S.; Giri, B.C. TOPSIS for Solving Multi-Attribute Decision Making Problems under Bi-Polar Neutrosophic Environment. New Trends in Neutrosophic Theory and Application, Pons asbl; European Union: Brussels, Belgium, 2016; pp. 65–77. [Google Scholar]
  19. Uluçay, V.; Deli, I.; Şahin, M. Similarity measures of bipolar neutrosophic sets and their application to multiple criteria decision making. Neural Comput. Appl. 2016, 29, 739–748. [Google Scholar] [CrossRef]
  20. Wang, L.; Zhang, H.Y.; Wang, J.Q. Frank Choquet Bonferroni mean operators of bipolar neutrosophic sets and their application to multi-criteria decision-making problems. Int. J. Fuzzy Syst. 2017, 3, 1–16. [Google Scholar] [CrossRef]
  21. Yu, D.J.; Wu, Y.Y. Interval-valued intuitionistic fuzzy Heronian mean operators and their application in multi-criteria decision making. Afr. J. Bus. Manag. 2012, 6, 4158–4168. [Google Scholar] [CrossRef]
  22. Liu, P.D. The Evaluation Method and Application Research of Enterprise Information Level Based on Fuzzy Multi-Attribute Decision-Making; Beijing Jiaotong University: Bejing, China, 2010; pp. 113–129. [Google Scholar]
  23. Pouresmaeil, H.; Shivanian, E.; Khorram, E.; Fathabadi, H.S. An Extended Method Using Topsis And Vikor For Multiple Attribute Decision Making with Multiple Decision Makers And Single Valued Neutrosophic Numbers. Adv. Appl. Stat. 2017, 50, 261–292. [Google Scholar] [CrossRef]
  24. Zavadskas, E.K.; Bausys, R.; Lazauskas, M. Sustainable assessment of alternative sites for the construction of a waste incineration plant by applying WASPAS method with single-valued neutrosophic set. Sustainability 2015, 7, 15923–15936. [Google Scholar] [CrossRef]
  25. Zavadskas, E.K.; Bausys, R.; Kaklauskas, A.; Ubartė, I.; Kuzminskė, A.; Gudienė, N. Sustainable market valuation of buildings by the single-valued neutrosophic MAMVA method. Appl. Soft Comput. 2017, 57, 74–87. [Google Scholar] [CrossRef]
  26. Stanujkic, D.; Zavadskas, E.K.; Smarandache, F.; Brauers, W.K.M.; Karabasevic, D. A neutrosophic extension of the MULTIMOORA method. Informatica 2017, 28, 181–192. [Google Scholar] [CrossRef]
  27. Li, Y.; Liu, P.; Chen, Y. Some Single Valued Neutrosophic Number Heronian Mean Operators and Their Application in Multiple Attribute Group Decision Making. Informatica 2016, 27, 85–110. [Google Scholar] [CrossRef]
  28. Zavadskas, E.K.; Bausys, R.; Juodagalviene, B.; Garnyte-Sapranaviciene, I. Model for residential house element and material selection by neutrosophic MULTIMOORA method. Eng. Appl. Artif. Intell. 2017, 64, 315–324. [Google Scholar] [CrossRef]
Figure 1. The relationship between τ 1 and τ 2 .
Figure 1. The relationship between τ 1 and τ 2 .
Mathematics 07 00097 g001
Table 1. The decision matrix ( τ i j ) 4 × 4 .
Table 1. The decision matrix ( τ i j ) 4 × 4 .
Φ 1 Φ 2 Φ 3 Φ 4
Γ 1 0.5 , 0.7 , 0.2 , 0.7 , 0.3 , 0.6 0.4 , 0.4 , 0.5 , 0.7 , 0.8 , 0.4 0.7 , 0.7.0.5 , 0.8 , 0.7 , 0.6 0.1 , 0.5 , 0.7 , 0.5 , 0.2 , 0.8
Γ 2 0.9 , 0.7 , 0.5 , 0.7 , 0.7 , 0.1 0.7 , 0.6 , 0.8 , 0.7 , 0.5 , 0.1 0.9 , 0.4 , 0.6 , 0.1 , 0.7 , 0.5 0.5 , 0.2 , 0.7 , 0.5 , 0.1 , 0.9
Γ 3 0.3 , 0.4 , 0.2 , 0.6 , 0.3 , 0.7 0.2 , 0.2 , 0.2 , 0.4 , 0.7 , 0.4 0.9 , 0.5 , 0.5 , 0.6 , 0.5 , 0.2 0.7 , 0.5 , 0.3 , 0.4 , 0.2 , 0.2
Γ 4 0.9 , 0.7 , 0.2 , 0.8 , 0.6 , 0.1 0.3 , 0.5 , 0.2 , 0.5 , 0.5 , 0.2 0.5 , 0.4 , 0.5 , 0.1 , 0.7 , 0.2 0.4 , 0.2 , 0.8 , 0.5 , 0.5 , 0.6
Table 2. Ranking results with different values of p and q based on bipolar neutrosophic number improved generalized weighted Heronian mean (BNNIGWHM) operator.
Table 2. Ranking results with different values of p and q based on bipolar neutrosophic number improved generalized weighted Heronian mean (BNNIGWHM) operator.
No.p, qBNNIGWHMRanking
1p = 1, q = 0s( τ 1 ) = 0.4915, s ( τ 2 ) = 0.4782, s ( τ 3 ) = 0.5471, s ( τ 4 ) = 0.5116 Γ 3 Γ 4 Γ 1 Γ 2
2p = 1, q = 0.5s( τ 1 ) = 0.4823, s( τ 2 ) = 0.4809, s ( τ 3 ) = 0.5392, s ( τ 4 ) = 0.5083 Γ 3 Γ 4 Γ 1 Γ 2
3p = 1, q = 2s( τ 1 ) = 0.5059, s ( τ 2 ) = 0.5316, s ( τ 3 ) = 0.5658, s ( τ 4 ) = 0.5495 Γ 3 Γ 4 Γ 2 Γ 1
4p = 0, q = 1s( τ 1 ) = 0.5021, s ( τ 2 ) = 0.5433, s ( τ 3 ) = 0.5659, s ( τ 4 ) = 0.5517 Γ 3 Γ 4 Γ 2 Γ 1
5p = 0.5, q = 1s( τ 1 ) = 0.4871, s ( τ 2 ) = 0.4966, s ( τ 3 ) = 0.5445, s ( τ 4 ) = 0.5215 Γ 3 Γ 4 Γ 2 Γ 1
6p = 2, q = 1s( τ 1 ) = 0.4981, s ( τ 2 ) = 0.5161, s ( τ 3 ) = 0.5589, s ( τ 4 ) = 0.5346 Γ 3 Γ 4 Γ 2 Γ 1
7p = 2, q = 2s( τ 1 ) = 0.5105, s ( τ 2 ) = 0.5425, s ( τ 3 ) = 0.5730, s ( τ 4 ) = 0.5567 Γ 3 Γ 4 Γ 2 Γ 1
Table 3. The ranking with different p and q based on BNN improved generalized weighted geometry HM (BNNIGWGHM) operator.
Table 3. The ranking with different p and q based on BNN improved generalized weighted geometry HM (BNNIGWGHM) operator.
No.p, qBNNIGWGHMRanking
1p = 1, q = 0s( τ 1 ) = 0.5228, s ( τ 2 ) = 0.5768, s ( τ 3 ) = 0.5967, s ( τ 4 ) = 0.5955 Γ 3 Γ 4 Γ 2 Γ 1
2p = 1, q = 0.5s( τ 1 ) = 0.4831, s ( τ 2 ) = 0.4893, s ( τ 3 ) = 0.5358, s ( τ 4 ) = 0.5039 Γ 3 Γ 4 Γ 2 Γ 1
3p = 1, q = 2s( τ 1 ) = 0.3834, s ( τ 2 ) = 0.3990, s ( τ 3 ) = 0.4504, s ( τ 4 ) = 0.4160 Γ 3 Γ 4 Γ 2 Γ 1
4p = 0, q = 1s( τ 1 ) = 0.4190, s ( τ 2 ) = 0.4376, s ( τ 3 ) = 0.4841, s ( τ 4 ) = 0.4584 Γ 3 Γ 4 Γ 2 Γ 1
5p = 0.5, q = 1s( τ 1 ) = 0.4411, s ( τ 2 ) = 0.4492, s ( τ 3 ) = 0.4957, s ( τ 4 ) = 0.4664 Γ 3 Γ 4 Γ 2 Γ 1
6p = 2, q = 1s( τ 1 ) = 0.4275, s ( τ 2 ) = 0.4211, s ( τ 3 ) = 0.4791, s ( τ 4 ) = 0.4341 Γ 3 Γ 4 Γ 1 Γ 2
7p = 2, q = 2s( τ 1 ) = 0.3873, s ( τ 2 ) = 0.3913, s ( τ 3 ) = 0.4496, s ( τ 4 ) = 0.4057 Γ 3 Γ 4 Γ 2 Γ 1
Table 4. Decision results based on four aggregation operators.
Table 4. Decision results based on four aggregation operators.
Aggregation OperatorScore ValueRanking
The bipolar neutrosophic weighted average operator (Aw) and bipolar neutrosophic weighted geometric operator (Gw) proposed in Reference [16]σ( τ 1 ) = 0.50, σ( τ 2 ) = 0.52,
σ( τ 3 ) = 0.56, σ( τ 4 ) = 0.54
Γ 3 Γ 4 Γ 2 Γ 1
The Similarity measures of bipolar neutrosophic sets proposed in Reference [19] with the following variables:
λ = 0.25σ( τ 1 ) = 0.24683, σ( τ 2 ) = 0.11778,
σ( τ 3 ) = 0.27833, σ( τ 4 ) = 0.21136
Γ 3 Γ 1 Γ 4 Γ 2
λ = 0.3σ( τ 1 ) = 0.27063, σ( τ 2 ) = 0.19497,
σ( τ 3 ) = 0.30222, σ( τ 4 ) = 0.22904
Γ 3 Γ 1 Γ 4 Γ 2
λ = 0.6σ( τ 1 ) = 0.41342, σ( τ 2 ) = 0.29803,
σ( τ 3 ) = 0.44555, σ( τ 4 ) = 0.33510
Γ 3 Γ 1 Γ 4 Γ 2
λ = 0.9σ( τ 1 ) = 0.55620, σ( τ 2 ) = 0.40109,
σ( τ 3 ) = 0.54313, σ( τ 4 ) = 0.44116
Γ 1 Γ 3 Γ 4 Γ 2

Share and Cite

MDPI and ACS Style

Fan, C.; Ye, J.; Feng, S.; Fan, E.; Hu, K. Multi-Criteria Decision-Making Method Using Heronian Mean Operators under a Bipolar Neutrosophic Environment. Mathematics 2019, 7, 97. https://doi.org/10.3390/math7010097

AMA Style

Fan C, Ye J, Feng S, Fan E, Hu K. Multi-Criteria Decision-Making Method Using Heronian Mean Operators under a Bipolar Neutrosophic Environment. Mathematics. 2019; 7(1):97. https://doi.org/10.3390/math7010097

Chicago/Turabian Style

Fan, Changxing, Jun Ye, Sheng Feng, En Fan, and Keli Hu. 2019. "Multi-Criteria Decision-Making Method Using Heronian Mean Operators under a Bipolar Neutrosophic Environment" Mathematics 7, no. 1: 97. https://doi.org/10.3390/math7010097

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