A decision tree based decomposition method for oil refinery scheduling

9Citations
Citations of this article
23Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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.

Cite

CITATION STYLE

APA

Gao, X., Huang, D., Jiang, Y., & Chen, T. (2018). A decision tree based decomposition method for oil refinery scheduling. Chinese Journal of Chemical Engineering, 26(8), 1605–1612. https://doi.org/10.1016/j.cjche.2017.10.006

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free