Distributed genetic algorithms for the floorplan design problem
Cohoon, J.P.
Hegde, S.U.
Martin, W.N.
Richards, D.S.
Dept. of Comput. Sci., Virginia Univ., Charlottesville, VA;
Abstract
Designing a VLSI floorplan calls for arranging a given set of
modules in the plane to minimize the weighted sum of area and
wire-length measures. A method of solving the floorplan design problem
using distributed genetic algorithms is presented. Distributed genetic
algorithms, based on the paleontological theory of punctuated
equilibria, offer a conceptual modification to the traditional genetic
algorithms. Experimental results on several problem instances
demonstrate the efficacy of this method and indicate the advantages of
this method over other methods, such as simulated annealing. The method
has performed better than the simulated annealing approach, both in
terms of the average cost of the solutions found and the best-found
solution, in almost all the problem instances tried
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
