检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:潘雨 刘伯潭[1] 盖晓龙 PAN Yu;LIU Bo-tan;GE Xiao-long(School of Chemical Engineering and Materials and Science,Tianjin University of Science and Technology,Tianjin 300457,China;State Key Laboratory of Chemical Engineering,Tianjin University,Tianjin 300350,China)
机构地区:[1]天津科技大学化学工程与材料科学学院,天津300457 [2]天津大学化学工程联合国家重点实验室,天津300350
出 处:《化学工程》2022年第4期17-22,共6页Chemical Engineering(China)
基 金:国家自然科学基金资助项目(21978218,U1862119)。
摘 要:反应精馏是过程耦合强化的重要手段,对于受平衡限制的反应而言,能够在提高平衡转化率的同时降低过程的能耗与设备投资。但是过程多参数优化是亟需解决的关键问题。反应精馏过程的优化涉及整数变量与连续变量的同时求解,且相平衡的非理想性显著增强了过程的非线性。通过引入广义析取规划,以析取变量表示过程的整数变量,建立了反应精馏过程优化的数学模型。在此基础上采用外部逻辑近似算法将析取模型分解为混合整数线性规划问题与非线性规划问题进行模型求解。以典型工业案例甲酸甲酯水解制甲酸为例,验证反应精馏耦合强化过程的有效性与优化方法的可行性。As a vital method for achieving process intensification,reactive distillation could simultaneously improve the conversion and reduce energy consumption/capital cost investment for equilibrium-limited reaction.However,the parameter optimization imposes challenge to detailed design and further industrial utilization.The optimization shows that the mixed integer nonlinear programming problem and the non-ideal phase equilibrium increases the difficulty of finding optimal solution significantly.Disjunctive variable was employed to represent integer variable of the process and Generalized Disjunctive Programming(GDP)was introduced to establish mathematical model for reactive distillation.Then logic-based outer approximation(LBOA)was used to decompose the disjunctive model into the master problem-mixed integer linear programming(MILP)and subproblem-nonlinear programming(NLP).Taking the typical industrial hydrolysis of methyl formate to formic acid for example,the feasibility of optimization method and the effectiveness of coupling intensified process of reactive distillation was validated.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.229