English   español  
Please use this identifier to cite or link to this item: http://hdl.handle.net/10261/49596
Share/Impact:
Statistics
logo share SHARE logo core CORE   Add this article to your Mendeley library MendeleyBASE

Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL
Exportar a otros formatos:

Title

A Tabu search-based algorithm for mixed-integer nonlinear problems and its application to integrated process and control system design

AuthorsExler, Oliver ; Antelo, L. T. ; Egea, José A. ; Alonso, Antonio A. ; Banga, Julio R.
KeywordsIntegrated process and control design
Mixed-integer nonlinear programming (MINLP)
Metaheuristic
Tabu search
Tennessee Eastman plant
Issue Date2008
PublisherElsevier
CitationComputers and Chemical Engineering 32(8): 1877-1891 (2008)
AbstractIn this contribution, we consider mixed-integer nonlinear programming problems subject to differential-algebraic constraints. This class of problems arises frequently in processdesign, and the particular case of integratedprocess and controlsystemdesign is considered. Since these problems are frequently non-convex, local optimization techniques usually fail to locate the global solution. Here, we propose a global optimization algorithm, based on extensions of the metaheuristic TabuSearch, in order to solve this challenging class of problems in an efficient and robust way. The ideas of the methodology are explained and, on the basis of two case studies, the performance of the approach is evaluated. The first benchmark problem is a Wastewater Treatment Plant model [Alex, J., Bteau, J. F., Copp, J. B., Hellinga, C., Jeppsson, U., Marsili-Libelli, S., et al. (1999). Benchmark for evaluating control strategies in wastewater treatment plants. In Proceedings of the ECC’99 conference] for nitrogen removal and the second case study is the well-known Tennessee Eastman Process [Downs, J. J., & Vogel, E. F. (1993). A plant-wide industrial processcontrol problem. Computers & Chemical Engineering, 17, 245-255]. Numerical experiments with our new method indicate that we can achieve an improved performance in both cases. Additionally, our method outperforms several other recent competitive solvers for the two challenging case studies considered
Description15 páginas, 4 tablas, 4 figuras
Publisher version (URL)http://dx.doi.org/10.1016/j.compchemeng.2007.10.008
URIhttp://hdl.handle.net/10261/49596
DOI10.1016/j.compchemeng.2007.10.008
ISSN0098-1354
E-ISSN1873-4375
Appears in Collections:(IIM) Artículos
Files in This Item:
File Description SizeFormat 
Tabu_search-based_algorithm.pdf325,32 kBAdobe PDFThumbnail
View/Open
Show full item record
Review this work
 

Related articles:


WARNING: Items in Digital.CSIC are protected by copyright, with all rights reserved, unless otherwise indicated.