Disjunctive multiperiod optimization methods for design and planning of chemical process systems

In this paper, we present a general disjunctive multiperiod nonlinear optimization model, which incorporates design, as well as operation and expansion planning, and takes into account the corresponding costs incurred in each time period. This model is formulated with the use of logic and disjunctiv...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Computers & chemical engineering Ročník 23; číslo 8; s. 1075 - 1095
Hlavní autoři: van den Heever, Susara A., E. Grossmann, Ignacio
Médium: Journal Article
Jazyk:angličtina
Vydáno: Oxford Elsevier Ltd 01.08.1999
Elsevier
Témata:
ISSN:0098-1354, 1873-4375
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:In this paper, we present a general disjunctive multiperiod nonlinear optimization model, which incorporates design, as well as operation and expansion planning, and takes into account the corresponding costs incurred in each time period. This model is formulated with the use of logic and disjunctive programming, and includes Boolean variables for design, operation planning and expansion planning. We propose two algorithms for the solution of these problems. The first is a logic-based Outer Approximation (OA) algorithm for multiperiod problems. The second is a bilevel decomposition algorithm, that exploits the problem structure by decomposing it into an upper level design problem and a lower level operation and expansion planning problem, each of which is solved with the logic-based OA algorithm. Applications are considered in the areas of design and planning of process networks, as well as retrofit design for multiproduct batch plants. The results show that the disjunctive logic-based OA algorithm performs best for small problems, while the disjunctive bilevel decomposition algorithm is superior for larger problems. In both cases, a significant decrease in MILP solution time and total solution time is achieved compared to DICOPT++. Results also show that problems with a significant number of time periods can be solved in reasonable time.
ISSN:0098-1354
1873-4375
DOI:10.1016/S0098-1354(99)00273-2