# Rolling Force Prediction in Heavy Plate Rolling Based on Uniform Differential Neural Network

Authors: Fei Zhang; Yuntao Zhao; Jian Shao
Journal: Journal of Control Science and Engineering
 (2016)

---

## Abstract

Accurate prediction of the rolling force is critical to assuring the quality of the final product in steel manufacturing. Exit thickness of plate for each pass is calculated from roll gap, mill spring, and predicted roll force. Ideal pass scheduling is dependent on a precise prediction of the roll force in each pass. This paper will introduce a concept that allows obtaining the material model parameters directly from the rolling process on an industrial scale by the uniform differential neural network. On the basis of the characteristics that the uniform distribution can fully characterize the solution space and enhance the diversity of the population, uniformity research on differential evolution operator is made to get improved crossover with uniform distribution. When its original function is transferred with a transfer function, the uniform differential evolution algorithms can quickly solve complex optimization problems. Neural network structure and weights threshold are optimized by uniform differential evolution algorithm, and a uniform differential neural network is formed to improve rolling force prediction accuracy in process control system.


---

## Body

## 1. Introduction

The steel plates are used for applications such as shipbuilding, bridge construction, civil engineering, industrial machinery, and offshore structures, which require high quality and high strength for reliability. Recently, market demands are growing increasingly strict for high-quality products in hot rolling. Particularly, the requirement for thickness precision in a rolling mill process is stricter than any other request. Good thickness precision is highly related with good rolling force prediction [1]. A typical process as shown in Figure 1 mainly consists of two furnaces, a rolling stand and a cooling system.Figure 1
Plate mill scheme.A plate-making process goes through the following steps. Initially, a slab is reheated to recrystallization temperature (about 1215–1230°C) in the furnace, and it is rolled to a final target plate after about a dozen passes in the plate mill. Then, the microstructure of plate is controlled by the phase transformation of austenite during the cooling processes.After the slab’s extraction from the furnace, the operation sequences in the rolling section are determined by a pass calculation algorithm, which calculates the sequences of rolling operations required and predicts the characteristics of the plate after each pass. Figure2 shows the rolling sequences in each pass which consists of three steps: the precalculation step, the real-time control step (or rolling phase), and the postcalculation step [1].Figure 2
Process control system of a plate mill.The plate rolling process is a complicated process with multiple variables, nonlinearity, and strong coupling. Because of the complexity of rolling environment, such as the changes of material constant, friction coefficient, surface roughness of roller, roll wear, oil film thickness, and lubrication condition, the set calculation results of the rolling force, rolling torque, front slide, and deformation resistance are different from the actual rolling process. The rolling force is the most important equipment parameter and technological parameter of rolling mill, for it is the important basis of plastic processing technology, equipment optimization design, and process control. The calculation accuracy of the rolling force directly affects the setting accuracy of the rolling schedule; besides, it is the key to make full use of the regulatory capacity of the thickness and shape control system and the key to improve the hit rate of the steel head. As the conventional rolling force is calculated by the rolling force mathematical model based on experience and statistics, there are some defects in the process of using. Firstly, for the purposes of online control, the general mathematical model is simplified under certain assumptions, so it cannot provide sufficiently accurate predictive value. Secondly, because of the variation of the measurement errors and system characteristics, the parameter errors of model are also great. Therefore, in order to improve the accuracy of rolling force setting, adaptive and self-learning methods based on instant information are used to modify the model [2].Rolling schedule plays an important role in the process of plate rolling production. And an excellent rolling schedule is the basic guarantee for the production capacity of rolling mill, for it can improve the quality of products. The medium and thick plate rolling schedule mainly includes the reduction (load) system, the speed system, the temperature system, and the roller type system. Based on the technical requirements of steel, raw material conditions, temperature conditions, and the actual situation of production equipment, rolling schedule design can make artificial calculation or computer calculation to determine the actual reduction, no-load roll gap, rolling speed, and other parameters with the use of mathematical formulas or charts; in the meanwhile, according to the adaptive correction and processing under condition of actual rolling, rolling schedule design can give full play to the equipment potential, increase production, guarantee quality, make operation easy, and make equipment safe.To develop the correct rolling schedule, a reasonable reduction (load) distribution must be determined. Because of the characteristics of the plate rolling, the research on load distribution started very late, but whether it is the traditional optimization method or intelligent optimization method, the whole process of optimization is generally summarized as 4 steps: (1) Determine the objective function of rolling load distribution according to the actual production conditions; (2) determine the constraint conditions according to the actual production conditions; (3) choose the appropriate optimization method; (4) derive the extreme value of the objective function and obtain the process parameters when the objective function reaches its extreme value.


## 2. Mathematical Model of Plate Rolling

### 2.1. Rolling Force Model

The rolling force model is in the core position in the plate model system, as it is an important parameter to develop technological system, adjust the mill, improve the product quality, expand the product range, fully and reasonably tap equipment potential, and check equipment strength. At present, Sims’ model is recognized as the most suitable model for hot rolling [3]. Sims’ model assumes the plate deformation to be purely plastic. In consideration of the yield condition derived by Orowan and making some assumptions on the friction between the work rolls and the plate, Sims calculates the rolling force P by integrating Von Karman’s differential equation [4]:(1)
P
=
B
l
c
′
Q
P
K
K
T
,where P is the rolling force, B is the plate width, l
c
′ is the horizontal projection length of contact arc of the squashed roller and the rolling plate, Q
P is the influence coefficient of friction force in the contact arc, K is the metal deformation resistance, and K
T is the effect factor of rolling force by tensile stress.


### 2.2. Rolling Torque Model

Rolling torque can be determined by rolling force or energy consumption:(2)
M
=
2
×
F
×
R
′
×
Δ
h
×
ψ
p
,where ψ
p is the moment arm coefficient, whose value in plate rolling is 0.4 to 0.8 in general, and it can also be calculated by the following empirical formula [5]:(3)
ψ
p
=
0.5
-
0.028
R
′
×
Δ
h
h
0
.The rolling power is related to the rolling torque and the roll speed:(4)
P
=
M
×
n
971
,where P is the rolling power, M is the rolling torque, and n is the roll speed.


### 2.3. Temperature Drop Model

Temperature is one of the most influential factors to the deformation resistance. With the increase of temperature, the strength indexes, including yield limit, strength limit, and hardness, of all kinds of metals and alloys will decrease. This is because, with the increase of temperature, the amplitude of the thermal agitation of the metal atom increases and the bond force between the atoms decreases; accordingly the needed energy and the deformation resistance of the metal plastic deformation decrease. Generally plate temperature model includes the temperature drop of radiation, descaling, and interstand cooling water when the rolling plate is conveyed on the roll table or in the mill housing, the temperature rise of rolling deformation, and the temperature drop of contact between the rolling plate and the roll table or roller [3]. The radiation temperature drop model takes the formula in [6], and models of the descaling temperature drop, the interstand cooling water temperature drop, rolling deformation temperature rise, and the contact temperature drop take the formula in [3].


