1 Introduction

Ever since the fuzzy set theory was first proposed by Zadeh (1965), fuzzy sets (FSs), especially triangular fuzzy numbers (TFN) and trapezoidal fuzzy numbers (TrFN) have been widely studied, developed, and applied to various fields, such as multi-criteria decision-making (MCDM), logic programming and pattern recognition. With regard to an arbitrary fuzzy set \(A\), the degree of membership of the element \(x\) in a universe \(X\) is a single value, which mixes the evidence for \(x\in X\)with that against \(x\in X\). Therefore, the FS theory cannot tackle the cases of incomplete information referring to a fuzzy concept, i.e., the sum of the degrees of membership and non-membership is less than one. Atanassov’ intuitionistic fuzzy sets (AIFSs), which were introduced by Atanassov (1986) and widely studied by many researchers (Atanassov 2000, 2007; Burillo et al. 1994), use two characteristic functions to express the degree of membership and non-membership respectively. With the supplement of non-membership function, AIFSs can deal with the presence of vagueness and hesitancy originating from imprecise knowledge or information.

The talent of AIFSs in describing fuzziness makes it popular with researchers quickly, and quite a lot of work has already been done in MCDM problems (Kavita 2011) and optimization problem (Angelov 1997). Atanassov and Gargov (1989) introduced the concept of interval-valued Atanassov’ intuitionistic fuzzy sets (IVAIFSs), in which the membership and non-membership both took the form of interval numbers. Liu and Yuan (2007) brought the definition of fuzzy number AIFSs (FNAIFSs), and introduced the corresponding operations. Angelov (1995) introduced some definitions of crispification, which was an analog to the basic operations of AIFSs—defuzzification, and many scholars proposed a lot of relative decision-making methods based on these concepts. Liu and Li (2009) defined some fuzzy number amelioration operators to optimize Atanassov’ intuitionistic fuzzy numbers. Boran et al. (2009) proposed a TOPSIS method combined with AIFSs to select an appropriate supplier in group decision-making environment. Li (2010a) developed a method based on the extended generalized ordered weighted averaging (GOWA) operators to solve MCDM problems with AIFSs. Zhao et al. (2010) introduced some generalized Atanassov’ intuitionistic fuzzy aggregation operators to deal with Atanassov’ intuitionistic fuzzy and interval-valued Atanassov’ intuitionistic fuzzy information. Xu (2010) used the Choquet integral to propose some Atanassov’ intuitionistic fuzzy aggregation operators that could reflect the correlations among the elements. Wei (2010) introduced some induced geometric aggregation operators with Atanassov’ intuitionistic fuzzy information, and then applied them to group decision-making problems. Park et al. (2010) extended the VIKOR method for dynamic intuitionistic fuzzy MCDM problems. Feng and Qian (2010) presented a method of grey-related analysis for handling MCDM problems based on AIFSs. Chen et al. (2011) proposed an approach to deal with the multi-criteria group decision-making (MCGDM) problem based on the interval-valued Atanassov’ intuitionistic fuzzy preference relation. Yadav and Kumar (2009) extended the TOPSIS method to solve supplier selection problems with IVAIFSs. Tan (2011) investigated an MCDM technique with IVAIFSs based on an extension of the TOPSIS method in group decision-making environment, where the inter-dependent or interactive characteristics were taken into account. Ye (2011) studied the fuzzy cross-entropy of IVAIFSs to deal with MCDM problems. Xu and Xia (2011) applied the Choquet integral and Dempster–Shafer evidence theory to aggregate inuitionistic fuzzy information. Li (2011) developed a methodology for solving MCDM problems with AIFSs.

With the increasing development of AIFS theory, quite a few extensions of Atanassov’ intuitionistic fuzzy numbers (AIFNs) such as triangular Atanassov’ intuitionistic fuzzy numbers (TAIFNs) (Shu et al. 2006), trapezoid Atanassov’ intuitionistic fuzzy numbers (TrAIFNs) (Wang 2008) and Atanassov’ intuitionistic linguistic numbers (AILNs) have been proposed (Wang and Li 2010). Shu et al. (2006) discussed the definition of TAIFNs and their operations, and then applied them to the fault-tree analysis. Wang and Li (2010) gave a definition of AILNs as well as the aggregation operators, and then applied them to MCDM problems with AILNs. Some trapezoid Atanassov’ intuitionistic fuzzy aggregation operators were defined to deal with MCDM problems with TrAIFNs (Wang and Zhang 2009a, b; Wan and Dong 2010; Wan 2013a; Wang and Nie 2012). Wang et al. (2013) introduced the operators of TAIFNs and applied them in the system fault analysis. With considerations of inter-dependent or interactive characteristics among criteria, Wang and Nie (2011) proposed an Atanassov’ intuitionistic triangle fuzzy MCDM method. Wan also did a lot of work on TAIFNs, such as the properties of TAIFNs (Wan et al. 2013a), the extended VIKOR method for MCGDM with TAIFNs (Wan et al. 2013b), and the MCDM method based on possibility variance coefficient of TAIFNs (Wan 2013b). In addition, Wan (2010) made a comprehensive survey on Atanassov’ intuitionistic fuzzy MCDM approach according to the forms of AIFSs, such as AIFSs, IVAIFSs, TAIFNs and TrAIFNs. It is worthwhile to note that the domains of AIFSs and IVAIFSs are discrete sets, they are the extensions of fuzzy sets. TAIFNs and TrAIFNs extend the domain of AIFSs from discrete sets to continuous sets, and they are the extensions of fuzzy numbers. Compared to AIFSs, TAIFNs and TrAIFNs express their membership and non-membership functions using TFNs and TrFNs, and make the membership degree and the non-membership degree no longer relative to a fuzzy concept “Excellent” or “Good”, but relative to TFNs or TrFNs. Thus, the information of decision makers can be exactly reflected and expressed in different dimensions (Wan 2013a). Hence, TAIFNs and TrAIFNs can better reflect the information of decision problems than IFSs.

The normal intuitionistic fuzzy numbers (NIFNs) which express the membership and non-membership functions by normal fuzzy numbers (NFNs) have much more realistic sense than TAIFNs or TrAIFNs. The definition of NIFNs was first proposed by Wang and Li (2012, 2013), together with the corresponding operations, the score function and the stability factor. In reality, a large number of natural phenomena and social phenomena belong to the normal distribution, and NFNs defined by Yang and Ko (1996) can well express these phenomena. Li and Liu (2004) pointed out that, compared to other fuzzy numbers such as TFNs and TrFNs, NFNs has several advantages. First, the normal distribution widely exists in natural phenomena, social phenomena and production activities. Second, the higher derivative of the normal membership function is continuous. Third, the fuzzy concepts characterized by the normal membership function are much closer to human mind. Consequently, NIFNs are superior than other Atanassov’ intuitionistic fuzzy numbers.

Due to the talent of NIFNs in reflecting uncertain information, especially in reflecting the inherent fuzziness of uncertain information, NIFNs have wide applications in MCDM problems just as TIFNs or TrIFNs. As the aggregation operators of NIFNs are important tools of information fusion in MCDM problems with normal intuitionistic fuzzy information, some aggregation operators of NIFNs will be introduced in this paper. The rest of this paper is organized as follows. The definition of NIFNs as well as their operations is reviewed in Sect. 2 to make you have a better understanding of this paper. In Sect. 3, some normal intuitionistic fuzzy aggregation operators and their properties are presented. Then in Sect. 4, a normal intuitionistic fuzzy MCDM approach based on normal intuitionistic fuzzy-induced generalized aggregation operator is proposed. In Sect. 5, an illustrative example and the comparison analysis are given to show the feasibility and validity of the approach. In Sect. 6, some conclusions are drawn.

