Genetic Channel Router
Summary :
Genetic algorithms have been shown to be very useful in a variety of search and optimization problems. In this paper, we describe the implementation of genetic algorithms for channel routing problems and identify the key points which are essential to making full use of the population of potential solutions, that is one of the characteristics of genetic algorithms. Three efficient crossover techniques which can be divided further into 13 kinds of crossover operators have been compared. We also extend our previous work with ability to deal with dogleg case by simply splitting multi-terminal nets into a series of 2-terminal subnets. It routes the Deutsch's difficult example with 21 tracks without any detours.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E77-A No.3 pp.492-501
- Publication Date
- 1994/03/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section PAPER (Special Section on the 6th Karuizawa Workshop on Circuits and Systems)
- Category
- Computer Aided Design (CAD)
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Xingzhao LIU, Akio SAKAMOTO, Takashi SHIMAMOTO, "Genetic Channel Router" in IEICE TRANSACTIONS on Fundamentals,
vol. E77-A, no. 3, pp. 492-501, March 1994, doi: .
Abstract: Genetic algorithms have been shown to be very useful in a variety of search and optimization problems. In this paper, we describe the implementation of genetic algorithms for channel routing problems and identify the key points which are essential to making full use of the population of potential solutions, that is one of the characteristics of genetic algorithms. Three efficient crossover techniques which can be divided further into 13 kinds of crossover operators have been compared. We also extend our previous work with ability to deal with dogleg case by simply splitting multi-terminal nets into a series of 2-terminal subnets. It routes the Deutsch's difficult example with 21 tracks without any detours.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e77-a_3_492/_p
Copy
@ARTICLE{e77-a_3_492,
author={Xingzhao LIU, Akio SAKAMOTO, Takashi SHIMAMOTO, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Genetic Channel Router},
year={1994},
volume={E77-A},
number={3},
pages={492-501},
abstract={Genetic algorithms have been shown to be very useful in a variety of search and optimization problems. In this paper, we describe the implementation of genetic algorithms for channel routing problems and identify the key points which are essential to making full use of the population of potential solutions, that is one of the characteristics of genetic algorithms. Three efficient crossover techniques which can be divided further into 13 kinds of crossover operators have been compared. We also extend our previous work with ability to deal with dogleg case by simply splitting multi-terminal nets into a series of 2-terminal subnets. It routes the Deutsch's difficult example with 21 tracks without any detours.},
keywords={},
doi={},
ISSN={},
month={March},}
Copy
TY - JOUR
TI - Genetic Channel Router
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 492
EP - 501
AU - Xingzhao LIU
AU - Akio SAKAMOTO
AU - Takashi SHIMAMOTO
PY - 1994
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E77-A
IS - 3
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - March 1994
AB - Genetic algorithms have been shown to be very useful in a variety of search and optimization problems. In this paper, we describe the implementation of genetic algorithms for channel routing problems and identify the key points which are essential to making full use of the population of potential solutions, that is one of the characteristics of genetic algorithms. Three efficient crossover techniques which can be divided further into 13 kinds of crossover operators have been compared. We also extend our previous work with ability to deal with dogleg case by simply splitting multi-terminal nets into a series of 2-terminal subnets. It routes the Deutsch's difficult example with 21 tracks without any detours.
ER -
English
