A new genetic algorithm for the channel routing problem

A new genetic algorithm for channel routing in VLSI circuits is presented. It is based on a random path search in a lattice-like representation of the routing channel. The performance of the algorithm is tested on different benchmarks and it is shown that the results obtained using the proposed algorithm are either qualitatively similar to or better than the best published results.<<ETX>>

[1]  Yu-Chin Hsu,et al.  SILK: a simulated evolution router , 1989, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[2]  Alberto L. Sangiovanni-Vincentelli,et al.  A Detailed Router Based on Incremental Routing Modifications: Mighty , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[3]  Rostam Joobbani,et al.  Artificial Intelligence Approach to VLSI Routing , 1985 .

[4]  Adel Torkaman Rahmani,et al.  A Genetic Algorithm for Channel Routing Problem , 1993, International Conference on Genetic Algorithms.

[5]  Takeshi Yoshimura,et al.  Efficient Algorithms for Channel Routing , 1982, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[6]  Sabih H. Gerez,et al.  Switchbox routing by stepwise reshaping , 1989, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[7]  C. Y. Lee.  An Algorithm for Path Connections and Its Applications , 1961, IRE Trans. Electron. Comput..

[8]  Thomas G. Szymanski.  Dogleg Channel Routing is NP-Complete , 1985, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[9]  F. Sorbello,et al.  A genetic algorithm for the routing of VLSI circuits , 1991, Euro ASIC '91.

[10]  Ronald L. Rivest,et al.  A "Greedy" Channel Router , 1982, DAC 1982.