• Shaik Karimullah
• Dr.K.Murali Babu
• Dr.K.Riyazuddin

As technology advances at a rapid pace in the field of VLSI physical design, the maximum number of transistors and modules must be integrated within the comparatively small range. The aim and goal of physical design placement is generally to reduce the silicon chip area. Hence Optimization approach is considered for placement and routing strategies to achieve best solution. Most of the optimization techniques adopted nowadays are either nature-inspired or evolution-based. These methods of optimization take important attributes from our problem and use them as the variables in their algorithms to produce better solutions. Several algorithms such as Greedy Nearest Neighbor, Simulated Annealing, Ant Colony and Genetic Algorithms have been investigated in the present work to optimize processing blocks. This investigation has been carried out by using MATLAB software with optimization tool box using Travelling salesman problem.

Optimization, Placement, Greedy Nearest Neighbor, Simulated Annealing, Ant Colony and Genetic Algorithms.

"STRATEGICAL COMPARISION OF PLACEMENT AND ROUTING IN VLSI DESIGN USING OPTIMIZATION ALGORITHMS", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.5, Issue 8, page no.637-641, August-2018, Available :http://www.jetir.org/papers/JETIR1808994.pdf

"STRATEGICAL COMPARISION OF PLACEMENT AND ROUTING IN VLSI DESIGN USING OPTIMIZATION ALGORITHMS", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.5, Issue 8, page no. pp637-641, August-2018, Available at : http://www.jetir.org/papers/JETIR1808994.pdf