2 NIFNs and the related concepts

For the purpose of making this paper smoother and easier to understand, some basic concepts are here to review.

Definition 1

(Yang and Ko 1996) Let \(R\) be a real number set and \(\tilde{A}=(a,\sigma )\) be an NFN if its membership function satisfies:

$$\begin{aligned} \tilde{A}(x)=e^{-\left( \frac{x-a}{\sigma }\right) ^2}(\sigma >0). \end{aligned}$$

Here, the set of NFNs is denoted by \(\tilde{N}\).

Definition 2

(Xu and Li 2001) Let \(\tilde{A},\tilde{B}\in \tilde{N}\) and \(\tilde{A}=(a,\sigma ),\tilde{B}=(b,\tau )\), and then two operations between \(\tilde{A}\) and \(\tilde{B}\) can be defined as follows:

  1. (1)

    \(t\tilde{A}=t(a,\sigma )=(ta,t\sigma )(t>0);\)

  2. (2)

    \(\tilde{A}+\tilde{B}=(a,\sigma )+(b,\tau )=(a+b,\sigma +\tau ).\)

Definition 3

(Li 2008) Let \(\tilde{A},\tilde{B}\in \tilde{N}\) and \(\tilde{A}=(a,\sigma ),\tilde{B}=(b,\tau )\), and then the distance between \(\tilde{A}\) and \(\tilde{B}\) is

$$\begin{aligned} d^2 (\tilde{A},\tilde{B})=(a-b)^2+\frac{1}{2}(\sigma -\tau )^2. \end{aligned}$$
(1)

Definition 4

(Wang and Li 2012, 2013) Let \(X\) be an ordinary finite non-empty set and \((a,\sigma )\in \tilde{N}\), \(A=\langle (a,\sigma ),\mu _A ,v_A\rangle \) is an NIFN if its membership function satisfies:

$$\begin{aligned} \mu _A (x)=\mu _A e^{-\left( \frac{x-a}{\sigma }\right) ^2},\quad x\in X, \end{aligned}$$
(2)

and its non-membership function satisfies:

$$\begin{aligned} v_A (x)=1-(1-v_A )e^{-\left( \frac{x-a}{\sigma }\right) ^2},\quad x\in X. \end{aligned}$$
(3)

where \(0\le \mu _A \le 1,0\le v_A \le 1,\mu _A +v_A \le 1\). When \(\mu _A =1\) and \(\nu _A =0\), the NIFN will be an NFN. Compared to NFNs, NIFNs add the non-membership function that expresses the degree of alternatives not belonging to \((a,\sigma )\). In addition, \(\pi _A (x)=1-\mu _A (x)-v_A (x)\) expresses the degree of hesitance.

The set of NIFNs is denoted by NIFNS.

Definition 5

(Wang and Li 2012, 2013) Let \(A=\langle (a,\sigma _A ),\mu _A ,v_A\rangle \) and \(B=\langle (b,\sigma _B ),\mu _B ,v_B \rangle \) be two NIFNs, and some operations between \(A\) and \(B\) can be defined as follows.

  1. (1)

    \(A+B=\left\langle (a+b,\sigma _A +\sigma _B ),\frac{\vert a\vert \mu _A +\vert b\vert \mu _B }{\vert a\vert +\vert b\vert },\frac{\vert a\vert v_A +\vert b\vert v_B }{\vert a\vert +\vert b\vert }\right\rangle ;\)

  2. (2)

    \(A-B=\left\langle (a-b,\sigma _A +\sigma _B ),\frac{\vert a\vert \mu _A +\vert b\vert \mu _B }{\vert a\vert +\vert b\vert },\frac{\vert a\vert v_A +\vert b\vert v_B }{\vert a\vert +\vert b\vert }\right\rangle .\) When \(\vert a\vert =0\) and \(\vert b\vert =0\), \(\mu _{A+B} =\mu _{A-B} =\frac{\mu _A +\mu _B }{2}\), and \(\nu _{A+B} =v_{A-B} =\frac{\nu _A +\nu _B }{2}\).

  3. (3)

    \(\lambda A=\langle (\lambda a,\lambda \sigma _A ),\mu _A ,v_A \rangle .\)

  4. (4)

    \(\frac{1}{A}=\left\langle \left( \frac{1}{a},\frac{\sigma _A }{a^2}\right) ,\mu _A ,v_A \right\rangle ,a\ne 0.\)

  5. (5)

    \(AB=\left\langle \left( ab,ab\sqrt{\frac{\sigma _A ^2}{a^2}+\frac{\sigma _B ^2}{b^2}} \right) ,\mu _A \mu _B ,v_A +v_B -v_A v_B \right\rangle .\)

  6. (6)

    \(A^\lambda =\left\langle \left( a^\lambda ,\lambda ^{\frac{1}{2}}a^{\lambda -1}\sigma _A \right) ,\mu _A ^\lambda ,1-(1-\nu { }_A)^\lambda \right\rangle (\lambda \ge 0).\)

Example 1

Let \(A=\langle (6,0.5),0.4,0.2\rangle \), \(B=\langle (4,0.3),0.6,0.1\rangle \) and \(\lambda =2\). Then, the followings are true:

  1. (1)

    \(A+B=\left\langle (6+4,0.5+0.3),\frac{\vert 6\vert 0.4+\vert 4\vert 0.6}{\vert 6\vert +\vert 4\vert },\frac{\vert 6\vert 0.2+\vert 4\vert 0.1}{\vert 6\vert +\vert 4\vert }\right\rangle =\langle (10,0.8),0.48,0.16\rangle ;\)

  2. (2)

    \(A-B=\left\langle (6-4,0.5+0.3),\frac{\vert 6\vert 0.4+\vert 4\vert 0.6}{\vert 6\vert +\vert 4\vert },\frac{\vert 6\vert 0.2+\vert 4\vert 0.1}{\vert 6\vert +\vert 4\vert }\right\rangle =\langle (2,0.8),0.48,0.16\rangle ;\)

  3. (3)

    \(2A=\langle (2\times 6,2\times 0.5),0.4,0.2\rangle =\langle (12,1),0.4,0.2\rangle ;\)

  4. (4)

    \(\frac{1}{A}=\left\langle \left( \frac{1}{6},\frac{0.5}{6^2}\right) ,0.4,0.2\right\rangle =\left\langle \left( \frac{1}{6},\frac{1}{72}\right) ,0.4,0.2\right\rangle ;\)

  5. (5)

    \(AB{=}\left\langle \left( 6\times 4,6\times 4\sqrt{\frac{0.5^2}{6^2}+\frac{0.3^2}{4^2}} \right) ,0.4\times 0.6,0.2+0.1-0.2\times 0.1\right\rangle \quad =\langle (24,2.69),0.24,28\rangle ;\)

  6. (6)

    \(A^2\!=\!\left\langle \left( 6^2,2^{\frac{1}{2}}\times 6^{2-1}\times 0.5\right) ,0.5^2,1\!-\!(1-0.2)^2\right\rangle =\langle (36,4.24),0.25,0.36\rangle .\)

Proposition 1

Let \(A=\langle (a,\sigma _A ),\mu _A ,v_A \rangle , \,\,B=\langle (b,\sigma _B ),\mu _B ,v_B \rangle \) and \(C=\langle (c,\sigma _C ),\mu _C ,v_C \rangle \) be three NINFs, and \(ab\ge 0,bc\ge 0,ac\ge 0\). The following equations are true:

  1. (1)

    \(A+B=B+A;\)

  2. (2)

    \((A+B)+C=A+(B+C);\)

  3. (3)

    \(AB=BA;\)

  4. (4)

    \((AB)C=A(BC);\)

  5. (5)

    \(\lambda _1 A+\lambda _2 A=(\lambda _1 +\lambda _2 )A,\lambda _1 ,\lambda _2 \ge 0;\)

  6. (6)

    \(\lambda (A+B)=\lambda A+\lambda B,\lambda \ge 0.\)

