Research Article | Open Access

# Nonlinear Predictive Control of Mass Moment Aerospace Vehicles Based on Ant Colony Genetic Algorithm Optimization

**Academic Editor:**Vishal Bhatnaga

#### Abstract

Based on the mathematical model of the mass moment aerospace vehicles (MMAV), a coupled nonlinear dynamical system is established by rational simplification. The flight control system of MMAV is designed via utilizing nonlinear predictive control (NPC) approach. Aiming at the parameters of NPC is generally used the trial-and-error method to optimize and design, a novel kind of NPC parameters optimization strategy based on ant colony genetic algorithm (ACGA) is proposed in this paper. The method for setting NPC parameters with ACA in which the routes of ants are optimized by the genetic algorithm (GA) is derived. And then, a detailed realized process of this method is also presented. Furthermore, this optimization algorithm of the NPC parameters is applied to the flight control system of MMAV. The simulation results show that the system not only meets the demands of time-response specifications but also has excellent robustness.

#### 1. Introduction

The aerodynamic rudder control is generally used for the traditional flight missile in the atmosphere. But in upper air, especially in the exoatmospheric space above 30 kilometers, because of lower air density, the dynamic pressure becomes very low. In the far field of missile fighting, because the speed of missile reduces, the dynamic pressure is relatively low. This causes the dynamic characteristics of the missile to be decreased and the maneuverability to be weak. The weak maneuverability of the missile makes the missile miss the targets frequently and cannot meet the demands of precise guidance and control. This requests the new technical approach. In order to enhance the maneuverability, agility, and guidance precision of the antiaircraft missile, a new method of mass moment control is proposed in 2000 by USA. From the related literatures, the moving-mass-center control was studied by both Russia and USA. In the 1990s of the 20th century. But, because the maneuver control technology of the reentry warhead was kept secret extremely in the world, the public literatures and the related research are very few. The related research which can be seen in the literature has almost focused on reentry warhead at high Mach numbers. Several studies have suggested that mass moment control system (MMCS) appears to offer the greater design and cost advantages [1–8]. There are some advantages of mass moment control as follows. All the mechanism of MMCS is in aerospace vehicles, which will not affect the aerodynamic configuration and is better to accuracy of terminal attack. The actuators of MMCS are internal moving masses, which decrease the thermal load of aerodynamic configuration and avoid the gap on the surface of the vehicle and ablation steering surface. By using aerodynamic forces generated by high-speed flight of vehicle, we can decrease the energy consumption and get effective control avoiding conflict between fuel consumption and control moment generated by lateral jet engine.

The stability control mode of the three channels was used for MMAV in this paper. The two orthogonal moving masses were arranged on radial of MMAV, and another moving mass was arranged on axis. Each of the channels has strong coupled aerodynamic, control, inertia, and dynamics. So MMAV becomes one multivariable system model of the nonlinearity and uncertainty. A coupled nonlinear dynamic model is obtained by the rational simplification for this system. The nonlinear predictive control (NPC) of MMAV is investigated in the paper. By considering the insufficiency of NPC adjustment parameters, one parameter optimization method is proposed based on ant colony genetic algorithm (ACGA). With the merits of GA, this method has the global search ability, latent parallel computing, and simple computation process and can solve the contradiction of the optimal solution and the searching space. The contradiction of searching space and time performance is also overcome, which easy to convergent in nonglobal optimal solution and computing time too long when using ant colony algorithm (ACA) to solute optimization question. This method is applied to system design of flight control on MMAV.

During the last decade, much effort has been made in GA to investigate aerospace vehicles systems [9–18]. For instance, [9] demonstrates the advantages of using a real coded genetic algorithm (GA) for aerospace engineering design applications. In [10], in order to realize the high precision attitude determination of the space crafts by star sensors, an optimization method of star map distorted model based on improved genetic algorithm is presented. Reference [12] presented a new method in hierarchical genetic algorithms (HGAs) to speed up the optimization of aerodynamic shapes. In [13], an improved GA for airfoil shape parameterization is presented which takes into consideration the characteristics of viscous transonic flow particularly around the trailing edge. In [14], a novel parsimonious genetic programming (PGP) algorithm together with a novel aeroengine optimum data-driven dynamic start process model based on PGP is proposed. In order to obtain the global solution efficiently, [15] proposed a hybrid optimizer combining the advantages of a floating-coded genetic algorithm and simplex method. In [16], an optimization process, based on a genetic algorithm, is used to meet the frequency domain handling qualities requirements for the longitudinal plane. It is well known that GA cannot make good use of system feedback information. It often results in a lot of redundancy and reduces the computing efficiency. In contrast, ant colony algorithm accumulates and renews the optimal path information continuously. It has the ability of parallel processing and global searching. Many scholars have researched the hybrid algorithm including GA and ACA and got some good results in applications. For example, [19] gave an application of ant colony, genetic algorithm, and data mining-based techniques for scheduling. [20] used the hybrid algorithm in the contrast of images. Reference [21] addressed the optimization of cloud database route scheduling based on combination of GA and ACA. More results can be found from [22–28]. However, to the best of our knowledge, there are few works appeared to investigate the MMCS by the GA combined with ACA. This motivates the research in this paper.

