A Genetic and Simulated Annealing Combined Algorithm for Optimization of Wideband Antenna Matching Networks

A genetic and simulated annealing combined algorithm is presented and applied to optimize broadband matching networks for antennas. As a result, advantages of both the genetic algorithm (GA) and simulated annealing (SA) are taken. Effectiveness and efficiency of the presented combined algorithm are demonstrated by optimization of a wideband matching network for a VHF/UHF discone-based antenna. The optimized parameters provide significant improvements of VSWR and transducer power gain for the antenna.

Download Full-text

GMDH Network Model Based on Simulated Annealing and Genetic Algorithm

Applied Mechanics and Materials ◽

10.4028/www.scientific.net/amm.380-384.1370 ◽

2013 ◽

Vol 380-384 ◽

pp. 1370-1373

Author(s):

Xiao Ling Zhang ◽

Li Kun Zou

Keyword(s):

Genetic Algorithm ◽

Simulated Annealing ◽

Network Model ◽

Simulated Annealing Algorithm ◽

Least Square Method ◽

Least Square ◽

Model Based ◽

Simulated Annealing Genetic Algorithm ◽

Global And Local ◽

Combined Algorithm

According to the traditional UMDH network modeling with the least square method to recognize parameters ,it's easy to fall into local minimum ,and with the result that the prediction effect is not ideal. This paper puts forward to combine the simulated annealing algorithm and genetic algorithm, and introduces the combined algorithm to the UMDH network which is used to identify some of its description type coefficient. In this paper ,it describes the simulated annealing genetic algorithm ,and constructs the UMDH network model based on this algorithm, and the model is applied to the simulation of debris flow prediction research ,forecast average relative error reached 3. 54%. The results show that the algorithm not only ensuring the global optimization but also preventing premature convergence, improve the UMDH network model of global and local searching optimal ability further.

Download Full-text

Image Segmentation on Colonies Images by A Combined Algorithm of Simulated Annealing and Genetic Algorithm

Fourth International Conference on Image and Graphics (ICIG 2007) ◽

10.1109/icig.2007.106 ◽

2007 ◽

Cited By ~ 4

Author(s):

Wang Luo ◽

Weixing Wang ◽

Haijun Liao

Keyword(s):

Genetic Algorithm ◽

Image Segmentation ◽

Simulated Annealing ◽

Combined Algorithm

Download Full-text

An Effective Heuristic-Based Approach for Partitioning

Journal of Applied Mathematics ◽

10.1155/2013/138037 ◽

2013 ◽

Vol 2013 ◽

pp. 1-8 ◽

Cited By ~ 6

Author(s):

Xibin Zhao ◽

Hehua Zhang ◽

Yu Jiang ◽

Songzheng Song ◽

Xun Jiao ◽

...

Keyword(s):

Genetic Algorithm ◽

Simulated Annealing ◽

Embedded System ◽

Simulated Annealing Algorithm ◽

Optimal Solution ◽

Local Optimal Solution ◽

Annealing Algorithm ◽

The Cost ◽

Combined Algorithm ◽

Search Capability

As being one of the most crucial steps in the design of embedded systems, hardware/software partitioning has received more concern than ever. The performance of a system design will strongly depend on the efficiency of the partitioning. In this paper, we construct a communication graph for embedded system and describe the delay-related constraints and the cost-related objective based on the graph structure. Then, we propose a heuristic based on genetic algorithm and simulated annealing to solve the problem near optimally. We note that the genetic algorithm has a strong global search capability, while the simulated annealing algorithm will fail in a local optimal solution easily. Hence, we can incorporate simulated annealing algorithm in genetic algorithm. The combined algorithm will provide more accurate near-optimal solution with faster speed. Experiment results show that the proposed algorithm produce more accurate partitions than the original genetic algorithm.

Download Full-text

Broadband matching network design for antennas using a hybrid genetic algorithm

2008 8th International Symposium on Antennas, Propagation and EM Theory ◽

10.1109/isape.2008.4735147 ◽

2008 ◽

Author(s):

Jiang Tie-hua ◽

Su Dong-lin ◽

Chen Ai-xin ◽

Zhang Yan-jun ◽

Wang Guo-yu

Keyword(s):

Genetic Algorithm ◽

Network Design ◽

Hybrid Genetic Algorithm ◽

Matching Network ◽

Broadband Matching

Download Full-text

Reflection Modeling Based Broadband Matching Network Design

Frequenz ◽

10.1515/freq-2016-0040 ◽

2017 ◽

Vol 71 (5-6) ◽

Author(s):

Metin Şengül

Keyword(s):

Network Design ◽

Real Function ◽

Power Gain ◽

Data Generation ◽

Output Impedance ◽

Matching Network ◽

Initial Element ◽

Reflection Data ◽

Impedance Data ◽

Broadband Matching

AbstractIn this paper, a new broadband matching network design approach based on reflection modeling is proposed, which has two parts: impedance data generation and modeling. In the approach, firstly the output impedance data of the matching network is obtained to get the desired flat transducer power gain in the passband. Next the output reflection data are calculated using the obtained impedance data, then they are modeled as a bounded real function. Then this function is synthesized and the desired lossless matching network with initial element values is obtained. A double matching example is solved to illustrate the use of the proposed approach. It is seen that proposed approach provides suitable initials for CAD tools for final trimming.

Download Full-text