Remark 1

NIFNs introduced in this paper are similar to TIFNs or TrIFNs, but the operations are not analogs of TIFNs’ or TrIFNs’ operations. However, TrIFNs’ operations are similar to TIFNs’, we just take the additive and multiplicative operations of TIFNs for example.

Given two TIFNs, \(A=\langle (a_1 ,a_2 ,a_3 ),\mu _a ,\nu _a \rangle \) and \(B=\langle ( b_1 ,b_2 ,b_3 ),\mu _b ,\nu _b \rangle \), the additive and multiplicative operations between \(A\) and \(B\) are defined as follows (Li 2008):

  1. (1)

    \(A+B=\langle (a_1 +b_1 ,a_2 +b_2 ,a_3 +b_3 ),\min \{\mu _a ,\mu _b \},\max \{\nu _a ,\nu _b \}\rangle ;\)

  2. (2)

    \(AB=\langle (a_1 b_1 ,a_2 b_2 ,a_3 b_3 ),\min \{\mu _a ,\mu _b \},\max \{\nu _a ,\nu _b \}\rangle .\)

Obviously, there are some deficiencies for the operations above. For example, when \(A=\langle (a_1 ,a_2 ,a_3 ),0,1\rangle \) and \(B=\langle (a_1 ,a_2 ,a_3 ),1,0\rangle \), \(A+B=\langle (2a_1 ,2a_2 ,2a_3) ,0,1\rangle \) and \(AB=\langle (a_1^2 ,a_2^2 ,a_3^2 ),0,1\rangle \). Intuitively, if one team unanimously approved an alternative while another unanimously opposed it, then the overall approval rating of this alternative should not be zero, so the additive operation of TIFNs is not reasonable enough. Meanwhile, the TIFNs’ multiplicative operation is exclusive to the case of \(a_1 ,a_2 ,a_3 ,b_1 ,b_2 ,b_3 >0\). For two NIFNs \(A=\langle (a,\sigma ),0,1\rangle \) and \(B=\langle (a,\sigma ),1,0\rangle \), if the additive and multiplicative operations of NIFNs are applied to them, there will be \(A+B=\langle (2a,2\sigma ),\frac{1}{2},\frac{1}{2}\rangle \) and \(AB=\langle (a^2,\sqrt{2} \sigma ^2),0,1\rangle \). Here, the deficiencies of TIFNs’ operations are not inherited in NIFNs’ operations.

Definition 6

(Wang and Li 2012, 2013) Let \(A=\langle (a,\sigma _A ),\mu _A ,v_A \rangle \) be an NIFN, then its score function is

$$\begin{aligned} s_1 (A)=a(\mu _A -v_A ),s_2 (A)=\sigma _A (\mu _A -v_A ), \end{aligned}$$
(4)

and its accuracy function is

$$\begin{aligned} h_1 (A)=a(\mu _A +v_A ),h_2 (A)=\sigma _A (\mu _A +v_A ). \end{aligned}$$
(5)

Definition 7

(Wang and Li 2012, 2013) Let \(A=\langle (a,\sigma _A ),\mu _A ,v_A \rangle \) and \(B=\langle (b,\sigma _B ),\mu _B ,v_B \rangle \) be two NIFNs, the score functions of \(A\) and \(B\) be \(s_1 (A),s_2 (A)\) and \(s_1 (B),s_2 (B)\), and the accuracy functions of \(A\) and \(B\) be \(h_1 (A),h_2 (A)\) and \(h_1 (B),h_2 (B)\), respectively. Then, there will be:

  1. (1)

    when \(s_1 (A)>s_1 (B)\), \(A>B\);

  2. (2)

    when \(s_1 (A)=s_1 (B)\) and \(h_1 (A)>h_1 (B)\), \(A>B\);

  3. (3)

    when \(s_1 (A)=s_1 (B)\) and \(h_1 (A)=h_1 (B)\);

  4. (a)

    when \(s_2 (A)< s_2 (B), \,\,A>B;\)

  5. (b)

    when \(s_2 (A)=s_2 (B)\) and \(h_2 (A)< h_2 (B)\), \(A>B\);

  6. (c)

    when \(s_2 (A)=s_2 (B)\) and \(h_2 (A)=h_2 (B)\), \(A=B\).

Example 2

If \(A=\langle (6,0.5),0.4,0.2\rangle \) and \(B=\langle (4,0.3),0.6,0.1\rangle \), then \(s_1 (A)=6(0.4-0.2)=1.2\), \(s_2 (A)=0.5(0.4-0.2)=0.1\), \(s_1 (B)=4(0.6-0.1)=2\), and \(s_2 (B)=0.3(0.6-0.1)=0.15\), so \(s_1 (A) <s_1 (B)\) and \(A< B\).

Definition 8

(Wang and Li 2012) Let \(A=\langle (a,\sigma _A ),\mu _A ,v_A \rangle \) be an NIFN, and its stability factor is

$$\begin{aligned} C_i =\frac{\sigma _i }{a_i }. \end{aligned}$$
(6)

3 Normal Intuitionistic fuzzy aggregation operators

As we have mentioned, NIFNs can better reflect the evaluation information and offer wonderful solutions to MCDM problems. However, solving MCDM problems on the basis of NIFNs is not an easy task. After decision makers give the criterion values for each alternative in the form of NIFNs, an aggregation step must be performed for a collective overall evaluation. Here, some normal intuitionistic fuzzy aggregation operators are proposed for the information fusion.

Definition 9

Let \(A_i =\langle (a_i ,\sigma _i ),\mu _i ,v_i \rangle (i=1,2,\ldots ,n)\) be a set of NIFNs, and \(\mathrm{NIFWAA}:\,\mathrm{NIFNS}^n\rightarrow \mathrm{NIFNS}\) be a mapping:

$$\begin{aligned} \mathrm{NIFWAA}(A_1 ,A_2 ,\ldots ,A_n )=\sum \limits _{i=1}^n {\omega _i A_i }, \end{aligned}$$
(7)

where \(\omega =(\omega _1 ,\omega _2 ,\ldots \omega _n )\) is the weight vector of \(A_i (i=1,2,\ldots ,n)\), satisfying \(\omega _i \in [0,1]\) \((i=1,2,\ldots ,n)\) and \(\sum _{i=1}^n {\omega _i } =1\). Then, \(\text{ NIFWAA }\) is called normal intuitionistic fuzzy weighted arithmetic averaging operator. Particularly, when \(\omega =(1/n,1/n,\ldots ,1/n)\), the \(\text{ NIFWAA }\) operator will degenerate into normal intuitionistic fuzzy arithmetic averaging (\(\text{ NIFAA })\) operator:

$$\begin{aligned} \mathrm{NIFAA}(A_1 ,A_2 ,\ldots ,A_n )=\frac{1}{n}\sum \limits _{i=1}^n {A_i }. \end{aligned}$$
(8)

Theorem 1

Let \(A_i =\langle (a_i ,\sigma _i ),\mu _i ,v_i \rangle (i=1,2,\ldots ,n)\) be a set of NIFNs, and \(\omega =(\omega _1 ,\omega _2 ,\ldots \omega _n )\) be the weight vector of \(A_i (i=1,2,\ldots ,n)\) satisfying \(\omega _i \in [0,1](i=1,2,\ldots ,n)\) and \(\sum _{i=1}^n {\omega _i } =1\). Then the result obtained using Eq. (7) is still an NIFN and

