# A Threat Assessment Model under Uncertain Environment

Authors: Yong Deng
Journal: Mathematical Problems in Engineering
 (2015)

---

## Abstract

Threat evaluation is extremely important to decision makers in many situations, such as military application and physical protection systems. In this paper, a new threat assessment model based on interval number to deal with the intrinsic uncertainty and imprecision in combat environment is proposed. Both objective and subjective factors are taken into consideration in the proposed model. For the objective factors, the genetic algorithm (GA) is used to search out an optimal interval number representing
all the attribute values of each object. In addition, for the subjective factors, the interval Analytic Hierarchy Process (AHP) is adopted to determine each object’s threat weight according to the experience of commanders/experts. Then a discounting method is proposed to integrate the objective and subjective factors. At last, the ideal of Technique for Order Preference by Similarity to Ideal Solution (TOPSIS) is applied to obtain the threat ranking of all the objects. A real application is used to illustrate the effectiveness of the proposed model.


---

## Body

## 1. Introduction

In the real world, it is always complex and difficult to make a decision and to deal with threat assessment in most situations, because the problems we are faced with are always intrinsic imprecision and uncertainty which is typically represented by the threat assessment for multiobject and multiattribute with uncertain information. Hence, it is meaningful to develop a reasonable model to solve this problem. The threat assessment of multiobject and multiattribute has been researched by many researchers. Generally speaking, threat assessment can be seen as a decision-making problem under uncertain environment. We first introduce some related works about decision making and threat assessment.


### 1.1. Decision Making

Decision making has been the popular topic of research in many fields since the concept was proposed. Saaty [1, 2] introduces the AHP which is a multicriteria decision-making approach in which factors are arranged in a hierarchic structure. Hall and Davis [3] introduce a value-based decision-making model which suggests that multiple perspectives may be achieved by considering a foundation of individual values. Zhang et al. [4] present a method for solving the stochastic MCDM problem and propose a new concept of stochastic dominance degree (SDD). Chiadamrong [5] introduces the concept of fuzzy set theory to overcoming the precision-based evaluation for manufacturing strategies selection. Hon et al. [6] make use of a procedure to solve the multiple attributes and multiple hierarchical system under fuzzy environment. This procedure is based on gradient eigenvector method or rating the fuzzy criteria weighting and the max-min paired elimination method for aggregation. Forgionne and Kohli [7] present a methodology that objectively rates decision technology system journals across multiple and relevant dimensions. Through this process, the AHP-based rating model and the DSS-delivery mechanism are the major contribution. Fan et al. [8] propose a method based on pairwise comparisons of alternatives with random evaluations to solve stochastic MCDM problem. By computing the probabilities of all possible results of pairwise comparisons and using the identification rule, superior, indifferent, and inferior probabilities on pairwise comparisons of alternatives are estimated. Al-Najjar and Alsyouf [9] make use of the advantage of both fuzzy logic and multiple criteria decision making to introduce an evaluation methodology. Wang [10] proposes a new multiple criteria decision-making method with incomplete certain information based on ternary AHP; in this process, the ternary comparison matrix of the alternatives is constructed to normalize priority vector of the alternatives. Similar researches are conducted by Chan et al. [11]. Due to the efficient modelling and handling of uncertain information, fuzzy set theory [12–15] and evidence theory are also widely used in decision making [16–23]. Some typical evidence theories with AHP are published in [24, 25].


### 1.2. Threat Assessment

A threat is defined as any act, entity, event, or phenomenon with the potential to harm a person or thing. In other words, a threat is a source of potential harm. Sometimes the word hazard or risk is used as a synonym for threat. The term “threat assessment” can be broadly interpreted as evaluation of impending danger or harm by a person, group, circumstance, or set of conditions. It is a pattern of activities involving detection and analysis of threat stimuli and the situations in which the threat is encountered. Threat or risk assessment serving as the foundation of regulatory decision making whether to take actions to reduce the loss has been researched by many researchers. Pedrycz et al. [26] introduce a scheme of risk assessment on a basis of classification results produced for some experimental data capturing the history of previous threat cases. Through this procedure, information granulation (fuzzy clustering) was used to reveal the structural relationships in the experimental data. van de Walle and Rutkowski [27] designed and developed FURIA (fuzzy relational incident analysis), a prototype fuzzy decision support system allowing individual group members to compare their individual assessment of a decision alternative to the assessment of the other group members. Looney and Liang [28] propose a multiphase approach to middle and high level data fusion with an application to situation and threat assessment, threat assessment with fuzzy belief network. Khadam and Kaluarachachi [29] propose a decision analysis framework which integrates probabilistic health risk assessment into comprehensive, yet simple, cost-based multicriteria decision analysis framework. Assmuth and Hildén [30] present an analysis of frameworks for information on integrated risk assessment and management, which focuses on issues related to environmental and health risks of chemicals and their regulation at the EU level. Chen and Ma [31] propose a method combining the cost of reducing uncertainty with the selection of risk assessment models for remediation decision of site contamination; in this study, they explore how to choose among equally plausible models for risk-related decisions, which is closely related to model uncertainty. Jeong et al. [32] introduce a risk assessment method which is developed by using risk matrix and fuzzy inference logic, on the basis of the radiological and nonradiological hazard for a decommissioning safety of a nuclear facility. Bonano et al. [33] developed and demonstrated a single framework integrating risk assessment and decision analysis methods for evaluating, ranking, and selecting preferred remediation alternatives at a contaminated site; in the decision analysis framework, the Analytic Hierarchy Process was selected as a technique to obtain stakeholder working group input. van Duijne et al. [34] outline the preconditions for risk assessment method and aim to clarify the difficulties and pitfalls in the subsequent stages of risk assessment. Kalantarnia et al. [35] demonstrate the use of Bayesian theory in quantitative risk assessment (QRA) and its application as a useful tool in dynamic risk assessment to prevent accidents, which overcomes the major disadvantages of QRA: its inability to update risk during the life of a process. In the past few years, the field of group decision and threat evaluation has been researched hotly, like in Deng et al. [36].Evaluation for aerial objects is an important part in the aerial defensive operation, which can be described as the assessment of multiobject and multiattribute under uncertain environment. Due to the limitation of detection means or secrecy, the effective information we can obtain from the threat objects is little. Generally, the interval number can be used to represent the uncertain or imprecise information. In this paper, a new model is proposed to rank the threat objects based on interval numbers, which takes the subjective and objective factors into consideration. Two examples are used to illustrate the effectiveness of the proposed threat evaluation model.This paper is organized as follows. Section2 mainly introduces several concepts of interval numbers, the classical genetic algorithm, interval AHP, and the TOPSIS. Section 3 introduces the model of threat assessment in detail. Section 4 introduces a simple numerical example and a real application to illustrate the effectiveness of the proposed assessment model. A conclusion is made in Section 5.


## 1.1. Decision Making

Decision making has been the popular topic of research in many fields since the concept was proposed. Saaty [1, 2] introduces the AHP which is a multicriteria decision-making approach in which factors are arranged in a hierarchic structure. Hall and Davis [3] introduce a value-based decision-making model which suggests that multiple perspectives may be achieved by considering a foundation of individual values. Zhang et al. [4] present a method for solving the stochastic MCDM problem and propose a new concept of stochastic dominance degree (SDD). Chiadamrong [5] introduces the concept of fuzzy set theory to overcoming the precision-based evaluation for manufacturing strategies selection. Hon et al. [6] make use of a procedure to solve the multiple attributes and multiple hierarchical system under fuzzy environment. This procedure is based on gradient eigenvector method or rating the fuzzy criteria weighting and the max-min paired elimination method for aggregation. Forgionne and Kohli [7] present a methodology that objectively rates decision technology system journals across multiple and relevant dimensions. Through this process, the AHP-based rating model and the DSS-delivery mechanism are the major contribution. Fan et al. [8] propose a method based on pairwise comparisons of alternatives with random evaluations to solve stochastic MCDM problem. By computing the probabilities of all possible results of pairwise comparisons and using the identification rule, superior, indifferent, and inferior probabilities on pairwise comparisons of alternatives are estimated. Al-Najjar and Alsyouf [9] make use of the advantage of both fuzzy logic and multiple criteria decision making to introduce an evaluation methodology. Wang [10] proposes a new multiple criteria decision-making method with incomplete certain information based on ternary AHP; in this process, the ternary comparison matrix of the alternatives is constructed to normalize priority vector of the alternatives. Similar researches are conducted by Chan et al. [11]. Due to the efficient modelling and handling of uncertain information, fuzzy set theory [12–15] and evidence theory are also widely used in decision making [16–23]. Some typical evidence theories with AHP are published in [24, 25].


## 1.2. Threat Assessment