## 2.1. Rolling Force Model

The rolling force model is in the core position in the plate model system, as it is an important parameter to develop technological system, adjust the mill, improve the product quality, expand the product range, fully and reasonably tap equipment potential, and check equipment strength. At present, Sims’ model is recognized as the most suitable model for hot rolling [3]. Sims’ model assumes the plate deformation to be purely plastic. In consideration of the yield condition derived by Orowan and making some assumptions on the friction between the work rolls and the plate, Sims calculates the rolling force P by integrating Von Karman’s differential equation [4]:(1)
P
=
B
l
c
′
Q
P
K
K
T
,where P is the rolling force, B is the plate width, l
c
′ is the horizontal projection length of contact arc of the squashed roller and the rolling plate, Q
P is the influence coefficient of friction force in the contact arc, K is the metal deformation resistance, and K
T is the effect factor of rolling force by tensile stress.


## 2.2. Rolling Torque Model

Rolling torque can be determined by rolling force or energy consumption:(2)
M
=
2
×
F
×
R
′
×
Δ
h
×
ψ
p
,where ψ
p is the moment arm coefficient, whose value in plate rolling is 0.4 to 0.8 in general, and it can also be calculated by the following empirical formula [5]:(3)
ψ
p
=
0.5
-
0.028
R
′
×
Δ
h
h
0
.The rolling power is related to the rolling torque and the roll speed:(4)
P
=
M
×
n
971
,where P is the rolling power, M is the rolling torque, and n is the roll speed.


## 2.3. Temperature Drop Model

Temperature is one of the most influential factors to the deformation resistance. With the increase of temperature, the strength indexes, including yield limit, strength limit, and hardness, of all kinds of metals and alloys will decrease. This is because, with the increase of temperature, the amplitude of the thermal agitation of the metal atom increases and the bond force between the atoms decreases; accordingly the needed energy and the deformation resistance of the metal plastic deformation decrease. Generally plate temperature model includes the temperature drop of radiation, descaling, and interstand cooling water when the rolling plate is conveyed on the roll table or in the mill housing, the temperature rise of rolling deformation, and the temperature drop of contact between the rolling plate and the roll table or roller [3]. The radiation temperature drop model takes the formula in [6], and models of the descaling temperature drop, the interstand cooling water temperature drop, rolling deformation temperature rise, and the contact temperature drop take the formula in [3].


## 3. Differential Evolution Algorithm

DE (differential evolution) algorithm proposed by Storn and Price in 1995 is a random group evolutionary search algorithm, which can guide the optimization process by the swarm intelligence produced by individual cooperation and competition. Due to the ease of use, robustness, and strong global optimization ability, DE algorithm has been successfully used in many fields [7–13]. On the basis of the traditional mathematical model, this paper studies how to improve the accuracy of rolling force prediction by using DE algorithm.When DE algorithm is solving optimization problems, the parallel search will be completed byN
P individuals together in the search space. The basic operation of the DE includes mutation, crossover, and selection. The initial population is randomly generated in the search space, and it is generally produced by a uniform distribution of random functions. In case a preliminary solution is available, the initial population might be generated by adding normally distributed random deviations to the nominal solution. DE generates new parameter vectors by adding the weighted difference between two population vectors to a third vector. This operation is called mutation. The mutated vector’s parameters are then mixed with the parameters of another predetermined vector, the target vector, to yield the so-called trial vector. Parameter mixing is often referred to as “crossover.” If the fitness of the trial vector is better than the fitness of the target vector, the trial vector replaces the target vector in the following generation. This operation is called selection [14, 15].SetN
P D-dimensional real vectors as each generation population; each individual can be expressed as(5)
x
i
g
,
i
=
1,2
,
…
,
N
P
,where i is the sequence of individual in population, g
=
1,2
,
…
,
G is the evolutionary generation, N
P is population size, and N
P does not change during the evolution process [16].


### 3.1. Basic Differential Evolution Algorithm

#### 3.1.1. Initialization

In order to establish the initial point of optimal search, the population should be initialized first. One method of generating the initial population is randomly chosen from the given boundary constraints. In the DE research, it is generally assumed that all the randomly initialized populations accord with uniform probability distribution.Set parameter variable boundary asx
i
j
(
L
)
≤
x
i
j
≤
x
i
j
(
U
); then(6)
x
i
j
0
=
rand
⁡
0,1
·
x
i
j
U
-
x
i
j
L
+
x
i
j
L
,where i
=
1,2
,
…
,
N
P,  j
=
1,2
,
…
,
D, and  rand
⁡
[
0,1
] is a random number in the range of [
0,1
].


#### 3.1.2. Mutation

For each target individualx
i
g, i
=
1,2
,
…
,
N
P, a mutant individual is generated according to(7)
v
i
g
=
x
r
1
g
+
F
x
r
2
g
-
x
r
3
gwith random indexes r
1
,
r
2
,
r
3
∈
{
1,2
,
…
,
N
P
}, which are mutually different and F
>
0. The randomly chosen integers r
1, r
2, and r
3 are also chosen to be different from the running index i, so N
P
≥
4 must be satisfied. The mutation operator F
∈
[
0,2
] is a real and constant factor which controls the amplification of the differential variation (
x
r
2
,
G
-
x
r
3
,
G
). So far the study shows that F less than 0.4 and more than 1 is only occasionally effective, and F
=
0.5 is usually a good initial choice.


#### 3.1.3. Crossover

In order to increase the diversity of the population, the crossover operation is introduced. Variant individualv
i
g and the corresponding target individual x
i
g obtained from the mutation operation generate trial vector u
i
g according to(8)
u
i
g
=
v
i
j
g
,
if
rand
⁡
b
j
≤
C
R
or
j
=
m
b
r
i
x
i
j
g
,
if
rand
⁡
b
j
>
C
R
or
j
≠
m
b
r
i
,where u
i
g
=
(
u
i
1
g
,
u
i
2
g
,
…
,
u
i
D
g
),  i
=
1,2
,
…
,
N
P,  j
=
1,2
,
…
,
D, rand
⁡
b
(
j
) is the jth evaluation of a uniform random number generator with outcome [
0,1
], m
b
r
i
∈
1,2
,
…
,
D is a randomly chosen index which ensures that u
i
g obtains at least one parameter from v
i
g, and C
R
∈
[
0,1
] is the crossover constant.Formula (8) indicates that if C
R becomes greater, the contribution of v
i
g to u
i
g is greater; if C
R
=
1, then u
i
g
=
v
i
g, which is advantageous to local search and accelerates convergence rate; if C
R becomes less, the contribution of x
i
g to u
i
g is greater; if C
R
=
0, then u
i
g
=
x
i
g, which is beneficial to maintain the diversity and global search.


#### 3.1.4. Selection

In order to ensure that the better individual is selected into the next generation, DE compares the trial vectoru
i
g and the target individual x
i
g in the current population according to the principle of greed. If the objective function is minimized, the vector with the smaller objective function values will win a place in the next generation:(9)
x
i
g
+
1
=
u
i
g
,
if
u
i
g
<
f
x
i
g
x
i
g
,
otherwise.


