In recent years, immune genetic algorithm (IGA) is gaining popularity for finding the optimal solution for non-linear optimization problems in many engineering applications. However, IGA with deterministic mutation fa...In recent years, immune genetic algorithm (IGA) is gaining popularity for finding the optimal solution for non-linear optimization problems in many engineering applications. However, IGA with deterministic mutation factor suffers from the problem of premature convergence. In this study, a modified self-adaptive immune genetic algorithm (MSIGA) with two memory bases, in which immune concepts are applied to determine the mutation parameters, is proposed to improve the searching ability of the algorithm and maintain population diversity. Performance comparisons with other well-known population-based iterative algorithms show that the proposed method converges quickly to the global optimum and overcomes premature problem. This algorithm is applied to optimize a feed forward neural network to measure the content of products in the combustion side reaction of p-xylene oxidation, and satisfactory results are obtained.展开更多
基金Supported by the Major State Basic Research Development Program of China (2012CB720500)the National Natural Science Foundation of China (Key Program: U1162202)+1 种基金the National Natural Science Foundation of China (General Program:61174118)Shanghai Leading Academic Discipline Project (B504)
文摘In recent years, immune genetic algorithm (IGA) is gaining popularity for finding the optimal solution for non-linear optimization problems in many engineering applications. However, IGA with deterministic mutation factor suffers from the problem of premature convergence. In this study, a modified self-adaptive immune genetic algorithm (MSIGA) with two memory bases, in which immune concepts are applied to determine the mutation parameters, is proposed to improve the searching ability of the algorithm and maintain population diversity. Performance comparisons with other well-known population-based iterative algorithms show that the proposed method converges quickly to the global optimum and overcomes premature problem. This algorithm is applied to optimize a feed forward neural network to measure the content of products in the combustion side reaction of p-xylene oxidation, and satisfactory results are obtained.
