Global Optimization of Nonlinear Blend-Scheduling Problems

摘要

The scheduling of gasoline-blending operations is an important problem in the oil refining industry.This problem not only exhibits the combinatorial nature that is intrinsic to scheduling problems,but also non-convex nonlinear behavior,due to the blending of various materials with different quality properties.In this work,a global optimization algorithm is proposed to solve a previously published continuous-time mixed-integer nonlinear scheduling model for gasoline blending.The model includes blend recipe optimization,the distribution problem,and several important operational features and constraints.The algorithm employs piecewise McCormick relaxation (PMCR) and normalized multiparametric disaggregation technique (NMDT) to compute estimates of the global optimum.These techniques partition the domain of one of the variables in a bilinear term and generate convex relaxations for each partition.By increasing the number of partitions and reducing the domain of the variables,the algorithm is able to refine the estimates of the global solution.The algorithm is compared to two commercial global solvers and two heuristic methods by solving four examples from the literature.Results show that the proposed global optimization algorithm performs on par with commercial solvers but is not as fast as heuristic approaches.