#### 3.1.5. Boundary Handling

In the problem of boundary constraints, it is necessary to make sure that the new individual is located in the feasible region of the problem, and a simple method is replaced by the random generation of the new individual with the feasible region.That is, ifx
i
j
g
+
1
<
x
i
j
(
L
) or x
i
j
g
+
1
>
x
i
j
(
U
), then(10)
x
i
j
g
+
1
=
rand
⁡
0,1
·
x
i
j
U
-
x
i
j
L
+
x
i
j
L
.


### 3.2. Deformed Differential Evolution Algorithm

In the practical application, the differential evolution algorithm is developed for the convenience of representation, which is described in the form of DE/x/y/z.The letter x represents the selection method of the base vector (the mutant target individual) of the mutation operation, and the letter x can be “r
a
n
d” (representing a randomly selected individual from the population) or “b
e
s
t” (representing the best selected individual from the population).The letter y represents the number of differential vectors used.The letter z represents the crossover method and is usually performed by Bernoulli experiment method with “b
i
n.”In accordance with the above provisions, the aforementioned differential evolution algorithm can be expressed asD
E
/
r
a
n
d
/
1
/
b
i
n. Storn and Price proposed D
E extension mode as follows [7]:Mode 1:D
E
/
b
e
s
t
/
1
/
b
i
n:(11)
v
i
g
=
x
b
e
s
t
g
+
F
·
x
r
1
g
-
x
r
2
g
.Mode 2:D
E
/
r
a
n
d
-
t
o
-
b
e
s
t
/
1
/
b
i
n:(12)
v
i
g
=
x
i
g
+
λ
·
x
b
e
s
t
g
-
x
i
g
+
F
·
x
r
1
g
-
x
i
g
.Mode 3:D
E
/
b
e
s
t
/
2
/
b
i
n:(13)
v
i
g
=
x
b
e
s
t
g
+
F
·
x
r
1
g
-
x
r
2
g
+
x
r
3
g
-
x
r
4
g
.Mode 4:D
E
/
r
a
n
d
/
2
/
b
i
n:(14)
v
i
g
=
x
r
5
g
+
F
·
x
r
1
g
-
x
r
2
g
+
x
r
3
g
-
x
r
4
g
.Different deformation modes have their own characteristics, but through a large number of experimental studies, Storn and Price show that the performance ofD
E
/
b
e
s
t
/
2
/
b
i
n and D
E
/
r
a
n
d
/
1
/
b
i
n is better than other methods, and D
E
/
b
e
s
t
/
2
/
b
i
n and D
E
/
r
a
n
d
/
1
/
b
i
n are the most widely applied DE extension modes in the actual engineering design process.


### 3.3. Improved Differential Evolution Algorithm

In view of the disadvantages such as slow convergence speed and the decrease of population diversity, the algorithm is improved by using the information and target information to improve the spatial characteristics and the complex optimization environment. The uniform distribution proposed by [17] can completely characterize the solution space and is conducive to the enhancement of population diversity, and the uniformity of differential evolution operator is studied. Through the analysis, individuals with uniform distribution can be obtained after mutation and selection operations, and those crossover operators that cannot exhibit properties of uniform distribution are improved to obtain the improved crossover operators with uniform distribution according to uniform distribution theory. Secondly, the transformation function is used to transform the original function, so that the current local minimal point and the region of the inferior to the point can be stretched to a certain height and keep the optimized function value below the current local minimal point unchanged. So the number of local minimal points can be eliminated, and then the difficulty of subsequent search can be effectively reduced. At last, a uniform differential evolution algorithm based on transformation function for fast solving complex optimization problem is obtained (abbreviated to AtDE).In the DE algorithm, the variable to be optimized can be directly processed as the algorithm individual. Letx
i
g
(
i
=
1,2
,
…
,
n
) be n individuals of the gth generation (each individual has a D dimensional real valued information), and then these individuals constitute the population X
g of the gth generation. After the initialization of the algorithm, all the individuals in the solution space are consistent with the uniform probability distribution. Through a series of mutation (denoted by M
g), crossover (denoted by C
g), and selection (denoted by S
g) operations, population evolution is ultimately completed. Because the uniformly distributed population can fully characterize solution space features during search procedure, it is conducive to enhance the diversity of population. DE algorithm based on the greedy criterion compares the intermediate individual u
i
g with the target individual x
i
g in the current population to determine whether the intermediate individual u
i
g can become a member of the next generation. In the process of running, the algorithm keeps searching for the extreme value information. If the maximum information f
(
x
b
) is not changed after two iterations (which can be set according to the complexity of the trial function), the algorithm is considered to be a local minimum, and according to this information the solution space is divided into S
1
=
{
x
∣
f
(
x
)
≥
f
(
x
b
)
} and S
2
=
{
x
∣
f
(
x
)
<
f
(
x
b
)
}. Therefore, the transformation function is used to simplify the complex optimization environment and eliminate the search area worse than the local extreme point, while the search area better than the local extreme point remains unchanged. Hence the algorithm more easily gets rid of the local extreme points of the optimization problem, and it cooperates with the distribution of the individual’s uniformity to guarantee the algorithm converge to the global optimal solution of the problem.According to the first two sections, the specific steps of the AtDE algorithm are as follows.Step 1.
Setg
=
0, and create initial population.Step 2.
Calculate the fitness of each individual in the population.Step 3.
Evaluate whether the optimal individual is located in the local minimum. If yes, then letf
(
x
)
=
φ
(
x
); else go to the next step.Step 4.
If the shutdown conditions are met, then shut the algorithm down; else go to the next step.Step 5.
Perform mutation operationM
g, and get the intermediate population V
g.Step 6.
Use uniform crossover operator for the original population and the intermediate population, and get the new intermediate populationU
g.Step 7.
Get the new population of the next generation by operator selection.Step 8.
Setg
=
g
+
1, and then go to Step 2.


## 3.1. Basic Differential Evolution Algorithm

### 3.1.1. Initialization

In order to establish the initial point of optimal search, the population should be initialized first. One method of generating the initial population is randomly chosen from the given boundary constraints. In the DE research, it is generally assumed that all the randomly initialized populations accord with uniform probability distribution.Set parameter variable boundary asx
i
j
(
L
)
≤
x
i
j
≤
x
i
j
(
U
); then(6)
x
i
j
0
=
rand
⁡
0,1
·
x
i
j
U
-
x
i
j
L
+
x
i
j
L
,where i
=
1,2
,
…
,
N
P,  j
=
1,2
,
…
,
D, and  rand
⁡
[
0,1
] is a random number in the range of [
0,1
].


### 3.1.2. Mutation

