Please use this identifier to cite or link to this item:
|Title:||Differential evolution with tabu list for solving nonlinear and mixed-integer nonlinear programming problems|
|Citation:||Srinivas, M., Rangaiah, G.P. (2007-10-24). Differential evolution with tabu list for solving nonlinear and mixed-integer nonlinear programming problems. Industrial and Engineering Chemistry Research 46 (22) : 7126-7135. ScholarBank@NUS Repository. https://doi.org/10.1021/ie070007q|
|Abstract:||Differential evolution (DE), a population-based direct-search algorithm, has been gaining popularity in the recent past due to its simplicity and ability to handle nonlinear, nondifferentiable, and nonconvex functions. In this study, a method, namely, differential evolution with tabu list (DETL), is described and evaluated for solving constrained optimization problems encountered in chemical engineering. It incorporates the concept of tabu search (TS) (i.e., avoiding revisits during the search) in DE mainly to improve its computational efficiency. DETL is initially applied to many nonlinear programming problems (NLPs) involving 2-13 variables and up to 38 constraints. It is then tested on several mixed-integer nonlinear programming problems (MINLPs) encountered in chemical engineering practice. The performance results of DETL, DE, and modified differential evolution (MDE) (Babu, K. V.; Angira, R. Comput. Chem. Eng. 2006, 30, 989), for both NLPs and MINLPs, are presented, and the relative performance of the three methods is discussed. © 2007 American Chemical Society.|
|Source Title:||Industrial and Engineering Chemistry Research|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on May 14, 2018
WEB OF SCIENCETM
checked on May 7, 2018
checked on May 5, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.