Abstract
The solution of generic dynamic optimization problems described by Modelica, and its extension Optimica, code using direct collocation methods is discussed. We start by providing a description of dynamic optimization problems in general and how to solve them by means of direct collocation. Next, an existing implementation of a collocation algorithm in JModelica.org, using CasADi and IPOPT, is presented. The extensions made to this implementation are reported. The new implementation is compared to an old C-based collocation algorithm in JModelica.org in two benchmarks. The presented benchmarks are based on a continuously stirred tank reactor and a combined cycle power plant. The new algorithm and its surrounding framework is more flexible and shown to be several times more efficient than its predecessor.
Cite
CITATION STYLE
Magnusson, F., & Åkesson, J. (2012). Collocation Methods for Optimization in a Modelica Environment. In Proceedings of the 9th International MODELICA Conference, September 3-5, 2012, Munich, Germany (Vol. 76, pp. 649–658). Linköping University Electronic Press. https://doi.org/10.3384/ecp12076649
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.