This paper deals with the optimum placement of modules on a two-dimensional board, which minimizes the total routing length of signal sets. A new heuristic procedure, based on iterative improvement, is proposed. The procedure repeats random generation of an initial solution and its improvement by a sequence of local transformations. The best among the local optimum solutions is taken as a final solution. This method is different from an earlier one, in the sense that it considers interchanging more than two modules at the same time and examines only a small portion of feasible solutions which has high probability of being better. Experimental results show this procedure gives better solutions than the best one up to now. The computation time for each local optimum solution grows almost linearly with regard to the number of modules.
|ジャーナル||IEEE Transactions on Circuits and Systems|
|出版ステータス||Published - 1981 1月|
ASJC Scopus subject areas