.png){kind=icon}
返回
Centralized-decentralized optimization for refinery scheduling
.png){kind=icon}
PRE
AI
DOI：10.1016/j.compchemeng.2009.06.010.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper presents a novel decomposition strategy for solving large scale refinery scheduling problems Instead of formulating one huge and unsolvable MILP or MINLP for centralized problem we propose a, general decomposition scheme that generates smaller sub-systems that can be solved to global optimality The original problem is decomposed at intermediate storage tanks such that inlet and outlet streams of the tank belong to the different sub-systems. Following the decomposition, each decentralized problem is solved to optimality and the solution to the original problem is obtained by integrating the optimal schedule of each sub-systems Different case studies of refinery scheduling are presented to illustrate the applicability and effectiveness of the proposed decentralized strategy. The conditions under which these two types of optimization strategies (centralized and decentralized) give the same optimal result are discussed. (C) 2009 Elsevier Ltd. All rights reserved.
Keyword:
Refinery
Scheduling
Optimization
Centralized
Decentralized
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
3.9
论文数:
8.1K
被引数:
1.7W
机构
引用论文
.png){kind=icon}
分享收藏Adolescents seeking weight management: Who is putting their hand up and what are they looking for?
PREAI
分享收藏Solving a large-scale industrial scheduling problem using MILP combined with a heuristic procedure使用MILP结合启发式程序解决大规模工业调度问题
PREAI
分享收藏
查看更多内容