Skip to Main Content
Evolutionary algorithm is a class of stochastic search algorithm, which can be applied to both combinatorial and numerical optimization problems, especially NP hard problems. Circuit partitioning, placement and clock routing are three key phases in VLSI physical design and they are proved to be NP hard. So a genetic algorithm frame and its realization process are presented in this paper in order to solve these problems. Meanwhile, this algorithm is used to test different benchmarks for three different problems, experimental results show that it is a feasible and valid algorithm. This genetic algorithm can also improve solutions when compared with traditional heuristic methods.