Article

ANNSA: a hybrid artificial neural network/simulated annealing algorithm for optimal control problems

Department of Chemical Engineering, Indian Institute of Science, Bangalore 560012, India
Chemical Engineering Science (Impact Factor: 2.61). 07/2003; 58(14):3131-3142. DOI: 10.1016/S0009-2509(03)00168-4

ABSTRACT This paper introduces a numerical technique for solving nonlinear optimal control problems. The universal function approximation capability of a three-layer feedforward neural network has been combined with a simulated annealing algorithm to develop a simple yet efficient hybrid optimisation algorithm to determine optimal control profiles. The applicability of the technique is illustrated by solving various optimal control problems including multivariable nonlinear problems and free final time problems. Results obtained for the different case studies considered agree well with those reported in the literature.

0 Followers
 · 
75 Views
  • [Show abstract] [Hide abstract]
    ABSTRACT: Two general approaches are adopted in solving dynamic optimization problems in chemical processes, namely, the analytical and numerical methods. The numerical method, which is based on heuristic algorithms, has been widely used. An approach that combines differential evolution (DE) algorithm and control vector parameterization (CVP) is proposed in this paper. In the proposed CVP, control variables are approximated with polynomials based on state variables and time in the entire time interval. Region reduction strategy is used in DE to reduce the width of the search region, which improves the computing efficiency. The results of the case studies demonstrate the feasibility and efficiency of the proposed methods.
    Chinese Journal of Chemical Engineering 01/2013; 21(1):64–71. DOI:10.1016/S1004-9541(13)60442-5 · 0.87 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: The solutions of dynamic optimization problems are usually very difficult due to their highly nonlinear and multidimensional nature. Genetic algorithm (GA) has been proved to be a feasible 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 Gaussian 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.
    Chinese Journal of Chemical Engineering 02/2013; 21(2):144–154. DOI:10.1016/S1004-9541(13)60452-8 · 0.87 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: An approach that combines genetic algorithm (GA) and control vector parameterization (CVP) is proposed to solve the dynamic optimization problems of chemical processes using numerical methods. In the new CVP method, control variables are approximated with polynomials based on state variables and time in the entire time interval. The iterative method, which reduces redundant expense and improves computing efficiency, is used with GA to reduce the width of the search region. Constrained dynamic optimization problems are even more difficult. A new method that embeds the information of infeasible chromosomes into the evaluation function is introduced in this study to solve dynamic optimization problems with or without constraint. The results demonstrated the feasibility and robustness of the proposed methods. The proposed algorithm can be regarded as a useful optimization tool, especially when gradient information is not available.
    Engineering Optimization 09/2013; 45(9). DOI:10.1080/0305215X.2012.720683 · 1.23 Impact Factor

Full-text (2 Sources)

Download
75 Downloads
Available from
May 27, 2014