This paper is organized as follows. The mathematical model of MMAV is derived in Section 2. In Section 3, nonlinear predictive control and its robustness analysis are employed to design MMCS. Ant colony genetic algorithm is applied to parameter optimization of MMCS in Section 4. In Section 5, simulation demonstrates the ability of the optimized controller to effectively control the MMAV’s motion. Conclusion is given in Section 6.

#### 2. The Mathematical Model of MMAV

##### 2.1. The General Dynamics Model of the MMAV

The basic principle by which MMCS is able to control the vehicle’s motion is to produce the control torque by using the aerodynamic forces and moving the masses within the MMAV to offset the c. m. of system.

Suppose that the MMAV includes moving masses and the mass of MMAV’s shell is . The mass of the th moving mass is . So, the total mass of MMAV is . The mass ratio of the th moving mass is . The coordinates in the body fixed frame are , . In the ground frame, the velocity of the center of MMAV is , and the acceleration is . Let the coordinates in the ground with the body fixed frame of the th moving mass be and the coordinates in the ground frame . There is the relationship , .

The coordinates of MMAV’s c. m. in the ground frame are given by

After derivation, the translational equation of the MMAV in the ground frame can be presented below:

Then, the translational equation of the MMAV in the body fixed frame is as follows: where is the transformation matrix from the body fixed frame to the ground frame and is the antisymmetric matrix of the angular velocity of the MMAV in the ground frame. is the antisymmetric matrix of the angular velocity of the MMAV in the body fixed frame.

Correspondingly, the force equation of the th moving mass in the body fixed frame is given by

According to D’lembert principle, the rotational equation in body coordinates is obtained as follows: where , is the antisymmetric matrix of the th moving mass in the body fixed frame representing the position coordinates .

##### 2.2. The Dynamics Model of the MMAV with Three Moving Masses

The structure diagram of the MMAV with three moving masses is shown in Figure 1. To quickly adjust the flying attitude and decrease coupling, one mass is fixed at -axis in the body fixed frame. Other two masses are fixed at -axis and -axis in radial direction through the MMAV’s axis.

The mass of the MMAV’s shell is . The mass of axial moving mass is , and the coordinate in the body fixed frame is . The mass of radial moving mass is , and the coordinate in the body fixed frame is . The mass of radial moving mass is , and the coordinate in the body fixed frame is . So, the total mass is , and the mass ratios are , , and , respectively.

This section derives the equations of motion fully accounted for the dynamic coupling between the four bodies. The moving masses are allowed to translate with respect to the MMAV’s shell but are not allowed to rotate with respect to the MMAV’s shell. Both the MMAV and the moving masses are assumed to be rigid bodies.

In the body fixed frame, the interaction between axial moving mass and MMAV is , the interaction between radial moving mass and MMAV is , and the interaction between radial moving mass and MMAV is . Equation (4) can be presented below:

The vector translational dynamics of MMAV can be obtained by (3) as follows:

The rotational dynamics of MMAV obtained by (5) are given by where the antisymmetric matrixes of position coordinates of the three moving masses in the body fixed frame are , , and , respectively.

Furthermore, the equations of motion of MMAV system also include some relative movement functions and nonlinear aerodynamic functions. The equations of motion clearly indicate that the MMCS is a complex nonlinear system which has the variable coefficients and large disturbances caused by the accelerations and velocities of masses.

#### 3. Nonlinear Predictive Control and Robustness Analysis

##### 3.1. Nonlinear Predictive Control

Consider the following MMAV nonlinear system [29]: where is the state variable, is the control input, and is the output to be controlled by the control input .

