Logic-Based Discrete-Steepest Descent: A solution method for process synthesis Generalized Disjunctive Programs

Optimization of chemical processes is challenging due to nonlinearities arising from chemical principles and discrete design decisions. The optimal synthesis and design of chemical processes can be posed as a Generalized Disjunctive Programming (GDP) problem. While reformulating GDP problems as Mixe...

Full description

Saved in:
Bibliographic Details
Published in:Computers & chemical engineering Vol. 195; p. 108993
Main Authors: Ovalle, Daniel, Liñán, David A., Lee, Albert, Gómez, Jorge M., Ricardez-Sandoval, Luis, Grossmann, Ignacio E., Bernal Neira, David E.
Format: Journal Article
Language:English
Published: Elsevier Ltd 01.04.2025
Subjects:
Generalized Disjunctive Programming
MINLP
Optimal process design
Process intensification
Superstructure optimization
MINLP
Superstructure optimization
Process intensification
Optimal process design
Generalized Disjunctive Programming
ISSN:0098-1354, 1873-4375
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Optimization of chemical processes is challenging due to nonlinearities arising from chemical principles and discrete design decisions. The optimal synthesis and design of chemical processes can be posed as a Generalized Disjunctive Programming (GDP) problem. While reformulating GDP problems as Mixed-Integer Nonlinear Programming (MINLP) problems is common, specialized algorithms for GDP remain scarce. This study introduces the Logic-Based Discrete-Steepest Descent Algorithm (LD-SDA) as a solution method for GDP problems involving ordered Boolean variables. LD-SDA transforms these variables into external integer decisions and uses a two-level decomposition: the upper-level sets external configurations, and the lower-level solves the remaining variables, efficiently exploiting the GDP structure. In the case studies presented in this work, including batch processing, reactor superstructures, and distillation columns, LD-SDA consistently outperforms conventional GDP and MINLP solvers, especially as the problem size grows. LD-SDA also proves superior when solving challenging problems where other solvers encounter difficulties finding optimal solutions. •A logic-based discrete steepest algorithm for generalized disjunctive programs.•By reformulating ordered Boolean variables, a lattice of subproblems can be explored.•Ordered Booleans variables are key in process optimization and chemical engineering.•Computational results show the efficiency of the algorithm against compared to MINLP methods.•Open-source implementation and algorithmic enhancements are explained and provided.
ISSN:0098-1354
1873-4375
DOI:10.1016/j.compchemeng.2024.108993