Please use this identifier to cite or link to this item:
|Title:||Improving the robustness and efficiency of crude scheduling algorithms|
|Authors:||Li, J. |
Mixed-integer linear program
|Citation:||Li, J., Li, W., Karimi, I.A., Srinivasan, R. (2007-10). Improving the robustness and efficiency of crude scheduling algorithms. AIChE Journal 53 (10) : 2659-2680. ScholarBank@NUS Repository. https://doi.org/10.1002/aic.11280|
|Abstract:||Higher crude prices have made it even more imperative that refiners blend low-quality and high-quality crudes optimally to maximize their margins. Mathematical modeling of crude blending results in bilinear terms, which combined with commonly used feed quality specifications, make crude scheduling a large, nonconvex, mixed-integer nonlinear optimization problem. The existing literature algorithms and software (DICOPT/GAMS and BARON/GAMS; Brooke et al., GAMS: a user's guide, GAMS, 1998) fail to solve practical instances of this difficult and useful problem. In this paper, we first enhance the practical utility of our previous crude scheduling algorithm by adding 15 properties and corresponding linearly additive indices, which are used in the refinery industry to ensure feed quality. Then, we propose some new iterative strategies to improve the robustness and solution quality of this algorithm. We also propose a partial relaxation strategy to increase its solution speed. We prove its enhanced performance using 24 industry-scale examples, and estimate bounds on solution quality. In contrast to existing algorithms or software that fail to solve most of these problems, our revised algorithm solves all problems successfully and gives profits within 6% of our computed upper bounds. © 2007 American Institute of Chemical Engineers.|
|Source Title:||AIChE Journal|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jul 16, 2018
WEB OF SCIENCETM
checked on Jun 20, 2018
checked on Jun 22, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.