摘要
提出一种快速求取化工批处理过程次优调度的方法。通过约束变换、引入操作批量的函数和松弛物料存贮能力约束,将调度问题分解为一个两层次的优化问题。用动态规划求解下层问题,用次梯度法求解上层对偶问题。然后依据对偶问题的解,以启发式方法构作原问题的可行解。数值测试结果证明了读方法的有效性和实用性。
This paper proposes an efficient algorithm to schedule batch chemical processes. The problem is decomposed into a two-level optimization problem by constraints substitution) introduction of functions of batch sizes and relaxation of material balance constraints. Dynamic programming method is used to solve the low level subproblems, and the subgradient method is used for the high level dual problem. A heuristic method is then proposed to construct a feasible solution of the original problem. Computational results are given to demonstrate the efficiency and practicality of the approach.
出处
《控制与决策》
EI
CSCD
北大核心
1997年第A00期408-413,共6页
Control and Decision
基金
国家自然科学基金资助课题
关键词
化工批处理过程
调度
LAGRANGIAN
松弛法
batch chemical processes, scheduling, Lagrangian relaxation, dynamic programming