By Topic

GenRouter: a genetic algorithm for channel routing problems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Hee Il Ahn ; Electron. & Telecommun. Res. Inst., Daejeon, South Korea ; Han, Seung Kee ; Tae Won Cho

A genetic algorithm for channel routing problems is presented in this paper. The genetic algorithm is new technology developed recently and applied to the many difficult problems. However none of them are applied to the channel routing problems. Thus we applied a genetic method and verified it as a practical algorithm to solve the channel routing problems. The genetic algorithm can be applied easily to the placement; global and detailed routing in the VLSI circuit design. Also the inherent nature of a genetic algorithm makes it possible to parallelize in the multiprocessing environment

Published in:

Microelectronics and VLSI, 1995. TENCON '95., IEEE Region 10 International Conference on

Date of Conference:

6-10 Nov 1995