Reference output signals of the system are

Generally, , , and are chosen to be step signal.

Then the output tracking errors of the system are

According to the mathematical model forms of MMAV, select function is as follows: where , , and .

So, can be as the linear combination of the output tracking error, its differential term, and its integral term. Furthermore the choice from to should meet the following conditions: where , .

Derivation of function is

In order to obtain the predictive control law, the quadratic objective function is chosen as follows: is a positive definite symmetric matrix, is a positive semidefinite symmetric matrix, is a small positive number, and is the predictive value of at time . is expanded approximately at according to the first-order Taylor’s series:

In order to make least, set in (15). The control law is obtained below: when , and exist, substitute formula (17) into formula (16) and obtain formula (18) below:

Obviously, when , tends to zero. When and exist, also tends to be boundary by simulation. Because includes integral term of tracking error, the output tracking error tends to zero inevitably.

##### 3.2. Robustness Analysis of the System

Consider the uncertain nonlinear system where and are the parts of the nominal system and and are the uncertainty parts of the system.

Suppose that and are the known bounded continuous functions and and satisfy the following conditions:

Then, each term in (17) can be written as the following form: where , , and correspond to the known nominal system and , , and correspond to the uncertain parts of system.

Firstly, consider the situation is . According to the parameter of nominal system by formula (17), the control law is obtained by

Substitute formula (21) and formula (22) into formula (14):

Because of and , also is boundary which should be known.

Set as input and as output. The transfer functions are obtained by (12):

From formula (24), is strict stability convergence, is boundary input, and is boundary output inevitably. Because includes the integral term of should tend to zero ultimately.

To sum up, when is equal to 0, the system has strong robustness. Similarly, when , the system still has strong robustness by analysis above.

#### 4. Ant Colony Genetic Algorithm

##### 4.1. Optimization Principle of Ant Colony Algorithm

When ants in the nature seek foods or meet obstacles, they always can find one optimal route from their nests to food source or round the obstacles. The reason is that the ants can release one special secretion called pheromone on the roads which they pass through (pheromone, this material can volatilize gradually along with time); then the following ants may choose next route according to the pheromone which the fore ants leaved. The pheromone in one route is higher, and the number of times which should be selected is more. That is, the performance of this route will be superior, and the probability that the following ants choose this route will be larger. So, a positive feedback process of learning information is established by this way. At last, the optimal solution can be obtained [30–32]. The ant colony algorithm is based on this principle.

For formula (13), when control system is designed by nonlinear predictive control, the parameters to be optimized are , . In the generality, set and . So, only and need to be optimized.

##### 4.2. Generation of Nodes and Routes

By the inspiration of [33], the two parameters to be optimized are expressed in a plane for using the ant colony algorithm expediently. The graph is shown in Figure 2.

~ and ~ express and , respectively. According to the test results in [7], the initial value is and the initial value is 10.00. and are calculated, respectively, by the formulas below:

Take the fold line in Figure 2 as example. The expressed parameters are and .

##### 4.3. Establishment of the Objective Function

When the objective function is established, the dynamic performances of the system on establishing overload instructions should be made as basis according to system requests for design, which mainly consider system overshoot, the rise time, and the settling time. The objective function is defined as follows: where , , and are the overshoot, the rise time, and the settling time which guidance control system requested. , , and are the weight coefficients, respectively. Their values are , , and .

##### 4.4. The Choice of the Route Nodes

Suppose that it takes each ant the equal time to crawl from any node on line to the next any node on line and has nothing to do with the distance between the nodes. Therefore, if all ants start from the origin of coordinates, they will simultaneously arrive at each line ( = 1~9). Finally, they will also simultaneously arrive at their end points on the line . Then, one circulation is completed. Define to express the remaining pheromone on node at . The pheromone is equal on each node in the initial time. In order to make the algorithm search more feasible solutions in the preliminary stage, and are set at initialization. Suppose that expresses the probability in which the ant crawls from any node on to node at ; then

in which is the visibility on node , where the value is obtained as the following method. In the first circulation of ant colony algorithm, is given by the -coordinate value of each node which and map in Figure 2. In each circulation later, is given by the -coordinate value of each node in which and correspond to the optimal route produced in the previous circulation (the optimal performances in previous circulation) map in Figure 2.

##### 4.5. Renewal and Limitation of the Pheromone

