...
首页> 外文期刊>Computers & Chemical Engineering >Kaibel column: Modeling, optimization, and conceptual design of multi-product dividing wall columns
【24h】

Kaibel column: Modeling, optimization, and conceptual design of multi-product dividing wall columns

机译:Kaibel色谱柱:多产品分隔壁色谱柱的建模,优化和概念设计

获取原文
获取原文并翻译 | 示例
           

摘要

In this work, we present the modeling, optimization, and conceptual design of a dividing wall column for the separation of four products, commonly referred to in the literature as a Kaibel column, by implementing three different formulations: an NLP, an MINLP, and a GDP formulation. For its solution, we propose a rigorous tray-by-tray model and compared it to results from a commercial software, followed by its reformulation to include a mixed-integer nonlinear programming and a general disjunctive programming formulation to respond to the conceptual design problem attached to these complex configurations. Considering the proposed rigorous model and the two formulations, the Kaibel column is solved, obtaining four high-purity products and new optimal tray locations for the feed and two side product streams, when the mixed-integer nonlinear programming formulation is applied. The use of these optimally located side streams showed reductions in the energy consumption when compared to cases were non-optimal fixed tray locations are used. When the general disjunctive programming problem was solved, the minimum number of trays needed in the main column and dividing wall are obtained, showing a great reduction of the remixing effects in the Kaibel column, and with that, a more energy efficient configuration. The models were coded in Pyomo using the solver IPOPT for the solution of the nonlinear programming problem, the solver Bonmin for the solution of the mixed-integer nonlinear programming problem, and GDPopt for the solution of the general disjunctive programming optimization problem. (C) 2019 Elsevier Ltd. All rights reserved.
机译:在这项工作中,我们通过实施三种不同的公式,介绍了用于分隔四种产品(在文献中通常称为Kaibel色谱柱)的分隔墙色谱柱的建模,优化和概念设计。 GDP公式。对于其解决方案,我们提出了一个严格的逐托盘模型,并将其与商业软件的结果进行比较,随后对其进行了重新表述,以包括混合整数非线性规划和通用相异规划公式,以应对所附加的概念设计问题这些复杂的配置。考虑到提出的严格模型和两种公式,使用混合整数非线性规划公式时,解开Kaibel色谱柱,获得了四个高纯度产品以及用于进料和两个副产品流的新的最佳塔板位置。与使用非最佳固定托盘位置的情况相比,使用这些位置最佳的侧流显示出能源消耗的减少。解决了一般的分离程序设计问题后,获得了在主塔和分隔壁中所需的最小塔板数,这表明Kaibel塔中的再混合效果大大降低,从而实现了更节能的配置。使用IPOPT求解器求解非线性规划问题,使用求解器Bonmin求解求解混合整数非线性规划问题,并使用GDPopt求解一般的离散规划优化问题,在Pyomo中对模型进行了编码。 (C)2019 Elsevier Ltd.保留所有权利。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号