Recursive Aggregation and Its Fusion Process for Intuitionistic Fuzzy Numbers Based on Non-Additive Measure

Abstract

In this paper, the recursive aggregation of OWA operators for intuitionistic fuzzy numbers (IFN) based on a non-additive measure (NAM) with $\sigma -\lambda$ rules is constructed and investigated in light of the $\sigma -\lambda$ rules of a non-additive measure (NAM). Additionally, an integrator is designed by drawing on the genetic algorithm and the process of calculation is elaborated by an example.

1. Introduction

Since the concept of ordered weighted averaging (OWA) operators was initiated by Yager in 1988 [1], it has received wide application in various domains, including decision expert systems, market surveys, neural networks, analysis, fuzzy logic control, etc. [2,3,4]. In 2005, Yager further put forward the recursive forms of OWA operators [5]. Its fundamental basic idea is to directly derive the aggregated result of n data by using the aggregated result of $n-1$ data while keeping the orness level unchanged. However, the attribute indexes are mostly related with each other in the process of deriving aggregation results of n data using the existing aggregation results of $n-1$ data. The main reason lies in the fact that the existing recursive forms of OWA operators are established on the base of the classical probability measure and Lebesgue integral integration operator [6]. That is to say, the weight vector is not able to be measured independently, and it may also not meet the countable additivity of the classical probability measure. Fortunately, fuzzy measure, defined by Sugeno in 1974, can be utilized to depict the correlations of attribute indexes [7,8,9,10]. Meanwhile, aggregation functions and aggregation operators are investigated by many researchers recently [11,12,13,14]. Because of the fuzziness and uncertainty of actual decision issues, the evaluation values involved in the decision process are not always expressed as crisp numbers. However, Intuitionistic fuzzy number (IFN) is a critical tool for settling imprecise information [15,16] and could offer the membership degree and the nonmembership degree simultaneously. Thus, IFN performs more flexibly and efficiently than a traditional fuzzy set in addressing uncertainty. In this work, recursive aggregation of OWA operators for IFN based on a non-additive measure (NAM) with $\sigma -\lambda$ rules is put forward and researched.

The rest of this work is organized as follows. In Section 2, we review the non-additive measure (NAM) with $\sigma -\lambda$ rules and IFN and propose an OWA operator for IFN based on a NAM with $\sigma -\lambda$ rules. In Section 3, we derive the recursive forms of OWA operators for IFN according to NAM with $\sigma -\lambda$ rules while keeping the orness grade unchanged. In Section 4, the procedure for integrator design in recursive aggregation is designed, and the process of calculation is demonstrated by an example.

2. Preliminaries

Definition 1

([7,8,9,10]). Let X be a nonempty set and $\mathcal{A}$ a $\sigma -$ algebra on the X. A set function $\mu :A\to [0,+\infty ]$ is called a fuzzy measure if

(1) $\mu (\varnothing )=0;$

(2) $\mu \left(X\right)=1;$

(3) For each A and $B\in \mathcal{A}$ such that $A\subseteq B$,  $\mu \left(A\right)\le \mu \left(B\right).$

A fuzzy measure μ is called a Sugeno measure if μ satisfies $\sigma -\lambda$ rules, briefly denoted as $g_{\lambda }$. The fuzzy measure shown in this paper is a Sugeno measure.

Definition 2

([7,8,9,10]). $g_{\lambda }$ is called a fuzzy measure based on $\sigma -\lambda$ rules if

