Optimization of Yagi array by hierarchical genetic algorithms

H. J. Wang; K. F. Man; C. H. Chan; K. M. Luk

doi:10.1109/RAWCON.2003.1227900

Optimization of Yagi array by hierarchical genetic algorithms

H. J. Wang, K. F. Man, C. H. Chan, K. M. Luk

Department of Electrical Engineering

Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review

9 Citations (Scopus)

Abstract

A method of hierarchical genetic algorithms (HGA) is used for optimizing the element spacing and lengths of Yagi-Uda antennas. This scheme has the ability of handling multiobjective functions as well as the discrete constraints in the numerical optimizing process. Together with the technique of Pareto ranking scheme, more than one possible solution can be obtained. It has been found that the number of dipoles of the antenna can be minimally identified with multi-facet design criteria as well as the imposed stringent constraints on the antenna design. Furthermore, this added feature also enables a design tradeoff between cost and performance without extra computational effort.

Original language	English
Title of host publication	Proceedings - 2003 IEEE Radio and Wireless Conference, RAWCON 2003
Publisher	IEEE
Pages	91-94
ISBN (Print)	0780378296, 9780780378292
DOIs	https://doi.org/10.1109/RAWCON.2003.1227900
Publication status	Published - 2003
Event	2003 IEEE Radio and Wireless Conference, RAWCON 2003 - Boston, United States Duration: 10 Aug 2003 → 13 Aug 2003

Conference

Conference	2003 IEEE Radio and Wireless Conference, RAWCON 2003
Place	United States
City	Boston
Period	10/08/03 → 13/08/03

Research Keywords

Antenna arrays
Design methodology
Design optimization
Dipole antennas
Genetic algorithms
Genetic engineering
Integral equations
Microwave theory and techniques
Remote sensing
Yagi-Uda antennas

Access Output

10.1109/RAWCON.2003.1227900

Other Access Options

Check CityUHK Library

Permanent Link

Right click to copy link

Cite this

@inproceedings{0449af805f0e4f3dae45bd2119c850b3,

title = "Optimization of Yagi array by hierarchical genetic algorithms",

abstract = "A method of hierarchical genetic algorithms (HGA) is used for optimizing the element spacing and lengths of Yagi-Uda antennas. This scheme has the ability of handling multiobjective functions as well as the discrete constraints in the numerical optimizing process. Together with the technique of Pareto ranking scheme, more than one possible solution can be obtained. It has been found that the number of dipoles of the antenna can be minimally identified with multi-facet design criteria as well as the imposed stringent constraints on the antenna design. Furthermore, this added feature also enables a design tradeoff between cost and performance without extra computational effort.",

keywords = "Antenna arrays, Design methodology, Design optimization, Dipole antennas, Genetic algorithms, Genetic engineering, Integral equations, Microwave theory and techniques, Remote sensing, Yagi-Uda antennas",

author = "Wang, {H. J.} and Man, {K. F.} and Chan, {C. H.} and Luk, {K. M.}",

year = "2003",

doi = "10.1109/RAWCON.2003.1227900",

language = "English",

isbn = "0780378296",

pages = "91--94",

booktitle = "Proceedings - 2003 IEEE Radio and Wireless Conference, RAWCON 2003",

publisher = "IEEE",

address = "United States",

note = "2003 IEEE Radio and Wireless Conference, RAWCON 2003 ; Conference date: 10-08-2003 Through 13-08-2003",

}

TY - GEN

T1 - Optimization of Yagi array by hierarchical genetic algorithms

AU - Wang, H. J.

AU - Man, K. F.

AU - Chan, C. H.

AU - Luk, K. M.

PY - 2003

Y1 - 2003

N2 - A method of hierarchical genetic algorithms (HGA) is used for optimizing the element spacing and lengths of Yagi-Uda antennas. This scheme has the ability of handling multiobjective functions as well as the discrete constraints in the numerical optimizing process. Together with the technique of Pareto ranking scheme, more than one possible solution can be obtained. It has been found that the number of dipoles of the antenna can be minimally identified with multi-facet design criteria as well as the imposed stringent constraints on the antenna design. Furthermore, this added feature also enables a design tradeoff between cost and performance without extra computational effort.

AB - A method of hierarchical genetic algorithms (HGA) is used for optimizing the element spacing and lengths of Yagi-Uda antennas. This scheme has the ability of handling multiobjective functions as well as the discrete constraints in the numerical optimizing process. Together with the technique of Pareto ranking scheme, more than one possible solution can be obtained. It has been found that the number of dipoles of the antenna can be minimally identified with multi-facet design criteria as well as the imposed stringent constraints on the antenna design. Furthermore, this added feature also enables a design tradeoff between cost and performance without extra computational effort.

KW - Antenna arrays

KW - Design methodology

KW - Design optimization

KW - Dipole antennas

KW - Genetic algorithms

KW - Genetic engineering

KW - Integral equations

KW - Microwave theory and techniques

KW - Remote sensing

KW - Yagi-Uda antennas

UR - http://www.scopus.com/inward/record.url?scp=84881042782&partnerID=8YFLogxK

UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-84881042782&origin=recordpage

U2 - 10.1109/RAWCON.2003.1227900

DO - 10.1109/RAWCON.2003.1227900

M3 - RGC 32 - Refereed conference paper (with host publication)

SN - 0780378296

SN - 9780780378292

SP - 91

EP - 94

BT - Proceedings - 2003 IEEE Radio and Wireless Conference, RAWCON 2003

PB - IEEE

T2 - 2003 IEEE Radio and Wireless Conference, RAWCON 2003

Y2 - 10 August 2003 through 13 August 2003

ER -

Optimization of Yagi array by hierarchical genetic algorithms

Abstract

Conference

Research Keywords

Access Output

Other Access Options

Permanent Link

Other Files and Links

Fingerprint

Cite this