For each target individualx
i
g, i
=
1,2
,
…
,
N
P, a mutant individual is generated according to(7)
v
i
g
=
x
r
1
g
+
F
x
r
2
g
-
x
r
3
gwith random indexes r
1
,
r
2
,
r
3
∈
{
1,2
,
…
,
N
P
}, which are mutually different and F
>
0. The randomly chosen integers r
1, r
2, and r
3 are also chosen to be different from the running index i, so N
P
≥
4 must be satisfied. The mutation operator F
∈
[
0,2
] is a real and constant factor which controls the amplification of the differential variation (
x
r
2
,
G
-
x
r
3
,
G
). So far the study shows that F less than 0.4 and more than 1 is only occasionally effective, and F
=
0.5 is usually a good initial choice.


### 3.1.3. Crossover

In order to increase the diversity of the population, the crossover operation is introduced. Variant individualv
i
g and the corresponding target individual x
i
g obtained from the mutation operation generate trial vector u
i
g according to(8)
u
i
g
=
v
i
j
g
,
if
rand
⁡
b
j
≤
C
R
or
j
=
m
b
r
i
x
i
j
g
,
if
rand
⁡
b
j
>
C
R
or
j
≠
m
b
r
i
,where u
i
g
=
(
u
i
1
g
,
u
i
2
g
,
…
,
u
i
D
g
),  i
=
1,2
,
…
,
N
P,  j
=
1,2
,
…
,
D, rand
⁡
b
(
j
) is the jth evaluation of a uniform random number generator with outcome [
0,1
], m
b
r
i
∈
1,2
,
…
,
D is a randomly chosen index which ensures that u
i
g obtains at least one parameter from v
i
g, and C
R
∈
[
0,1
] is the crossover constant.Formula (8) indicates that if C
R becomes greater, the contribution of v
i
g to u
i
g is greater; if C
R
=
1, then u
i
g
=
v
i
g, which is advantageous to local search and accelerates convergence rate; if C
R becomes less, the contribution of x
i
g to u
i
g is greater; if C
R
=
0, then u
i
g
=
x
i
g, which is beneficial to maintain the diversity and global search.


### 3.1.4. Selection

In order to ensure that the better individual is selected into the next generation, DE compares the trial vectoru
i
g and the target individual x
i
g in the current population according to the principle of greed. If the objective function is minimized, the vector with the smaller objective function values will win a place in the next generation:(9)
x
i
g
+
1
=
u
i
g
,
if
u
i
g
<
f
x
i
g
x
i
g
,
otherwise.


### 3.1.5. Boundary Handling

In the problem of boundary constraints, it is necessary to make sure that the new individual is located in the feasible region of the problem, and a simple method is replaced by the random generation of the new individual with the feasible region.That is, ifx
i
j
g
+
1
<
x
i
j
(
L
) or x
i
j
g
+
1
>
x
i
j
(
U
), then(10)
x
i
j
g
+
1
=
rand
⁡
0,1
·
x
i
j
U
-
x
i
j
L
+
x
i
j
L
.


## 3.1.1. Initialization

In order to establish the initial point of optimal search, the population should be initialized first. One method of generating the initial population is randomly chosen from the given boundary constraints. In the DE research, it is generally assumed that all the randomly initialized populations accord with uniform probability distribution.Set parameter variable boundary asx
i
j
(
L
)
≤
x
i
j
≤
x
i
j
(
U
); then(6)
x
i
j
0
=
rand
⁡
0,1
·
x
i
j
U
-
x
i
j
L
+
x
i
j
L
,where i
=
1,2
,
…
,
N
P,  j
=
1,2
,
…
,
D, and  rand
⁡
[
0,1
] is a random number in the range of [
0,1
].


## 3.1.2. Mutation

For each target individualx
i
g, i
=
1,2
,
…
,
N
P, a mutant individual is generated according to(7)
v
i
g
=
x
r
1
g
+
F
x
r
2
g
-
x
r
3
gwith random indexes r
1
,
r
2
,
r
3
∈
{
1,2
,
…
,
N
P
}, which are mutually different and F
>
0. The randomly chosen integers r
1, r
2, and r
3 are also chosen to be different from the running index i, so N
P
≥
4 must be satisfied. The mutation operator F
∈
[
0,2
] is a real and constant factor which controls the amplification of the differential variation (
x
r
2
,
G
-
x
r
3
,
G
). So far the study shows that F less than 0.4 and more than 1 is only occasionally effective, and F
=
0.5 is usually a good initial choice.


## 3.1.3. Crossover

In order to increase the diversity of the population, the crossover operation is introduced. Variant individualv
i
g and the corresponding target individual x
i
g obtained from the mutation operation generate trial vector u
i
g according to(8)
u
i
g
=
v
i
j
g
,
if
rand
⁡
b
j
≤
C
R
or
j
=
m
b
r
i
x
i
j
g
,
if
rand
⁡
b
j
>
C
R
or
j
≠
m
b
r
i
,where u
i
g
=
(
u
i
1
g
,
u
i
2
g
,
…
,
u
i
D
g
),  i
=
1,2
,
…
,
N
P,  j
=
1,2
,
…
,
D, rand
⁡
b
(
j
) is the jth evaluation of a uniform random number generator with outcome [
0,1
], m
b
r
i
∈
1,2
,
…
,
D is a randomly chosen index which ensures that u
i
g obtains at least one parameter from v
i
g, and C
R
∈
[
0,1
] is the crossover constant.Formula (8) indicates that if C
R becomes greater, the contribution of v
i
g to u
i
g is greater; if C
R
=
1, then u
i
g
=
v
i
g, which is advantageous to local search and accelerates convergence rate; if C
R becomes less, the contribution of x
i
g to u
i
g is greater; if C
R
=
0, then u
i
g
=
x
i
g, which is beneficial to maintain the diversity and global search.


## 3.1.4. Selection

In order to ensure that the better individual is selected into the next generation, DE compares the trial vectoru
i
g and the target individual x
i
g in the current population according to the principle of greed. If the objective function is minimized, the vector with the smaller objective function values will win a place in the next generation:(9)
x
i
g
+
1
=
u
i
g
,
if
u
i
g
<
f
x
i
g
x
i
g
,
otherwise.


## 3.1.5. Boundary Handling

In the problem of boundary constraints, it is necessary to make sure that the new individual is located in the feasible region of the problem, and a simple method is replaced by the random generation of the new individual with the feasible region.That is, ifx
i
j
g
+
1
<
x
i
j
(
L
) or x
i
j
g
+
1
>
x
i
j
(
U
), then(10)
x
i
j
g
+
1
=
rand
⁡
0,1
·
x
i
j
U
-
x
i
j
L
+
x
i
j
L
.


## 3.2. Deformed Differential Evolution Algorithm