$$\begin{aligned}&\mathrm{NIFWAA}(A_1 ,A_2 ,\ldots ,A_n )\nonumber \\&\quad =\left\langle \left( \sum \limits _{i=1}^n {\omega _i a_i } ,\sum \limits _{j=1}^n {\omega _i \sigma _i} \right) ,\frac{\sum _{i=1}^n {\omega _i \vert a_i \vert } \mu _i }{\sum _{i=1}^n {\omega _i \vert a_i \vert } },\frac{\sum _{i=1}^n {\omega _i \vert a_i \vert } \nu _i }{\sum _{i=1}^n {\omega _i \vert a_i \vert } }\right\rangle . \end{aligned}$$
(9)

Theorem 1 can be demonstrated by the mathematical induction.

Example 3

If \(A_1 =\langle (4,0.2),0.7,0.2\rangle \), \(A_2 =\langle (3,0.5),0.5,0.4\rangle \), \(A_3 =\langle (6,0.4),0.6,0.1\rangle \) and \(\omega =(0.4,0.2,0.4)\), then

$$\begin{aligned}&\mathrm{NIFWAA}(A_1 ,A_2 ,A_3 )\\&\quad =\left\langle (4\times 0.4+3\times 0.2+6\times 0.4,0.2\times 0.4+0.5\times 0.2+0.4\times 0.4),\right. \\&\qquad \left. \frac{4\times 0.4\times 0.7+3\times 0.2\times 0.5+6\times 0.4\times 0.6}{4\times 0.4+3\times 0.2+6\times 0.4},\right. \\&\qquad \left. \frac{4\times 0.4\times 0.2+3\times 0.2\times 0.4+6\times 0.4\times 0.1}{4\times 0.4+3\times 0.2+6\times 0.4}\right\rangle \\&\quad =\langle (4.6,0.34),0.6,0.174\rangle . \end{aligned}$$

Furthermore, it can be easily proved that the \(\text{ NIFWAA }\) operator is idempotent, monotonic and bounded, and these are presented as below.

Proposition 2

(Idempotency) Let \(A_i =\langle (a_i ,\sigma _i ),\mu _i ,v_i \rangle (i=1,2,\ldots ,n)\) be a set of NIFNs. If \(A_i =A_0 \quad (i=1,2,\ldots ,n)\), then

$$\begin{aligned} \mathrm{NIFWAA}(A_1 ,A_2 ,\ldots ,A_n )=A_0. \end{aligned}$$
(10)

Proposition 3

(Monotonicity) Let \((A_1 ,A_2 ,\ldots ,A_n )\) and \((B_1 ,B_2 ,\ldots ,B_n )\) be two sets of NIFNs satisfying \(A_i >B_i \,\,(i=1,2,\ldots n)\), then

$$\begin{aligned} \mathrm{NIFWAA}(A_1 ,A_2 ,\ldots ,A_n )>\mathrm{NIFWAA}(B_1 ,B_2 ,\ldots ,B_n ). \end{aligned}$$
(11)

Proposition 4

(Boundedness) Let \(A_i =\langle (a_i ,\sigma _i ),\mu _i ,v_i \rangle (i=1,2,\ldots ,n)\) be a set of NIFNs, \(A^*=\max (A_i )\), and \(A_*=\min (A_i )\), and then

$$\begin{aligned} A_*\le \mathrm{NIFWAA}(A_1 ,A_2 ,\ldots ,A_n )\le A^*. \end{aligned}$$
(12)

Definition 10

Let \(A_i =\langle (a_i ,\sigma _i ),\mu _i ,v_i \rangle (i=1,2,\ldots ,n)\) be a set of NIFNs, and \(\mathrm{NIFWGA}:\,\mathrm{NIFNS}^n\rightarrow \mathrm{NIFNS}\) be a mapping:

$$\begin{aligned} \mathrm{NIFWGA}(A_1 ,A_2 ,\ldots ,A_n )=\prod \limits _{i=1}^n {A_i ^{\omega _i }} , \end{aligned}$$
(13)

where \(\omega =(\omega _1 ,\omega _2 ,\ldots \omega _n )\) is the weight vector of \(A_i (i=1,2,\ldots ,n)\), satisfying \(\omega _i \in [0,1]\) \((i=1,2,\ldots ,n)\) and \(\sum _{i=1}^n {\omega _i } =1\). Then, \(\text{ NIFWGA }\) is called normal intuitionistic fuzzy weighted geometric averaging operator. Particularly, when \(\omega =(1 / n,\ldots ,1 /n)\), the \(\text{ NIFWGA }\) operator will degenerate into normal intuitionistic fuzzy geometric averaging \((\text{ NIFGA })\) operator:

$$\begin{aligned} \mathrm{NIFGA}(A_1 ,A_2 ,\ldots ,A_n )=\prod \limits _{i=1}^n {A_i ^{1/n}}. \end{aligned}$$
(14)

Theorem 2

Let \(A_i =\langle (a_i ,\sigma _i ),\mu _i ,v_i \rangle (i=1,2,\ldots ,n)\) be a set of NIFNs, and \(\omega =(\omega _1 ,\omega _2 ,\ldots \omega _n )\) be the weight vector of \(A_i (i=1,2,\ldots ,n)\) satisfying \(\omega _i \in [0,1](i=1,2,\ldots ,n)\) and \(\sum _{i=1}^n {\omega _i } =1\). Then the result obtained using Eq. (13) is still an NIFN and

$$\begin{aligned}&\mathrm{NIFWGA}(A_1 ,A_2 ,\ldots ,A_n )\nonumber \\&\quad =\left\langle \left( \prod \limits _{i=1}^n {a_i ^{\omega _i }} ,\prod \limits _{i=1}^n {a_i ^{\omega _i }} \sqrt{\sum \nolimits _{i=1}^n {\frac{\omega _i \sigma _i^2 }{a_i^2 }} } \right) ,\prod \limits _{i=1}^n {\mu _i ^{\omega _i }} ,1-\prod \limits _{i=1}^n {(1-v_i )^{\omega _i }} \right\rangle . \end{aligned}$$
(15)

Example 4

If \(A_1 =\langle (4,0.2),0.7,0.2\rangle ,\,\,A_2 =\langle (3,0.5),0.5,0.4\rangle ,\,\,A_3 =\langle (6,0.4),0.6,0.1\rangle \) and \(\omega =(0.4,0.2,0.4)\), then

$$\begin{aligned}&\mathrm{NIFWGA}(A_1 ,A_2 ,A_3 )\\&\quad =\left\langle \left( 4^{0.4}\times 3^{0.2}\times 6^{0.4},4^{0.4}\times 3^{0.2}\times 6^{0.4}\sqrt{\frac{0.4\times 0.2^2}{4^2}+\frac{0.2\times 0.5^2}{3^2}+\frac{0.4\times 0.4^2}{6^2}} \right) ,\right. \\&\quad \left. 0.7^{0.4}\times 0.5^{0.2}\times 0.6^{0.4},1-(1-0.2)^{0.4}\times (1-0.4)^{0.2}\times (1-0.1)^{0.4}\right\rangle \\&=\langle (4.4412,0.0294),0.6153,0.2083\rangle . \\ \end{aligned}$$

Similarly, it can be easily proved that the \(\text{ NIFWGA }\) operator is idempotent, monotonic and bounded.

Definition 11

