Centralized–decentralized optimization for refinery scheduling

This paper presents a novel decomposition strategy for solving large scale refinery scheduling problems. Instead of formulating one huge and unsolvable MILP or MINLP for centralized problem, we propose a general decomposition scheme that generates smaller sub-systems that can be solved to global optimality. The original problem is decomposed at intermediate storage tanks such that inlet and outlet streams of the tank belong to the different sub-systems. Following the decomposition, each decentralized problem is solved to optimality and the solution to the original problem is obtained by integrating the optimal schedule of each sub-systems. Different case studies of refinery scheduling are presented to illustrate the applicability and effectiveness of the proposed decentralized strategy. The conditions under which these two types of optimization strategies (centralized and decentralized) give the same optimal result are discussed.