New <scp>MINLP</scp> formulation for the multiperiod pooling problem

Castro, Pedro M.

doi:10.1002/aic.15018

Cited by 23 publications

(19 citation statements)

References 48 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…5 Those rules are the following: 1. Every blender can process several products over the time horizon, but one after another.…”

Section: Problem Statementmentioning

confidence: 99%

See 1 more Smart Citation

A cost‐effective model for the gasoline blend optimization problem

Cerdá¹,

Pautasso²,

Cafaro³

2016

AIChE Journal

View full text Add to dashboard Cite

Gasoline blending is a critical process with a significant impact on the total revenues of oil refineries. It consists of mixing several feedstocks coming from various upstream processes and small amounts of additives to make different blends with some specified quality properties. The major goal is to minimize operating costs by optimizing blend recipes, while meeting product demands on time and quality specifications. This work introduces a novel continuous-time mixed-integer linear programming (MILP) formulation based on floating time slots to simultaneously optimize blend recipes and the scheduling of blending and distribution operations. The model can handle non-identical blenders, multipurpose product tanks, sequence-dependent changeover costs, limited amounts of gasoline components, and multi-period scenarios. Because it features an integrality gap close to zero, the proposed MILP approach is able to find optimal solutions at much lower computational cost than previous contributions when applied to large gasoline blend problems.

show abstract

“…5 Those rules are the following: 1. Every blender can process several products over the time horizon, but one after another.…”

Section: Problem Statementmentioning

confidence: 99%

“…The number of time slots chosen for each example is reported in the Supporting Information. In Table 1 (5) 118,800 9…”

mentioning

confidence: 98%

A cost‐effective model for the gasoline blend optimization problem

Cerdá¹,

Pautasso²,

Cafaro³

2016

AIChE Journal

View full text Add to dashboard Cite

show abstract

“…Common examples of objective functions used in similar problems include maximization of profits [53,54,34,29,9,3,36,2,64] or gross margins [45,50,7,16,6], or minimization of operating costs [45,33,35,32,7,6]. The objective function used in [14] in particular is similar to that in this work, but includes additional penalties for performing mixing operations, missing the demand composition requirements, and for not respecting the maintenance requirements.…”

Section: Literature Reviewmentioning

confidence: 99%

An Approximate Method for the Optimization of Long-Horizon Tank Blending and Scheduling Operations

Beach¹,

Hildebrand²,

Ellis³

et al. 2020

Preprint

View full text Add to dashboard Cite

We address a challenging tank blending and scheduling problem regarding operations for a chemical plant. We model the problem as a nonconvex MIQCP, then approximate this model as a MILP using a discretization-based approach. We combine a rolling horizon approach with the discretization of individual chemical property specifications to deal with long scheduling horizons, time-varying quality specifications, and multiple suppliers with discrete arrival times. This approach has been evaluated using industry-representative data sets from the specialty chemical industry. We demonstrate that the proposed approach supports fast planning cycles.

show abstract

“…Disjunctions relate binary and continuous variables, logic propositions relate the different sets of binary variables, whereas the majority of constraints relating continuous variables are essentially mass balances. The outcome is a simpler and more systematic model compared to our recent GDP efforts for pipeline scheduling, which follows the work for blending problems in petroleum refineries …”

Section: Introductionmentioning

confidence: 99%

“…The outcome is a simpler and more systematic model compared to our recent GDP efforts for pipeline scheduling, 27,28 which follows the work for blending problems in petroleum refineries. 11,34…”

Section: Introductionmentioning

confidence: 99%

Continuous‐time scheduling formulation for straight pipelines

Mostafaei

Castro

2016

AIChE Journal

Self Cite

View full text Add to dashboard Cite

Pipelines represent the most cost‐effective way of transporting large quantities of refined petroleum products over large distances but can be challenging to operate. In this article, we propose a new mixed‐integer linear programming formulation for scheduling straight pipelines with multiple single and dual purpose nodes. The model allows for simultaneous injections and deliveries, and interacting pumping runs, in which a segment of the pipeline simultaneously receives material from its refinery and upstream segment. In contrast to previous batch centric models, it uses segment dependent coordinates. To make it efficient by design, we rely on generalized disjunctive programming and develop disjunctions for which the convex hull reformulation is simple (roughly the same number of variables and constraints as its big‐M counterpart). Through the solution of a set of test cases from the literature, we show a better utilization of the pipeline capacity that is translated into a lower makespan. © 2016 American Institute of Chemical Engineers AIChE J, 63: 1923–1936, 2017

show abstract

New MINLP formulation for the multiperiod pooling problem

Cited by 23 publications

References 48 publications

A cost‐effective model for the gasoline blend optimization problem

A cost‐effective model for the gasoline blend optimization problem

An Approximate Method for the Optimization of Long-Horizon Tank Blending and Scheduling Operations

Continuous‐time scheduling formulation for straight pipelines

Contact Info

Product

Resources

About