Let \(A_i =\langle (a_i ,\sigma _i ),\mu _i ,v_i \rangle (i=1,2,\ldots ,n)\) be a set of NIFNs, and \(\mathrm{NIFIOWA}:\,\mathrm{NIFNS}^n\rightarrow \mathrm{NIFNS}\) be a mapping:

$$\begin{aligned} \mathrm{NIFIOWA}\,\, (( C_1 ,A_1 ),(C_2 ,A_2 ),\ldots ,(C_n ,A_n ))=\sum \limits _{i=1}^n {\omega _i \beta _i } , \end{aligned}$$
(16)

where \(\omega =(\omega _1 ,\omega _2 ,\ldots \omega _n )\) is the weight vector correlative with the\(\text{ NIFIOWA }\) operator satisfying \(\omega _i \in [0,1](i=1,2,\ldots ,n)\) and \(\sum _{i=1}^n {\omega _i } =1\); \(\beta _i \) is the value of \(A_i \) in the pair \((C_i ,A_i )\) having the \(i\)-th smallest \(C_i \), and \(C_i \) in \((C_i ,A_i )\) is the order inducing variable. Then, \(\text{ NIFIOWA }\) is called normal intuitionistic fuzzy-induced ordered weighted averaging operator.

Theorem 3

Let \(A_i =\langle (a_i ,\sigma _i),\mu _i ,v_i \rangle (i=1,2,\ldots ,n)\) be a set of NIFNs, \(\omega =(\omega _1 ,\omega _2 ,\ldots \omega _n )\) be the weight vector correlative with the \(\text{ NIFIOWA }\) operator satisfying \(\omega _i \in [0,1](i=1,2,\ldots ,n)\) and \(\sum _{i=1}^n {\omega _i } =1\), \(\beta _i =\langle ({a}^{\prime }_i ,{\sigma }^{\prime }_i ),{\mu }^{\prime }_i ,{v}^{\prime }_i \rangle \) be the value of \(A_i \) in the pair \((C_i ,A_i )\) having the \(i\)-th smallest \(C_i \), and \(C_i \) in \((C_i ,A_i )\) be the order inducing variable. Then, the result obtained using Eq. (16) is still an NIFN and

$$\begin{aligned}&\mathrm{NIFIOWA}((C_1 ,A_1 ),(C_2 ,A_2 ),\ldots ,(C_n ,A_n ))\nonumber \\&\quad =\left\langle \sum \limits _{i=1}^n {\omega _i {a}^{\prime }_i } ,\sum \limits _{j=1}^n {\omega _i {\sigma }^{\prime }_i } ,\frac{\sum _{i=1}^n {\omega _i \vert {a}^{\prime }_i \vert } \mu _i ^\prime }{\sum _{i=1}^n {\omega _i \vert {a}^{\prime }_i \vert } },\frac{\sum _{i=1}^n {\omega _i \vert {a}^{\prime }_i \vert } {\nu }^{\prime }_i }{\sum _{i=1}^n {\omega _i \vert {a}^{\prime }_i \vert } }\right\rangle . \end{aligned}$$
(17)

Example 5

If \(A_1 =\langle (4,0.2),0.7,0.2\rangle , \,\,A_2 =\langle (3,0.5),0.5,0.4\rangle , \,\,A_3 =\langle (6,0.4),0.6,0.1\rangle \) and \(\omega =(0.4,0.2,0.4)\), then

$$\begin{aligned}&C_1 =0.05,C_2 =0.1667,C_3 =0.0667,C_1 <C_3 <C_2 , \\&\mathrm{NIFIOWA}(A_1 ,A_2 ,A_3 )\\&\quad =\left\langle (4\times 0.4+6\times 0.2+3\times 0.4,0.2\times 0.4+0.4\times 0.2+0.5\times 0.4),\right. \\&\qquad \left. \frac{4\times 0.4\times 0.7+6\times 0.2\times 0.6+3\times 0.4\times 0.5}{4\times 0.4+6\times 0.2+3\times 0.4},\right. \\&\qquad \left. \frac{4\times 0.4\times 0.2+6\times 0.2\times 0.1+3\times 0.4\times 0.4}{4\times 0.4+6\times 0.2+3\times 0.4}\right\rangle \\&\quad =\langle (4,0.36),0.61,0.23\rangle . \\ \end{aligned}$$

Furthermore, it can be easily proved that the \(\text{ NIFIOWA }\) operator is idempotent, monotonic and bounded. Meanwhile, the \(\text{ NIFIOWA }\) operator is commutative.

Proposition 5

(Commutativity) Let \(A_i =\langle (a_i ,\sigma _i ),\mu _i ,v_i \rangle (i=1,2,\ldots ,n)\) be a set of NIFNs. If \(({A}^{\prime }_1 ,{A}^{\prime }_2 ,\ldots ,{A}^{\prime }_n )\) is any permutation of \((A_1 ,A_2 ,\ldots ,A_n )\), then

$$\begin{aligned}&\mathrm{NIFIOWA}((C_1 ,A_1 ),(C_2 ,A_2 ),\ldots ,(C_n ,A_n ))\nonumber \\&\quad =\mathrm{NIFIOWA}((C_1 ,{A}^{\prime }_1 ),(C_2 ,{A}^{\prime }_2 ),\ldots ,(C_n ,{A}^{\prime }_n )). \end{aligned}$$
(18)

Definition 12

Let \(A_i =\langle (a_i ,\sigma _i ),\mu _i ,v_i \rangle (i=1,2,\ldots ,n)\) be a set of NIFNs, and \(\mathrm{NIFIOWGA}:\,\mathrm{NIFNS}^n\rightarrow \mathrm{NIFNS}\) be a mapping:

$$\begin{aligned} \mathrm{NIFIOWGA}((C_1 ,A_1 ),(C_2 ,A_2 ),\ldots ,(C_n ,A_n ))=\sum \limits _{i=1}^n {\beta _i^{\omega _i } } , \end{aligned}$$
(19)

where \(\omega =(\omega _1 ,\omega _2 ,\ldots \omega _n )\) is the weight vector correlative with the \(\text{ NIFIOWGA }\) operator satisfying \(\omega _i \in [0,1](i=1,2,\ldots ,n)\) and \(\sum _{i=1}^n {\omega _i } =1\), \(\beta _i \) is the value of \(A_i \) in the pair \((C_i ,A_i )\) having the \(i\)-th smallest \(C_i \), and \(C_i \) in \((C_i ,A_i )\) is the order inducing variable. Then, \(\text{ NIFIOWGA }\) is called normal intuitionistic fuzzy-induced ordered weighted geometric averaging operator.

Theorem 4

Let \(A_i =\langle (a_i ,\sigma _i),\mu _i ,v_i \rangle (i=1,2,\ldots ,n)\) be a set of NIFNs, \(\omega =(\omega _1 ,\omega _2 ,\ldots \omega _n )\) be the weight vector correlative with the \(\text{ NIFIOWGA }\) operator satisfying \(\omega _i \in [0,1](i=1,2,\ldots ,n)\) and \(\sum _{i=1}^n {\omega _i } =1\), \(\beta _i =\langle ({a}^{\prime }_i ,{\sigma }^{\prime }_i ),{\mu }^{\prime }_i ,{v}^{\prime }_i\rangle \) be the value of \(A_i \) in the pair \((C_i ,A_i )\) having the \(i\)-th smallest \(C_i \), and \(C_i \) in \((C_i ,A_i )\) be the order inducing variable. Then, the result obtained using Eq. (19) is still an NIFN and