In the practical application, the differential evolution algorithm is developed for the convenience of representation, which is described in the form of DE/x/y/z.The letter x represents the selection method of the base vector (the mutant target individual) of the mutation operation, and the letter x can be “r
a
n
d” (representing a randomly selected individual from the population) or “b
e
s
t” (representing the best selected individual from the population).The letter y represents the number of differential vectors used.The letter z represents the crossover method and is usually performed by Bernoulli experiment method with “b
i
n.”In accordance with the above provisions, the aforementioned differential evolution algorithm can be expressed asD
E
/
r
a
n
d
/
1
/
b
i
n. Storn and Price proposed D
E extension mode as follows [7]:Mode 1:D
E
/
b
e
s
t
/
1
/
b
i
n:(11)
v
i
g
=
x
b
e
s
t
g
+
F
·
x
r
1
g
-
x
r
2
g
.Mode 2:D
E
/
r
a
n
d
-
t
o
-
b
e
s
t
/
1
/
b
i
n:(12)
v
i
g
=
x
i
g
+
λ
·
x
b
e
s
t
g
-
x
i
g
+
F
·
x
r
1
g
-
x
i
g
.Mode 3:D
E
/
b
e
s
t
/
2
/
b
i
n:(13)
v
i
g
=
x
b
e
s
t
g
+
F
·
x
r
1
g
-
x
r
2
g
+
x
r
3
g
-
x
r
4
g
.Mode 4:D
E
/
r
a
n
d
/
2
/
b
i
n:(14)
v
i
g
=
x
r
5
g
+
F
·
x
r
1
g
-
x
r
2
g
+
x
r
3
g
-
x
r
4
g
.Different deformation modes have their own characteristics, but through a large number of experimental studies, Storn and Price show that the performance ofD
E
/
b
e
s
t
/
2
/
b
i
n and D
E
/
r
a
n
d
/
1
/
b
i
n is better than other methods, and D
E
/
b
e
s
t
/
2
/
b
i
n and D
E
/
r
a
n
d
/
1
/
b
i
n are the most widely applied DE extension modes in the actual engineering design process.


## 3.3. Improved Differential Evolution Algorithm

In view of the disadvantages such as slow convergence speed and the decrease of population diversity, the algorithm is improved by using the information and target information to improve the spatial characteristics and the complex optimization environment. The uniform distribution proposed by [17] can completely characterize the solution space and is conducive to the enhancement of population diversity, and the uniformity of differential evolution operator is studied. Through the analysis, individuals with uniform distribution can be obtained after mutation and selection operations, and those crossover operators that cannot exhibit properties of uniform distribution are improved to obtain the improved crossover operators with uniform distribution according to uniform distribution theory. Secondly, the transformation function is used to transform the original function, so that the current local minimal point and the region of the inferior to the point can be stretched to a certain height and keep the optimized function value below the current local minimal point unchanged. So the number of local minimal points can be eliminated, and then the difficulty of subsequent search can be effectively reduced. At last, a uniform differential evolution algorithm based on transformation function for fast solving complex optimization problem is obtained (abbreviated to AtDE).In the DE algorithm, the variable to be optimized can be directly processed as the algorithm individual. Letx
i
g
(
i
=
1,2
,
…
,
n
) be n individuals of the gth generation (each individual has a D dimensional real valued information), and then these individuals constitute the population X
g of the gth generation. After the initialization of the algorithm, all the individuals in the solution space are consistent with the uniform probability distribution. Through a series of mutation (denoted by M
g), crossover (denoted by C
g), and selection (denoted by S
g) operations, population evolution is ultimately completed. Because the uniformly distributed population can fully characterize solution space features during search procedure, it is conducive to enhance the diversity of population. DE algorithm based on the greedy criterion compares the intermediate individual u
i
g with the target individual x
i
g in the current population to determine whether the intermediate individual u
i
g can become a member of the next generation. In the process of running, the algorithm keeps searching for the extreme value information. If the maximum information f
(
x
b
) is not changed after two iterations (which can be set according to the complexity of the trial function), the algorithm is considered to be a local minimum, and according to this information the solution space is divided into S
1
=
{
x
∣
f
(
x
)
≥
f
(
x
b
)
} and S
2
=
{
x
∣
f
(
x
)
<
f
(
x
b
)
}. Therefore, the transformation function is used to simplify the complex optimization environment and eliminate the search area worse than the local extreme point, while the search area better than the local extreme point remains unchanged. Hence the algorithm more easily gets rid of the local extreme points of the optimization problem, and it cooperates with the distribution of the individual’s uniformity to guarantee the algorithm converge to the global optimal solution of the problem.According to the first two sections, the specific steps of the AtDE algorithm are as follows.Step 1.
Setg
=
0, and create initial population.Step 2.
Calculate the fitness of each individual in the population.Step 3.
Evaluate whether the optimal individual is located in the local minimum. If yes, then letf
(
x
)
=
φ
(
x
); else go to the next step.Step 4.
If the shutdown conditions are met, then shut the algorithm down; else go to the next step.Step 5.
Perform mutation operationM
g, and get the intermediate population V
g.Step 6.
Use uniform crossover operator for the original population and the intermediate population, and get the new intermediate populationU
g.Step 7.
Get the new population of the next generation by operator selection.Step 8.
Setg
=
g
+
1, and then go to Step 2.


## 4. Rolling Force Prediction Model Based on Uniform Differential Neural Network

### 4.1. Application Strategy

Because the mathematical model has a solid theoretical basis and it can roughly predict the changing trend of the rolling force, the prediction model of the combination of the mathematical model and the uniform differential neural network is used in the setting calculation. The prediction model is shown as follows:(15)
F
=
F
0
+
F
N
N
,where F
0 is the calculated value of rolling force and F
N
N is the difference between the calculated value and the actual value of rolling force for uniform differential neural network.The advantages of the algorithm are as follows: on the one hand, because of the introduction of a neural network model with strong nonlinear approximation ability, the relationship between the parameters and the rolling force is well described, moreover, by online learning and real-time feedback correction, the model further improves the adaptability of the rolling force online model to the parameters variation and random disturbance, and then the prediction accuracy of the model is improved; on the other hand, because of the existence of the conventional model, the adaptive learning speed is improved, and the increment of the control of the intermediate variable is guaranteed not to be too large, so the stability of the rolling force prediction is improved, and the prediction accuracy of the rolling force is further improved. The application strategy of uniform differential neural network rolling force prediction model is shown in Figure3.Figure 3
Application strategy of uniform differential neural network rolling force prediction model.


### 4.2. Structure Design

#### 4.2.1. Design of Input Layer and Output Layer

The input and output layer node number of neural network is designed according to the requirement of the user. On the basis of the information required to ensure the accuracy of network prediction model, the system size should be reduced as much as possible so as to reduce the learning time and the complexity of the system. The basic form of rolling force mathematical model can be expressed asF
=
f
(
B
,
R
′
,
h
i
n
,
h
o
u
t
,
K
m
,
Q
p
), which means the rolling force is associated with the strip width, entrance thickness, exit thickness, roll diameter, stress state, and deformation resistance coefficient, while, according to the spring equation, the exit thickness is associated with the setting value of the roll gap. The stress state coefficient Q
p is related to flattening roll diameter and reduction rate. The deformation resistance K
m is related not only to the chemical composition of the metal materials but also to the plastic deformation (deformation temperature, deformation velocity, and deformation degree). Combined with these factors, the rolling force can be expressed as follows: (16)
F
=
f
B
,
R
,
h
i
n
,
ε
,
S
,
C
%
,
S
i
%
,
M
n
%
,
T
,
u
m
,where C
%, S
i
%, and M
n
% are the contents of M
n, S
i, and C in raw materials, respectively, which can reflect the characteristics of the material.Considering that the working roll radius is relatively stable in the process of steady state rolling, in order to reduce the complexity of the network, the parameterR is not set as the network input.Therefore, the following nine main factors affecting the rolling force are set as the input parameters of the network: the entrance thickness, the reduction rate, the roll gap, the entrance width, the rolling speed, the rolling temperature, and contents ofC, S
i, and M
n, respectively. There is only one node in the output layer, which is the deviation between the calculated value and the actual value of the mathematical model.


