TY - JOUR
T1 - A piecewise McCormick relaxation-based strategy for scheduling operations in a crude oil terminal
AU - de Assis, Leonardo Salsano
AU - Camponogara, Eduardo
AU - Zimberg, Bernardo
AU - Ferreira, Enrique
AU - Grossmann, Ignacio E.
N1 - Publisher Copyright:
© 2017 Elsevier Ltd
PY - 2017
Y1 - 2017
N2 - The petroleum supply chain can be divided into three segments: upstream, midstream and downstream. This work studies the scheduling of operations in a crude oil terminal within the midstream segment. The first challenge consists in deciding how the crude oil that arrives in vessels should be uploaded to the storage tanks. At the same time, the operations engineer must decide which storage tanks will feed the pipeline connected to the refinery in order to satisfy its demand. This work concerns the crude oil terminal of the national refinery of Uruguay. To schedule terminal operations, this work proposes an iterative two-step MILP-NLP algorithm based on piecewise McCormick relaxation and a domain-reduction strategy for handling bilinear terms. For small instances for which an optimal solution is known, the proposed strategy consistently finds optimal or near-optimal solutions. It also solves larger instances which are, in some cases, intractable by a global optimization solver.
AB - The petroleum supply chain can be divided into three segments: upstream, midstream and downstream. This work studies the scheduling of operations in a crude oil terminal within the midstream segment. The first challenge consists in deciding how the crude oil that arrives in vessels should be uploaded to the storage tanks. At the same time, the operations engineer must decide which storage tanks will feed the pipeline connected to the refinery in order to satisfy its demand. This work concerns the crude oil terminal of the national refinery of Uruguay. To schedule terminal operations, this work proposes an iterative two-step MILP-NLP algorithm based on piecewise McCormick relaxation and a domain-reduction strategy for handling bilinear terms. For small instances for which an optimal solution is known, the proposed strategy consistently finds optimal or near-optimal solutions. It also solves larger instances which are, in some cases, intractable by a global optimization solver.
KW - Bilinear terms
KW - Blending
KW - Crude oil scheduling
KW - MINLP
KW - Piecewise McCormick envelopes
UR - http://www.scopus.com/inward/record.url?scp=85030625963&partnerID=8YFLogxK
U2 - 10.1016/j.compchemeng.2017.06.012
DO - 10.1016/j.compchemeng.2017.06.012
M3 - Artículo
AN - SCOPUS:85030625963
SN - 0098-1354
VL - 106
SP - 309
EP - 321
JO - Computers and Chemical Engineering
JF - Computers and Chemical Engineering
ER -