Application of Improved Ant Colony Algorithm in Integrated Circuit Routing

Author

Liying, Han ; Hongmei, Tang ; Zhijie, Sun ; Cunshan, Zhang ; Hongdong, Zhao

Author_Institution

Sch. of Inf., Hebei Univ. of Technol., Tianjin, China

fYear

2009

fDate

5-6 Dec. 2009

Firstpage

44

Lastpage

47

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.

Keywords

VLSI; circuit optimisation; integrated circuit layout; network routing; travelling salesman problems; NP wire problems; ant colony algorithm; fast convergence capability; integrated circuit routing; multiterminal net routing problem; optimization; physical design; Algorithm design and analysis; Ant colony optimization; Application specific integrated circuits; Design optimization; Fabrication; Integrated circuit technology; Routing; Traveling salesman problems; Very large scale integration; Wire; Ant colony algorithm; No grid lines; integrated circuits; multiterminal net;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer and Communications Security, 2009. ICCCS '09. International Conference on

Conference_Location

Hong Kong

Print_ISBN

978-0-7695-3906-5

Electronic_ISBN

978-1-4244-5408-2

Type

conf

DOI

10.1109/ICCCS.2009.16

Filename

5380334