#### 4.2.2. Precision of Network Training

The goal of improving the accuracy of the network can be achieved by increasing the number of hidden layers as well as the number of hidden layer nodes. The latter is simpler in implementation, so in this paper the hidden layer is fixed to one layer, and only the node number of the single hidden layer is automatically optimized. The node activation functions of both the hidden layer and output layer are Sigmoid functions.


#### 4.2.3. Data Processing

The error data and the noise data will be removed before training. At the same time, the different variables represent different physical quantities, and their range may vary greatly, so all the data must be normalized to the same range of values. Because the activation function is the Sigmoid function, in order to avoid working in the flat area of the function, the data need to be transformed to 0.1–0.9. For this purpose, the following transformation is done on the data of the training sample set and the prediction sample set [17]. The new variable x
c is(17)
x
c
=
0.9
-
0.1
x
m
a
x
-
x
m
i
n
x
+
0.9
-
0.9
-
0.1
x
m
a
x
-
x
m
i
n
x
m
a
x
.After the weights are obtained by training uniform differential neural network, the output value of the output layer is obtained by using the prediction sample, and the rolling force deviation value must be obtained by the transformation:(18)
x
=
x
m
a
x
+
1.25
x
c
-
0.9
x
m
a
x
-
x
m
i
n
,where x
m
a
x and x
m
i
n are the maximum and minimum values of the normalized variables, respectively.


#### 4.2.4. Parameter Setting

By using the uniform differential evolution algorithm, the code string for optimizing the structure and weights of the neural network consists of five parts: the number of the hidden nodes, the connection weights between the input layer and the hidden layer, the connection weights between the hidden layer and the output layer, the hidden layer threshold, and the output layer threshold. Set the numbers of input units, hidden units, and output units of the single hidden layer network to bem, p, and q, respectively.Because the number of the hidden nodes is indefinite, the length of code string is variable during network optimization, and inconvenience will be brought to the operator’s operation. At first, the maximum possible length of the code string is chosen to determine the maximum possible valuep
m
a
x and then gradually reduced to determine the optimal hidden layer node. In this paper, p
m
a
x
=
2
(
m
+
q
). According to the actual need, if we assume that the neurons of each layer are only connected to the neurons of its previous layer and there is no direct connection between the input and output, then the total number of connection weights is m
+
q
p
m
a
x.The total length of code stringH is(19)
H
=
m
+
q
+
1
p
m
a
x
+
q
+
1
.The total length of the code stringH includes all information about network structure, connection weights, and threshold values. The structure of uniform differential neural network code strings is shown as follows:(20)
H
1
,
H
2
,
…
,
H
p
Number of hidden nodes
W
i
j
i
=
1,2
,
…
,
m
;
j
=
1,2
,
…
,
p
Weights of input layer and hidden layer
V
j
t
j
=
1,2
,
…
,
p
;
t
=
1,2
,
…
,
q
Weights of hidden layer and output layer
θ
j
j
=
1,2
,
…
,
p
Hidden layer threshold
γ
t
t
=
1,2
,
…
,
q
Output layer threshold
.Let the sample pair of training set be the input and the expected output of the uniform differential neural network, calculate the error between the network output and the expected output, and take the error sum of squares as the fitness functionJ [18]:(21)
J
n
=
∑
k
=
1
N
∑
j
=
1
q
y
j
k
-
y
^
j
k
2
,where n is the nth individual in the population, N is the number of the sample sets of network input and output, q is the number of output layer nodes, y
j
(
k
) is expected output of the jth output node when the kth sample is input, and y
^
j
(
k
) is actual output of the jth output node when the kth sample is input.The other parameter settings of the uniform DE algorithm are as follows. The population size is 60, the maximum evolution generation is 2000,C
R
=
0.8, and F
=
0.5.The schematics of uniform DE algorithm optimizing neural network are shown in Figure4.Figure 4
Schematics of uniform DE algorithm optimizing neural network.


## 4.1. Application Strategy

Because the mathematical model has a solid theoretical basis and it can roughly predict the changing trend of the rolling force, the prediction model of the combination of the mathematical model and the uniform differential neural network is used in the setting calculation. The prediction model is shown as follows:(15)
F
=
F
0
+
F
N
N
,where F
0 is the calculated value of rolling force and F
N
N is the difference between the calculated value and the actual value of rolling force for uniform differential neural network.The advantages of the algorithm are as follows: on the one hand, because of the introduction of a neural network model with strong nonlinear approximation ability, the relationship between the parameters and the rolling force is well described, moreover, by online learning and real-time feedback correction, the model further improves the adaptability of the rolling force online model to the parameters variation and random disturbance, and then the prediction accuracy of the model is improved; on the other hand, because of the existence of the conventional model, the adaptive learning speed is improved, and the increment of the control of the intermediate variable is guaranteed not to be too large, so the stability of the rolling force prediction is improved, and the prediction accuracy of the rolling force is further improved. The application strategy of uniform differential neural network rolling force prediction model is shown in Figure3.Figure 3
Application strategy of uniform differential neural network rolling force prediction model.


## 4.2. Structure Design

### 4.2.1. Design of Input Layer and Output Layer

The input and output layer node number of neural network is designed according to the requirement of the user. On the basis of the information required to ensure the accuracy of network prediction model, the system size should be reduced as much as possible so as to reduce the learning time and the complexity of the system. The basic form of rolling force mathematical model can be expressed asF
=
f
(
B
,
R
′
,
h
i
n
,
h
o
u
t
,
K
m
,
Q
p
), which means the rolling force is associated with the strip width, entrance thickness, exit thickness, roll diameter, stress state, and deformation resistance coefficient, while, according to the spring equation, the exit thickness is associated with the setting value of the roll gap. The stress state coefficient Q
p is related to flattening roll diameter and reduction rate. The deformation resistance K
m is related not only to the chemical composition of the metal materials but also to the plastic deformation (deformation temperature, deformation velocity, and deformation degree). Combined with these factors, the rolling force can be expressed as follows: (16)
F
=
f
B
,
R
,
h
i
n
,
ε
,
S
,
C
%
,
S
i
%
,
M
n
%
,
T
,
u
m
,where C
%, S
i
%, and M
n
% are the contents of M
n, S
i, and C in raw materials, respectively, which can reflect the characteristics of the material.Considering that the working roll radius is relatively stable in the process of steady state rolling, in order to reduce the complexity of the network, the parameterR is not set as the network input.Therefore, the following nine main factors affecting the rolling force are set as the input parameters of the network: the entrance thickness, the reduction rate, the roll gap, the entrance width, the rolling speed, the rolling temperature, and contents ofC, S
i, and M
n, respectively. There is only one node in the output layer, which is the deviation between the calculated value and the actual value of the mathematical model.