A threat is defined as any act, entity, event, or phenomenon with the potential to harm a person or thing. In other words, a threat is a source of potential harm. Sometimes the word hazard or risk is used as a synonym for threat. The term “threat assessment” can be broadly interpreted as evaluation of impending danger or harm by a person, group, circumstance, or set of conditions. It is a pattern of activities involving detection and analysis of threat stimuli and the situations in which the threat is encountered. Threat or risk assessment serving as the foundation of regulatory decision making whether to take actions to reduce the loss has been researched by many researchers. Pedrycz et al. [26] introduce a scheme of risk assessment on a basis of classification results produced for some experimental data capturing the history of previous threat cases. Through this procedure, information granulation (fuzzy clustering) was used to reveal the structural relationships in the experimental data. van de Walle and Rutkowski [27] designed and developed FURIA (fuzzy relational incident analysis), a prototype fuzzy decision support system allowing individual group members to compare their individual assessment of a decision alternative to the assessment of the other group members. Looney and Liang [28] propose a multiphase approach to middle and high level data fusion with an application to situation and threat assessment, threat assessment with fuzzy belief network. Khadam and Kaluarachachi [29] propose a decision analysis framework which integrates probabilistic health risk assessment into comprehensive, yet simple, cost-based multicriteria decision analysis framework. Assmuth and Hildén [30] present an analysis of frameworks for information on integrated risk assessment and management, which focuses on issues related to environmental and health risks of chemicals and their regulation at the EU level. Chen and Ma [31] propose a method combining the cost of reducing uncertainty with the selection of risk assessment models for remediation decision of site contamination; in this study, they explore how to choose among equally plausible models for risk-related decisions, which is closely related to model uncertainty. Jeong et al. [32] introduce a risk assessment method which is developed by using risk matrix and fuzzy inference logic, on the basis of the radiological and nonradiological hazard for a decommissioning safety of a nuclear facility. Bonano et al. [33] developed and demonstrated a single framework integrating risk assessment and decision analysis methods for evaluating, ranking, and selecting preferred remediation alternatives at a contaminated site; in the decision analysis framework, the Analytic Hierarchy Process was selected as a technique to obtain stakeholder working group input. van Duijne et al. [34] outline the preconditions for risk assessment method and aim to clarify the difficulties and pitfalls in the subsequent stages of risk assessment. Kalantarnia et al. [35] demonstrate the use of Bayesian theory in quantitative risk assessment (QRA) and its application as a useful tool in dynamic risk assessment to prevent accidents, which overcomes the major disadvantages of QRA: its inability to update risk during the life of a process. In the past few years, the field of group decision and threat evaluation has been researched hotly, like in Deng et al. [36].Evaluation for aerial objects is an important part in the aerial defensive operation, which can be described as the assessment of multiobject and multiattribute under uncertain environment. Due to the limitation of detection means or secrecy, the effective information we can obtain from the threat objects is little. Generally, the interval number can be used to represent the uncertain or imprecise information. In this paper, a new model is proposed to rank the threat objects based on interval numbers, which takes the subjective and objective factors into consideration. Two examples are used to illustrate the effectiveness of the proposed threat evaluation model.This paper is organized as follows. Section2 mainly introduces several concepts of interval numbers, the classical genetic algorithm, interval AHP, and the TOPSIS. Section 3 introduces the model of threat assessment in detail. Section 4 introduces a simple numerical example and a real application to illustrate the effectiveness of the proposed assessment model. A conclusion is made in Section 5.


## 2. Preliminaries

As mentioned above, there are many math tools to handle uncertain information, such as fuzzy sets theory [37–40] and evidence theory [41]. In addition, interval number is also a simple and efficient method. In this section, the basic concepts of interval number are briefly introduced.


### 2.1. Interval Number

The interval approach is originally developed by Moore [42, 43] in order to keep track of the lower and upper bounds to the exact result when carrying out numerical calculation on digital computers with a finite number of significant digits. Recently, it has been suggested to use interval numbers to represent the uncertainty or probability resulting from instinct of the incomplete knowledge or cognition [44–46]. In this paper, interval numbers are used to represent the uncertain value of threat attributes.Definition 1.
Interval number is defined as an ordered paira~=a-,a+=x∣a-≤x≤a+,a-,a+∈R; particularly, if a-=a+, then a~ is obviously equal to a real number, and the interval numbers we discussed in this paper are all positive interval numbers which can be described as a~=a-,a+=x∣a-≤x≤a+,a-,a+∈R∗, where R∗ is positive real number set.Definition 2.
Leta=[a-,a+], b=[b-,b+] be any two interval numbers; then some of their arithmetic operations are defined as follows:(1)
a=b if and only if a-=b- and a+=b+;(2)
a+b=[a-+b-,a++b+].
The problem of a multiobjective threat assessment can be described with the mathematical model. The object set can be represented withR={R1,…,Rm} and the attribute set is F={F1,…,Fn}. Decision matrix R=(rij)m×n is composed of attribute values (interval number rij=[rij-,rij+], i=1,…,m; j=1,…,n). The threat goals Ri are measured by the attribute Fj. And the attribute Fj is supplied by specific researches according to the different situation.Definition 3.
The attribute of each object is composed of two types, namely, “cost type” and “benefit type.” LetJ1,J2(J1∪J2=n) represent their corresponding subscript set, and the “cost type” is a kind of attribute which becomes better with its value increasing while “benefit type” is a kind of attribute which becomes better with its value decreasing. To eliminate the influence of decision results in different physical dimension, R is normalized to (X)m×n with the procedure defined as follows:(1)xij-=rij-∑i=1nrij+2,xij+=rij+∑i=1nrij-2,i∈N,j∈J1,xij-=1/rij+∑i=1n1/rij-2,xij+=1/rij-∑i=1n1/rij+2,i∈N,j∈J2.Definition 4.
LetF(R) be the set of interval numbers in R, and let the distance between two interval numbers A(a1,a2) and B(b1,b2) be defined by Tran and Duckstein [47] as(2)
D
2
A
,
B
=
∫
-
1
/
2
1
/
2
a
1
+
a
2
2
+
x
a
2
-
a
1
-
b
1
+
b
2
2
+
x
b
2
-
b
1
2
d
x
,
(3)
D
2
A
,
B
=
a
1
+
a
2
2
-
b
1
+
b
2
2
2
+
1
12
a
2
-
a
1
+
b
2
-
b
1
2
.
It can be proved thatD(A,B)=D2(A,B) is a distance on F(R). First, D(A,B)≥0. Symmetry is transparent. If D(A,B)=0, then A=B. The triangle inequality follows from the fact that the function to be integrated in (2) is the square of Euclidean distance.
Although only the lower and upper bound values of the two interval numbers appear in (3), which is derived from (2) for operational purpose, the integral in (2) shows that this distance takes into account every point in both intervals when computing the distance between those two interval numbers. It is different from most existing distance measures for interval numbers which often use only the lower and upper bound values [48–50]. Paper [51] proposes a distance measure for intervals which also considers every point of both intervals. Its general form, however, is too complicated and the authors later restricted the measure to a particular case with a finite number of considered values for operational purpose.


### 2.2. Genetic Algorithms

The simple genetic algorithm (Algorithm1) over populations defined as multisets P(t)=(a0(t),a1(t),…,ar-1(t)) consists of r individual binary l-tuples ak(t)=(ak,0(t),ak,1(t),…,ak,l-1(t))∈Ω with fitness values f(ak(t)). For the creation of offspring individual in each generation t random genetic operators like crossover χΩ and mutation μΩ are applied to parental individuals which are selected according to their fitness values as follows. The population P(0) is initialised appropriately, for example, by randomly choosing individuals in Ω. GA is also used to cope with the issue of decision making by lots of researchers like Chan et al. [52].Algorithm 1:%  procedure: simplegenetic algorithm.
t
≔
0;
w
h
i
l
e
e
n
d
o
f
a
d
a
p
t
a
t
i
o
n
≠
t
u
r
e
d
o
fork=0tor-1do
selectparentall-tuplesb(t)andc(t)
applycrossoverχΩandmutationμΩ
ak(t+1)≔μΩχΩbt,ct;
evaluatefitnessf(ak(t+1));
end
t:=t+1;
e
n
d(
1) Selection. For fitness-proportional selection each individual ak(t) in the population P(t) is selected with a probability pk(t) which is directly proportional to its fitness f(ak(t))≥0. The individual selection probability is then given by (4)pkt=fakt∑j=0r-1fajt.(
2) Crossover. The crossover operator χΩ:Ω×Ω→Ω takes two selected individual l-tuples a=(a0,a1,…,al-1) and b=(b0,b1,…,bl-1) and randomly generates an offspring l-tuple c=(c0,c1,…,cl-1) according to c=χΩ(a,b).Forl-pointcrossover a position 1≤λ≤l-1 is chosen with uniform probability and the two l-tuples (a0,…,aλ-1,bλ,…,bl-1) and (b0,…,bλ-1,aλ,…,al-1) are generated, one of which is randomly chosen as offspring c. The 1-point crossover operator is applied with crossover probability χ. In case of uniform crossover each bit of the offspring c is chosen with probability χ from the parental l-tuple a and with probability 1-χ from the parental l-tuple b or vice versa.(
3) Mutation. In the simple genetic algorithm with binary l-tuples the bitwise mutation operator χΩ:Ω→Ω is defined by randomly flipping each bit of the individual l-tuple a=(a0,a1,…,al-1) with small mutation probability μ. A typical value is μ↔1/l.