Suppose that at initial time; all ants are located at the origin of coordinates . After 9 units of time, all ants crawl from the initial point to the end point. The pheromone in the route may be adjusted by the following formula:

For using more optimal solution information during the running period of algorithm, the renewal and limitary mechanism of the pheromone can use the maximal minimal ant system (MMAS), in which only the one optimal ant can increase pheromone after each iterative. And there is : represents the optimal objective function value in this circulation. It can be calculated by (27).

##### 4.6. The Steps of Optimizing MMCS Parameter Using ACGA

The hybridization of AC and GA has been studied in many works. The methods have been successfully applied to diverse combinatorial optimization problems including traveling salesman, quadratic assignment, vehicle routing, telecommunication networks, image processing, constraint satisfaction, and scheduling. Recently, researchers have been dealing with the relation of ACGA to the fields of optimal control and reinforcement learning, in which, with the merits of GA, this method has the global search ability, latent parallel computing, and simple computation process and can solve the contradiction of the optimal solution and the searching space. It also can overcome the contradiction of searching space and time performance, in contrast with easing to converge to nonglobal optimal solution and computing time too long when using AC to solute optimization question. So, the control parameters optimization method of MMAV is proposed based on ACGA. The goals are to meet the demands of time-response specifications and improve the robustness for MMCS. Several studies have suggested that MMCS appears to offer the greater design and cost advantages in flight vehicles control. We present the mathematical modeling process of MMAV and describe the method of nonlinear predictive control for MMCS. But it is very difficult to design the MMCS because there are many parameters to adjust manually. In this paper, a new method is proposed using ACGA, by which automatic parameter optimization can be realized instead of manually adjusting.

When the MMCS parameters are optimized by the ant colony algorithm, the variation operation of GA can be used for the second optimization of the obtained result [19, 34]. That is, to avoid to fall into partial optimal by using ant colony algorithm to obtain a group partial solution that makes the objective function expressed by formula (27) is minimal. Then, the coding is carried on (the binary system is used in this paper), and the variation of certain digits is caused stochastically. If the variation solution surpasses the original solution in genetic and variation process, then the variation solution is retained. Otherwise, the original solution is used. After this variation, seeking in the partial minimal region can be jumped out, and the quality of solutions can be enhanced; the convergence velocity of the optimal solution is speeded up. So, ACGA can realize the highly effective, fast, and complete seeking to the search space.

The basic steps to optimize MMCS parameters with ACGA are described as follows:

*Step 1. *Initialize the MMCS parameters and the correlation ACGA parameters. The initial values of and can be seen above.

*Step 2. *Set ant number as . Define the one-dimensional array *Routek* including 9 elements for each ant. The -coordinate values of 9 nodes which the ant will pass through are saved in this array, that is, the route of the ant crawling.

*Step 3. *Make time counter and cycle number . Define the biggest cycle number and the pheromone values on each node at initial time; set . Put all the ants at the initial station .

*Step 4. *Set .

*Step 5. *Compute the transfer probabilities that the ant moves to each node on the line by formula (28). According to these probabilities, a node for each ant on the line is chosen by roulette principle, and the ant also will be moved to this node. Simultaneously, the -coordinate value of this node is saved in th element of *Routek*.

*Step 6. *Set . If there is , jump to Step 4. Otherwise, jump to Step 7.

*Step 7. * and corresponding to this route are calculated by formula (25) and formula (26) according to *Routek,* that is, the routes passed by the ants. The dynamic performances , and can be calculated by carrying on computer simulation applying these parameters to the MMCS system of MMAV. Then, the objective function corresponding to the ant is calculated by formula (27), and is obtained. The optimal solution is saved in this circulation. The MMCS parameters corresponding to these also are saved into and . Then, the second optimization is carried on by GA. The optimal solution from the original solution and the mutation solution is chosen.

*Step 8. *Set and . According to formula (30) and formula (31), the pheromones on each node are renewed, and *Routek* is reset to zero.

*Step 9. *If and the whole ant colony is not convergent to one route, all ants will be put at the initial station again, and then jump to Step 4. If , but the whole ant colony converges to one same route, the algorithm will be ended and the corresponding optimized MMCS parameters and are achieved.

#### 5. Simulation Result and Discussion

Because the control performances of MMAV need to be realized through an axial moving mass and two-radial-moving-mass to and fro movement on the guide rail, the control effects of the system directly are affected by the characteristics of servo system. So, in the design of MMCS, the dynamic characteristics of servo system have to be considered.

