By Topic

Geometry reconstruction using genetic programming and local optimization

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Wildman, R.A. ; Univ. of Delaware, Newark ; Weile, Daniel S.

Geometry optimization has applications in many fields and problems such as structure design and inverse scattering. Recently, a method for geometry design was developed using genetic programming. The method is based on a tree shaped chromosome that represents Boolean combinations of convex shapes. Genetic programming (GP) is used to optimize the structure. This approach proved successful but required a large amount of computing resources. The typical number of function evaluations required was around 200,000. While other genetic algorithm (GA) based inverse scattering methods were shown to require a similar number of evaluations for problems of similar complexity, the efficiency of the method can still be improved by using local optimization. Local optimization methods such as the Broyden-Fletcher-Goldfarb-Shanno (BFGS) method can compliment a GA's global search capabilities with a more efficient local search mechanism. The resulting method should provide more accurate answers using fewer function evaluations. One drawback is that the local optimization scheme will require a number of function evaluations that cannot be parallelized as easily as a genetic algorithm. If several chromosomes are optimized simultaneously, each can be run in parallel. In addition, the local optimizer can be run for a small number of steps.

Published in:

Antennas and Propagation Society International Symposium, 2007 IEEE

Date of Conference:

9-15 June 2007