$$\begin{aligned}&\mathrm{NIFIOWGA}((C_1 ,A_1 ),(C_2 ,A_2 ),\ldots ,(C_n ,A_n ))\nonumber \\&\quad = \left\langle \left( \prod _{i=1}^n {{a}_i^{{\prime } \omega _i}} ,\prod \limits _{i=1}^n {{a}_i^{{\prime } \omega _i }} \sqrt{\sum \nolimits _{i=1}^n \frac{\omega _i {\sigma }_i^{\prime 2}}{{{a}_i^{{\prime }2}}} }\right) ,\prod \limits _{i=1}^n {{\mu }_i^{{\prime }\omega _i}} ,1-\prod \limits _{i=1}^n {(1-{v}^{\prime }_i)^{\omega _i }} \right\rangle . \end{aligned}$$
(20)

Example 6

If \(A_1 =\langle (4,0.2),0.7,0.2\rangle , \,\,A_2 =\langle (3,0.5),0.5,0.4\rangle , \,\,A_3 =\langle (6,0.4),0.6,0.1\rangle \) and \(\omega =(0.4,0.2,0.4)\), then

$$\begin{aligned}&C_1 =0.05,C_2 =0.1667,C_3 =0.0667,C_1 <C_3 <C_2 , \\&\mathrm{NIFIOWGA}(A_1 ,A_2 ,A_3 )\\&\quad =\left\langle \left( 4^{0.4}\times 6^{0.2}\times 3^{0.4},4^{0.4}\times 6^{0.2}\times 3^{0.4}\sqrt{\frac{0.4\times 0.2^2}{4^2}+\frac{0.2\times 0.4^2}{6^2}+\frac{0.4\times 0.5^2}{3^2}} \right) ,\right. \\&\qquad \left. 0.7^{0.4}\times 0.6^{0.2}\times 0.5^{0.4},1-(1-0.2)^{0.4}\times (1-0.1)^{0.2}\times (1-0.4)^{0.4}\right\rangle \\&\quad =\langle (3.8663,0.0378),0.5933,0.2700\rangle . \end{aligned}$$

Furthermore, it can be easily proved that the \(\text{ NIFIOWGA }\) operator is commutative, monotonic, bounded, and idempotent.

Definition 13

Let \(A_i =\langle (a_i ,\sigma _i ),\mu _i ,v_i \rangle (i=1,2,\ldots ,n)\) be a set of NIFNs, and \(\mathrm{NIFIGOWA}:\,\mathrm{NIFNS}^n\rightarrow \mathrm{NIFNS}\) be a mapping:

$$\begin{aligned} \mathrm{NIFIGOWA}((C_1 ,A_1 ),(C_2 ,A_2 ),\ldots ,(C_n ,A_n ))=\left( {\sum \limits _{i=1}^n {\omega _i \beta _i^\lambda } }\right) ^{1/\lambda }, \end{aligned}$$
(21)

where \(\omega =(\omega _1 ,\omega _2 ,\ldots \omega _n )\) is the weight vector correlative with the \(\text{ NIFIGOWA }\) operator satisfying \(\omega _i \in [0,1](i=1,2,\ldots ,n)\) and \(\sum _{i=1}^n {\omega _i } =1\), \(\beta _i \) is the value of \(A_i \) in the pair \((C_i ,A_i )\) having the \(i\)-th smallest \(C_i \), \(C_i \) in \((C_i ,A_i )\) is the order inducing variable, and \(\lambda \in (0,+\infty )\) is determined according to the characteristics needed in real-life situations. Then, \(\text{ NIFIGOWA }\)is called normal intuitionistic fuzzy-induced generalized ordered weighted averaging operator.

Theorem 5

Let \(A_i =\langle (a_i ,\sigma _i ),\mu _i ,v_i \rangle (i=1,2,\ldots ,n)\) be a set of NIFNs, \(\omega =(\omega _1 ,\omega _2 ,\ldots \omega _n )\) be the weight vector correlative with the \(\text{ NIFIGOWA }\) operator satisfying \(\omega _i \in [0,1](i=1,2,\ldots ,n)\) and \(\sum _{i=1}^n {\omega _i } =1\), \(\beta _i =({a}^{\prime }_i ,{\sigma }^{\prime }_i ),{\mu }^{\prime }_i ,{v}^{\prime }_i \rangle \) be the value of \(A_i \) in the pair \((C_i ,A_i )\) having the \(i\)-th smallest \(C_i \), and \(C_i \) in \((C_i ,A_i )\) be the order inducing variable. Then, the result obtained using Eq. (21) is still an NIFN and

$$\begin{aligned}&\hbox {NIFIGOWA}_{\omega } ((C_{1}, A_{1}), (C_{2}, A_{2}), \ldots , (C_{n}, A_{n}))\nonumber \\&\quad = \left\{ \left\langle \sum \limits _{i = 1}^{n} \omega _{i} a_{i}^{\prime \lambda }, \lambda ^{1/2} \left( \sum \limits _{j = 1}^{n} \omega _{i} a_{i}^{\prime \lambda -1} \sigma _{i}^{\prime \lambda }\right) ,\right. \right. \nonumber \\&\qquad \left. \left. \frac{\sum _{i = 1}^{n} \omega _i |a_{i}^{\prime }|^{\lambda }\mu _{i}^{\prime \lambda }}{\sum _{i = 1}^{n} \omega _i|a_{i}^{\prime } |^{\lambda }}, \frac{{\sum _{i = 1}^{n} \omega _i |a_i^{\prime }}|^{\lambda }[1 - (1 - \nu _i^{\prime })^{\lambda }]}{\sum _{i = 1}^{n} \omega _i|a_{i}^{\prime }|^{\lambda }}\right\rangle \right\} ^{1/\lambda }\nonumber \\&\quad =\left\langle \left( \sum \limits _{i = 1}^{n} \omega _{i} a_{i}^{\prime \lambda }\right) ^{1/\lambda }, \lambda ^{1/(2\lambda )} \left( \sum \limits _{j = 1}^{n} \omega _i a_{i}^{\lambda - 1} \sigma _{i}^{\prime \lambda } \right) ^{1/\lambda }, \left( \frac{\sum _{i = 1}^{n} \omega _i| a_{i}^{\prime } |{}^{\lambda } \mu _{i}^{\prime \lambda }}{\sum _{i = 1}^{n} \omega _{i}|a_{i}^{\prime } |^{\lambda }}\right) ^{1/\lambda },\right. \nonumber \\&\qquad \left. 1 - \left( 1 - \frac{\sum _{i = 1}^{n} \omega _i |a_{i}^{\prime } |^{\lambda } [1 - (1 - \nu _{i}^{\prime })^{\lambda }]}{\sum _{i = 1}^{n} \omega _i| a_{i}^{\prime } |^{\lambda }}\right) ^{1/\lambda }\right\rangle . \end{aligned}$$
(22)

Obviously, there are some properties for the \(\text{ NIFIGOWA }\) operator as follows.

  1. (1)

    When \(\lambda \rightarrow 0, \,\,{\hbox {NIFIGOWA}}\,((C_1 ,A_1 ),(C_2 ,A_2 ),\ldots ,(C_n ,A_n ))=( \sum _{i=1}^n \omega _i \beta _i^\lambda )^{1/\lambda }=\prod _{i=1}^n {\beta _i ^{\omega _i }} \), and the \(\text{ NIFIGOWA }\) operator is reduced to the \(\text{ NIFIOWGA }\) operator.

  2. (2)

    When \(\lambda {=}1,\,\,{\hbox {NIFIGOWA}}\,((C_1 ,A_1 ),(C_2 ,A_2 ),\ldots ,(C_n ,A_n )){=}( {\sum _{i=1}^n {\omega _i \beta _i^\lambda } })^{1/\lambda }=\sum _{i=1}^n {\omega _i \beta _i}\), and the \({\hbox {NIFIGOWA}}\) operator is reduced to the \(\text{ NIFIOWA }\) operator.

