Please use this identifier to cite or link to this item:
|Title:||Black-box optimization by Fourier analysis and swarm intelligence||Authors:||Lim, E.W.C.
Design of experiments
Discrete Fourier analysis
Particle swarm optimization
|Issue Date:||2012||Citation:||Lim, E.W.C., New, J.R. (2012). Black-box optimization by Fourier analysis and swarm intelligence. Journal of Chemical Engineering of Japan 45 (6) : 417-428. ScholarBank@NUS Repository. https://doi.org/10.1252/jcej.12we002||Abstract:||A new methodology for solving black-box optimization problems by the continuous approach has been developed in this study. A discrete Fourier series method was derived from the conventional Fourier series formulation and principles associated with the discrete Fourier transform, and used for the reformulation of black-box objective functions as continuous functions. A stochastic global optimization technique known as Particle Swarm Optimization (PSO) was then applied to locate the global optimal solutions of the continuous functions derived. The methodology was first applied to the solution of a black-box optimization problem that was simulated on the basis of the Himmelblau function. It was then applied successfully to the optimization of the conditions used for various types of experiments such as those involving the permeation of nimodipine through human cadaver epidermis, lipid production, and the production of a human interferon beta by the recombinant bacteria Escherichia coli. The discrete Fourier series method coupled to the PSO algorithm is thus a promising methodology for solving black-box optimization problems via the continuous approach. © 2012 The Society of Chemical Engineers, Japan.||Source Title:||Journal of Chemical Engineering of Japan||URI:||http://scholarbank.nus.edu.sg/handle/10635/63548||ISSN:||00219592||DOI:||10.1252/jcej.12we002|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jul 16, 2021
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.