Journal of Control Science and Engineering

Volume 2015 (2015), Article ID 502828, 7 pages

http://dx.doi.org/10.1155/2015/502828

## System Identification of Heat-Transfer Process of Frequency Induction Furnace for Melting Copper Based on Particle Swarm Algorithm

Department of Electronic Engineering, Fudan University, Shanghai 200433, China

Received 28 October 2014; Revised 17 February 2015; Accepted 17 February 2015

Academic Editor: Hung-Yuan Chung

Copyright © 2015 Zhi-gang Jia and Xing-xuan Wang. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

#### Abstract

An adaptive evolutionary strategy in standard particle swarm optimization is introduced. Adaptive evolution particle swarm optimization is constructed to improve the capacity of global search. A method based on adaptive evolution particle swarm optimization for identification of continuous system with time delay is proposed. The basic idea is that the identification of continuous system with time delay is converted to an optimization of continuous nonlinear function. The adaptive evolution particle swarm optimization is utilized to find an optimal solution of continuous nonlinear function. Convergence conditions are given by the convergence analysis based on discrete time linear dynamic system theory. Numerical simulation results show that the proposed method is effective for a general continuous system with time delay and the system of heat-transfer process of frequency induction furnace for melting copper.

#### 1. Introduction

Frequency induction furnace has been developed into a kind of smelting equipment widely used. It is composed of four main parts: furnace body, electrical system, water cooling system, and hydraulic system [1]. Its power supply is industrial frequency (50 or 60 Hz) current. The research object in this paper is a vertical frequency induction furnace in a copper company. After adding raw material, workers regulate transformer output-voltage so that material melts. Copper smelting and heat preservation need lower transformer output-voltage. The molten copper is kept in proper temperature. Finally pour the molten copper [2].

The heat-transfer process in frequency induction furnace system consists of copper melting process and heat-transfer process of molten copper to furnace wall. The approximation of most industrial processes is low-order continuous system. For the sake of convenience, the approximations of those two processes are first-order continuous systems, respectively [2]. The following mathematical model can be set up by frequency induction furnace input voltage and measured data of furnace wall temperature where , , and denote heat-transfer gain, time constant of the process of copper melting, and time constant of heat-transfer process of molten copper to furnace wall [2]. But this industrial process has time delay. Therefore time delay is introduced to model (1) in literature [1]. The mathematical model of frequency induction furnace heat-transfer process is proposed as follows: The controller design of frequency induction furnace heat-transfer process needs identification of system (2).

Identification methods of second-order system with time delay in literature [3–6] set up identification model by integral computation of step response and measured data of input signal in time domain. Then identify parameters though Newton-Raphson method and least square method. Methods in literature [3–6] can only be used for second-order system with time delay.

The continuous system identification methods based on particle swarm optimization (PSO) proposed in this paper are effective for general continuous system with time delay. The input signal has no limitation.

#### 2. Adaptive Evolution PSO (AEPSO)

##### 2.1. Standard PSO

The particle swarm optimization algorithm is a new evolutionary computation method proposed by Kenndy and Eberhart in 1995. It is a simulation of the natural phenomenon of a flock of birds searching for food. As a key optimization technique, PSO has been used extensively in many fields, including function optimization, neutral network, and fuzzy system control [7]. PSO algorithm belongs to the evolutionary algorithm similar to genetic algorithm. It starts from the random solutions and searches for the optimal solution through iteration [8].

In dimensional solution space, the position of th particle can be expressed as a dimensional vector The velocity vector of th particle is expressed as follows: The position of the optimal solution of th particle can be expressed as a dimensional vector as follows: The position of the optimal solution of the swarm which has the maximum fitness value in the swarm can be expressed as follows: The dynamic range of the particles is as follows: The dynamic range of the velocity of the particles is as follows: is a real function which is defined in dimensional space. The fitness value of th particle can be expressed as follows: Particles’ velocity and position are updated from generation to according to the following equations: where and are random number from 0 to 1. and are local learning factor and global learning factor, respectively. is larger than generally. is inertia weight.

Studies show that the standard PSO algorithm can find the local optimal solution quickly, but it also can produce premature convergence phenomenon. Each particle adjusts its search direction based on individual optimal position and global optimal position in standard PSO algorithm. But particles are more and more close to the global optimal particle along with iteration. Thus particles’ velocity decreases and tends to zero gradually. So this particle swarm loses ability to evolve further. The standard PSO is considered to be convergent at this time. In many cases, the convergence results do not converge to the global optimal solution, not even converge to a local optimal solution sometimes [9].

In order to avoid premature convergence phenomenon, many improved PSO algorithms have been proposed. These algorithms tend to focus on improving inertia weight or introduce special mutation operation to particles [10]. This paper will introduce adaptive inertia weight and special mutation operation to the swarm to avoid premature convergence phenomenon.