Considering the band width of the measure elements for system (accelerometer and rate gyro) is relatively large, the simplification model of the servo system is obtained by repeated test: where and to the axial moving mass, and to the radial moving mass. Simultaneously, the saturated constraints of the displacements should be considered for the whole design assigns when the system is tested.

According to the ant colony genetic algorithm proposed in this paper to carry on parameter optimization, the final parameters of MMAV in nonlinear predictive control system are shown in Figure 2. Simultaneously, 6DOF mathematical simulation of MMAV was carried on. The signals and in the flight control system are obtained by the second-order filter. The simulation results in which the aerodynamic parameters have uncertainty are shown at length of article limited and the system design results in nominal state as the foundation. The simulation graphs are shown in Figures 3 and 4, which are state responses of MMAV using NPC with the original GA and ACGA, respectively. The time response and system stability of ACGA are better than those of the original GA. The simulation curves of the normal overload and each control of MMAV are only shown in this paper (because the radial moving mass is symmetry, the displacement curves of axis and axis for the moving mass are the same). (Only the displacement curve of axis for the moving mass is given). From the graphs, the displacement of the axial moving mass is limited in the scope , and the displacements of the two radial moving masses are limited in the scope . That flight control of MMAV may be realized by only very short displacement of the moving mass. The dynamic performances of control system for MMAV still satisfy the design requests although aerodynamic parameters have been changed with their nominal values.

As shown in simulation results, the nonlinear predictive control is proposed to design MMCS, in which controller parameters are optimized with the original GA and ACGA. The simulation results show that MMCS with ACGA has better dynamic behavior and strong robustness than that with the original GA. This approach can improve the robustness of MMCS and make it work effectively. The theoretical analysis and the simulation results of the flight control system for MMAV show that the strategy of the NPC parameter optimization based on the ant colony genetic algorithm proposed in this paper is effective and feasible. The algorithm of the flight control system for MMAV designed by using NPC based on ACGA optimization is simple. Moreover, the dynamic performances of the system satisfy the design requests completely and also have strong robustness. Simultaneously, the time is saved. The optimization algorithm proposed in this paper does not rely on the precise mathematical model of MMAV and makes processing question more flexible, adaptable, and robust. This method can not only improve the quality of control system design but also reduce the design difficulty and may solve optimization problems of the control system parameters which are designed by other control methods. So, it has important reference value in the control engineering domain.

#### 6. Conclusion

An autopilot for a nonlinear six-degree-of-freedom MMAV is introduced in this paper. Because the stability control system used by MMAV with three moving masses is three-channel, and the deduced mathematical model is too complicated, the dynamical model of MMAV is still a nonlinear system after reasonable simplification. Therefore, this control system is hard to design. The nonlinear predictive control method is proposed to design MMCS, in which controller parameters are optimized based on ACGA. This approach can improve the robustness of MMCS and make it work effectively. The simulation results show that MMCS has good dynamic behavior and strong robustness. As for the mechanism of mass moment control, it is very complicated and the related research is only in the beginning. The public references are insufficient; we only give some useful discussion about the control system design method of MMAV in this paper.

#### Conflict of Interests

The authors declare that there is no conflict of interests regarding the publication of this paper.

#### Acknowledgments

This work is supported by Natural Science Foundation of Heilongjiang Province of China (F201221), Training Program of Harbin Engineering University for National Natural Science Foundation of China and Fundamental Research Funds for the Central Universities of China (HEUCF100417, HEUCF130402).

#### References