### 2.3. Interval AHP

Assume that a decision maker provides interval judgements instead of precise judgements for a pairwise comparison matrix. For example, it could be judged thatith criterion is between aijL and aijU times as important as jth criterion with aijL and aijU being nonnegative real numbers and aijL≤aijU. Then, an interval comparison matrix can be expressed as (5)A~=a11L,a11Ua12L,a12U⋯a1nL,a1nUa21L,a21Ua22L,a22U⋯a2nL,a2nU⋮⋮⋮⋮an1L,an1Uan2L,an2U⋯annL,annU,where aijL=1/ajiU and aijU=1/ajiL for all i,j=1⋯n. The above interval comparison matrix can be split into two crisp nonnegative matrices: (6)AL=a11La12L⋯a1nLa21La22L⋯a2nL⋮⋮⋮⋮an1Lan2L⋯annL,AU=a11Ua12U⋯a1nUa21Ua22U⋯a2nU⋮⋮⋮⋮an1Uan2U⋯annU,where A~=[AL,AU].Letλmax=[λmax⁡L,λmax⁡U] be the principal eigenvalue of A~, which is an interval number. The principal right eigenvector corresponding to λmax is denoted by W=([ω1L,ω1U],…,[ωnL,ωnU])T=[WL,WU], where WL=(ω1L,…,ωnL)T and WU=(ω1U,…,ωnU)T. Therefore, the eigenvalue problem can be written as (7)AW=λmaxW;namely, (8)AL,AUWL,WU=λmax⁡L,λmax⁡UWL,WU.According to interval arithmetic, (8) can be expressed as (9)ALWL,AUWU=λmax⁡LWL,λmax⁡UWUwhich is equivalent to the following two equations: (10)ALWL=λmax⁡LWL,AUWU=λmax⁡UWU.The vector of weight is ω~=[αWL,βWU], where (11)α=∑j=1n1∑i=1naijU1/2,β=∑j=1n1∑i=1naijL1/2.


### 2.4. TOPSIS

Assume that a MCDM problem hasn alternatives, A1,…,An, and m decision criteria/attributes, C1,…,Cm. Each alternative is evaluated with respect to the m criteria/attributes. All the values/ratings assigned to the alternatives with respect to each criterion form a decision matrix denoted by X=(xij)n×m. Let W=(w1,…,wm) be the relative weight vector about the criteria, satisfying ∑j=1mwj=1. Then the TOPSIS method can be summarized as follows.(1) Normalize the decision matrixX=(xij)n×m using the following equation: (12)rij=xij∑k=1nxkj2,i=1,…,n;j=1,…,m,where rij is the normalized criteria/attribute value/rating.(2) Calculate the weighted normalized decision matrixV=(vij)n×m: (13)vij=wjrij,i=1,…,n;j=1,…,m,where wj is the relative weight of the jth criterion or attribute, and ∑j=1mwj=1.(3) Determine the ideal and negative-ideal solutions:(14)A∗=v1∗,…,vm∗=maxj⁡vij∣j∈Ωb,minj⁡vij∣j∈Ωc,A-=v1-,…,vm-=minj⁡vij∣j∈Ωb,maxj⁡vij∣j∈Ωc,where Ωb and Ωc are the sets of benefit criteria/attributes and cost criteria/attributes, respectively.(4) Calculate the Euclidean distances of each alternative from the ideal solution and the negative-ideal solution, respectively:(15)Di∗=∑j=1mvij-vj∗2,i=1,…,n,Di-=∑j=1mvij-vj-2,i=1,…,n.(5) Calculate the relative closeness of each alternative to the idea solution. The relative closeness of the alternativeAi with respect to A∗ is defined as (16)RCi=Di-Di-+Di∗,i=1,…,n.(6) Rank the alternatives according to the relative closeness to the ideal solution. The bigger theRCi, the better the alternative Ai. The best alternative is the one with the greatest relative closeness to the ideal solution.


## 2.1. Interval Number

The interval approach is originally developed by Moore [42, 43] in order to keep track of the lower and upper bounds to the exact result when carrying out numerical calculation on digital computers with a finite number of significant digits. Recently, it has been suggested to use interval numbers to represent the uncertainty or probability resulting from instinct of the incomplete knowledge or cognition [44–46]. In this paper, interval numbers are used to represent the uncertain value of threat attributes.Definition 1.
Interval number is defined as an ordered paira~=a-,a+=x∣a-≤x≤a+,a-,a+∈R; particularly, if a-=a+, then a~ is obviously equal to a real number, and the interval numbers we discussed in this paper are all positive interval numbers which can be described as a~=a-,a+=x∣a-≤x≤a+,a-,a+∈R∗, where R∗ is positive real number set.Definition 2.
Leta=[a-,a+], b=[b-,b+] be any two interval numbers; then some of their arithmetic operations are defined as follows:(1)
a=b if and only if a-=b- and a+=b+;(2)
a+b=[a-+b-,a++b+].
The problem of a multiobjective threat assessment can be described with the mathematical model. The object set can be represented withR={R1,…,Rm} and the attribute set is F={F1,…,Fn}. Decision matrix R=(rij)m×n is composed of attribute values (interval number rij=[rij-,rij+], i=1,…,m; j=1,…,n). The threat goals Ri are measured by the attribute Fj. And the attribute Fj is supplied by specific researches according to the different situation.Definition 3.
The attribute of each object is composed of two types, namely, “cost type” and “benefit type.” LetJ1,J2(J1∪J2=n) represent their corresponding subscript set, and the “cost type” is a kind of attribute which becomes better with its value increasing while “benefit type” is a kind of attribute which becomes better with its value decreasing. To eliminate the influence of decision results in different physical dimension, R is normalized to (X)m×n with the procedure defined as follows:(1)xij-=rij-∑i=1nrij+2,xij+=rij+∑i=1nrij-2,i∈N,j∈J1,xij-=1/rij+∑i=1n1/rij-2,xij+=1/rij-∑i=1n1/rij+2,i∈N,j∈J2.Definition 4.
LetF(R) be the set of interval numbers in R, and let the distance between two interval numbers A(a1,a2) and B(b1,b2) be defined by Tran and Duckstein [47] as(2)
D
2
A
,
B
=
∫
-
1
/
2
1
/
2
a
1
+
a
2
2
+
x
a
2
-
a
1
-
b
1
+
b
2
2
+
x
b
2
-
b
1
2
d
x
,
(3)
D
2
A
,
B
=
a
1
+
a
2
2
-
b
1
+
b
2
2
2
+
1
12
a
2
-
a
1
+
b
2
-
b
1
2
.
It can be proved thatD(A,B)=D2(A,B) is a distance on F(R). First, D(A,B)≥0. Symmetry is transparent. If D(A,B)=0, then A=B. The triangle inequality follows from the fact that the function to be integrated in (2) is the square of Euclidean distance.
Although only the lower and upper bound values of the two interval numbers appear in (3), which is derived from (2) for operational purpose, the integral in (2) shows that this distance takes into account every point in both intervals when computing the distance between those two interval numbers. It is different from most existing distance measures for interval numbers which often use only the lower and upper bound values [48–50]. Paper [51] proposes a distance measure for intervals which also considers every point of both intervals. Its general form, however, is too complicated and the authors later restricted the measure to a particular case with a finite number of considered values for operational purpose.


## 2.2. Genetic Algorithms

