Block placement by improved simulated annealing based on genetic algorithm

This paper proposes an improved simulated annealing method based on a genetic algorithm and applies it to a block placement problem of VLSI. The proposed method can effectively search wide state space for an optimal solution because of the parallel search starting from many initial points and the selection of search paths. Computational experiments show that this method is more likely to obtain a better solution than the conventional simulated annealing method.