Abstract
Although there are many characteristics of Genetic Algorithms (GAs) which qualify them to be a robust based search procedure, still GAs are not well suited to perform finely tuned search. One way to improve performance of GAs is through inclusion of local search, creating a hybrid genetic algorithm (HGA). The inclusion of local search helps to speed up the solution process and to make the solution technique more robust. A high-level synthesis framework based on hybrid evolutionary computation is presented. This novel hybrid evolutionary computation algorithm includes two levels of optimization: a stochastic global search method using a multi-objective adaptive genetic algorithm and a local optimization technique to create a hybrid adaptive GA (HAGA). By using this method, a desirable convergence of solutions has been accomplished by applying a controllable search strategy.
| Original language | English |
|---|---|
| Pages (from-to) | 311-327 |
| Number of pages | 17 |
| Journal | International Journal of Computational Intelligence Research |
| Volume | 5 |
| Issue number | 3 |
| Publication status | Published - 1 Jul 2009 |