The simple genetic algorithm (Algorithm1) over populations defined as multisets P(t)=(a0(t),a1(t),…,ar-1(t)) consists of r individual binary l-tuples ak(t)=(ak,0(t),ak,1(t),…,ak,l-1(t))∈Ω with fitness values f(ak(t)). For the creation of offspring individual in each generation t random genetic operators like crossover χΩ and mutation μΩ are applied to parental individuals which are selected according to their fitness values as follows. The population P(0) is initialised appropriately, for example, by randomly choosing individuals in Ω. GA is also used to cope with the issue of decision making by lots of researchers like Chan et al. [52].Algorithm 1:%  procedure: simplegenetic algorithm.
t
≔
0;
w
h
i
l
e
e
n
d
o
f
a
d
a
p
t
a
t
i
o
n
≠
t
u
r
e
d
o
fork=0tor-1do
selectparentall-tuplesb(t)andc(t)
applycrossoverχΩandmutationμΩ
ak(t+1)≔μΩχΩbt,ct;
evaluatefitnessf(ak(t+1));
end
t:=t+1;
e
n
d(
1) Selection. For fitness-proportional selection each individual ak(t) in the population P(t) is selected with a probability pk(t) which is directly proportional to its fitness f(ak(t))≥0. The individual selection probability is then given by (4)pkt=fakt∑j=0r-1fajt.(
2) Crossover. The crossover operator χΩ:Ω×Ω→Ω takes two selected individual l-tuples a=(a0,a1,…,al-1) and b=(b0,b1,…,bl-1) and randomly generates an offspring l-tuple c=(c0,c1,…,cl-1) according to c=χΩ(a,b).Forl-pointcrossover a position 1≤λ≤l-1 is chosen with uniform probability and the two l-tuples (a0,…,aλ-1,bλ,…,bl-1) and (b0,…,bλ-1,aλ,…,al-1) are generated, one of which is randomly chosen as offspring c. The 1-point crossover operator is applied with crossover probability χ. In case of uniform crossover each bit of the offspring c is chosen with probability χ from the parental l-tuple a and with probability 1-χ from the parental l-tuple b or vice versa.(
3) Mutation. In the simple genetic algorithm with binary l-tuples the bitwise mutation operator χΩ:Ω→Ω is defined by randomly flipping each bit of the individual l-tuple a=(a0,a1,…,al-1) with small mutation probability μ. A typical value is μ↔1/l.


## 2.3. Interval AHP

Assume that a decision maker provides interval judgements instead of precise judgements for a pairwise comparison matrix. For example, it could be judged thatith criterion is between aijL and aijU times as important as jth criterion with aijL and aijU being nonnegative real numbers and aijL≤aijU. Then, an interval comparison matrix can be expressed as (5)A~=a11L,a11Ua12L,a12U⋯a1nL,a1nUa21L,a21Ua22L,a22U⋯a2nL,a2nU⋮⋮⋮⋮an1L,an1Uan2L,an2U⋯annL,annU,where aijL=1/ajiU and aijU=1/ajiL for all i,j=1⋯n. The above interval comparison matrix can be split into two crisp nonnegative matrices: (6)AL=a11La12L⋯a1nLa21La22L⋯a2nL⋮⋮⋮⋮an1Lan2L⋯annL,AU=a11Ua12U⋯a1nUa21Ua22U⋯a2nU⋮⋮⋮⋮an1Uan2U⋯annU,where A~=[AL,AU].Letλmax=[λmax⁡L,λmax⁡U] be the principal eigenvalue of A~, which is an interval number. The principal right eigenvector corresponding to λmax is denoted by W=([ω1L,ω1U],…,[ωnL,ωnU])T=[WL,WU], where WL=(ω1L,…,ωnL)T and WU=(ω1U,…,ωnU)T. Therefore, the eigenvalue problem can be written as (7)AW=λmaxW;namely, (8)AL,AUWL,WU=λmax⁡L,λmax⁡UWL,WU.According to interval arithmetic, (8) can be expressed as (9)ALWL,AUWU=λmax⁡LWL,λmax⁡UWUwhich is equivalent to the following two equations: (10)ALWL=λmax⁡LWL,AUWU=λmax⁡UWU.The vector of weight is ω~=[αWL,βWU], where (11)α=∑j=1n1∑i=1naijU1/2,β=∑j=1n1∑i=1naijL1/2.


## 2.4. TOPSIS

Assume that a MCDM problem hasn alternatives, A1,…,An, and m decision criteria/attributes, C1,…,Cm. Each alternative is evaluated with respect to the m criteria/attributes. All the values/ratings assigned to the alternatives with respect to each criterion form a decision matrix denoted by X=(xij)n×m. Let W=(w1,…,wm) be the relative weight vector about the criteria, satisfying ∑j=1mwj=1. Then the TOPSIS method can be summarized as follows.(1) Normalize the decision matrixX=(xij)n×m using the following equation: (12)rij=xij∑k=1nxkj2,i=1,…,n;j=1,…,m,where rij is the normalized criteria/attribute value/rating.(2) Calculate the weighted normalized decision matrixV=(vij)n×m: (13)vij=wjrij,i=1,…,n;j=1,…,m,where wj is the relative weight of the jth criterion or attribute, and ∑j=1mwj=1.(3) Determine the ideal and negative-ideal solutions:(14)A∗=v1∗,…,vm∗=maxj⁡vij∣j∈Ωb,minj⁡vij∣j∈Ωc,A-=v1-,…,vm-=minj⁡vij∣j∈Ωb,maxj⁡vij∣j∈Ωc,where Ωb and Ωc are the sets of benefit criteria/attributes and cost criteria/attributes, respectively.(4) Calculate the Euclidean distances of each alternative from the ideal solution and the negative-ideal solution, respectively:(15)Di∗=∑j=1mvij-vj∗2,i=1,…,n,Di-=∑j=1mvij-vj-2,i=1,…,n.(5) Calculate the relative closeness of each alternative to the idea solution. The relative closeness of the alternativeAi with respect to A∗ is defined as (16)RCi=Di-Di-+Di∗,i=1,…,n.(6) Rank the alternatives according to the relative closeness to the ideal solution. The bigger theRCi, the better the alternative Ai. The best alternative is the one with the greatest relative closeness to the ideal solution.


## 3. Mathematic Model of Threat Assessment

The mathematic model of threat assessment is detailed in this section. As shown in Figure1, the input of our model includes two parts, namely, subjective factors and objective factors, and the output of this model is the ranking of all the threat objects.Figure 1
The threat evaluation model.


### 3.1. Integration of Objective Factors

Due to the imprecision of the sensors in the complex situation, sometimes, we should make use of interval numbers to represent the attributive values of the threat targets. In order to measure the different threat degree, the problem arises regarding how best we can aggregate this interval number into a general interval number. The main idea of our proposed method can be shown as follows: this paper integrates the fuzzy numbers through the distance among interval numbers to find a special interval number([x1,x2],a<x1<x2<b) whose distance is the optimal value from all other normalized interval numbers with the searching method of genetic algorithms. The binary function f(x1,x2) is constructed with the summation of all the distance between [x1,x2] and each normalized interval number. Hence, the problem is mapped into finding the optimal solution of f(x1,x2) under the constraint a<x1<x2<b with the method of genetic algorithms. This process can be mathematically described by (17)min⁡SD=∑i=1nfx1,x2=∑i=1nD2O,Ois.t.O=x1,x2a≤x1≤ba≤x2≤bx1<x2,where Oi is the interval value of attribute of the ith object. D2(O,Oi) is the interval distance between O and Oi. a and b are the boundary range of x1 and x2.Now the procedure of aggregating interval numbers (objective factors) is made by GA in detail as follows.(
1) Determination of the Encoding Method. The first step is to determine the encoding strategy, in other words, how to represent the data between a and b with the computer language. In this paper, the binary encoding strategy is adopted to represent the chromosome. The length of chromosome depends on the accuracy of encoding. Assume that the domain of variable x1 is [a,b] and the accuracy of encoding prec is the digit after decimal point. The length of a binary string variable L can be calculated as follows: (18)L=max_intlog2b-a/prec+1,where prec is to represent the precision of the result and max_int(x) means the maximum integer which is not more than x.(
2) Determination of the Decoding Method. The decoding of chromosome is to translate the chromosome from binary data to decimal data in the interval number accordingly. Assume that the binary encoding of a chromosome is represented with (bL-1,…,b0). Firstly, the binary string (bL,bL-1,…,b0) should be translated to decimal number x′, which can be denoted as follows: (19)bL,bL-1,…,b02=∑i=0L-1bi×2i10=x′.Then, the final decoding data in the interval number [a,b] can be calculated as (20)x=a+x′·b-a2L-1,where L is the encoding length of the chromosome.(
3) Construction of the Initial Population. According to (18), the encoding length of chromosome for each variable can be obtained. Hence, the total length of chromosome for variable weight can be accumulated to be composed of the length of a single long chromosome. For the point position of each chromosome, the method of generating population can be denoted as follows: (21)bi=1,ξi>0.50,ξi≤0.5,whereξi∈U0,1.(
4) Determination of the Adaptive Function and Adaptive Value. Generally, the adaptive function is designed according to the objective function f∗(x1,x2), and the adaptive function is denoted as F(x1,x2). In order to lay the foundation for calculating the selected probability of each individual behind, the optimalizing direction of adaptive function f∗(x1,x2) should adapt to the incremental direction of adaptive value. Due to the value of objective function f∗(x1,x2)>0, the adaptive function F(x1,x2) is defined as (22)Fx1,x2=e-f∗x1,x2.In this paper, the objective function f∗(x1,x2) is determined by min⁡SD according to (17).(
5) Determination of the Selection Criteria. In this paper, the proportional selection strategy of adaptive value is introduced, and the proportion of every individual is defined as selected probability Pi. Assume that the population whose scale is n is given as pop={a1,a2,a3,…,an} and the adaptive of ai is given as Fi; then the selected probability Pi is denoted as (23)Pi=Fi∑i=1nFi,i=1,2,3,…,n.Then the accumulative probability Qi of every chromosome is denoted as follows: (24)Qi=∑j=1iPj,j=1,2,….After random data r, r∈[0,1] is generated and the selection of chromosome Ui for a new population can be made ifQi-1≤r≤Qi.(
6) Determination of the Genetic Operators. Assume that we have a population pop(1) including four individuals described as follows: (25)
p
o
p
1
=
1101011101001100011110
,
%
%
U
1
1000011001010001000010
,
%
%
U
2
0001100111010110000000
,
%
%
U
3
0110101001101110010101
%
%
U
4
.After conducting several Roulette Wheel tests, assume that chromosomeU2 occupies the most area of the whole circle and chromosome U3 occupies the least area of the whole circle. According to the selecting criteria, chromosome U2 is selected to make a reproduction, while chromosome U3 fell into disuse:(26)
n
e
w
p
o
p
1
=
1101011101001100011110
,
%
%
U
1
1000011001010001000010
,
%
%
U
2
1000011001010001000010
,
%
%
U
3
0110101001101110010101
%
%
U
4
.The crossover operator in this paper adopts the strategy of a single cutting crossover. This method considers the two flanks of the cutting into two substrings; then the right substrings should be exchanged with each other to get two new individuals. If the crossover probabilityPc=25%, it means that 25% of the chromosomes on average exchange each other:(27)1101011101001100011110crossover:1000011001010001000010,new:1101011101010001000010,new:1000011001001100011110.Mutation operator is to change some gene of chromosome with a tiny possibility. If the mutation probabilityPm=0.01, it means that 1% of all the genes are expected to mutate.(
7) Determine the Process Parameter and Terminal Condition. Through the prior test, the crossover probability Pcro is between 0.4 and 0.99, the mutation probability Pmut is between 0.0001 and 0.01, the scale of population is between 20 and 100, and the terminated condition may be determined by the precise N iterated generation or determined by the minimum bias δ, which satisfies (28)fitnessmax-fitness∗≤δ,where fitnessmax is the maximum fitness value and fitness∗ is the objective fitness value. If the judgement condition is not satisfied with the terminal condition, then go to step (4).Example 1.
Three interval numbers are as follows:(29)O1=5,7,O2=5.5,8,O3=6,7.5.
Assume that the importance of each interval number is the same. First, we suppose that the integrated interval number of the three fuzzy numbers is represented withO=[x1,x2], 4<x1<x2<9. So the distance between O and each number Oi(i=1,2,3) can be shown as follows according to the distance of the interval numbers:(30)min⁡fx1,x2=∑i=13D2O,Oi=D2O,O1+D2O,O2+D2O,O3=x12+x1x2+x22+7x1-412x1-372x2+7696,where4<x1<x2<9.
Hence, the integration of three interval numbers is mapped into solving the minimum of the formulaf(x1,x2) under the constraint of 4<x1<x2<9.
Assume that the accuracy of encodingprec is 0.0001, the crossover probability pcro is 0.2, and the mutation probability pmut is 0.05. First, the length of chromosome can be calculated as log2[(9-4)/0.0001+1]=16. Then the encoding length of x1 and x2 is 32. The adaptive function is F(x1,x2)=e-f(x1,x2)=e-(x12+x1x2+x22+7x1-(41/2)x1-(37/2)x2+769/6). After 300 times of repeat, the convergent result is (5.4949, 7.5023) and the minimal value of the objective function is 4.4315.