- T. Petsopoulos and F. J. Regan, “A moving-mass roll control system for a fixed-trim reentry vehicle,” in
*Proceedings of the 32nd Aerospace Sciences Meeting*, January 1994, AIAA paper no. 94-0033. View at: Google Scholar - R. Byrne, B. R. Sturgis, and R. D. Robinett, “A moving mass trim control system for reentry vehicle guidance,” in
*Proceedings of the 21st Atmospheric Flight Mechanics Conference*, 1996, AIAA-96-3438-CP. View at: Google Scholar - R. D. Robinett III, B. R. Sturgis, and S. A. Kerr, “Moving mass trim control for aerospace vehicles,”
*Journal of Guidance, Control, and Dynamics*, vol. 19, no. 5, pp. 1064–1070, 1996. View at: Google Scholar - C. A. Woolsey and N. E. Leonard, “Moving mass control for underwater vehicles,” in
*Proceedings of the American Control Conference*, pp. 2824–2829, May 2002. View at: Google Scholar - P. K. Menon, S. S. Vaddi, and E. J. Ohlmeyer, “Finite-horizon robust integrated guidance-control of a moving-mass actuated kinetic warhead,” in
*Proceedings of the AIAA Guidance, Navigation, and Control Conference*, pp. 5279–5291, August 2006, AIAA 2006-6787. View at: Google Scholar - J.-W. Li, B.-W. Song, and C. Shao, “Tracking control of autonomous underwater vehicles with internal moving mass,”
*Acta Automatica Sinica*, vol. 34, no. 10, pp. 1319–1323, 2008. View at: Publisher Site | Google Scholar | MathSciNet - X.-Y. Zhang, Y.-Z. He, and Z.-C. Wang, “Robust control of mass moment interception missile based on
*H*_{∞}performance characteristics,”*Acta Aeronautica et Astronautica Sinica*, vol. 28, no. 3, pp. 634–640, 2007. View at: Google Scholar - J. Liu, X. Gao, and Y. Ma, “Study on guidance and control technology of mass moment vehicle,” in
*Proceedings of the IEEE International Conference on Control and Automation (ICCA '09)*, pp. 679–684, December 2009. View at: Publisher Site | Google Scholar - J. D. Dyer, R. J. Hartfield, G. V. Dozier, and J. E. Burkhalter, “Aerospace design optimization using a steady state real-coded genetic algorithm,”
*Applied Mathematics and Computation*, vol. 218, no. 9, pp. 4710–4730, 2012. View at: Publisher Site | Google Scholar - Q. Wei, F. Jiancheng, and Z. Weina, “A method of optimization for the distorted model of star map based on improved genetic algorithm,”
*Aerospace Science and Technology*, vol. 15, no. 2, pp. 103–107, 2011. View at: Publisher Site | Google Scholar - E. T. Turgut and M. A. Rosen, “Relationship between fuel consumption and altitude for commercial aircraft during descent: preliminary assessment with a genetic algorithm,”
*Aerospace Science and Technology*, vol. 17, no. 1, pp. 65–73, 2012. View at: Publisher Site | Google Scholar - J. F. Wang, J. Periaux, and M. Sefrioui, “Parallel evolutionary algorithms for optimization problems in aerospace engineering,”
*Journal of Computational and Applied Mathematics*, vol. 149, no. 1, pp. 155–169, 2002. View at: Publisher Site | Google Scholar - A. Shahrokhi and A. Jahangirian, “Airfoil shape parameterization for optimum Navier-Stokes design with genetic algorithm,”
*Aerospace Science and Technology*, vol. 11, no. 6, pp. 443–450, 2007. View at: Publisher Site | Google Scholar - Y.-H. Li and X.-K. Wei, “Linear-in-parameter models based on parsimonious genetic programming algorithm and its application to aero-engine start modeling,”
*Chinese Journal of Aeronautics*, vol. 19, no. 4, pp. 295–303, 2006. View at: Google Scholar - Y.-Z. Luo, G.-J. Tang, and H.-Y. Li, “Optimization of multiple-impulse minimum-time rendezvous with impulse constraints using a hybrid genetic algorithm,”
*Aerospace Science and Technology*, vol. 10, no. 6, pp. 534–540, 2006. View at: Publisher Site | Google Scholar - R. Fantinutto, G. Guglieri, and F. B. Quagliotti, “Flight control system design and optimisation with a genetic algorithm,”
*Aerospace Science and Technology*, vol. 9, no. 1, pp. 73–80, 2005. View at: Publisher Site | Google Scholar - Y. V. Pehlivanoglu and B. Yagiz, “Aerodynamic design prediction using surrogate-based modeling in genetic algorithm architecture,”
*Aerospace Science and Technology*, vol. 23, no. 1, pp. 479–491, 2012. View at: Publisher Site | Google Scholar - Y. V. Pehlivanoglu, “A new vibrational genetic algorithm enhanced with a Voronoi diagram for path planning of autonomous UAV,”
*Aerospace Science and Technology*, vol. 16, no. 1, pp. 47–55, 2012. View at: Publisher Site | Google Scholar - S. Kumar and C. S. P. Rao, “Application of ant colony, genetic algorithm and data mining-based techniques for scheduling,”
*Robotics and Computer-Integrated Manufacturing*, vol. 25, no. 6, pp. 901–908, 2009. View at: Publisher Site | Google Scholar - P. Hoseini and M. G. Shayesteh, “Efficient contrast enhancement of images using hybrid ant colony optimisation, genetic algorithm, and simulated annealing,”
*Digital Signal Processing*, vol. 23, no. 3, pp. 879–893, 2013. View at: Publisher Site | Google Scholar | MathSciNet - Y.-H. Zhang, L. Feng, and Z. Yang, “Optimization of cloud database route scheduling based on combination of genetic algorithm and ant colony algorithm,”
*Procedia Engineering*, vol. 15, pp. 3341–3345, 2011. View at: Google Scholar - W. Zhang and T. Lu, “The research of genetic ant colony algorithm and its application,”
*Procedia Engineering*, vol. 37, pp. 101–106, 2012. View at: Publisher Site | Google Scholar - Z.-J. Lee, S.-F. Su, C.-C. Chuang, and K.-H. Liu, “Genetic algorithm with ant colony optimization (GA-ACO) for multiple sequence alignment,”
*Applied Soft Computing Journal*, vol. 8, no. 1, pp. 55–78, 2008. View at: Publisher Site | Google Scholar - A. Ghanbari, M. Kazemi, F. Mehmanpazir, and M. M. Nakhostin, “A Cooperative Ant Colony Optimization-Genetic Algorithm approach for construction of energy demand forecasting knowledge-based expert systems,”
*Knowledge-Based Systems*, vol. 39, pp. 194–206, 2013. View at: Publisher Site | Google Scholar - B. Hemmateenejad, M. Shamsipur, V. Zare-Shahabadi, and M. Akhond, “Building optimal regression tree by ant colony system-genetic algorithm: application to modeling of melting points,”
*Analytica Chimica Acta*, vol. 704, no. 1-2, pp. 57–62, 2011. View at: Publisher Site | Google Scholar - S. R. Jangam and N. Chakraborti, “A novel method for alignment of two nucleic acid sequences using ant colony optimization and genetic algorithms,”
*Applied Soft Computing Journal*, vol. 7, no. 3, pp. 1121–1130, 2007. View at: Publisher Site | Google Scholar - T. Keskinturk, M. B. Yildirim, and M. Barut, “An ant colony optimization algorithm for load balancing in parallel machines with sequence-dependent setup times,”
*Computers and Operations Research*, vol. 39, no. 6, pp. 1225–1235, 2012. View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNet - S. Akpınar, G. M. Bayhan, and A. Baykasoglu, “Hybridizing ant colony optimization via genetic algorithm for mixed-model assembly line balancing problem with sequence dependent setup times between tasks,”
*Applied Soft Computing*, vol. 13, no. 1, pp. 574–589, 2013. View at: Google Scholar - G. Xu, T. Li, X. Zhang, and L. Zhang, “Modeling and motion analysis of a missile based on mass moment control,”
*Journal of Harbin Engineering University*, vol. 32, no. 12, pp. 1588–1593, 2011. View at: Publisher Site | Google Scholar - H.-B. Duan,
*Ant Colony Algorithms: Theory and Applications*, Science Press, Beijing, China, 2005. - R. J. Mullen, D. Monekosso, S. Barman, and P. Remagnino, “A review of ant algorithms,”
*Expert Systems with Applications*, vol. 36, no. 6, pp. 9608–9617, 2009. View at: Publisher Site | Google Scholar - M. H. Afshar, “A parameter free Continuous Ant Colony Optimization Algorithm for the optimal design of storm sewer networks: constrained and unconstrained approach,”
*Advances in Engineering Software*, vol. 41, no. 2, pp. 188–195, 2010. View at: Publisher Site | Google Scholar - G.-Z. Tan and W.-B. Li, “Design of ant algorithm-based optimal PID controller and its application to intelligent artificial leg,”
*Journal of Central South University of Technology*, vol. 35, no. 1, pp. 91–96, 2004. View at: Google Scholar - Y.-H. Zhang, L. Feng, and Z. Yang, “Optimization of cloud database route scheduling based on combination of genetic algorithm and ant colony algorithm,”
*Procedia Engineering*, vol. 15, pp. 3341–3345, 2011. View at: Google Scholar

#### Copyright

Copyright © 2013 Xiaoyu Zhang et al. 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.