Application of Improved Ant Colony Algorithm in Integrated Circuit Routing

Abstract

As VLSI fabrication technology developing to VDSM and the magnitude increasing rapidly¿a more effective optimized algorithm is requited to realize circuit routing in the physical design. In this paper, through optimizing the basic ant colony algorithm based on ant colony system, a better solution is found. It can improve the problem of excessive search time using the basic ant colony to solve traveling salesman problem (TSP). The improved algorithm has fast convergence capability and strong optimization ability. Using the improved ant colony algorithm to solve the multiterminal net routing problem around the obstacles, a better total connection length is achieved. The experimental results show that the improved ant colony algorithm is an effective way to solve difficult NP wire problems.