### 3.2. Integration of Subjective Factors

For the subjective factors, the interval AHP (interval eigenvector) is applied to deal with the object’s threat weight according to experience of the commanders/experts. A numerical example is used to describe the process as follows.Example 2.
Suppose that we get a pairwise comparison matrix through interval judgements which is denoted as(31)
A
~
=
1,1
3,4
2,3
3,5
3,5
1
4
,
1
3
1,1
1
2
,
1
1,2
3,5
1
3
,
1
2
1,2
1,1
2,3
2,3
1
5
,
1
3
1
2
,
1
1
3
,
1
2
1,1
2,3
1
5
,
1
3
1
5
,
1
3
1
3
,
1
2
1
3
,
1
2
1,1
.
Then the interval comparison matrixA~ can be split into two crisp nonnegative matrices: (32)
A
L
=
1
3
2
3
3
1
4
1
1
2
1
3
1
3
1
1
2
2
1
5
1
2
1
3
1
2
1
5
1
5
1
3
1
3
1
,
A
U
=
1
4
3
5
5
1
3
1
1
2
5
1
2
2
1
3
3
1
3
1
1
2
1
3
1
3
1
3
1
2
1
2
1
.
Then the principal eigenvalue ofA~ can be calculated: λmax=[λmax⁡L,λmax⁡U], where λmax⁡L=4.2892 and λmax⁡U=6.3219. The principal right eigenvector corresponding to λmax is W=[WL,WU], where (33)WL=0.4441,0.1638,0.2072,0.1153,0.0696,WU=0.4265,0.1753,0.2113,0.1182,0.0687.So, the vector of weight ω~=[αWL,βWU] is (34)
ω
~
=
0.4052,0.4567
,
0.1495,0.1878
,
0.1891,0
.
2263
,
0.1052,0.1266
,
0.0635,0.0735
,where α=0.9124 and β=1.0709.


### 3.3. Integration of Objective and Subjective Factors

In this part, the method of discounting will be used to integrate the objective and subjective factors. Through the two procedures above, for each threat object, the integrative interval number describing the objective factor can be integrated by the convergent process of genetic algorithm. Hence, assume that there aren threat objects; n optimal interval number will be used to represent the different threat degree; they can be formally denoted as(35)Weight  (objective)=o1-,o1+,o2-,o2+,…,on-,on+.Sometimes, the commanders need to evaluate the threat degree of each target according to their previous experience in order to control the situation. Hence, through constructing the interval decision matrix and calculating the interval eigenvector, the subjective interval numbers representing the evaluation of experts can be described as(36)Weight  (subjective)=s1-,s1+,s2-,s2+,…,sn-,sn+.Then the fusion weight of all the threat targetsWeight can be calculated according to the method of discounting the objective and subjective factors, which is denoted as (37)
Weight
=
α
′
∗
Weight  (objective)
+
β
′
∗
Weight  (subjective)
=
α
′
o
1
-
+
β
′
s
1
-
,
α
′
o
1
+
+
β
′
s
1
+
,
…
,
α
′
o
n
-
+
β
′
s
n
-
,
α
′
o
n
+
+
β
′
s
n
+
,where α′+β′=1. In the process of decision, the discounting factors α′ and β′ may be modified to adapt the importance of objective factors comparing with subjective factors. If the influence from experts’ subjective evaluation is dominant over the influence from the sensors’ detection in some complex situation, then the discounting factor should satisfy α′<β′, α′+β′=1.


### 3.4. Ranking the Threat Objects

In this part, the method of TOPSIS will be made use of to deal with the ranking of the threat objects according to their different threat degree. The classical TOPSIS method is a technique for order preference by similarity to ideal solution. The ideal solution (also called positive ideal solution) is a solution that maximizes the benefit criteria/attributes and minimizes the cost criteria/attributes, whereas the negative ideal solution (also called anti-ideal solution) maximizes the cost criteria/attributes and minimizes the benefit criteria/attributes. The so-called benefit criteria/attributes are those for maximization, while the cost criteria/attributes are those for minimization. The best alternative is the one which is closest to the ideal solution and farthest from the negative ideal solution.Because the normalized interval numbers all distribute in[0,1], the two extreme bounds can be considered as the anti-ideal solution and the ideal solution. That is to say, the interval number [0,0] can be the anti-ideal solution and the interval number [1,1] can be the ideal solution.Then the distance between the ideal solution[1,1] and each target’s weight from the fusion process of integration with the method of discounting can be calculated. It is not difficult to know that the target nearest to the ideal solution is the most dangerous. Hence the ranking of threat objects can be made easily according to their distance to the ideal solution or the anti-ideal solution.Example 3.
Assume that an interval numberF is [0.4748,0.5152] (data from integrating objective and subjective factors); then the distance DF+ (ideal distance) can be calculated with the interval distance formula DF+=0.2552; similarly, the distance DF- (anti-ideal distance) also can be calculated with interval distance DF-=0.2452; at last, the relative closeness RC can be calculated as (38)RC=DF-DF-+DF+=0.24520.2452+0.2552=0.49.


## 3.1. Integration of Objective Factors

