New algorithms for mixed-integer dynamic optimization
New algorithms for mixed-integer dynamic optimization
复制标题
DOI：
10.1016/s0098-1354(02)00261-2
复制
发表时间：
2003-05-15
影响因子：
4.3
通讯作者：
Pistikopoulos, EN
中科院分区：
文献类型：
--
作者：
Bansal, V;Sakizlis, V;Pistikopoulos, EN
混合整数动态优化（MIDO）问题出现在化学工程中，每当离散和连续的决策是由瞬态模型描述的系统。应用领域包括集成设计和控制、反应器网络的合成、动力学机制的简化和混合系统的优化。本文提出了解决MIDO问题的新公式和算法。该算法的基础上分解成原始的，动态优化和主，混合整数线性规划子问题。它们不依赖于使用一个特定的原始动态优化方法，他们不需要解决一个中间伴随问题的主问题，即使整数变量显式出现在微分代数方程系统。两个精馏设计和控制优化的例子证明了该算法的实用潜力。(C)2002爱思唯尔科技有限公司版权所有。
Mixed-integer dynamic optimization (MIDO) problems arise in chemical engineering whenever discrete and continuous decisions are to be made for a system described by a transient model. Areas of application include integrated design and control, synthesis of reactor networks, reduction of kinetic mechanisms and optimization of hybrid systems. This article presents new formulations and algorithms for solving MIDO problems. The algorithms are based on decomposition into primal, dynamic optimization and master, mixed-integer linear programming sub-problems. They do not depend on the use of a particular primal dynamic optimization method and they do not require the solution of an intermediate adjoint problem for constructing the master problem, even when the integer variables appear explicitly in the differential-algebraic equation system. The practical potential of the algorithms is demonstrated with two distillation design and control optimization examples. (C) 2002 Elsevier Science Ltd. All rights reserved.