Comparison of global optimization algorithms for the design of water-using networks

Castro, Pedro; Teles, João P.

http://hdl.handle.net/10400.9/2446

Use this identifier to reference this record.

Name:	Description:	Size:	Format:
ComputerChemicalEngineering_Vol.52_249.pdf		205.03 KB	Adobe PDF	Download

Send Feedback

Authors

Castro, Pedro

Teles, João P.

Abstract(s)

We address a special class of bilinear process network problems with global optimization algorithms iterating between a lower bound provided by a mixed-integer linear programming (MILP) formulation and an upper bound given by the solution of the original nonlinear problem (NLP) with a local solver. Two conceptually different relaxation approaches are tested, piecewise McCormick envelopes and multiparametric disaggregation, each considered in two variants according to the choice of variables to partition/parameterize. The four complete MILP formulations are derived from disjunctive programming models followed by convex hull reformulations. The results on a set of test problems from the literature show that the algorithm relying on multiparametric disaggregation with parameterization of the concentrations is the best performer, primarily due to a logarithmic as opposed to linear increase in problem size with the number of partitions. The algorithms are also compared to the commercial solvers BARON and GloMIQO through performance profiles.

Keywords

Mathematical modelling Nonlinear programming Integer programming Disjunctive programming Process design Water minimization

URI

http://hdl.handle.net/10400.9/2446

Citation

Cantro, P.M.; Teles, J.P. Comparison of global optimization algorithms for the design of water-using networks. In: Computers and Chemical Engineering, 2013, Vol. 52, p. 249-261

Publisher

Elsevier

Collections

ISE - Artigos em revistas internacionais

Full item page