Please use this identifier to cite or link to this item:
https://doi.org/10.1016/B978-0-444-53711-9.50115-2
DC Field | Value | |
---|---|---|
dc.title | Self-adaptive Differential Evolution with Taboo List for Constrained Optimization Problems and Its Application to Pooling Problems | |
dc.contributor.author | Zhang, H. | |
dc.contributor.author | Rangaiah, G.P. | |
dc.date.accessioned | 2014-12-15T06:08:17Z | |
dc.date.available | 2014-12-15T06:08:17Z | |
dc.date.issued | 2011 | |
dc.identifier.citation | Zhang, H., Rangaiah, G.P. (2011). Self-adaptive Differential Evolution with Taboo List for Constrained Optimization Problems and Its Application to Pooling Problems. Computer Aided Chemical Engineering 29 : 573-576. ScholarBank@NUS Repository. https://doi.org/10.1016/B978-0-444-53711-9.50115-2 | |
dc.identifier.issn | 15707946 | |
dc.identifier.uri | http://scholarbank.nus.edu.sg/handle/10635/117414 | |
dc.description.abstract | Differential evolution (DE), a population-based global optimization algorithm, has been gaining popularity in the recent past due to its capability to handle non-convex and nondifferentiable functions. In this study, Self-adaptive Differential Evolution with Taboo List (SaDETL) with a novel constraint handling technique is proposed. It is tested for solving benchmark problems with equality and/or inequality constraints, and then applied to pooling problems, which are challenging with many constraints and important in process industries. In SaDETL, mutation strategy and parameter are selfadapted according to the learning experience from the previous generations, and taboo list is used to avoid revisiting the same area, to increase the population diversity and exploration of search space with fewer function evaluations, and to prevent premature convergence. An efficient constraint handling technique is incorporated with SaDETL; it is based on adaptive relaxation of constraints to improve the search and feasibility approach for selection. The results show that SaDETL with this technique is better than recent stochastic techniques for solving benchmark constrained problems, and is reliable and promising for solving pooling problems. © 2011 Elsevier B.V. | |
dc.description.uri | http://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1016/B978-0-444-53711-9.50115-2 | |
dc.source | Scopus | |
dc.subject | Constraint handling | |
dc.subject | Differential evolution | |
dc.subject | Global optimization | |
dc.subject | Pooling problems | |
dc.subject | Self-adaptation | |
dc.type | Book Chapter | |
dc.contributor.department | CHEMICAL & BIOMOLECULAR ENGINEERING | |
dc.description.doi | 10.1016/B978-0-444-53711-9.50115-2 | |
dc.description.sourcetitle | Computer Aided Chemical Engineering | |
dc.description.volume | 29 | |
dc.description.page | 573-576 | |
dc.identifier.isiut | NOT_IN_WOS | |
Appears in Collections: | Staff Publications |
Show simple item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.