Premium
Greedy search and a hybrid local optimization/genetic algorithm for tree‐based inverse scattering
Author(s) -
Wildman Raymond A.,
Weile Daniel S.
Publication year - 2008
Publication title -
microwave and optical technology letters
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.304
H-Index - 76
eISSN - 1098-2760
pISSN - 0895-2477
DOI - 10.1002/mop.23222
Subject(s) - inverse scattering problem , local search (optimization) , algorithm , genetic algorithm , mathematical optimization , inverse , tree (set theory) , computer science , greedy algorithm , genetic programming , inverse problem , mathematics , artificial intelligence , combinatorics , mathematical analysis , geometry
A genetic programming‐based geometry optimization method for inverse scattering that uses a tree data structure to encode Boolean combinations of convex shapes has recently been shown to outperform other genetic algorithm‐based techniques. Nonetheless, the genetic algorithms are still inefficient for inverse scattering. This letter treats the inefficiency with local search techniques. First, an implementation using greedy search is discussed. Next, a local search method is added to the genetic algorithm used in the previous approach. Numerical results show that the number of function evaluations necessary to image conducting cylinders can be reduced by several orders of magnitude. © 2008 Wiley Periodicals, Inc. Microwave Opt Technol Lett 50: 822–825, 2008; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/mop.23222