$$g_{\lambda }\left(\bigcup _{i=1}^{\infty }{A}_i\right)=\left\{\begin{array}{c}{\displaystyle \frac{1}{\lambda }\left\{\prod _{i=1}^{\infty }[1+\lambda g_{\lambda }\left(A_i\right)]-1\right\},\lambda \ne 0,}\hfill \\ {\displaystyle \sum _{i=1}^{\infty }{g}_{\lambda }\left(A_i\right),\lambda =0,}\hfill \end{array}\right.$$

where $\lambda \in (-\frac{1}{sup\mu },\infty )\bigcup \left\{0\right\}$, $\left\{A_i\right\}\subset \mathcal{A}$, $A_i\cap A_j=\varnothing$ for all $i,j=1,2,\cdots$ and $i\ne j$.

Particularly, if $\lambda =0$, then $g_{\lambda }$ is a classic probability measure.

In Definition 2, if $n=2$, then

$$\mu \left(A\cup B\right)=\left\{\begin{array}{c}{\displaystyle \mu \left(A\right)+\mu \left(B\right)+\lambda \mu \left(A\right)\mu \left(B\right),\lambda \ne 0,}\hfill \\ {\displaystyle \mu \left(A\right)+\mu \left(B\right),\lambda =0.}\hfill \end{array}\right.$$

If X is a finite set, for any subset A of X, then

$$g_{\lambda }\left(A\right)=\left\{\begin{array}{c}{\displaystyle \frac{1}{\lambda }\left\{\prod _{x\in A}[1+\lambda g_{\lambda }\left(\left\{x\right\}\right)]-1\right\},\lambda \ne 0,}\hfill \\ {\displaystyle \sum _{x\in A}{g}_{\lambda }\left(\left\{x\right\}\right),\lambda =0.}\hfill \end{array}\right.$$

If X is a finite set, then the parameter $\lambda$ of a regular Sugeno measure based on $\sigma -\lambda$ rules is determined by the equation

$$1+\lambda =\prod _{i=1}^n(1+\lambda g_{\lambda }\left(x_i\right)).$$

Definition 3

([15,16]). ($IF{N}_s$)  Suppose X be a universe of discourse. An INF in A over X is expressed by:

$$A=\left\{\langle x,{\mu }_A\left(x\right),{\nu }_A\left(x\right)\rangle \right|x\in X\},$$

where

$${\mu }_A\to [0,1],{\nu }_A\to [0,1],$$

with the condition $0\le \mu \left(x\right)+\nu \left(x\right)\le 1,\forall x\in X.$$\mu \left(x\right)$, $\nu \left(x\right)$ and $\pi \left(x\right)=1-\mu \left(x\right)-\nu \left(x\right)$ denote the membership function, the non-membership function, and hesitation functions of the element x to the set A, respectively. The class $\tilde{\mathfrak{E}}$ represents the set of all INFs in A.

Definition 4

([16]). ($IF{N}_s$ Score Function) Suppose $\tilde{\alpha }=(\mu ,\nu )$ be an IFN, a score function $S\left(\tilde{\alpha }\right)$ of an INF can be represented below

$$S\left(\tilde{\alpha }\right)=\frac{{\mu }_{\tilde{\alpha }}-{\nu }_{\tilde{\alpha }}}{2},S\left(\tilde{\alpha }\right)\in [-1,1],$$

to evaluate the degree of the score of the intuitionistic fuzzy number $\tilde{\alpha },$ where $S\left(\tilde{\alpha }\right)\in [-1,1].$

($IF{N}_s$ Accuracy Function). Suppose $\tilde{\alpha }=(\mu ,\nu )$ be an intuitionistic fuzzy number, an accuracy function $H\left(\tilde{\alpha }\right)$ of an IFN can be defined below

$$H\left(\tilde{\alpha }\right)=\frac{{\mu }_{\tilde{\alpha }}+{\nu }_{\tilde{\alpha }}}{2},H\left(\tilde{\alpha }\right)\in [-1,1],$$

to evaluate the degree of accuracy of the IFN $\tilde{\alpha },$ where $H\left(\tilde{\alpha }\right)\in [-1,1].$

In the light of the two mentioned functions in Definition 4, Xu and Yager proposed the order relation below [16]:

(1)

If $S\left(\widetilde{{\alpha }_1}\right)<S\left(\widetilde{{\alpha }_2}\right),$ then $\widetilde{{\alpha }_1}<\widetilde{{\alpha }_2};$

(2)

If $S\left(\widetilde{{\alpha }_1}\right)=S\left(\widetilde{{\alpha }_2}\right),$ then

(i)

If $H\left({\tilde{\alpha }}_1\right)=H\left({\tilde{\alpha }}_2\right),$ then ${\tilde{\alpha }}_1={\tilde{\alpha }}_2;$

(ii)

If $H\left({\tilde{\alpha }}_1\right)<H\left({\tilde{\alpha }}_2\right),$ then ${\tilde{\alpha }}_1<{\tilde{\alpha }}_2;$

(iii)

If $H\left({\tilde{\alpha }}_1\right)>H\left({\tilde{\alpha }}_2\right),$ then ${\tilde{\alpha }}_1>{\tilde{\alpha }}_2.$

Definition 5

([16]). Let ${\tilde{\alpha }}_1=({\mu }_{{\tilde{\alpha }}_1},{\nu }_{{\tilde{\alpha }}_1})$ and ${\tilde{\alpha }}_2=({\mu }_{{\tilde{\alpha }}_2},{\nu }_{{\tilde{\alpha }}_2})$ be two IFNs, then

(1) ${\tilde{\alpha }}_1\oplus {\tilde{\alpha }}_2=({\mu }_{{\tilde{\alpha }}_1}+{\mu }_{{\tilde{\alpha }}_2}-{\mu }_{{\tilde{\alpha }}_1}{\mu }_{{\tilde{\alpha }}_2},{\nu }_{{\tilde{\alpha }}_1}{\nu }_{{\tilde{\alpha }}_2});$

(2) ${\tilde{\alpha }}_1\otimes {\tilde{\alpha }}_2=({\mu }_{{\tilde{\alpha }}_1}{\mu }_{{\tilde{\alpha }}_2},{\nu }_{{\tilde{\alpha }}_1}+{\nu }_{{\tilde{\alpha }}_2}-{\nu }_{{\tilde{\alpha }}_1}{\nu }_{{\tilde{\alpha }}_2});$

(3) $\lambda \tilde{\alpha }=(1-{(1-{\mu }_{\tilde{\alpha }})}^{\lambda },{\nu }_{\tilde{\alpha }}^{\lambda }),\lambda >0;$

(4) ${\tilde{\alpha }}^{\lambda }=({\mu }_{\tilde{\alpha }}^{\lambda },1-{(1-{\nu }_{\tilde{\alpha }})}^{\lambda }),\lambda >0.$

3. The OWA Operator for Intuitionistic Fuzzy Numbers (IFNs) on a Non-Additive Measure (NAM) with $\mathbf{\sigma }-\mathbf{\lambda }$ Rules

In the following discussion, we will always default to $g_{\lambda }\left(A_0\right)=0$ unless otherwise specified.

Definition 6.

Let $g_{\lambda }$ be a fuzzy measure satisfying $\sigma -\lambda$ rules, $A_i=\{x_1,x_2,\cdots ,x_i\}$, $i=1,2,\cdots ,n$. An OWA operator of dimension n for INFs based on a NAM with $\sigma -\lambda$ rules is a mapping ${\tilde{F}}_n:{\tilde{\mathfrak{E}}}_1\times {\tilde{\mathfrak{E}}}_2\times ···\times {\tilde{\mathfrak{E}}}_n\to \tilde{\mathfrak{E}}$ defined as

$${\tilde{F}}_n({\tilde{\alpha }}_1,{\tilde{\alpha }}_2,\cdots ,{\tilde{\alpha }}_n)=\underset{i=1}{\overset{n}{⨁}}(g_{\lambda }\left(A_i\right)-g_{\lambda }\left(A_{i-1}\right))·{\tilde{\beta }}_i,$$

(1)

where ${\tilde{\beta }}_i$ is the i-th largest value out of $\tilde{\alpha }=({\tilde{\alpha }}_1,{\tilde{\alpha }}_2,\cdots ,{\tilde{\alpha }}_n)$ ($i.e.,{\tilde{\beta }}_1\ge {\tilde{\beta }}_2\ge \cdots \ge {\tilde{\beta }}_n)$.

By Definitions  5 and 6, we can easily obtain the result below.

Theorem 1.

Let $g_{\lambda }$ be fuzzy measure satisfying $\sigma -\lambda$ rules, denote $A_i=\{x_1,x_2,\cdots ,x_i\}$, $i=1,2,\cdots ,n$, ${\tilde{F}}_n({\tilde{\alpha }}_1,{\tilde{\alpha }}_2,\cdots ,{\tilde{\alpha }}_n)$ be an OWA operator of dimension n for IFNs based on a NAM with $\sigma -\lambda$ rules. Then,

$$\begin{array}{cc}\hfill & {\tilde{F}}_n({\tilde{\alpha }}_1,{\tilde{\alpha }}_2,\cdots ,{\tilde{\alpha }}_n)\hfill \\ \hfill & =\underset{i=1}{\overset{n}{⨁}}(1-{(1-{\mu }_{{\tilde{\beta }}_i})}^{g_{\lambda }\left(A_i\right)-g_{\lambda }\left(A_{i-1}\right)},{\nu }_{{\tilde{\beta }}_i}^{g_{\lambda }\left(A_i\right)-g_{\lambda }\left(A_{i-1}\right)})\hfill \\ \hfill & =(1-\prod _{i=1}^n{(1-{\mu }_{{\tilde{\beta }}_i})}^{g_{\lambda }\left(A_i\right)-g_{\lambda }\left(A_{i-1}\right)},\prod _{i=1}^n{\nu }_{{\tilde{\beta }}_i}^{g_{\lambda }\left(A_i\right)-g_{\lambda }\left(A_{i-1}\right)}).\hfill \end{array}$$

(2)

That is to say,

$$\begin{array}{cc}\hfill & {\mu }_{{\tilde{F}}_n}=1-\prod _{i=1}^n{(1-{\mu }_{{\tilde{\beta }}_i})}^{g_{\lambda }\left(A_i\right)-g_{\lambda }\left(A_{i-1}\right)},\hfill \\ \hfill & {\nu }_{{\tilde{F}}_n}=\prod _{i=1}^n{\nu }_{{\tilde{\beta }}_i}^{g_{\lambda }\left(A_i\right)-g_{\lambda }\left(A_{i-1}\right)},\hfill \end{array}$$

(3)

where ${\tilde{\beta }}_i=({\mu }_{{\tilde{\beta }}_i},{\nu }_{{\tilde{\beta }}_i})$ is the i-th largest value out of $\tilde{\alpha }=({\tilde{\alpha }}_1,{\tilde{\alpha }}_2,\cdots ,{\tilde{\alpha }}_n)$ ($i.e.,{\tilde{\beta }}_1\ge {\tilde{\beta }}_2\ge \cdots \ge {\tilde{\beta }}_n)$.

Proof. 

By Definitions  5 and 6, we easily obtain the result below. As

$${\tilde{\beta }}_1\oplus {\tilde{\beta }}_2=({\mu }_{{\tilde{\beta }}_1}+{\mu }_{{\tilde{\beta }}_2}-{\mu }_{{\tilde{\beta }}_1}{\mu }_{{\tilde{\beta }}_2},{\nu }_{{\tilde{\beta }}_1}{\nu }_{{\tilde{\beta }}_2})=(1-(1-{\mu }_{{\tilde{\beta }}_1})(1-{\mu }_{{\tilde{\beta }}_2}),{\nu }_{{\tilde{\beta }}_1}{\nu }_{{\tilde{\beta }}_2})$$

and

$${\tilde{\beta }}_1\oplus {\tilde{\beta }}_2\oplus {\tilde{\beta }}_3=(1-(1-{\mu }_{{\tilde{\beta }}_1})(1-{\mu }_{{\tilde{\beta }}_2})(1-{\mu }_{{\tilde{\beta }}_3}),{\nu }_{{\tilde{\beta }}_1}{\nu }_{{\tilde{\beta }}_2}{\nu }_{{\tilde{\beta }}_3}),$$

we have

$$\begin{array}{cc}\hfill & {\tilde{F}}_n({\tilde{\alpha }}_1,{\tilde{\alpha }}_2,\cdots ,{\tilde{\alpha }}_n)\hfill \\ \hfill & =\underset{i=1}{\overset{n}{⨁}}(1-{(1-{\mu }_{{\tilde{\beta }}_i})}^{g_{\lambda }\left(A_i\right)-g_{\lambda }\left(A_{i-1}\right)},{\nu }_{{\tilde{\beta }}_i}^{g_{\lambda }\left(A_i\right)-g_{\lambda }\left(A_{i-1}\right)})\hfill \\ \hfill & =(1-\prod _{i=1}^n{(1-{\mu }_{{\tilde{\beta }}_i})}^{g_{\lambda }\left(A_i\right)-g_{\lambda }\left(A_{i-1}\right)},\prod _{i=1}^n{\nu }_{{\tilde{\beta }}_i}^{g_{\lambda }\left(A_i\right)-g_{\lambda }\left(A_{i-1}\right)}).\hfill \end{array}$$

It follows that

$$\begin{array}{cc}\hfill & {\mu }_{{\tilde{F}}_n}=1-\prod _{i=1}^n{(1-{\mu }_{{\tilde{\beta }}_i})}^{g_{\lambda }\left(A_i\right)-g_{\lambda }\left(A_{i-1}\right)},\hfill \\ \hfill & {\nu }_{{\tilde{F}}_n}=\prod _{i=1}^n{\nu }_{{\tilde{\beta }}_i}^{g_{\lambda }\left(A_i\right)-g_{\lambda }\left(A_{i-1}\right)},\hfill \end{array}$$

   □

Theorem 2.

When $\lambda =0$, and ${\tilde{\beta }}_i$ is an IFN, then the OWA operator for a series of INFs based on a NAM with $\sigma -\lambda$ rules would degenerate to the classic OWA operator form for a series of IFNs. In fact, based on countable additivity, we have

$$\begin{array}{cc}\hfill & {\tilde{F}}_n({\tilde{\alpha }}_1,{\tilde{\alpha }}_2,\cdots ,{\tilde{\alpha }}_n)=\underset{i=1}{\overset{n}{⨁}}(g_{\lambda }\left(A_i\right)-g_{\lambda }\left(A_{i-1}\right))·{\tilde{\beta }}_i\hfill \\ \hfill & =g_1{\tilde{\beta }}_1⨁g_2{\tilde{\beta }}_2⨁\cdots ⨁g_n{\tilde{\beta }}_n\hfill \\ \hfill & ={\omega }_1{\tilde{\beta }}_1⨁{\omega }_2{\tilde{\beta }}_2⨁\cdots ⨁{\omega }_n{\tilde{\beta }}_n\hfill \\ \hfill & =\underset{i=1}{\overset{n}{⨁}}(1-{(1-{\mu }_{{\tilde{\beta }}_i})}^{{\omega }_i},{\nu }_{{\tilde{\beta }}_i}^{{\omega }_i})\hfill \\ \hfill & =(1-\prod _{i=1}^n{(1-{\mu }_{{\tilde{\beta }}_i})}^{{\omega }_i},\prod _{i=1}^n{\nu }_{{\tilde{\beta }}_i}^{{\omega }_i}).\hfill \end{array}$$

(4)

and

$$\sum _{i=1}^n{\omega }_i=\sum _{i=1}^n(g_{\lambda }\left(A_i\right)-g_{\lambda }\left(A_{i-1}\right))=g_{\lambda }\left(A_n\right)=1.$$

Corollary 1.

When $\lambda =0$, and ${\tilde{\beta }}_i$ is a special IFN, namely, real number, $i=1,2,3,\cdots$ then the OWA operator for a series of IFN based on a NAM with $\sigma -\lambda$ rules degenerates to the classic OWA operator in Reference [2].

Definition 7.

Let $g_{\lambda }$ be fuzzy measure meeting $\delta -\lambda$ rules. Denote $A_i=\{x_1,x_2,\cdots ,x_i\}$, $i=1,2,\cdots ,n$, $A_0=\varnothing$. The measure of orness involved with an OWA operator ${\tilde{F}}_n$ of dimension n for IFNs based on a NAM with $\sigma -\lambda$ rules can be defined by

$$orness\left(g_{\lambda }^{\left(n\right)}\right)=\sum _{i=1}^n\frac{n-i}{n-1}(g_{\lambda }^{\left(n\right)}\left(A_i\right)-g_{\lambda }^{\left(n\right)}\left(A_{i-1}\right)),$$

The measure of andness associated with the OWA operator ${\tilde{F}}_n$ of dimension n for IFNs based on a NAM with $\sigma -\lambda$ rules can be further defined by

$$andness\left(g_{\lambda }^{\left(n\right)}\right)=1-orness\left(g_{\lambda }^{\left(n\right)}\right)=\sum _{i=1}^n\frac{i-1}{n-1}(g_{\lambda }^{\left(n\right)}\left(A_i\right)-g_{\lambda }^{\left(n\right)}\left(A_{i-1}\right)).$$

Theorem 3.

Let $g_{\lambda }$ be the fuzzy measure meeting $\delta -\lambda$ rules. Denote $A_i=\{x_1,x_2,\cdots ,x_i\}$, $i=1,2,\cdots ,n$, $A_0=\varnothing$. ${\tilde{F}}_n$ is an OWA operator for IFNs based on a NAM with $\sigma -\lambda$ rules, then

(1) The measure of orness associated with an OWA operator ${\tilde{F}}_n$ of dimension n for IFNs based on a NAM with $\sigma -\lambda$ rules is defined as

$$orness\left(g_{\lambda }^{\left(n\right)}\right)=\frac{1}{n-1}\sum _{i=1}^{n-1}{g}_{\lambda }^{\left(n\right)}\left(A_i\right),$$

(5)

(2) The measure of andness associated with the OWA operator ${\tilde{F}}_n$ of dimension n for IFN based on a NAM with $\sigma -\lambda$ rules is defined as

$$andness\left(g_{\lambda }^{\left(n\right)}\right)=1-orness\left(g_{\lambda }^{\left(n\right)}\right)=1-\frac{1}{n-1}\sum _{i=1}^{n-1}{g}_{\lambda }^{\left(n\right)}\left(A_i\right).$$

(6)

Proof. 

$$\begin{array}{cc}\hfill \left(1\right)orness\left(g_{\lambda }^{\left(n\right)}\right)& =\sum _{i=1}^n\frac{n-i}{n-1}(g_{\lambda }^{\left(n\right)}\left(A_i\right)-g_{\lambda }^{\left(n\right)}\left(A_{i-1}\right))\hfill \\ \hfill & =\frac{1}{n-1}[(n-1)(g_{\lambda }^{\left(n\right)}\left(A_1\right)-g_{\lambda }^{\left(n\right)}\left(A_0\right))+(n-2)(g_{\lambda }^{\left(n\right)}\left(A_2\right)-g_{\lambda }^{\left(n\right)}\left(A_1\right))\hfill \\ \hfill & +\cdots +(g_{\lambda }^{\left(n\right)}\left(A_{n-1}\right)-g_{\lambda }^{\left(n\right)}\left(A_{n-2}\right))]\hfill \\ \hfill & =\frac{1}{n-1}(g_{\lambda }^{\left(n\right)}\left(A_1\right)+g_{\lambda }^{\left(n\right)}\left(A_2\right)+\cdots +g_{\lambda }^{\left(n\right)}\left(A_{n-1}\right))\hfill \\ \hfill & =\frac{1}{n-1}\sum _{i=1}^{n-1}{g}_{\lambda }^{\left(n\right)}\left(A_i\right),\hfill \end{array}$$

$$\begin{array}{cc}\hfill \left(2\right)andness\left(g_{\lambda }^{\left(n\right)}\right)& =\sum _{i=1}^n\frac{i-1}{n-1}(g_{\lambda }^{\left(n\right)}\left(A_i\right)-g_{\lambda }^{\left(n\right)}\left(A_{i-1}\right))\hfill \\ \hfill & =\frac{1}{n-1}[(g_{\lambda }^{\left(n\right)}\left(A_2\right)-g_{\lambda }^{\left(n\right)}\left(A_1\right))+2(g_{\lambda }^{\left(n\right)}\left(A_3\right)-g_{\lambda }^{\left(n\right)}\left(A_2\right))\hfill \\ \hfill & +\cdots +(n-1)(g_{\lambda }^{\left(n\right)}\left(A_n\right)-g_{\lambda }^{\left(n\right)}\left(A_{n-1}\right))]\hfill \\ \hfill & =\frac{1}{n-1}(-g_{\lambda }^{\left(n\right)}\left(A_1\right)-g_{\lambda }^{\left(n\right)}\left(A_2\right)-\cdots -g_{\lambda }^{\left(n\right)}\left(A_{n-1}\right)+(n-1))\hfill \\ \hfill & =\frac{1}{n-1}(-\sum _{i=1}^{n-1}{g}_{\lambda }^{\left(n\right)}\left(A_i\right)+(n-1))\hfill \\ \hfill & =1-\frac{1}{n-1}\sum _{i=1}^{n-1}{g}_{\lambda }^{\left(n\right)}\left(A_i\right).\hfill \end{array}$$

The proof is complete.    □

Remark 1.

When $\lambda =0$, the measure of orness associated with an OWA operator ${\tilde{F}}_n$ of dimension n for IFNs based on a NAM with $\sigma -\lambda$ rules degenerates to the classic case [5].

Remark 2.

When $\lambda =0$, and the weighting vector is $(1,0,\cdots ,0)$, then $orness\left(g_{\lambda }^{\left(n\right)}\right)=1$.

Remark 3.

When $\lambda =0$, and the weighting vector is $(0,0,\cdots ,1)$, then $orness\left(g_{\lambda }^{\left(n\right)}\right)=0$.

Remark 4.

When $\lambda =0$, and the weighting vector is $(\frac{1}{n},\frac{1}{n},\cdots ,\frac{1}{n})$, then $orness\left(g_{\lambda }^{\left(n\right)}\right)=\frac{1}{2}$.

4. Recursive Aggregation of the OWA Operator for Intuitionistic Fuzzy Numbers (INFs) Based on a Non-Additive Measure (NAM) with $\mathbf{\sigma }-\mathbf{\lambda }$ Rules

In this part, we will derive recursive aggregation of the OWA operator for INFs based on a NAM with $\sigma -\lambda$ rules under the condition that the orness grade remains unchanged.

Lemma 1.

Suppose ${\tilde{\alpha }}_1=({\mu }_{{\tilde{\alpha }}_1},{\nu }_{{\tilde{\alpha }}_1})$ and ${\tilde{\alpha }}_2=({\mu }_{{\tilde{\alpha }}_2},{\nu }_{{\tilde{\alpha }}_2})$ be two IFNs, and ${\lambda }_1,{\lambda }_2\ge 0,$ then

(1)${\lambda }_1\tilde{\alpha }\oplus {\lambda }_2\tilde{\alpha }=({\lambda }_1+{\lambda }_2)\tilde{\alpha };$

(2)${\lambda }_1\left({\lambda }_2\tilde{\alpha }\right)=\left({\lambda }_1{\lambda }_2\right)\tilde{\alpha }.$

Theorem 4.

Let $g_{\lambda }$ be the fuzzy measure meeting $\delta -\lambda$ rules. Denote $A_i=\{x_1,x_2,\cdots$, $x_i\}$, $i=1,2,\cdots ,n$. $(g_{\lambda }^{\left(n\right)}\left(A_i\right)-g_{\lambda }^{\left(n\right)}\left(A_{i-1}\right))$ is the i-th element for the weighting vector of dimension n. $P_L^{\left(n\right)}$ denotes the correlation coefficient. The Left Recursive Form (LRF) of the OWA operator for IFNs based on a NAM with $\sigma -\lambda$ rules can be expressed as:

$$\begin{array}{cc}\hfill {\tilde{F}}_n=& P_L^{\left(n\right)}·(\underset{i=1}{\overset{n-1}{⨁}}(g_{\lambda }^{(n-1)}\left(A_i\right)-g_{\lambda }^{(n-1)}\left(A_{i-1}\right))·{\tilde{\beta }}_i)⨁(g_{\lambda }^{\left(n\right)}\left(A_n\right)-g_{\lambda }^{\left(n\right)}\left(A_{n-1}\right))·{\tilde{\beta }}_n\hfill \\ \hfill =& P_L^{\left(n\right)}·{\tilde{F}}_{n-1}⨁(1-g_{\lambda }^{\left(n\right)}\left(A_{n-1}\right))·{\tilde{\beta }}_n,\hfill \end{array}$$

(7)

where

$$\begin{array}{cc}\hfill & P_L^{\left(n\right)}=1-(1-g_{\lambda }^{\left(n\right)}\left(A_{n-1}\right))=g_{\lambda }^{\left(n\right)}\left(A_{n-1}\right),\hfill \\ \hfill & g_{\lambda }^{\left(n\right)}\left(A_i\right)-g_{\lambda }^{\left(n\right)}\left(A_{i-1}\right)=P_L^{\left(n\right)}·(g_{\lambda }^{(n-1)}\left(A_i\right)-g_{\lambda }^{(n-1)}\left(A_{i-1}\right)),\hfill \\ \hfill & \sum _{i=1}^{n-1}(g_{\lambda }^{(n-1)}\left(A_i\right)-g_{\lambda }^{(n-1)}\left(A_{i-1}\right))=1.\hfill \end{array}$$

(8)

For a fixed level of orness α, we have

$$\begin{array}{cc}\hfill & P_L^{\left(n\right)}=\frac{(n-1)\alpha }{1+{\displaystyle \sum _{i=1}^{n-2}}{g}_{\lambda }^{(n-1)}\left(A_i\right)},\hfill \\ \hfill & g_{\lambda }^{\left(n\right)}\left(A_1\right)=g_{\lambda }^{(n-1)}\left(A_1\right)·P_L^{\left(n\right)},\hfill \\ \hfill & \cdots \hfill \\ \hfill & g_{\lambda }^{\left(n\right)}\left(A_{n-2}\right)=g_{\lambda }^{(n-1)}\left(A_{n-2}\right)·P_L^{\left(n\right)},\hfill \\ \hfill & g_{\lambda }^{\left(n\right)}\left(A_{n-1}\right)=P_L^{\left(n\right)}.\hfill \end{array}$$

Furthermore, ${\tilde{\beta }}_i$ is the i-th largest value out of $\tilde{\alpha }=({\tilde{\alpha }}_1,{\tilde{\alpha }}_2,\cdots ,{\tilde{\alpha }}_n)$ ($i.e.,{\tilde{\beta }}_1\ge {\tilde{\beta }}_2\ge \cdots \ge {\tilde{\beta }}_n)$.

Proof. 

The simplest aggregation is for two elements, as

$${\tilde{F}}_2=(g_{\lambda }^{\left(2\right)}\left(A_1\right)-g_{\lambda }^{\left(2\right)}\left(A_0\right))·{\tilde{\beta }}_1⨁(g_{\lambda }^{\left(2\right)}\left(A_2\right)-g_{\lambda }^{\left(2\right)}\left(A_1\right))·{\tilde{\beta }}_2=g_{\lambda }^{\left(2\right)}\left(A_1\right)·{\tilde{\beta }}_1⨁(1-g_{\lambda }^{\left(2\right)}\left(A_1\right))·{\tilde{\beta }}_2,$$

 $orness\left(g_{\lambda }^{\left(2\right)}\right)=g_{\lambda }^{\left(2\right)}\left(A_1\right)=\alpha$, $andness\left(g_{\lambda }^{\left(2\right)}\right)=1-g_{\lambda }^{\left(2\right)}\left(A_1\right)=1-\alpha .$   

Let us now consider the aggregation ${\tilde{F}}_3$. In this case,

$$orness\left(g_{\lambda }^{\left(3\right)}\right)=\frac{1}{2}\sum _{i=1}^2{g}_{\lambda }^{\left(3\right)}\left(A_i\right)=\alpha .$$

This leads to the system of independent equations

$$\left\{\begin{array}{cc}{g}_{\lambda }^{\left(3\right)}\left(A_1\right)+g_{\lambda }^{\left(3\right)}\left(A_2\right)=2\alpha ,\hfill & \\ (g_{\lambda }^{\left(3\right)}\left(A_1\right)-0)+(g_{\lambda }^{\left(3\right)}\left(A_2\right)-g_{\lambda }^{\left(3\right)}\left(A_1\right))+(g_{\lambda }^{\left(3\right)}\left(A_3\right)-g_{\lambda }^{\left(3\right)}\left(A_2\right))=1,\hfill & \\ g_{\lambda }^{\left(3\right)}\left(A_1\right)=g_{\lambda }^{\left(2\right)}\left(A_1\right)·P_L^{\left(3\right)},\hfill & \\ (g_{\lambda }^{\left(3\right)}\left(A_2\right)-g_{\lambda }^{\left(3\right)}\left(A_1\right))=(1-g_{\lambda }^{\left(2\right)}\left(A_1\right))·P_L^{\left(3\right)}.\hfill \end{array}\right.$$

The solution is

$$\begin{array}{cc}\hfill & P_L^{\left(3\right)}=\frac{2\alpha }{1+g_{\lambda }^{\left(2\right)}\left(A_1\right)},\hfill \\ \hfill & g_{\lambda }^{\left(3\right)}\left(A_1\right)=g_{\lambda }^{\left(2\right)}\left(A_1\right)·P_L^{\left(3\right)},\hfill \\ \hfill & g_{\lambda }^{\left(3\right)}\left(A_2\right)=P_L^{\left(3\right)}.\hfill \end{array}$$

More generally, in the case of n arguments, we obtain the system of $n+1$ independent equations

$$\left\{\begin{array}{cc}{\displaystyle \sum _{i=1}^{n-1}}{g}_{\lambda }^{\left(n\right)}\left(A_i\right)=(n-1)\alpha ,\hfill & \\ {\displaystyle \sum _{i=1}^n}(g_{\lambda }^{\left(n\right)}\left(A_i\right)-g_{\lambda }^{\left(n\right)}\left(A_{i-1}\right))=1,\hfill & \\ g_{\lambda }^{\left(n\right)}\left(A_1\right)=g_{\lambda }^{(n-1)}\left(A_1\right)·P_L^{\left(n\right)},\hfill & \\ \cdots \hfill & \\ g_{\lambda }^{\left(n\right)}\left(A_{n-1}\right)=g_{\lambda }^{(n-1)}\left(A_{n-1}\right)·P_L^{\left(n\right)},\hfill \end{array}\right.$$

whose solution is

$$\begin{array}{cc}\hfill & P_L^{\left(n\right)}=\frac{(n-1)\alpha }{1+{\displaystyle \sum _{i=1}^{n-2}}{g}_{\lambda }^{(n-1)}\left(A_i\right)},\hfill \\ \hfill & g_{\lambda }^{\left(n\right)}\left(A_1\right)=g_{\lambda }^{(n-1)}\left(A_1\right)·P_L^{\left(n\right)},\hfill \\ \hfill & \cdots \hfill \\ \hfill & g_{\lambda }^{\left(n\right)}\left(A_{n-2}\right)=g_{\lambda }^{(n-1)}\left(A_{n-2}\right)·P_L^{\left(n\right)},\hfill \\ \hfill & g_{\lambda }^{\left(n\right)}\left(A_{n-1}\right)=P_L^{\left(n\right)}.\hfill \end{array}$$

The proof is complete.    □

Theorem 5.

Let $g_{\lambda }$ be the fuzzy measure meeting $\sigma -\lambda$ rules, and let $A_i=\{x_1,x_2,\cdots ,x_i\}$, $i=1,2,\cdots ,n$, ${\tilde{F}}_n({\tilde{\alpha }}_1,{\tilde{\alpha }}_2,\cdots ,{\tilde{\alpha }}_n)$ be an OWA operator of dimension n for IFNs based on a NAM with $\sigma -\lambda$ rules. $P_L^{\left(n\right)}$ denotes the correlation coefficient. ${\tilde{F}}_n=({\mu }_{{\tilde{F}}_n},{\nu }_{{\tilde{F}}_n})$, $\widetilde{{\beta }_n}=({\mu }_{\widetilde{{\beta }_n}},{\nu }_{\widetilde{{\beta }_n}})$. Then,

$$\begin{array}{c}\hfill {\tilde{F}}_n=(1-{(1-{\mu }_{{\tilde{F}}_{n-1}})}^{P_L^{\left(n\right)}}{(1-{\mu }_{{\tilde{\beta }}_n})}^{1-g_{\lambda }^{\left(n\right)}\left(A_{n-1}\right)},{\nu }_{{\tilde{F}}_{n-1}}^{P_L^{\left(n\right)}}{\nu }_{{\tilde{\beta }}_n}^{1-g_{\lambda }^{\left(n\right)}\left(A_{n-1}\right)}).\end{array}$$

(9)

That is to say,

$$\begin{array}{cc}\hfill & {\mu }_{{\tilde{F}}_n}=1-{(1-{\mu }_{{\tilde{F}}_{n-1}})}^{P_L^{\left(n\right)}}{(1-{\mu }_{{\tilde{\beta }}_n})}^{1-g_{\lambda }^{\left(n\right)}\left(A_{n-1}\right)},\hfill \\ \hfill & {\nu }_{{\tilde{F}}_n}={\nu }_{{\tilde{F}}_{n-1}}^{P_L^{\left(n\right)}}{\nu }_{{\tilde{\beta }}_n}^{1-g_{\lambda }^{\left(n\right)}\left(A_{n-1}\right)},\hfill \end{array}$$

(10)

where

$$\begin{array}{cc}\hfill & P_L^{\left(n\right)}=1-(1-g_{\lambda }^{\left(n\right)}\left(A_{n-1}\right))=g_{\lambda }^{\left(n\right)}\left(A_{n-1}\right),\hfill \\ \hfill & g_{\lambda }^{\left(n\right)}\left(A_i\right)-g_{\lambda }^{\left(n\right)}\left(A_{i-1}\right)=P_L^{\left(n\right)}·(g_{\lambda }^{(n-1)}\left(A_i\right)-g_{\lambda }^{(n-1)}\left(A_{i-1}\right)),\hfill \\ \hfill & \sum _{i=1}^{n-1}(g_{\lambda }^{(n-1)}\left(A_i\right)-g_{\lambda }^{(n-1)}\left(A_{i-1}\right))=1.\hfill \end{array}$$

For a fixed level of orness α, we have

$$\begin{array}{cc}\hfill & P_L^{\left(n\right)}=\frac{(n-1)\alpha }{1+{\displaystyle \sum _{i=1}^{n-2}}{g}_{\lambda }^{(n-1)}\left(A_i\right)},\hfill \\ \hfill & g_{\lambda }^{\left(n\right)}\left(A_1\right)=g_{\lambda }^{(n-1)}\left(A_1\right)·P_L^{\left(n\right)},\hfill \\ \hfill & \cdots \hfill \\ \hfill & g_{\lambda }^{\left(n\right)}\left(A_{n-2}\right)=g_{\lambda }^{(n-1)}\left(A_{n-2}\right)·P_L^{\left(n\right)},\hfill \\ \hfill & g_{\lambda }^{\left(n\right)}\left(A_{n-1}\right)=P_L^{\left(n\right)}.\hfill \end{array}$$

Furthermore, ${\tilde{\beta }}_i=({\mu }_{{\tilde{\beta }}_i},{\nu }_{{\tilde{\beta }}_i})$ is the i-th largest value out of $\tilde{\alpha }=({\tilde{\alpha }}_1,{\tilde{\alpha }}_2,\cdots ,{\tilde{\alpha }}_n)$ ($i.e.,{\tilde{\beta }}_1\ge {\tilde{\beta }}_2\ge \cdots \ge {\tilde{\beta }}_n)$.

Remark 5.

Similar to Theorems 4 and 5, the Reft Recursive Form (RRF) and the General Recursive Form (GRF) of the OWA operator for IFNs based on a NAM with $\sigma -\lambda$ rules can be discussed easily. However, the Recursive Aggregation (RA) refers to Reft Recursive Form (RRF) if it is not emphasized.

Remark 6.

However, in practice, it is more suitable to settle some problems with a fixed level of orness α. Thus, it is interesting to notice that $P_L^{\left(n\right)}$ depends on n and α, as 

$$P_L^{\left(n\right)}=P_L(n,\alpha )=\frac{(n-1)\alpha }{(n-2)\alpha +1}.$$

(11)

5. Calculation of NAM and Fusion Process Design Based on Recursive Aggregation

Theorem 6.

Let ${\tilde{\alpha }}_i=({\mu }_{{\tilde{\alpha }}_i},v_{{\tilde{\alpha }}_i})(i=1,2)$ be two intuitionistic fuzzy numbers. The distance measure of IFNs ${\tilde{\alpha }}_1$ and ${\tilde{\alpha }}_2$, referring to [17], is defined by

$$D^2({\tilde{\alpha }}_1,{\tilde{\alpha }}_2)=\frac{1}{2}({({\mu }_{{\tilde{\alpha }}_1}-{\mu }_{{\tilde{\alpha }}_2})}^2+{(v_{{\tilde{\alpha }}_1}-v_{{\tilde{\alpha }}_2})}^2+{({\pi }_{{\tilde{\alpha }}_1}-{\pi }_{{\tilde{\alpha }}_2})}^2).$$

An OWA operator for IFNs based on a NAM with $\sigma -\lambda$ rules is a multiple input and single output model. By solving the model, we can obtain necessary data.

Let $X=\{x_1,x_2,\cdots ,x_k,x_{k+1},\cdots ,x_n\}$, $n\ge 2$ be a set of attributes, and $A=\{{\alpha }_1,{\alpha }_2,\cdots ,{\alpha }_m\}$ be a set of objects. Y is the given target.

Table 1. Information evaluation table.

	${\mathit{x}}_1$	${\mathit{x}}_2$	⋯	${\mathit{x}}_{\mathit{k}}$	y
${\alpha }_1$	${\tilde{\alpha }}_{11}$	${\tilde{\alpha }}_{12}$		${\tilde{\alpha }}_{1k}$	${\tilde{E}}_1$
${\alpha }_2$	${\tilde{\alpha }}_{21}$	${\tilde{\alpha }}_{22}$	⋯	${\tilde{\alpha }}_{2k}$	${\tilde{E}}_2$
⋯	⋯	⋯	⋯	⋯	⋯
${\alpha }_m$	${\tilde{\alpha }}_{m1}$	${\tilde{\alpha }}_{m2}$	⋯	${\tilde{\alpha }}_{mk}$	${\tilde{E}}_m$

shows the evaluation information, where ${\tilde{\alpha }}_{ij}=({\mu }_{{\tilde{\alpha }}_{ij}},{\nu }_{{\tilde{\alpha }}_{ij}})$ is a value for i-th object with respect to attribute $x_j$, and ${\tilde{E}}_i=({\mu }_{{\tilde{E}}_i},{\mu }_{{\tilde{E}}_i})$ is an evaluation value.

Below, we present a procedure for the calculation of the fuzzy measure and integrator design in recursive aggregation:

Step 1: According to the information evaluation table, we utilize the genetic algorithm to gain $\lambda$ and $g_{\lambda }\left(\left\{x_j\right\}\right).$

Step 2: Evaluation function:

$$Eval\left(V\right)=min\left\{\frac{1}{m}\sum _{i=1}^m{D}^2({\tilde{F}}_i({\tilde{\alpha }}_{i1},{\tilde{\alpha }}_{i2},\cdots ,{\tilde{\alpha }}_{ik}),{\tilde{E}}_i)\right\}$$

                                s.t

$$\left\{\begin{array}{cc}{\mu }_{{\tilde{F}}_i}=1-{\displaystyle \prod _{j=1}^k}{(1-{\mu }_{{\tilde{\alpha }}_{ij}})}^{g_{\lambda }\left(A_j\right)-g_{\lambda }\left(A_{j-1}\right)},\hfill & \\ {\nu }_{{\tilde{F}}_i}={\displaystyle \prod _{j=1}^k}{\nu }_{{\tilde{\alpha }}_{ij}}^{g_{\lambda }\left(A_j\right)-g_{\lambda }\left(A_{j-1}\right)},\hfill & \\ {\pi }_{{\tilde{F}}_i}=1-{\mu }_{{\tilde{F}}_i}-{\nu }_{{\tilde{F}}_i},\hfill & \\ 1+\lambda ={\displaystyle \prod _{j=1}^k}(1+\lambda g_{\lambda }^{\left(k\right)}\left(x_j\right)),\hfill & \\ g_{\lambda }^{\left(k\right)}\left(A_j\right)=\frac{1}{\lambda }(\prod _{x\in A_j}(1+\lambda g_{\lambda }^{\left(k\right)}\left(\left\{x\right\}\right))-1).\hfill \end{array}\right.$$

Step 3: Employ $g_{\lambda }^{\left(k\right)}\left(A_j\right)=\frac{1}{\lambda }({\prod }_{x\in A_j}(1+\lambda g_{\lambda }^{\left(k\right)}\left(\left\{x\right\}\right))-1)$ to derive $g_{\lambda }^{\left(k\right)}\left(A_j\right)$.

Step 4: Utilize RA for IFNs based on a NAM with $\sigma -\lambda$ rules proposed in this work to obtain $g_{\lambda }^{(k+1)}\left(A_j\right)$ with the condition of increasing the attribute index $x_{k+1}$.

Step 5: When a new object i gives values to the $k+1$ attributes, we can utilize the presented OWA operator to obtain ${\tilde{F}}_{k\left(i\right)}$. Then, utilize RF for IFNs based on a NAM with $\sigma -\lambda$ rules to directly obtain aggregation results ${\tilde{F}}_{k+1\left(i\right)}$ of $k+1$ attributes from aggregation results ${\tilde{F}}_{k\left(i\right)}$ of k attributes.

Step 6: Similarly, when adding, in turn, the attribute index to evaluation, we can always utilize the old aggregation results ${\tilde{F}}_{n-1\left(i\right)}$ of $n-1$ attributes to directly derive the final aggregation results ${\tilde{F}}_{n\left(i\right)}$ of n attributes.

Example 1.

Online shopping is prevalent in e-commercial area. Thus, making a relatively accurate and reasonable evaluation for online shopping is very useful. An online shop’s management randomly chooses five customers for a satisfaction evaluation of online shop. The evaluation value is denoted as ${\tilde{a}}_{ij}$, and ${\tilde{a}}_{ij}$ is an IFN. The attributes are $x_1$: logistics, $x_2$: service attitude, $x_3$: price, $x_4$: product quality in satisfaction evaluation, and the results are shown in Table 2. When customers further consider “after-sale service” or “payment security”, the online shop management want to obtain a new evaluation result.

Step 1: Collecting the evaluation values of the customers for a good in Table 2. The IFNs in Table 2 shows that the evaluation values of the customers for the attributes of the good. That is to say, the satisfaction evaluation and dissatisfaction evaluation of the customer for the attribute of a good.

Step 2: According to Table 3, we utilize the genetic algorithm to gain $\lambda$ and $g_{\lambda }^{\left(4\right)}\left(\left\{x_j\right\}\right)(j=1,2,3,4)$. The genetic algorithm is shown in Algorithm 1.    

Algorithm 1: The genetic algorithm to gain $\lambda$ and $g_{\lambda }^{\left(4\right)}\left(\left\{x_j\right\}\right)(j=1,2,3,4)$.

Step 1: Build an evaluation function file in Matlab software, save it as fit.m file and store it in the appropriate directory. Step 2: Genetic algorithm toolbox is executed in the command window of Matlab R2014a to enter the GUI interface of the genetic algorithm and set relevant parameters in the corresponding column. Fitness function is @fit, variables numbers are five. The parameters of the genetic algorithm used in this paper are shown in Table 4. Stopping Generation is 149, and we use the default values for others. The GUI running interface of the genetic algorithm toolbox is shown in Figure 1. Step 3: After setting the parameters, click “Start” in the GUI running interface of the genetic algorithm toolbox. $\lambda$ and $g_{\lambda }^{\left(4\right)}\left(\left\{x_j\right\}\right)(j=1,2,3,4)$ are shown in Table 5, and the operation result diagram is shown in Figure 2.

Step 3: Utilizing $g_{\lambda }^{\left(4\right)}\left(A_j\right)=\frac{1}{\lambda }({\prod }_{x\in A_j}(1+\lambda g_{\lambda }^{\left(4\right)}\left(\left\{x\right\}\right))-1)$ to derive $g_{\lambda }^{\left(4\right)}\left(A_j\right)$.

$g_{\lambda }^{\left(4\right)}\left(A_1\right)=g_{\lambda }^{\left(4\right)}\left(\left\{x_1\right\}\right)=0.3740$; $g_{\lambda }^{\left(4\right)}\left(A_2\right)=\frac{1}{\lambda }[(1+\lambda g_{\lambda }^{\left(4\right)}\left(\left\{x_1\right\}\right))(1+\lambda g_{\lambda }^{\left(4\right)}\left(\left\{x_2\right\}\right))-1]=0.6335$;

$g_{\lambda }^{\left(4\right)}\left(A_3\right)=\frac{1}{\lambda }[(1+\lambda g_{\lambda }^{\left(4\right)}\left(\left\{x_1\right\}\right))(1+\lambda g_{\lambda }^{\left(4\right)}\left(\left\{x_2\right\}\right))(1+\lambda g_{\lambda }^{\left(4\right)}\left(\left\{x_3\right\}\right))-1]=0.7477$.

Step 4: Utilizing LRF for IFNs based on a NAM with $\sigma -\lambda$ rules proposed in this paper to obtain $g_{\lambda }^{\left(5\right)}\left(A_j\right)$ with the attribute index “after-sale service” increasing, we have

$\alpha =orness\left(g_{\lambda }^{\left(4\right)}\right)=\frac{1}{3}\sum _{j=1}^3{g}_{\lambda }^{\left(4\right)}\left(A_j\right)=0.5850$; $P_L^{\left(5\right)}=\frac{(n-1)\alpha }{(n-2)\alpha +1}=\frac{4\alpha }{3\alpha +1}=0.8494$;

$g_{\lambda }^{\left(5\right)}\left(A_1\right)=P_L^{\left(5\right)}·g_{\lambda }^{\left(4\right)}\left(A_1\right)=0.3177$; $g_{\lambda }^{\left(5\right)}\left(A_2\right)=P_L^{\left(5\right)}·g_{\lambda }^{\left(4\right)}\left(A_2\right)=0.5381$;

$g_{\lambda }^{\left(5\right)}\left(A_3\right)=P_L^{\left(5\right)}·g_{\lambda }^{\left(4\right)}\left(A_3\right)=0.6351$; $g_{\lambda }^{\left(5\right)}\left(A_4\right)=P_L^{\left(5\right)}=0.8494$.

Step 5: When a new customer (6) gives values to logistics, service attitude, price, product quality, as listed in Table 2. We can utilize the OWA operator proposed in this paper to obtain ${\tilde{F}}_{4\left(6\right)}$. Then, utilize LRF to directly derive aggregation results ${\tilde{F}}_{5\left(6\right)}$ of 5 attributes from aggregation results ${\tilde{F}}_{4\left(6\right)}$ of 4 attributes.

${\tilde{F}}_{4\left(6\right)}=\left(g_{\lambda }^{\left(4\right)}\left(A_1\right)\right)\otimes (0.90,0.60)\oplus (g_{\lambda }^{\left(4\right)}\left(A_2\right)-g_{\lambda }^{\left(4\right)}\left(A_1\right))\otimes (0.60,0.20)\oplus (g_{\lambda }^{\left(4\right)}\left(A_3\right)-g_{\lambda }^{\left(4\right)}\left(A_2\right))\otimes (0.30,0.60)\oplus (1-g_{\lambda }^{\left(4\right)}\left(A_3\right))\otimes (0.20,0.70)=(0.6975,0),$

${\tilde{F}}_{5\left(6\right)}=P_L^{\left(5\right)}\otimes {\tilde{F}}_{4\left(6\right)}\oplus (1-g_{\lambda }^{\left(5\right)}\left(A_4\right))\otimes (0.40,0.50)=(0.6646,0)$.

Step 6: When a new customer (7) gives values to the attributes, as listed in Table 2,

${\tilde{F}}_{6\left(7\right)}=P_L^{\left(6\right)}\otimes {\tilde{F}}_{5\left(7\right)}\oplus (1-g_{\lambda }^{\left(6\right)}\left(A_5\right))\otimes (0.50,0.45)=(0.6476,0.2989)$.

Table 2. The satisfaction evaluation.

Customer	Logistics	Service Attitude	Price	Product Quality	After-Sale Service
1	$(0.00,0.90)$	$(0.10,0.80)$	$(0.30,0.50)$	$(1.00,0.00)$
2	$(0.30,0.60)$	$(0.80,0.15)$	$(0.50,0.30)$	$(0.60,0.30)$
3	$(0.70,0.20)$	$(0.90,0.05)$	$(1.00,0.00)$	$(0.70,0.2)$
4	$(0.10,0.85)$	$(0.00,0.90)$	$(0.40,0.50)$	$(0.30,0.50)$
5	$(0.50,0.35)$	$(0.40,0.40)$	$(0.50,0.50)$	$(0.60,0.20)$
6	$(0.30,0.60)$	$(0.90,0.00)$	$(0.60,0.20)$	$(0.20,0.70)$	$(0.40,0.50)$
7	$(0.30,0.70)$	$(0.90,0.10)$	$(0.60,0.20)$	$(0.20,0.70)$	$(0.40,0.60)$
Customer	Payment Security	Evaluation
1		$(0.20,0.65)$
2		$(0.50,0.45)$
3		$(0.80,0.10)$
4		$(0.10,0.85)$
5		$(0.40,0.50)$
6		?
7	$(0.50,0.45)$	?

Table 2. The satisfaction evaluation.

Customer	Logistics	Service Attitude	Price	Product Quality	After-Sale Service
1	$(0.00,0.90)$	$(0.10,0.80)$	$(0.30,0.50)$	$(1.00,0.00)$
2	$(0.30,0.60)$	$(0.80,0.15)$	$(0.50,0.30)$	$(0.60,0.30)$
3	$(0.70,0.20)$	$(0.90,0.05)$	$(1.00,0.00)$	$(0.70,0.2)$
4	$(0.10,0.85)$	$(0.00,0.90)$	$(0.40,0.50)$	$(0.30,0.50)$
5	$(0.50,0.35)$	$(0.40,0.40)$	$(0.50,0.50)$	$(0.60,0.20)$
6	$(0.30,0.60)$	$(0.90,0.00)$	$(0.60,0.20)$	$(0.20,0.70)$	$(0.40,0.50)$
7	$(0.30,0.70)$	$(0.90,0.10)$	$(0.60,0.20)$	$(0.20,0.70)$	$(0.40,0.60)$
Customer	Payment Security	Evaluation
1		$(0.20,0.65)$
2		$(0.50,0.45)$
3		$(0.80,0.10)$
4		$(0.10,0.85)$
5		$(0.40,0.50)$
6		?
7	$(0.50,0.45)$	?

Table 3. The triangular fuzzy number changed into the interval number.

Customer	Logistics	Service Attitude	Price	Product Quality	Evaluation
1	$(0.00,0.90)$	$(0.10,0.80)$	$(0.30,0.50)$	$(1.00,0.00)$	$(0.20,0.65)$
2	$(0.30,0.60)$	$(0.80,0.15)$	$(0.50,0.30)$	$(0.60,0.30)$	$(0.50,0.45)$
3	$(0.70,0.20)$	$(0.90,0.05)$	$(1.00,0.00)$	$(0.70,0.20)$	$(0.80,0.10)$
4	$(0.10,0.85)$	$(0.00,0.90)$	$(0.40,0.50)$	$(0.30,0.50)$	$(0.10,0.85)$
5	$(0.50,0.35)$	$(0.40,0.40)$	$(0.50,0.50)$	$(0.60,0.20)$	$(0.40,0.50)$

Table 3. The triangular fuzzy number changed into the interval number.

Customer	Logistics	Service Attitude	Price	Product Quality	Evaluation
1	$(0.00,0.90)$	$(0.10,0.80)$	$(0.30,0.50)$	$(1.00,0.00)$	$(0.20,0.65)$
2	$(0.30,0.60)$	$(0.80,0.15)$	$(0.50,0.30)$	$(0.60,0.30)$	$(0.50,0.45)$
3	$(0.70,0.20)$	$(0.90,0.05)$	$(1.00,0.00)$	$(0.70,0.20)$	$(0.80,0.10)$
4	$(0.10,0.85)$	$(0.00,0.90)$	$(0.40,0.50)$	$(0.30,0.50)$	$(0.10,0.85)$
5	$(0.50,0.35)$	$(0.40,0.40)$	$(0.50,0.50)$	$(0.60,0.20)$	$(0.40,0.50)$

Table 4. The parameters of the genetic algorithm.

Parameter	Population Size	Initial Rang	Elite Count	Crossover Probability
	80	$[0;1]$	2	$0.75$

Table 4. The parameters of the genetic algorithm.

Parameter	Population Size	Initial Rang	Elite Count	Crossover Probability
	80	$[0;1]$	2	$0.75$

Table 5. Results of Step 2.

Point Set	$\mathit{\lambda }$	${\mathit{g}}_{\mathit{\lambda }}$	Error	Hereditary Algebra
$\left\{x_1\right\}$	$0.0160$	$0.3740$	$0.0040$	149
$\left\{x_2\right\}$		$0.2580$
$\left\{x_3\right\}$		$0.1130$
$\left\{x_4\right\}$		$0.0020$

Table 5. Results of Step 2.

Point Set	$\mathit{\lambda }$	${\mathit{g}}_{\mathit{\lambda }}$	Error	Hereditary Algebra
$\left\{x_1\right\}$	$0.0160$	$0.3740$	$0.0040$	149
$\left\{x_2\right\}$		$0.2580$
$\left\{x_3\right\}$		$0.1130$
$\left\{x_4\right\}$		$0.0020$

Figure 1. The GUI running interface of the genetic algorithm toolbox.

Figure 1. The GUI running interface of the genetic algorithm toolbox.

Figure 2. The operation result diagram of Step 2.

Figure 2. The operation result diagram of Step 2.

6. Conclusions

In this paper, we propose an OWA operator for IFN based on a NAM with $\sigma -\lambda$ rules and derive the Recursive Forms of OWA operators for IFN according to NAM with $\sigma -\lambda$ rules while keeping the orness grade unchanged. Furthermore, the procedure for integrator design in recursive aggregation is designed and the process of calculation is demonstrated by an example.