The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Pareto-Optimization for Scheduling of Crude Oil Operations in Refinery via Genetic Algorithm
Abstract
With the interaction of discrete-event and continuous processes, it is challenging to schedule crude oil operations in a refinery. This paper studies the optimization problem of finding a detailed schedule to realize a given refining schedule. This is a multiobjective optimization problem with a combinatorial nature. Since the original problem cannot be directly solved by using heuristics and meta-heuristics, the problem is transformed into an assignment problem of charging tanks and distillers. Based on such a transformation, by analyzing the properties of the problem, this paper develops a chromosome that can describe a feasible schedule such that meta-heuristics can be applied. Then, it innovatively adopts an improved nondominated sorting genetic algorithm to solve the problem for the first time. An industrial case study is used to test the proposed solution method. The results show that the method makes a significant performance improvement and is applicable to real-life refinery scheduling problems.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A fast and elitist multiobjective genetic algorithm: NSGA-II
Deb, K., Pratap, A., Agarwal, S., & Meyarivan, T. (2002) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.996017 · Cited by 50,053
Cited by
Flexible Job-Shop Rescheduling for New Job Insertion by Using Discrete Jaya Algorithm
Gao, K., Yang, F., Zhou, M., Pan, Q., & Suganthan, P. N. (2019) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2018.2817240 · Cited by 302
Self-citationZhong, X., Yin, H., He, Y., & Huang, Y. (2017) · IEEE Access · doi:10.1109/access.2017.2767061 · Cited by 17
Metadata
- Authors
- Hou, Y., Wu, N., Zhou, M., & Li, Z.
- Venue
- IEEE Transactions on Systems, Man, and Cybernetics: Systems
- Published
- 2017-03
- Volume
- 47
- Issue
- 3
- Pages
- 517-530
- ISSN
- 2168-2216 (ISSN-L)
- 2168-2232
- OpenAlex
- W2344852273
- Cited by
- 246
- References
- 1
- FWCI
- 43.34
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.