Therefore, the \(\text{ NIFIOWGA }\) operator and the \(\text{ NIFIOWA }\) operator are two particular cases of the \(\text{ NIFIGOWA }\) operator, and the \(\text{ NIFIGOWA }\) operator is the generalized form of the \(\text{ NIFIOWGA }\) operator and the \(\text{ NIFIOWA }\) operator.

4 Multi-criteria decision-making approach based on normal intuitionistic fuzzy-induced generalized aggregation operator

Atanassov et al. (2005) have studied the intuitionistic fuzzy interpretations of multi-person MCDM method and the multi-measurement tool MCDM method, where the experts’ weights and the measurement tools’ weights are corresponded to their own reliability scores, and have presented the way to get the experts’ and measurement tools’ reliability scores. This paper is committed to studying a one-person one-measurement MCDM method. It is a very partial case of the study done by Atanassov et al. (2005), both the experts’ weights and the measurement tools’ weights are out of considerations and the weight vector of criteria is known completely and in the form of real numbers. The problem is described as follows.

For an MCDM selecting or ranking problem, let \(A=\{a_1 ,a_2 ,\ldots ,a_m \}\) be a set of alternatives, \(C=\{c_1 ,c_2 ,\ldots ,c_l \}\) be a set of criteria, and \(\omega =(\omega _1 ,\omega _2 ,\ldots ,\omega _l )\) be a set of fixed criteria weights satisfying \(\omega _j \in [0,1]\) and \(\sum _{j=1}^l \omega _j =1\). Suppose the criteria are independent of each other, and that the evaluation of the alternative \(a_i \) with respect to the criterion \(c_j \) is an NIFN represented by \(r_{ij} =\langle (a_{ij} ,\sigma _{ij} ),\mu _{ij} ,v_{ij} \rangle \).

To obtain the best alternative(s), the decision-making procedure is given as follows.

  • Step 1 The normalization of the decision matrix By virtue of the following formulae, the decision matrix \(D=(r_{ij} )_{m\times l} \) can be changed into the standardized decision matrix \(\bar{D}=(\bar{r}_{ij} )_{m\times l} (\bar{r}_{ij} =\langle (\bar{a}_{ij} ,\bar{\sigma }_{ij} ),\bar{\mu }_{ij} ,\bar{v}_{ij} \rangle )\).

    $$\begin{aligned}&\mathrm{For\,\, benefit\,\, criteria}{:}\,\,\bar{a}_{ij} =\frac{a_{ij} }{{\max }_i (a_{ij} )},\;\;\bar{\sigma }_{ij} =\frac{\sigma _{ij} }{{\max }_i (\sigma _{ij} )}\frac{\sigma _{ij} }{a_{ij} },\;\;\bar{\mu }_{ij} =u_{ij} ,\bar{v}_{ij} =v_{ij}. \end{aligned}$$
    (23)
    $$\begin{aligned}&\mathrm{For\,\, cost\,\, criteria}{:}\,\,\bar{a}_{ij} =\frac{{\min }_i (a_{ij} )}{a_{ij} },\;\;\bar{\sigma }_{ij} =\frac{\sigma _{ij} }{{\max }_i (\sigma _{ij} )}\frac{\sigma _{ij} }{a_{ij} },\;\;\bar{\mu }_{ij} =u_{ij} ,\bar{v}_{ij} =v_{ij}.\nonumber \\ \end{aligned}$$
    (24)
  • Step 2 Aggregate the criteria values of each alternative. By applying Eq. (22), we can obtain the comprehensive evaluation for the alternatives:

    $$\begin{aligned} R_i =\langle (a_i ,\sigma _i ),\mu _i ,v_i \rangle \,(i=1,2,\ldots ,l). \end{aligned}$$
  • Step 3 Determine the ranking of the alternatives. By virtue of Definitions 6 and 7, we can get the ranking of all alternatives.

5 Numerical example

An engine part manufacturing company wants to select a supplier, and there are four suppliers as alternatives to choose, denoted by \(a_1 ,a_2 ,a_3 ,a_4 \). The suppliers include the following four criteria that influence the choice of the company: (1) \(c_1 \) expresses supply capacity; (2) \(c_2 \) pertains to delivery capability; (3) \(c_3 \) denotes quality of service; (4) \(c_4 \) represents research strength. It is easy to know that the four criteria above are all benefit criteria. The criteria are independent of each other and their weights comprise a vector of \(\omega =(0.15,0.25,0.32,0.28)\). The four considered alternatives are evaluated according to the normal intuitionistic fuzzy information by the expert using the criteria mentioned above, and the evaluation outcomes are presented in Table 1.

Table 1 The expert’s evaluations for the alternatives

5.1 Procedures of decision-making based on the NIFIGOWA operator

  • Step 1 The normalization of the decision matrix The four criteria are all the benefit-type criteria, and by applying Eq. (23), we can obtain the standardized decision matrix \(\bar{D}\) as shown in Table 2.

  • Step 2 Calculate the comprehensive evaluations for the alternatives By applying Eq. (22), the comprehensive evaluation for four alternatives can be shown in Table 3.

  • Step 3 Determine the ranking of alternatives By applying Definitions 6 and 7, we can obtain the ranking of all alternatives as shown in Table 4. From Tables 3 and 4, it is obvious that when the value of \(\lambda \) changes, the rankings are different, and the corresponding best alternatives are also different. Furthermore, if Eq. (9) or (15) is used in Step 2, the ranking of the alternatives is \(a_4 \succ a_2 \succ a_1 \succ a_3 \), and the best alternative is \(a_4 \).

Table 2 The standardized decision matrix \(\bar{D}\)
Table 3 The comprehensive evaluations for four alternatives
Table 4 The ranking of all alternatives

5.2 Comparison analysis and discussion

To verify the feasibility of the proposed method based on normal intuitionistic fuzzy-induced generalized aggregation operator, a comparison study is conducted between the proposed method and the method based on triangular intuitionistic fuzzy aggregation operator (Li 2010b) and the extended VIKOR method of TIFNs (Wan et al. 2013b).

(a) The criterion values in the example above are transformed from NIFNs into TIFNs, and the decision-making problem is solved by the MCDM method based on triangular intuitionistic fuzzy aggregation operator.

Given an NIFN \(A=\langle (a,\sigma ),\mu ,v\rangle \), it can be transformed into a TIFN denoted by \(\tilde{A}=\langle (\tilde{a},\tilde{b},\tilde{c}),\tilde{\mu },\tilde{\nu }\rangle \), where \(\tilde{b}=a\), \(\tilde{a}=a-3\sigma \), \(\tilde{c}=a+3\sigma \), \(\tilde{\mu }=\mu \) and \(\tilde{\nu }=\nu \). According to this, the expert’s evaluations for alternatives in Table 1 can be transformed into TIFNs denoted by \(\hat{r}_{ij} =\langle (\hat{a}_{ij} ,\hat{b}_{ij} ,\hat{c}_{ij} ),\hat{\mu }_{ij} ,\hat{\nu }_{ij} \rangle \), as shown in Table 5.

Table 5 The expert’s evaluations for alternatives expressed by TIFNs

