Multi-FPGA systems synthesis by means of evolutionary computation
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartII
Compact Genetic Algorithms using belief vectors
Applied Soft Computing
| Hi-index | 0.00 |
Genetic Algorithms (GAs) are stocastic optimization heuristics in which searches in solution space are carried out by imitating the population genetics stated in Darwin's theory of evolution. The compact Genetic Algorithm (cGA) does not manage a population of solutions but only mimics its existence. The combination of genetic and local search heuristic has been shown to be an effective approach to solve some optimization problems more efficiently than with a single GA or a cGA. Multi-FPGA systems Design flow as three major tasks; partitioning, placement and routing. In this paper we present a new hybrid algorithm that exploits a cGA in order to generate high quality partitioning and placement solutions and, by means of a local search heuristic, improves the solutions obtained using a cGA or a GA.