Due to the imprecision of the sensors in the complex situation, sometimes, we should make use of interval numbers to represent the attributive values of the threat targets. In order to measure the different threat degree, the problem arises regarding how best we can aggregate this interval number into a general interval number. The main idea of our proposed method can be shown as follows: this paper integrates the fuzzy numbers through the distance among interval numbers to find a special interval number([x1,x2],a<x1<x2<b) whose distance is the optimal value from all other normalized interval numbers with the searching method of genetic algorithms. The binary function f(x1,x2) is constructed with the summation of all the distance between [x1,x2] and each normalized interval number. Hence, the problem is mapped into finding the optimal solution of f(x1,x2) under the constraint a<x1<x2<b with the method of genetic algorithms. This process can be mathematically described by (17)min⁡SD=∑i=1nfx1,x2=∑i=1nD2O,Ois.t.O=x1,x2a≤x1≤ba≤x2≤bx1<x2,where Oi is the interval value of attribute of the ith object. D2(O,Oi) is the interval distance between O and Oi. a and b are the boundary range of x1 and x2.Now the procedure of aggregating interval numbers (objective factors) is made by GA in detail as follows.(
1) Determination of the Encoding Method. The first step is to determine the encoding strategy, in other words, how to represent the data between a and b with the computer language. In this paper, the binary encoding strategy is adopted to represent the chromosome. The length of chromosome depends on the accuracy of encoding. Assume that the domain of variable x1 is [a,b] and the accuracy of encoding prec is the digit after decimal point. The length of a binary string variable L can be calculated as follows: (18)L=max_intlog2b-a/prec+1,where prec is to represent the precision of the result and max_int(x) means the maximum integer which is not more than x.(
2) Determination of the Decoding Method. The decoding of chromosome is to translate the chromosome from binary data to decimal data in the interval number accordingly. Assume that the binary encoding of a chromosome is represented with (bL-1,…,b0). Firstly, the binary string (bL,bL-1,…,b0) should be translated to decimal number x′, which can be denoted as follows: (19)bL,bL-1,…,b02=∑i=0L-1bi×2i10=x′.Then, the final decoding data in the interval number [a,b] can be calculated as (20)x=a+x′·b-a2L-1,where L is the encoding length of the chromosome.(
3) Construction of the Initial Population. According to (18), the encoding length of chromosome for each variable can be obtained. Hence, the total length of chromosome for variable weight can be accumulated to be composed of the length of a single long chromosome. For the point position of each chromosome, the method of generating population can be denoted as follows: (21)bi=1,ξi>0.50,ξi≤0.5,whereξi∈U0,1.(
4) Determination of the Adaptive Function and Adaptive Value. Generally, the adaptive function is designed according to the objective function f∗(x1,x2), and the adaptive function is denoted as F(x1,x2). In order to lay the foundation for calculating the selected probability of each individual behind, the optimalizing direction of adaptive function f∗(x1,x2) should adapt to the incremental direction of adaptive value. Due to the value of objective function f∗(x1,x2)>0, the adaptive function F(x1,x2) is defined as (22)Fx1,x2=e-f∗x1,x2.In this paper, the objective function f∗(x1,x2) is determined by min⁡SD according to (17).(
5) Determination of the Selection Criteria. In this paper, the proportional selection strategy of adaptive value is introduced, and the proportion of every individual is defined as selected probability Pi. Assume that the population whose scale is n is given as pop={a1,a2,a3,…,an} and the adaptive of ai is given as Fi; then the selected probability Pi is denoted as (23)Pi=Fi∑i=1nFi,i=1,2,3,…,n.Then the accumulative probability Qi of every chromosome is denoted as follows: (24)Qi=∑j=1iPj,j=1,2,….After random data r, r∈[0,1] is generated and the selection of chromosome Ui for a new population can be made ifQi-1≤r≤Qi.(
6) Determination of the Genetic Operators. Assume that we have a population pop(1) including four individuals described as follows: (25)
p
o
p
1
=
1101011101001100011110
,
%
%
U
1
1000011001010001000010
,
%
%
U
2
0001100111010110000000
,
%
%
U
3
0110101001101110010101
%
%
U
4
.After conducting several Roulette Wheel tests, assume that chromosomeU2 occupies the most area of the whole circle and chromosome U3 occupies the least area of the whole circle. According to the selecting criteria, chromosome U2 is selected to make a reproduction, while chromosome U3 fell into disuse:(26)
n
e
w
p
o
p
1
=
1101011101001100011110
,
%
%
U
1
1000011001010001000010
,
%
%
U
2
1000011001010001000010
,
%
%
U
3
0110101001101110010101
%
%
U
4
.The crossover operator in this paper adopts the strategy of a single cutting crossover. This method considers the two flanks of the cutting into two substrings; then the right substrings should be exchanged with each other to get two new individuals. If the crossover probabilityPc=25%, it means that 25% of the chromosomes on average exchange each other:(27)1101011101001100011110crossover:1000011001010001000010,new:1101011101010001000010,new:1000011001001100011110.Mutation operator is to change some gene of chromosome with a tiny possibility. If the mutation probabilityPm=0.01, it means that 1% of all the genes are expected to mutate.(
7) Determine the Process Parameter and Terminal Condition. Through the prior test, the crossover probability Pcro is between 0.4 and 0.99, the mutation probability Pmut is between 0.0001 and 0.01, the scale of population is between 20 and 100, and the terminated condition may be determined by the precise N iterated generation or determined by the minimum bias δ, which satisfies (28)fitnessmax-fitness∗≤δ,where fitnessmax is the maximum fitness value and fitness∗ is the objective fitness value. If the judgement condition is not satisfied with the terminal condition, then go to step (4).Example 1.
Three interval numbers are as follows:(29)O1=5,7,O2=5.5,8,O3=6,7.5.
Assume that the importance of each interval number is the same. First, we suppose that the integrated interval number of the three fuzzy numbers is represented withO=[x1,x2], 4<x1<x2<9. So the distance between O and each number Oi(i=1,2,3) can be shown as follows according to the distance of the interval numbers:(30)min⁡fx1,x2=∑i=13D2O,Oi=D2O,O1+D2O,O2+D2O,O3=x12+x1x2+x22+7x1-412x1-372x2+7696,where4<x1<x2<9.
Hence, the integration of three interval numbers is mapped into solving the minimum of the formulaf(x1,x2) under the constraint of 4<x1<x2<9.
Assume that the accuracy of encodingprec is 0.0001, the crossover probability pcro is 0.2, and the mutation probability pmut is 0.05. First, the length of chromosome can be calculated as log2[(9-4)/0.0001+1]=16. Then the encoding length of x1 and x2 is 32. The adaptive function is F(x1,x2)=e-f(x1,x2)=e-(x12+x1x2+x22+7x1-(41/2)x1-(37/2)x2+769/6). After 300 times of repeat, the convergent result is (5.4949, 7.5023) and the minimal value of the objective function is 4.4315.


## 3.2. Integration of Subjective Factors

For the subjective factors, the interval AHP (interval eigenvector) is applied to deal with the object’s threat weight according to experience of the commanders/experts. A numerical example is used to describe the process as follows.Example 2.
Suppose that we get a pairwise comparison matrix through interval judgements which is denoted as(31)
A
~
=
1,1
3,4
2,3
3,5
3,5
1
4
,
1
3
1,1
1
2
,
1
1,2
3,5
1
3
,
1
2
1,2
1,1
2,3
2,3
1
5
,
1
3
1
2
,
1
1
3
,
1
2
1,1
2,3
1
5
,
1
3
1
5
,
1
3
1
3
,
1
2
1
3
,
1
2
1,1
.
Then the interval comparison matrixA~ can be split into two crisp nonnegative matrices: (32)
A
L
=
1
3
2
3
3
1
4
1
1
2
1
3
1
3
1
1
2
2
1
5
1
2
1
3
1
2
1
5
1
5
1
3
1
3
1
,
A
U
=
1
4
3
5
5
1
3
1
1
2
5
1
2
2
1
3
3
1
3
1
1
2
1
3
1
3
1
3
1
2
1
2
1
.
Then the principal eigenvalue ofA~ can be calculated: λmax=[λmax⁡L,λmax⁡U], where λmax⁡L=4.2892 and λmax⁡U=6.3219. The principal right eigenvector corresponding to λmax is W=[WL,WU], where (33)WL=0.4441,0.1638,0.2072,0.1153,0.0696,WU=0.4265,0.1753,0.2113,0.1182,0.0687.So, the vector of weight ω~=[αWL,βWU] is (34)
ω
~
=
0.4052,0.4567
,
0.1495,0.1878
,
0.1891,0
.
2263
,
0.1052,0.1266
,
0.0635,0.0735
,where α=0.9124 and β=1.0709.


## 3.3. Integration of Objective and Subjective Factors

