The solutions of time-delayed optimal control problems by the use of modified line-up competition algorithm

2010 
Abstract In this article, line-up competition algorithm (LCA), a brand-new nonlinear programming method based on the principle of evolution, is applied to solve time-delay optimal control problems (TDOCPs). The problems are first discretized based on the concept of control vector parametrization, and then solved by LCA. Since the delay differential equations are directly integrated without using the auxiliary procedures such as model conversion and data interpolation, most TDOCPs can be solved very conveniently under such solution framework. Meanwhile, a more efficient sampling strategy is adopted to promote the too slow convergence of the basic LCA. By solving six typical examples, including five pure mathematical problems and one chemical engineering problem, the modified LCA demonstrates a robust and efficient property in optimizing time-delay unsteady systems.
    • Correction
    • Source
    • Cite
    • Save
    • Machine Reading By IdeaReader
    33
    References
    20
    Citations
    NaN
    KQI
    []