Using NU-SSGA to reduce the searching time in inverse problem of a buried metallic object

doi:10.1109/TAP.2005.856362

機構典藏 > College of Engineering > Graduate Institute & Department of Electrical Engineering > Journal Article > Item 987654321/46204

Please use this identifier to cite or link to this item: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/46204

Title:	Using NU-SSGA to reduce the searching time in inverse problem of a buried metallic object
Authors:	Chien, Wei;丘建青;Chiu, Chien-ching
Contributors:	淡江大學電機工程學系
Keywords:	Cubic-spline;half-space;improved efficient steady-state genetic algorithm;NU-SSGA;inverse problem
Date:	2005-10
Issue Date:	2010-03-26 21:14:29 (UTC+8)
Publisher:	Piscataway: Institute of Electrical and Electronics Engineers (IEEE)
Abstract:	We describe an inverse scattering problem with the aim of reducing the computation time for recovering the details of a perfectly conducting cylindrical object buried in a half-space. First, we use Fourier-series or cubic-spline methods to describe the shape and reformulate the inverse problem into an optimization one. Then we solved it by the improved steady-state genetic algorithm (SSGA) and simple genetic algorithm (SGA) respectively and compare the cost time in finding out the global extreme solution of the objective function. It is found the searching ability of SSGA is much powerful than that of the SGA. Even when the initial guess is far away from the exact one, the cost time for converging to a global extreme solution using by SSGA is much less than that by SGA. Numerical results are given to show that the inverse problem by using SSGA is much better than SGA in time costing.
Relation:	IEEE Transactions on Antennas and Propagation 53(10), pp.3128-3134
DOI:	10.1109/TAP.2005.856362
Appears in Collections:	[Graduate Institute & Department of Electrical Engineering] Journal Article

Files in This Item:

File	Description	Size	Format
0018-926X_53(10)p3128-3134.pdf		493Kb	Adobe PDF	744	View/Open

Loading...