An efficient congestion optimization algorithm for global routing based on search space traversing technology

In this paper, we present an efficient congestion optimization algorithm for global routing based on search space traversing technology. In this method, we adopt stochastic optimization, deterministic optimization and a local enumeration strategy to dynamically reconstruct the problem structure and make the "transition" from a local minimum point. Thus, we can reach other parts of the search space, traverse the whole search space, and obtain the global (approximate) optimal solution. In addition, we shorten the running time. Since any arbitrary initial solution can be accepted, the initialization in our algorithm is greatly simplified. We tested MCNC benchmark circuits and industrial circuits, and compared the experimental results with those of typical existing algorithms. It indicates that our algorithm can obtain the global (approximate) optimal solution easily and quickly. Moreover, it can meet the needs of practical applications.