.png){kind=icon}
返回
Efficient Solution of Enterprise-Wide Optimization Problems Using Nested Stochastic Blockmodeling
.png){kind=icon}
PRE
AI
DOI：10.1021/acs.iecr.1c01570.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Enterprise wide optimization seeks to improve the economic performance of process systems by considering simultaneously decisions at different time scales, resulting in large-scale optimization problems. In this paper, we propose the application of nested stochastic blockmodeling (nSBM) for the decomposition of such optimization problems. This approach allows the identification of the block structure of the problem at different hierarchical levels and the hierarchy itself. We consider problems of integration of scheduling and dynamic optimization and integration of planning, scheduling, and dynamic optimization for illustration. Application of nSBM reveals the multiscale nature of these optimization problems, and the exploitation of the structure of the problem at different hierarchical levels enables efficient solutions.
Keyword:
DYNAMIC OPTIMIZATION
LAGRANGEAN DECOMPOSITION
PROCESS OPERATIONS
INTEGRATION
MODEL
ALGORITHM
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
I
IF:
3.9
论文数:
4.0W
被引数:
9.6W
机构
暂无机构信息
引用论文
.png){kind=icon}
查看更多内容