Multiobjective Memetic Algorithms With Quadratic Approximation-Based Local Search for Expensive Optimization in Electromagnetics

Elizabeth Wanner, Frederico G Guimaraes, Ricardo H.C. Takahashi, Jaime A Ramirez, David A Lowther

Research output: Contribution to journalArticlepeer-review

Abstract

We describe a local search procedure for multiobjective genetic algorithms that employs quadratic approximations for all nonlinear functions involved in the optimization problem. The samples obtained by the algorithm during the evolutionary process are used to fit these quadratic approximations in the neighborhood of the point selected for local search, implying that no extra cost of function evaluations is required. After that, a locally improved solution is easily estimated from the associated quadratic problem. We demonstrate the hybridization of our procedure with the well-known multiobjective genetic algorithm. This methodology can also be coupled with other multiobjective evolutionary algorithms. The results show that the proposed procedure is suitable for time-demanding black-box optimization problems.
Original languageEnglish
Pages (from-to)1126-1129
JournalIEEE Transactions on Magnetics
Volume44
Issue number6
DOIs
Publication statusPublished - 2008

Fingerprint Dive into the research topics of 'Multiobjective Memetic Algorithms With Quadratic Approximation-Based Local Search for Expensive Optimization in Electromagnetics'. Together they form a unique fingerprint.

Cite this