The solutions of dynamic optimization problems are usually very difficult due to their highly nonlinear and multidimensional nature. 13enetic algorithm （GA） has been proved to be a teasibte method when the gradient ...The solutions of dynamic optimization problems are usually very difficult due to their highly nonlinear and multidimensional nature. 13enetic algorithm （GA） has been proved to be a teasibte method when the gradient is difficult to calculate. Its advantage is that the control profiles at all time stages are optimized simultaneously, but its convergence is very slow in the later period of evolution and it is easily trapped in the local optimum. In this study, a hybrid improved genetic algorithm （HIGA） for solving dynamic optimization problems is proposed to overcome these defects. Simplex method （SM） is used to perform the local search in the neighborhood of the optimal solution. By using SM, the ideal searching direction of global optimal solution could be found as soon as possible and the convergence speed of the algorithm is improved. The hybrid algorithm presents some improvements, such as protecting the best individual, accepting immigrations, as well as employing adaptive crossover and Ganssian mutation operators. The efficiency of the proposed algorithm is demonstrated by solving several dynamic optimization problems. At last, HIGA is applied to the optimal production of secreted protein in a fed batch reactor and the optimal feed-rate found by HIGA is effective and relatively stable.展开更多
基金Supported by Major State Basic Research Development Program of China （2012CB720500）, National Natural Science Foundation of China （Key Program： Ul162202）, National Science Fund for Outstanding Young Scholars （61222303）, National Natural Science Foundation of China （21276078, 21206037） and the Fundamental Research Funds for the Central Universities.
文摘The solutions of dynamic optimization problems are usually very difficult due to their highly nonlinear and multidimensional nature. 13enetic algorithm （GA） has been proved to be a teasibte method when the gradient is difficult to calculate. Its advantage is that the control profiles at all time stages are optimized simultaneously, but its convergence is very slow in the later period of evolution and it is easily trapped in the local optimum. In this study, a hybrid improved genetic algorithm （HIGA） for solving dynamic optimization problems is proposed to overcome these defects. Simplex method （SM） is used to perform the local search in the neighborhood of the optimal solution. By using SM, the ideal searching direction of global optimal solution could be found as soon as possible and the convergence speed of the algorithm is improved. The hybrid algorithm presents some improvements, such as protecting the best individual, accepting immigrations, as well as employing adaptive crossover and Ganssian mutation operators. The efficiency of the proposed algorithm is demonstrated by solving several dynamic optimization problems. At last, HIGA is applied to the optimal production of secreted protein in a fed batch reactor and the optimal feed-rate found by HIGA is effective and relatively stable.