Here, the procedures of the MCDM method based on triangular intuitionistic fuzzy aggregation operator (Li 2010b) are shown as follows.

  1. (1)

    Normalize the TIFN decision matrix. The normalized decision matrix is denoted by \(\tilde{R}=( {\tilde{r}_{ij} })_{m\times l} \), where \(\tilde{r}_{ij} =\langle (\tilde{a}_{ij} ,\tilde{b}_{ij} ,\tilde{c}_{ij} ),\tilde{\mu }_{ij} ,\tilde{\nu }_{ij} \rangle \quad =\langle (\frac{\hat{a}_{ij} }{\hat{c}_{_j }^+ },\frac{\hat{b}_{ij} }{\hat{c}_{_j }^+ },\frac{\hat{c}_{ij} }{\hat{c}_{_j }^+ }),\hat{\mu }_{ij} ,\hat{\nu }_{ij} \rangle (i=1,2,\ldots ,m)\) for benefit criteria. Here, \(\hat{c}_j^+ =\max \{\hat{c}_{ij} \vert i=1,2,\ldots ,m\} \quad (j=1,2,\ldots ,l)\). By applying the formula above, the normalized decision matrix \(\tilde{R}\) can be obtained and shown in Table 6.

  2. (2)

    Calculate the weighted comprehensive values \(\tilde{S}_i \) for the alternative \(a_i \).

    $$\begin{aligned} \tilde{S}_i&= \sum \limits _{j=1}^l {\omega _j \tilde{r}_{ij} } =\left\langle \left( \sum \limits _{j=1}^l {\omega _j \tilde{a}_{ij} } ,\sum \limits _{j=1}^l {\omega _j \tilde{b}_{ij} } ,\sum \limits _{j=1}^l {\omega _j \tilde{c}_{ij} } \right) ,{\min }_j \{\tilde{\mu }_{ij} \},{\max }_j \{\tilde{\nu }_{ij} \} \right\rangle \\&= \langle (\tilde{a}_i ,\tilde{b}_i ,\tilde{c}_i ),\tilde{\mu }_i ,\tilde{\nu }_i\rangle . \end{aligned}$$

    Thus, the weighted comprehensive values of \(a_i {}{}{}(i=1,2,3,4)\) are:

    $$\begin{aligned} \begin{array}{l} \tilde{S}_1 =\langle (0.50,0.68,0.86),0.6,0.3\rangle ;\;\tilde{S}_2 =\langle (0.55,0.71,0.86),0.6,0.3\rangle ; \\ \tilde{S}_3 =\langle (0.51,0.65,0.80),0.5,0.5\rangle ;\;\tilde{S}_4 =\langle (0.55,0.71,0.86),0.6,0.2\rangle . \\ \end{array} \end{aligned}$$
  3. (3)

    Rank all alternatives. Let \(Z(\tilde{S}_i ,\lambda )=\frac{V(\tilde{S}_i ,\lambda )}{1\text{+ }A(\tilde{S}_i ,\lambda )}\), where \(\lambda \in [0,1]\) is a weight representing the decision maker’s preference information. If \(\lambda \in [0,\frac{1}{2})\), it indicates the decision maker prefers uncertainty or negative feeling; if \(\lambda \in (\frac{1}{2},1]\), the decision maker prefers certainty or positive feeling; if \(\lambda =\frac{1}{2}\), the decision maker is indifferent between positive feeling and negative feeling. Besides, \(V(\tilde{S}_i ,\lambda )=V_\mu (\tilde{S}_i )+\lambda (V_\nu (\tilde{S}_i )-V_\mu (\tilde{S}_i ))\) and \(A(\tilde{S}_i ,\lambda )=A_\nu (\tilde{S}_i )-\lambda (A_\nu (\tilde{S}_i )-A_\mu (\tilde{S}_i ))\), where \(V_\mu (\tilde{S}_i )=\frac{(\tilde{a}_i +4\tilde{b}_i +\tilde{c}_i )\tilde{\mu }_i }{6}\), \(V_\nu (\tilde{S}_i )=\frac{(\tilde{a}_i +4\tilde{b}_i +\tilde{c}_i )(1-\tilde{\nu }_i )}{6}\), \(A_\mu (\tilde{S}_i )=\frac{(\tilde{c}_i -\tilde{a}_i )\tilde{\mu }_i }{3}\) and \(A_\nu (\tilde{S}_i )=\frac{(\tilde{c}_i -\tilde{a}_i )(1-\tilde{\nu }_i )}{3}\). Here, there is no indication of the decision maker’s preference, so we assume \(\lambda =\frac{1}{2}\). Calculate the values of \(Z(\tilde{S}_i ,\frac{1}{2})\), and then we can obtain the weighted comprehensive values of the alternatives as follows:

    $$\begin{aligned} Z(\tilde{S}_1 ,\frac{1}{2})=0.416,\;\;Z(\tilde{S}_2 ,\frac{1}{2})=0.432,\;Z(\tilde{S}_3 ,\frac{1}{2})=0.311,\;Z(\tilde{S}_4 ,\frac{1}{2})=0.462. \end{aligned}$$

    Rank the TIFNs \(\tilde{S}_i \) according to non-increasing order of the values of \(Z(\tilde{S}_i ,\frac{1}{2})\), and the maximum TIFN is the one with the largest ratio, i.e., \(\tilde{S}_4 \succ \tilde{S}_2 \succ \tilde{S}_1 \succ \tilde{S}_3 \). Hence, the ranking of the four alternatives should be: \(a_4 \succ a_2 \succ a_1 \succ a_3 \).

(b) After converting the NIFNs into the TIFNs and normalizing the TIFNs, a normalized decision-making matrix \(\tilde{R}\) can be obtained (seen in Table 6), and then we apply the extended VIKOR method of TIFNs (Wan et al. 2013b) to the normalized decision matrix. The results are shown in Table 7.

Table 6 The normalized decision matrix \(\tilde{R}\)
Table 7 The results of the extended VIKOR method

The alternatives are ranked in accordance with the increasing order of \(Q(a_i )\), where \(Q(a_i )=\lambda \frac{S(a_i )-S^+}{S^--S^+}+(1-\lambda )\frac{R(a_i )-R^+}{R^--R^+}\) (\(S^+=\mathrm{Min}_i \{S(a_i )\}\), \(S^-=\mathrm{Max}_i \{S(a_i )\}\), \(R^+=\mathrm{Min}_i \{R(a_i )\}\), and \(R^-=\mathrm{Max}_i \{R(a_i )\})\). With the variation of \(\lambda \), the rankings of the alternatives change, as shown in Table 8.

Table 8 The results of the extended VIKOR method with TIFNs

From the analysis above, we conclude that both the results of triangular intuitionistic fuzzy aggregation operator method and the extended VIKOR method are consistent with the proposed method, which fully illustrates the feasibility of the proposed method. However, the benefits of the normal intuitionistic fuzzy MCDM method proposed in this paper are far more than that. From the perspective of the definition of NIFNs, it has been well known that the normal distribution is the most important probability distribution to address the approximation of large numbers of random phenomena (Li et al. 2009), and certainly, NIFNs are of much more realistic senses than TIFNs. From the perspective of the aggregation operators, the induced generalized aggregation operator allows the value of \(\lambda \) to be a variable rather than a fixed number, which makes the decision-making more flexible and reliable.

6 Conclusions

Normal distribution phenomena widely exist in practical life, and NIFNs can better express normal distribution phenomena than other intuitionistic fuzzy numbers. Applying NIFNs to MCDM problems can not only complete the fuzzy MCDM theoretic system, but also render the MCDM methods much closer to reality. In this paper, some new aggregation operators of NIFNs are studied, which lay the foundation for the proposed MCDM method with normal intuitionistic fuzzy information. Particularly, the NIFIGOWA operator is used to aggregate the evaluation information of alternatives, so that the decision makers can properly select the desirable alternative according to their interest and the actual need by changing the value of \(\lambda \), which makes the decision-making results of the proposed method more flexible and reliable. Future research may extend the proposed approach to evaluating other practical cases of MCDM problems in the uncertain environment.