### 4.2.2. Precision of Network Training

The goal of improving the accuracy of the network can be achieved by increasing the number of hidden layers as well as the number of hidden layer nodes. The latter is simpler in implementation, so in this paper the hidden layer is fixed to one layer, and only the node number of the single hidden layer is automatically optimized. The node activation functions of both the hidden layer and output layer are Sigmoid functions.


### 4.2.3. Data Processing

The error data and the noise data will be removed before training. At the same time, the different variables represent different physical quantities, and their range may vary greatly, so all the data must be normalized to the same range of values. Because the activation function is the Sigmoid function, in order to avoid working in the flat area of the function, the data need to be transformed to 0.1–0.9. For this purpose, the following transformation is done on the data of the training sample set and the prediction sample set [17]. The new variable x
c is(17)
x
c
=
0.9
-
0.1
x
m
a
x
-
x
m
i
n
x
+
0.9
-
0.9
-
0.1
x
m
a
x
-
x
m
i
n
x
m
a
x
.After the weights are obtained by training uniform differential neural network, the output value of the output layer is obtained by using the prediction sample, and the rolling force deviation value must be obtained by the transformation:(18)
x
=
x
m
a
x
+
1.25
x
c
-
0.9
x
m
a
x
-
x
m
i
n
,where x
m
a
x and x
m
i
n are the maximum and minimum values of the normalized variables, respectively.


### 4.2.4. Parameter Setting

By using the uniform differential evolution algorithm, the code string for optimizing the structure and weights of the neural network consists of five parts: the number of the hidden nodes, the connection weights between the input layer and the hidden layer, the connection weights between the hidden layer and the output layer, the hidden layer threshold, and the output layer threshold. Set the numbers of input units, hidden units, and output units of the single hidden layer network to bem, p, and q, respectively.Because the number of the hidden nodes is indefinite, the length of code string is variable during network optimization, and inconvenience will be brought to the operator’s operation. At first, the maximum possible length of the code string is chosen to determine the maximum possible valuep
m
a
x and then gradually reduced to determine the optimal hidden layer node. In this paper, p
m
a
x
=
2
(
m
+
q
). According to the actual need, if we assume that the neurons of each layer are only connected to the neurons of its previous layer and there is no direct connection between the input and output, then the total number of connection weights is m
+
q
p
m
a
x.The total length of code stringH is(19)
H
=
m
+
q
+
1
p
m
a
x
+
q
+
1
.The total length of the code stringH includes all information about network structure, connection weights, and threshold values. The structure of uniform differential neural network code strings is shown as follows:(20)
H
1
,
H
2
,
…
,
H
p
Number of hidden nodes
W
i
j
i
=
1,2
,
…
,
m
;
j
=
1,2
,
…
,
p
Weights of input layer and hidden layer
V
j
t
j
=
1,2
,
…
,
p
;
t
=
1,2
,
…
,
q
Weights of hidden layer and output layer
θ
j
j
=
1,2
,
…
,
p
Hidden layer threshold
γ
t
t
=
1,2
,
…
,
q
Output layer threshold
.Let the sample pair of training set be the input and the expected output of the uniform differential neural network, calculate the error between the network output and the expected output, and take the error sum of squares as the fitness functionJ [18]:(21)
J
n
=
∑
k
=
1
N
∑
j
=
1
q
y
j
k
-
y
^
j
k
2
,where n is the nth individual in the population, N is the number of the sample sets of network input and output, q is the number of output layer nodes, y
j
(
k
) is expected output of the jth output node when the kth sample is input, and y
^
j
(
k
) is actual output of the jth output node when the kth sample is input.The other parameter settings of the uniform DE algorithm are as follows. The population size is 60, the maximum evolution generation is 2000,C
R
=
0.8, and F
=
0.5.The schematics of uniform DE algorithm optimizing neural network are shown in Figure4.Figure 4
Schematics of uniform DE algorithm optimizing neural network.


## 4.2.1. Design of Input Layer and Output Layer

The input and output layer node number of neural network is designed according to the requirement of the user. On the basis of the information required to ensure the accuracy of network prediction model, the system size should be reduced as much as possible so as to reduce the learning time and the complexity of the system. The basic form of rolling force mathematical model can be expressed asF
=
f
(
B
,
R
′
,
h
i
n
,
h
o
u
t
,
K
m
,
Q
p
), which means the rolling force is associated with the strip width, entrance thickness, exit thickness, roll diameter, stress state, and deformation resistance coefficient, while, according to the spring equation, the exit thickness is associated with the setting value of the roll gap. The stress state coefficient Q
p is related to flattening roll diameter and reduction rate. The deformation resistance K
m is related not only to the chemical composition of the metal materials but also to the plastic deformation (deformation temperature, deformation velocity, and deformation degree). Combined with these factors, the rolling force can be expressed as follows: (16)
F
=
f
B
,
R
,
h
i
n
,
ε
,
S
,
C
%
,
S
i
%
,
M
n
%
,
T
,
u
m
,where C
%, S
i
%, and M
n
% are the contents of M
n, S
i, and C in raw materials, respectively, which can reflect the characteristics of the material.Considering that the working roll radius is relatively stable in the process of steady state rolling, in order to reduce the complexity of the network, the parameterR is not set as the network input.Therefore, the following nine main factors affecting the rolling force are set as the input parameters of the network: the entrance thickness, the reduction rate, the roll gap, the entrance width, the rolling speed, the rolling temperature, and contents ofC, S
i, and M
n, respectively. There is only one node in the output layer, which is the deviation between the calculated value and the actual value of the mathematical model.


## 4.2.2. Precision of Network Training

The goal of improving the accuracy of the network can be achieved by increasing the number of hidden layers as well as the number of hidden layer nodes. The latter is simpler in implementation, so in this paper the hidden layer is fixed to one layer, and only the node number of the single hidden layer is automatically optimized. The node activation functions of both the hidden layer and output layer are Sigmoid functions.


## 4.2.3. Data Processing

The error data and the noise data will be removed before training. At the same time, the different variables represent different physical quantities, and their range may vary greatly, so all the data must be normalized to the same range of values. Because the activation function is the Sigmoid function, in order to avoid working in the flat area of the function, the data need to be transformed to 0.1–0.9. For this purpose, the following transformation is done on the data of the training sample set and the prediction sample set [17]. The new variable x
c is(17)
x
c
=
0.9
-
0.1
x
m
a
x
-
x
m
i
n
x
+
0.9
-
0.9
-
0.1
x
m
a
x
-
x
m
i
n
x
m
a
x
.After the weights are obtained by training uniform differential neural network, the output value of the output layer is obtained by using the prediction sample, and the rolling force deviation value must be obtained by the transformation:(18)
x
=
x
m
a
x
+
1.25
x
c
-
0.9
x
m
a
x
-
x
m
i
n
,where x
m
a
x and x
m
i
n are the maximum and minimum values of the normalized variables, respectively.