##### 2.2. The Introduction of Adaptive Inertia Weight

PSO algorithm which has introduced adaptive inertia weight needs to do the following modifications. Equation (10) can be modified as follows:

Time-varying inertia weight has been used in (12). If a linear decreasing inertia weight is used in iterative process, the PSO algorithm has good global search capability in the beginning and has a good local search ability in the later stage [11]. A good global search capability makes the PSO algorithm locate the area around the global optimal solution quickly in the beginning. The good local search ability makes the PSO algorithm obtain the global optimal solution accurately in the later stage. The adaptive inertia weight can be determined by the following equation in iteration: where is the number of evolution generation. and are constants. Let adaptive inertia weight vary in the range of . and are usually 0.9 and 0.1, respectively, according to experience.

##### 2.3. Mutation Operation

Mutation operation is a natural biological model of gene mutation induced by various accidental factors in genetic environment. It takes very small probability to change the position of the particle randomly. In order to obtain high quality optimal solution as far as possible, mutation operation must be taken. Mutation operation plays an auxiliary role in the genetic algorithm but is a necessary operation step of genetic algorithm. In this paper, the basic mutation strategy of genetic algorithm is introduced to the standard PSO algorithm [12]. The particles which will do mutation operation are selected according to the probability. Then the positions of the selected particles do mutation operation. The position density distribution model of each particle is considered to be uniform distribution density function in this paper [13] where denotes th parameter of th mutation particle. Then a new particle can have the following representation: where is a random variable which satisfies uniform distribution in the range of .

AEPSO consists of the following steps.(1)Initialization: generate particles in dimensional solution space which have random position and velocity vectors.(2)Fitness evaluation: calculate the fitness value of th particle and find out the optimal particle in the swarm which has the maximum fitness value, .(3)Updating of particles’ position and velocity: update the position and velocity of each particle with (12) and (11), respectively. Check whether the position and velocity of each particle are out of bounds.(4)Mutation operation: the positions of particles do mutation operation with (15).(5)Comparison of current fitness value of th particle and individual optimal fitness value of th particle : if , then .(6)Comparison of current fitness value of th particle and global optimal fitness value of the swarm : if , then .(7)Checking criterion for stopping iteration of algorithm: if the criterion is satisfied, the iteration of the algorithm is stopped. Otherwise, go to Step 3 and continue searching for the optimal solution until the criterion is satisfied.

#### 3. System Identification of General Continuous System with Time Delay

Consider the general continuous system as follows: where . The time delay of such a general continuous system needs approximate processing according to the identification method of second-order continuous system with time delay in literature [3]. The time delay can be represented by Taylor series as follows:

Now the parameter identification of becomes very difficult. After approximate processing, has high math power. The form of the general continuous system will become complicated after multiplication. Parameters of second-order continuous system with time delay can be identified well by Newton-Raphson method. But it does not work well for high-order system. The identification of the general continuous system can be converted to optimization of nonlinear function. Then the AEPSO algorithm mentioned in this paper can be used to solve this optimization problem. The parameters which need to be identified can be expressed as the following vector: The nonlinear function which needs to be optimized can be expressed as follows: where is the measured output vector of real system. is calculated output vector of estimation model. The fitness function can be expressed as follows: Therefore the parameter identification problem of general continuous system can be regarded as a standard optimization problem, minimization of (19) according to the input and output sequences. Search for the parameter vector which can minimize (19) in dimensional space.

#### 4. Analysis of Convergence

Analyze one element of the parameter vector without loss of generality: Equations (21) can be simplified as follows: Equations (22) can be converted into the following discrete dynamic system: The individual optimal position of a particle and the global optimal position of the swarm are usually unchangeable. The above two equations can be simplified as follows: So the above system can be rewritten as a discrete autonomous system: where , .

The equilibrium in Lyapunov sense can be obtained by the following equations: If , there is only one equilibrium. The characteristic equation of autonomous system can be expressed as follows: Characteristic root is the two following equations:

Theorem 1. *The sufficient and necessary condition of autonomous system (25) converging to the equilibrium state is as follows:
**
Therefore the sufficient and necessary condition can be obtained as follows:
*

*5. Numerical Simulation*

*5.1. Experiment One*

*Consider the following third-order continuous system with time delay. The input signal is random signal sequence with amplitude of 4:
There are six parameters needed to be identified. They can be expressed as the following vector:
*

*The settings of identification method based on AEPSO algorithm are as follows. The identification window is set to 1000. The number of particles . The number of iteration generations Times = 1000. The local learning factor . The global learning factor . The inertia weight decreases form 0.9 to 0.1 with the iteration. The search range of parameters mentioned above is .*

*The results of the nonlinear function needing to be optimized are shown in Figure 1.*