.png){kind=icon}
返回
A decision tree based decomposition method for oil refinery scheduling
.png){kind=icon}
OA
AI
DOI：10.1016/j.cjche.2017.10.006.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Refinery scheduling attracts increasing concerns in both academic and industrial communities in recent years. However, due to the complexity of refinery processes, little has been reported for success use in real world refineries. In academic studies, refinery scheduling is usually treated as an integrated, large-scale optimization problem, though such complex optimization problems are extremely difficult to solve. In this paper, we proposed a way to exploit the prior knowledge existing in refineries, and developed a decision making system to guide the scheduling process. For a real world fuel oil oriented refinery, ten adjusting process scales are predetermined. A C4.5 decision tree works based on the finished oil demand plan to classify the corresponding category (i.e. adjusting scale). Then, a specific sub-scheduling problem with respect to the determined adjusting scale is solved. The proposed strategy is demonstrated with a scheduling case originated from a real world refinery. (c) 2017 The Chemical Industry and Engineering Society of China, and Chemical Industry Press. All rights reserved.
Keyword:
Refinery scheduling
Decision tree
C4.5
Decomposition method
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.7
论文数:
5.3K
被引数:
1.1W
机构
引用论文
.png){kind=icon}
分享收藏分享收藏分享收藏
查看更多内容