## 4.2.4. Parameter Setting

By using the uniform differential evolution algorithm, the code string for optimizing the structure and weights of the neural network consists of five parts: the number of the hidden nodes, the connection weights between the input layer and the hidden layer, the connection weights between the hidden layer and the output layer, the hidden layer threshold, and the output layer threshold. Set the numbers of input units, hidden units, and output units of the single hidden layer network to bem, p, and q, respectively.Because the number of the hidden nodes is indefinite, the length of code string is variable during network optimization, and inconvenience will be brought to the operator’s operation. At first, the maximum possible length of the code string is chosen to determine the maximum possible valuep
m
a
x and then gradually reduced to determine the optimal hidden layer node. In this paper, p
m
a
x
=
2
(
m
+
q
). According to the actual need, if we assume that the neurons of each layer are only connected to the neurons of its previous layer and there is no direct connection between the input and output, then the total number of connection weights is m
+
q
p
m
a
x.The total length of code stringH is(19)
H
=
m
+
q
+
1
p
m
a
x
+
q
+
1
.The total length of the code stringH includes all information about network structure, connection weights, and threshold values. The structure of uniform differential neural network code strings is shown as follows:(20)
H
1
,
H
2
,
…
,
H
p
Number of hidden nodes
W
i
j
i
=
1,2
,
…
,
m
;
j
=
1,2
,
…
,
p
Weights of input layer and hidden layer
V
j
t
j
=
1,2
,
…
,
p
;
t
=
1,2
,
…
,
q
Weights of hidden layer and output layer
θ
j
j
=
1,2
,
…
,
p
Hidden layer threshold
γ
t
t
=
1,2
,
…
,
q
Output layer threshold
.Let the sample pair of training set be the input and the expected output of the uniform differential neural network, calculate the error between the network output and the expected output, and take the error sum of squares as the fitness functionJ [18]:(21)
J
n
=
∑
k
=
1
N
∑
j
=
1
q
y
j
k
-
y
^
j
k
2
,where n is the nth individual in the population, N is the number of the sample sets of network input and output, q is the number of output layer nodes, y
j
(
k
) is expected output of the jth output node when the kth sample is input, and y
^
j
(
k
) is actual output of the jth output node when the kth sample is input.The other parameter settings of the uniform DE algorithm are as follows. The population size is 60, the maximum evolution generation is 2000,C
R
=
0.8, and F
=
0.5.The schematics of uniform DE algorithm optimizing neural network are shown in Figure4.Figure 4
Schematics of uniform DE algorithm optimizing neural network.


## 5. Simulation

After the data collection of a plate mill for a period of time, 300 sets of data with good shape are selected to form a set of training samples. The structural parameters and the weight thresholds of the neural network are optimized by the uniform DE algorithm. The number of the hidden layer neurons is 11, and Table1 shows the weights of the input layer and the hidden layer of the neural network.Table 1
Optimized input-to-hidden layer weights.
p
m
1
2
3
4
5
6
7
8
9
1
0.4456
−0.2414
0.1351
−0.0842
−0.4818
0.1771
0.9440
−0.0075
−0.4579
2
0.0448
0.1204
−0.0670
−0.7016
0.7175
0.1968
−0.4644
0.7049
0.9254
3
−0.3353
0.1644
−0.7372
0.2863
0.0220
0.5553
−0.3442
−0.1290
0.5077
4
−0.2948
0.1012
−0.2111
−0.5865
0.0200
0.4889
0.2332
−0.5547
0.6458
5
0.4114
−0.4637
0.1488
0.2867
0.0850
0.0605
0.1048
−0.8742
0.8624
6
0.8308
0.8013
−0.7589
0.2929
0.6459
−0.6507
0.0033
−0.0798
−0.6997
7
0.4553
−0.5299
−0.3334
0.6369
−0.3279
0.1081
0.1722
0.7468
0.3356
8
0.7016
−0.1118
0.8840
−0.1757
−0.3861
0.2471
−0.0591
0.4828
−0.3004
9
0.4182
0.2965
−0.3703
−0.3109
−0.5969
0.0480
0.6277
0.3526
−0.5174
10
0.3091
0.6404
−0.7189
0.2736
−0.0714
0.1908
0.0999
−0.1387
0.8122
11
0.0782
−0.1496
0.3921
0.2717
−0.8132
−0.0330
−0.3873
−0.9612
0.2904At the same time, the weights of the hidden layer and the output layer are 0.3193, −0.7575, −0.3996, −0.4072, −0.6635, 0.0252, 0.0334, 0.8492, 0.4070, −0.4100, and −0.5028, the hidden layer thresholds are −0.0879, −0.3755, −0.0685, 0.7466, −0.1059, 0.1128, 0.4648, 0.4294, 0.8185, −0.5616, and 0.4474, and the output layer threshold is 0.1540.The neural network optimized by uniform differential algorithm can effectively avoid falling into local minima and speed up the training speed of the network. As shown in Figure5, in the same accuracy (0.0045) requirements, the AtDE neural network uses 1430 iterations, and BP neural network uses at least 2000 iterations, which shows that the former is faster than the latter.Figure 5
Convergence speed comparison between BP neural network and AtDE neural network.According to the network structure of the above, the 80 sets of data are selected as the trial sample. As shown in Figure5, the accuracy of AtDE network is significantly higher than that of the conventional rolling force model, and the prediction error is within 5%, which can meet the accuracy requirements of the rolling force prediction. Figure 6 shows that the rolling force prediction value of the AtDE neural network model is more close to the actual value than that of the conventional model.Figure 6
Comparison between AtDE neural network model and the conventional model of rolling force prediction value and the measured value.


## 6. Conclusion

In this paper, a uniform differential evolution algorithm with good performance in high dimensional function optimization is used to optimize the structure and weight value of neural network, so as to constitute a uniform differential neural network, and then it is used to improve the accuracy of rolling force prediction in the process control system of medium and heavy plate. Specific research contents are as follows:(1)
The basic theory and its algorithm improvement measures of BP neural network are analyzed.
(2)
In view of some defects of BP neural network, the AtDE algorithm is constructed, and the structure parameters and the weights of the neural network are optimized by using uniform DE algorithm, accordingly the performance of the neural network is improved, and the algorithm foundation of the adaptive learning of plate rolling force is laid.
(3)
On the basis of analysis of the traditional rolling force prediction model, the method of applying neural network to the rolling force prediction is discussed, and the rolling force prediction model based on uniform differential neural network is established. The results show that the model can improve the prediction accuracy.



---

*Source: 6473137-2016-06-20.xml*