Adaptive simulated annealing genetic algorithm for system identification
β Scribed by Il-kwon Jeong; Ju-jang Lee
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 757 KB
- Volume
- 9
- Category
- Article
- ISSN
- 0952-1976
No coin nor oath required. For personal study only.
β¦ Synopsis
Genetic algorithms and simulated annealing are leading methods of search and optimization. This paper proposes an efficient hybrid genetic algorithm named ASAGA (Adaptive Simulated Annealing Genetic Algorithm). Genetic algorithms are global search techniques for optimization. However, they are poor at hill-climbing. Simulated annealing has the ability of probabilistic hill-climbing. Therefore, the two techniques are combined here to produce an adaptive algorithm that has the merits of both genetic algorithms and simulated annealing, by introducing a mutation operator like simulated annealing and an adaptive cooling schedule. The validity and the efficiency of the proposed algorithm are shown by an example involving system identification.
π SIMILAR VOLUMES
## Abstract We present a novel approach for optimizing reservoir operation through fuzzy programming and a hybrid evolution algorithm, i.e. genetic algorithm (GA) with simulated annealing (SA). In the analysis, objectives and constraints of reservoir operation are transformed by fuzzy programming f
The optimal regression testing problem is one of determining the minimum number of test cases needed for revalidating modified software in the maintenance phase. We present two natural optimization algorithms, namely, a simulated annealing and a genetic algorithm, for solving this problem. The algor