In this part, the method of discounting will be used to integrate the objective and subjective factors. Through the two procedures above, for each threat object, the integrative interval number describing the objective factor can be integrated by the convergent process of genetic algorithm. Hence, assume that there aren threat objects; n optimal interval number will be used to represent the different threat degree; they can be formally denoted as(35)Weight  (objective)=o1-,o1+,o2-,o2+,…,on-,on+.Sometimes, the commanders need to evaluate the threat degree of each target according to their previous experience in order to control the situation. Hence, through constructing the interval decision matrix and calculating the interval eigenvector, the subjective interval numbers representing the evaluation of experts can be described as(36)Weight  (subjective)=s1-,s1+,s2-,s2+,…,sn-,sn+.Then the fusion weight of all the threat targetsWeight can be calculated according to the method of discounting the objective and subjective factors, which is denoted as (37)
Weight
=
α
′
∗
Weight  (objective)
+
β
′
∗
Weight  (subjective)
=
α
′
o
1
-
+
β
′
s
1
-
,
α
′
o
1
+
+
β
′
s
1
+
,
…
,
α
′
o
n
-
+
β
′
s
n
-
,
α
′
o
n
+
+
β
′
s
n
+
,where α′+β′=1. In the process of decision, the discounting factors α′ and β′ may be modified to adapt the importance of objective factors comparing with subjective factors. If the influence from experts’ subjective evaluation is dominant over the influence from the sensors’ detection in some complex situation, then the discounting factor should satisfy α′<β′, α′+β′=1.


## 3.4. Ranking the Threat Objects

In this part, the method of TOPSIS will be made use of to deal with the ranking of the threat objects according to their different threat degree. The classical TOPSIS method is a technique for order preference by similarity to ideal solution. The ideal solution (also called positive ideal solution) is a solution that maximizes the benefit criteria/attributes and minimizes the cost criteria/attributes, whereas the negative ideal solution (also called anti-ideal solution) maximizes the cost criteria/attributes and minimizes the benefit criteria/attributes. The so-called benefit criteria/attributes are those for maximization, while the cost criteria/attributes are those for minimization. The best alternative is the one which is closest to the ideal solution and farthest from the negative ideal solution.Because the normalized interval numbers all distribute in[0,1], the two extreme bounds can be considered as the anti-ideal solution and the ideal solution. That is to say, the interval number [0,0] can be the anti-ideal solution and the interval number [1,1] can be the ideal solution.Then the distance between the ideal solution[1,1] and each target’s weight from the fusion process of integration with the method of discounting can be calculated. It is not difficult to know that the target nearest to the ideal solution is the most dangerous. Hence the ranking of threat objects can be made easily according to their distance to the ideal solution or the anti-ideal solution.Example 3.
Assume that an interval numberF is [0.4748,0.5152] (data from integrating objective and subjective factors); then the distance DF+ (ideal distance) can be calculated with the interval distance formula DF+=0.2552; similarly, the distance DF- (anti-ideal distance) also can be calculated with interval distance DF-=0.2452; at last, the relative closeness RC can be calculated as (38)RC=DF-DF-+DF+=0.24520.2452+0.2552=0.49.


## 4. Numerical Examples

### 4.1. The First Numerical Example

In this part, a numerical example [53] is used to illustrate the proposed threat model. Suppose that assessments of the threat objects are all determined with the objective factors (α′=1,β′=0). The interval decision matrix can be denoted as in Table 1; there are three alternatives (A1, A2, A3) and two criteria (C1, C2). The decision maker wants to choose an alternative that has minimum C1 and maximum C2. Now we order the three alternatives with the proposed model above.Table 1
Interval decision matrix.
C
1
C
2
A
1
[0.75, 1.24]
[2784, 3192]
A
2
[1.83, 2.11]
[3671, 3857]
A
3
[4.90, 5.73]
[4409, 4681]First, the interval decision matrix can be normalized through (1). The normalized decision matrix can be denoted as in Table 2.Table 2
Normalized decision matrix.
C
1
C
2
A
1
[0.55, 1.40]
[0.41, 0.50]
A
2
[0.33, 0.57]
[0.54, 0.60]
A
3
[0.12, 0.21]
[0.64, 0.73]Second, through the proposed objective aggregating method with GA, the aggregated results can be converged as in Table3.Table 3
Aggregated decision matrix.
C
A
1
[0.47, 0.96]
A
2
[0.43, 0.59]
A
3
[0.31, 0.52]At last, the priority of the three alternatives can be determined by TOPSIS, and the result can be shown as in Table4. The ranking of three alternatives is A1>A2>A3, which is the same as the result of the paper [53].Table 4
Priority of decision matrix.
C
D
-
D
+
RC
A
1
[0.47, 0.96]
0.53
0.10
0.84
A
2
[0.43, 0.59]
0.26
0.24
0.52
A
3
[0.31, 0.52]
0.18
0.35
0.34This numerical example illustrates the effectiveness of the proposed model without considering the subjective factors. The aggregation of the objective factors is always optimum with GA. In the following part, another numerical example is presented to illustrate the effectiveness of the proposed threat model with considering both objective factors and subjective factors.


### 4.2. The Second Numerical Example

In this part, a real application in aerial object threat will be introduced to describe the operational procedure of threat assessment. The threat objects and their attributes can be shown as in Table5.Table 5
The attributive value of threat objects.
TT
ST
TA
SA
Object 1 (O1)
E
1500
[160, 155]
9
Object 2 (O2)
C
[300, 450]
[520, 300]
[11, 10]
Object 3 (O3)
C
[420, 520]
[600, 300]
[12, 11]
Object 4 (O4)
D
1600
[180, 177]
8
Object 5 (O5)
E
[600, 700]
[420, 300]
[20, 18]In Table5, TT,ST,TA, and SA mean “type of target,” “speed of target,” “time of arrival,” and “shortcut of airway.” At the same time TT,ST are benefit attributes, TA,SA are cost attributes, and the numerical value TT is described in Table 6.Table 6
Different numerical value of TT.
Target style
Threat degree
Details
A
0.8
Refuelling plane and so forth
B
0.6
Transport plane and so forth
C
0.9
Strike aircraft and so forth
D
0.8
Helicopter
E
1.0
Missile and so forth
F
0.2
Fictional goal and so forthIn order to eliminate the influence resulting from different measures, the normalization can be made through (1). The normalized result of Table 5 can be described as in Table 7.Table 7
Normalized attribute value of threat objects.
TT
ST
TA
SA
O
1
[0.48, 0.48]
[0.62, 0.64]
[0.71, 0.60]
[0.52, 0.50]
O
2
[0.44, 0.44]
[0.16, 0.19]
[0.37, 0.18]
[0.47, 0.41]
O
3
[0.44, 0.44]
[0.17, 0.22]
[0.37, 0.16]
[0.43, 0.38]
O
4
[0.48, 0.48]
[0.67, 0.68]
[0.62, 0.54]
[0.58, 0.56]
O
5
[0.39, 0.39]
[0.25, 0.30]
[0.37, 0.23]
[0.26, 0.23]Through the objective fusion method by GA, the integrated results can be converged as in Table8.Table 8
Integrated result of attributes of each corresponding object.
Fusion data
minSD
O
1
[0.58, 0.60]
0.0114
O
2
[0.28, 0.31]
0.0364
O
3
[0.25, 0.38]
0.0311
O
4
[0.57, 0.60]
0.0101
O
5
[0.30, 0.31]
0.0318In the following part, we will take the commanders’ experience into consideration. The interval decision by experts for the five threat objects is described as(39)
1,1
3,4
2,3
3,5
3,5
1
4
,
1
3
1,1
1
2
,
1
1,2
3,5
1
3
,
1
2
1,2
1,1
2,3
2,3
1
5
,
1
3
1
2
,
1
1
3
,
1
2
1,1
2,3
1
5
,
1
3
1
5
,
1
3
1
3
,
1
2
1
3
,
1
2
1,1
.As for the subjective factors, the method of interval eigenvector is used to generate the interval threat weights of all targets. The fusion process of subjective factors is like Example2, and the fusion weight of threat objects by experts’ decision is(40)
ω
~
=
0.41,0.46
,
0.15,0.19
,
0.19,0.23
,
0.11,0.13
,
0.06,0.07
.Hence, at present, the integration between objective factors and subjective factors can be made by the method of discounting. It can be denoted as in Table9.Table 9
Fusion between objective and subjective weight (O(w): objective weight, S(w): subjective weight, and I(w): integrated weight), α=0.6.
O(w)
S(w)
I(w)
O
1
[0.58, 0.60]
[0.41, 0.46]
[0.51, 0.54]
O
2
[0.28, 0.31]
[0.15, 0.19]
[0.23, 0.26]
O
3
[0.25, 0.38]
[0.19, 0.23]
[0.23, 0.32]
O
4
[0.57, 0.60]
[0.11, 0.13]
[0.39, 0.41]
O
5
[0.30, 0.31]
[0.06, 0.07]
[0.20, 0.21]According to the idea of TOPSIS, we can get the ideal distanceDF+ and anti-ideal distance DF- of each target’s fusion weight, and the ideal interval number is [1,1] and the anti-ideal interval number is [0,0], so we can get the relative closeness of each target described as in Table 10. According to the relative closeness RC, the ranking of all threat targets is O1>O4>O3>O2>O5 (threat degree from large to small). This result is shown by Figure 2 explicitly.Table 10
Relative closeness (RC) of all targets:DF+ means the ideal distance, DF- means the anti-ideal distance, and RC means relative closeness.
I(w)
D
F
+
D
F
-
RC
O
1
[0.51, 0.54]
0.3194
0.1894
0.3722
O
2
[0.23, 0.26]
0.5701
0.0601
0.0954
O
3
[0.23, 0.32]
0.5293
0.0753
0.1245
O
4
[0.39, 0.41]
0.3613
0.1593
0.3060
O
5
[0.20, 0.21]
0.6257
0.0437
0.0653Figure 2
The threat degree of all threat objects.As presented above, the proposed threat model can not only be applied to the objective issue, but can also be easily extended to considering the subjective issue from knowledge of the domain experts. When the objective discounting factorα′=1 and the subjective factor β′=0, the proposed threat model can be absolutely applied to the objective issues. When the objective discounting factor α′=0 and the subjective factor β′=1, the proposed threat model can be absolutely applied to the subjective issues. Otherwise, the proposed threat model is applied in both subjective and objective issues according to the optimum discounting factors (α′ and β′).


