Utilize este identificador para referenciar este registo: http://hdl.handle.net/10400.9/2446
Título: Comparison of global optimization algorithms for the design of water-using networks
Autor: Castro, Pedro
Teles, João P.
Palavras-chave: Mathematical modelling
Nonlinear programming
 Integer programming
Disjunctive programming
Process design
Water minimization
Data: 2013
Editora: Elsevier
Citação: 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 
Resumo: 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.
URI: http://hdl.handle.net/10400.9/2446
ISSN: 0098-1354
Versão do Editor: http://dx.doi.org/10.1016/j.compchemeng.2013.01.013
Aparece nas colecções:UAER - Artigos em revistas internacionais

Ficheiros deste registo:
Ficheiro Descrição TamanhoFormato 
ComputerChemicalEngineering_Vol.52_249.pdf205,03 kBAdobe PDFVer/Abrir

FacebookTwitterDeliciousLinkedInDiggGoogle BookmarksMySpace
Formato BibTex MendeleyEndnote Degois 

Todos os registos no repositório estão protegidos por leis de copyright, com todos os direitos reservados.