The solution of singular optimal control problems using the modified line-up competition algorithm with region-relaxing strategy.

In this study, singular optimal control problems are solved by line-up competition algorithm (LCA) under the framework of control parametrization. Two steps that promote the convergence quality of LCA are taken. One is to use normal (Gaussian) sampling policy to replace uniform sampling policy to accelerate initial convergence, while the other is to introduce region-relaxing strategy to enhance the refinement of solutions in final convergence. Four typical examples are given to illustrate the proposed algorithm. The results show that such modifications make LCA more robust and efficient in the solutions of singular optimal control problems.

[1]  Rein Luus,et al.  Choosing grid points in solving singular optimal control problems by iterative dynamic programming , 2007 .

[2]  Daim-Yuang Sun,et al.  Integrating Controlled Random Search into the Line-Up Competition Algorithm To Solve Unsteady Operation Problems , 2008 .

[3]  Kun Shen,et al.  Solving mixed integer nonlinear programming problems with line-up competition algorithm , 2004, Comput. Chem. Eng..

[4]  Rein Luus,et al.  Iterative dynamic programming , 2019, Iterative Dynamic Programming.

[5]  V. Vassiliadis,et al.  Efficient Optimal Control of Bioprocesses Using Second-Order Information , 2000 .

[6]  Pavan K. Shukla,et al.  Optimisation of biochemical reactors : an analysis of different approximations of fed-batch operation , 1998 .

[7]  Simant R. Upreti,et al.  A new robust technique for optimal control of chemical engineering processes , 2004, Comput. Chem. Eng..

[8]  Hans Seywald,et al.  Genetic Algorithm Approach for Optimal Control Problems with Linearly Appearing Controls , 1995 .

[9]  María del Carmen Pérez.  Computation of Optimal Singular Controls Using DAE’s , 1996 .

[10]  Liexiang Yan.  Solving combinatorial optimization problems with line-up competition algorithm , 2003, Comput. Chem. Eng..

[11]  R. Luus.  On the application of iterative dynamic programming to singular optimal control problems , 1992 .

[12]  Liexiang Yan,et al.  Global optimization of non-convex nonlinear programs using Line-up Competition Algorithm , 2001 .

[13]  Kim B. McAuley,et al.  On the computation of optimal singular and bang-bang controls , 1998 .

[14]  R. Luus.  Use of Luus–Jaakola optimization procedure for singular optimal control problems , 2001 .

[15]  D. Jacobson,et al.  Computation of optimal singular controls , 1970 .

[16]  V. Vassiliadis,et al.  Second-order sensitivities of general dynamic systems with application to optimal control problems , 1999 .

[17]  J. Banga,et al.  Dynamic Optimization of Batch Reactors Using Adaptive Stochastic Algorithms , 1997 .

[18]  Didier Dumur,et al.  Open-loop optimization and trajectory tracking of a fed-batch bioreactor , 2008 .

[19]  J. Flaherty,et al.  On the computation of singular controls , 1977 .

[20]  Rein Luus.  Effect of the choice of final time in optimal control of nonlinear systems , 1991 .

[21]  B. Goh.  Optimal singular rocket and aircraft trajectories , 2008, 2008 Chinese Control and Decision Conference.

[22]  Z. Michalewicz,et al.  A modified genetic algorithm for optimal control problems , 1992 .

[23]  R. Sargent,et al.  Solution of a Class of Multistage Dynamic Optimization Problems. 2. Problems with Path Constraints , 1994 .

[24]  Rein Luus.  Luus-Jaakola optimization procedure , 2000 .

[25]  Jeffery S. Logsdon,et al.  Accurate solution of differential-algebraic optimization problems , 1989 .

[26]  Ji-Pyng Chiou,et al.  Optimal control and optimal time location problems of differential-algebraic systems by differential evolution , 1997 .

[27]  R. Luus,et al.  Optimization of Fed-Batch Reactors by the Luus−Jaakola Optimization Procedure , 1999 .

[28]  W. Ramirez,et al.  Optimal production of secreted protein in fed‐batch reactors , 1988 .