Distributed Genetic Algorithms for the Floor Plan Design Problems

Report
Authors:Cohoon, James, Department of Computer ScienceUniversity of Virginia Hegde, S, Department of Computer ScienceUniversity of Virginia Martin, Worthy, Department of Computer ScienceUniversity of Virginia Richards, Dana, Department of Computer ScienceUniversity of Virginia
Abstract:

Floorplan design is an important stage in the VLSI design cycle. Designing a floorplan calls for arranging a given set of modules in the plane to minimize the weighted sum of area and wire length measures. This paper presents a method to solve the floorplan
design problem using distributed genetic algorithms. 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 our method, and point out the advantages of using this method over other methods, such as simulated annealing. Our 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. 1‘ Submitted to IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. A conference version of this paper appears in the 1988 IEEE International Conference on Computer-Aided Design.
Note: Abstract extracted from PDF file via OCR

Rights:
All rights reserved (no additional license for public reuse)
Language:
English
Source Citation:

Cohoon, James, S Hegde, Worthy Martin, and Dana Richards. "Distributed Genetic Algorithms for the Floor Plan Design Problems." University of Virginia Dept. of Computer Science Tech Report (1988).

Publisher:
University of Virginia, Department of Computer Science
Published Date:
1988