## 4.1. The First Numerical Example

In this part, a numerical example [53] is used to illustrate the proposed threat model. Suppose that assessments of the threat objects are all determined with the objective factors (α′=1,β′=0). The interval decision matrix can be denoted as in Table 1; there are three alternatives (A1, A2, A3) and two criteria (C1, C2). The decision maker wants to choose an alternative that has minimum C1 and maximum C2. Now we order the three alternatives with the proposed model above.Table 1
Interval decision matrix.
C
1
C
2
A
1
[0.75, 1.24]
[2784, 3192]
A
2
[1.83, 2.11]
[3671, 3857]
A
3
[4.90, 5.73]
[4409, 4681]First, the interval decision matrix can be normalized through (1). The normalized decision matrix can be denoted as in Table 2.Table 2
Normalized decision matrix.
C
1
C
2
A
1
[0.55, 1.40]
[0.41, 0.50]
A
2
[0.33, 0.57]
[0.54, 0.60]
A
3
[0.12, 0.21]
[0.64, 0.73]Second, through the proposed objective aggregating method with GA, the aggregated results can be converged as in Table3.Table 3
Aggregated decision matrix.
C
A
1
[0.47, 0.96]
A
2
[0.43, 0.59]
A
3
[0.31, 0.52]At last, the priority of the three alternatives can be determined by TOPSIS, and the result can be shown as in Table4. The ranking of three alternatives is A1>A2>A3, which is the same as the result of the paper [53].Table 4
Priority of decision matrix.
C
D
-
D
+
RC
A
1
[0.47, 0.96]
0.53
0.10
0.84
A
2
[0.43, 0.59]
0.26
0.24
0.52
A
3
[0.31, 0.52]
0.18
0.35
0.34This numerical example illustrates the effectiveness of the proposed model without considering the subjective factors. The aggregation of the objective factors is always optimum with GA. In the following part, another numerical example is presented to illustrate the effectiveness of the proposed threat model with considering both objective factors and subjective factors.


## 4.2. The Second Numerical Example

In this part, a real application in aerial object threat will be introduced to describe the operational procedure of threat assessment. The threat objects and their attributes can be shown as in Table5.Table 5
The attributive value of threat objects.
TT
ST
TA
SA
Object 1 (O1)
E
1500
[160, 155]
9
Object 2 (O2)
C
[300, 450]
[520, 300]
[11, 10]
Object 3 (O3)
C
[420, 520]
[600, 300]
[12, 11]
Object 4 (O4)
D
1600
[180, 177]
8
Object 5 (O5)
E
[600, 700]
[420, 300]
[20, 18]In Table5, TT,ST,TA, and SA mean “type of target,” “speed of target,” “time of arrival,” and “shortcut of airway.” At the same time TT,ST are benefit attributes, TA,SA are cost attributes, and the numerical value TT is described in Table 6.Table 6
Different numerical value of TT.
Target style
Threat degree
Details
A
0.8
Refuelling plane and so forth
B
0.6
Transport plane and so forth
C
0.9
Strike aircraft and so forth
D
0.8
Helicopter
E
1.0
Missile and so forth
F
0.2
Fictional goal and so forthIn order to eliminate the influence resulting from different measures, the normalization can be made through (1). The normalized result of Table 5 can be described as in Table 7.Table 7
Normalized attribute value of threat objects.
TT
ST
TA
SA
O
1
[0.48, 0.48]
[0.62, 0.64]
[0.71, 0.60]
[0.52, 0.50]
O
2
[0.44, 0.44]
[0.16, 0.19]
[0.37, 0.18]
[0.47, 0.41]
O
3
[0.44, 0.44]
[0.17, 0.22]
[0.37, 0.16]
[0.43, 0.38]
O
4
[0.48, 0.48]
[0.67, 0.68]
[0.62, 0.54]
[0.58, 0.56]
O
5
[0.39, 0.39]
[0.25, 0.30]
[0.37, 0.23]
[0.26, 0.23]Through the objective fusion method by GA, the integrated results can be converged as in Table8.Table 8
Integrated result of attributes of each corresponding object.
Fusion data
minSD
O
1
[0.58, 0.60]
0.0114
O
2
[0.28, 0.31]
0.0364
O
3
[0.25, 0.38]
0.0311
O
4
[0.57, 0.60]
0.0101
O
5
[0.30, 0.31]
0.0318In the following part, we will take the commanders’ experience into consideration. The interval decision by experts for the five threat objects is described as(39)
1,1
3,4
2,3
3,5
3,5
1
4
,
1
3
1,1
1
2
,
1
1,2
3,5
1
3
,
1
2
1,2
1,1
2,3
2,3
1
5
,
1
3
1
2
,
1
1
3
,
1
2
1,1
2,3
1
5
,
1
3
1
5
,
1
3
1
3
,
1
2
1
3
,
1
2
1,1
.As for the subjective factors, the method of interval eigenvector is used to generate the interval threat weights of all targets. The fusion process of subjective factors is like Example2, and the fusion weight of threat objects by experts’ decision is(40)
ω
~
=
0.41,0.46
,
0.15,0.19
,
0.19,0.23
,
0.11,0.13
,
0.06,0.07
.Hence, at present, the integration between objective factors and subjective factors can be made by the method of discounting. It can be denoted as in Table9.Table 9
Fusion between objective and subjective weight (O(w): objective weight, S(w): subjective weight, and I(w): integrated weight), α=0.6.
O(w)
S(w)
I(w)
O
1
[0.58, 0.60]
[0.41, 0.46]
[0.51, 0.54]
O
2
[0.28, 0.31]
[0.15, 0.19]
[0.23, 0.26]
O
3
[0.25, 0.38]
[0.19, 0.23]
[0.23, 0.32]
O
4
[0.57, 0.60]
[0.11, 0.13]
[0.39, 0.41]
O
5
[0.30, 0.31]
[0.06, 0.07]
[0.20, 0.21]According to the idea of TOPSIS, we can get the ideal distanceDF+ and anti-ideal distance DF- of each target’s fusion weight, and the ideal interval number is [1,1] and the anti-ideal interval number is [0,0], so we can get the relative closeness of each target described as in Table 10. According to the relative closeness RC, the ranking of all threat targets is O1>O4>O3>O2>O5 (threat degree from large to small). This result is shown by Figure 2 explicitly.Table 10
Relative closeness (RC) of all targets:DF+ means the ideal distance, DF- means the anti-ideal distance, and RC means relative closeness.
I(w)
D
F
+
D
F
-
RC
O
1
[0.51, 0.54]
0.3194
0.1894
0.3722
O
2
[0.23, 0.26]
0.5701
0.0601
0.0954
O
3
[0.23, 0.32]
0.5293
0.0753
0.1245
O
4
[0.39, 0.41]
0.3613
0.1593
0.3060
O
5
[0.20, 0.21]
0.6257
0.0437
0.0653Figure 2
The threat degree of all threat objects.As presented above, the proposed threat model can not only be applied to the objective issue, but can also be easily extended to considering the subjective issue from knowledge of the domain experts. When the objective discounting factorα′=1 and the subjective factor β′=0, the proposed threat model can be absolutely applied to the objective issues. When the objective discounting factor α′=0 and the subjective factor β′=1, the proposed threat model can be absolutely applied to the subjective issues. Otherwise, the proposed threat model is applied in both subjective and objective issues according to the optimum discounting factors (α′ and β′).


## 5. Conclusion

Threat assessment is very important in many fields. This paper proposes a new model of threat assessment based on interval number. Both subjective and objective factors are taken into consideration in this threat assessment model. GA is used to determine the objective factors. In addition, interval AHP is applied to determine subjective factors. Then a method of discounting is proposed to integrate the subjective weight and objective weight. At last, the idea of TOPSIS is adopted to rank the objects according to their threat degree. A numerical example and a real application are used to illustrate the effectiveness of the proposed threat model.



---

*Source: 878024-2015-08-26.xml*