Evolutionary Algorithmical Approach for VLSI Floorplanning Problem

This is a good thesis project for students on "evolutionary algorithmically approach for VLSI floor planning problem". The Classical floor planning that usually handles only block packing to minimize silicon area, So modern floor planning could be formulated as a fixed-outline floor planning. It uses some algorithms such as B-TREE representation, simulated annealing and adaptive fast simulated annealing. You can also Subscribe to FINAL YEAR PROJECT'S by Email for more such projects and seminar.


The algorithm combines a hierarchical design technique, Genetic algorithms, constructive techniques and advanced local search to solve VLSI floor planning problem. MA quickly produces optimal or nearly optimal solutions for all the popular benchmark problems. Thanks to Author of the project.

Author:-Hameem Shanavas .I and Gnanamurthy R.K

Source:- IJCTE

DOWNLOAD

Advertisements:-