A Modified 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 propose a modified genetic channel router. We adopt the compatible crossover operator and newly designed compatible mutation operator in order to search solution space more effectively, where vertical constraints are integrated. By carefully selected fitness function forms and optimized genetic parameters, the current version speeds up benchmarks on average about 5.83 times faster than that of our previous version. Moreover the total convergence to optimal solutions for benchmarks can be always obtained.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E77-A No.12 pp.2076-2084
- Publication Date
- 1994/12/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section PAPER (Special Section on VLSI Design and CAD Algorithms)
- Category
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
Akio SAKAMOTO, Xingzhao LIU, Takashi SHIMAMOTO, "A Modified Genetic Channel Router" in IEICE TRANSACTIONS on Fundamentals,
vol. E77-A, no. 12, pp. 2076-2084, December 1994, doi: .
Abstract: Genetic algorithms have been shown to be very useful in a variety of search and optimization problems. In this paper, we propose a modified genetic channel router. We adopt the compatible crossover operator and newly designed compatible mutation operator in order to search solution space more effectively, where vertical constraints are integrated. By carefully selected fitness function forms and optimized genetic parameters, the current version speeds up benchmarks on average about 5.83 times faster than that of our previous version. Moreover the total convergence to optimal solutions for benchmarks can be always obtained.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e77-a_12_2076/_p
Copy
@ARTICLE{e77-a_12_2076,
author={Akio SAKAMOTO, Xingzhao LIU, Takashi SHIMAMOTO, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Modified Genetic Channel Router},
year={1994},
volume={E77-A},
number={12},
pages={2076-2084},
abstract={Genetic algorithms have been shown to be very useful in a variety of search and optimization problems. In this paper, we propose a modified genetic channel router. We adopt the compatible crossover operator and newly designed compatible mutation operator in order to search solution space more effectively, where vertical constraints are integrated. By carefully selected fitness function forms and optimized genetic parameters, the current version speeds up benchmarks on average about 5.83 times faster than that of our previous version. Moreover the total convergence to optimal solutions for benchmarks can be always obtained.},
keywords={},
doi={},
ISSN={},
month={December},}
Copy
TY - JOUR
TI - A Modified Genetic Channel Router
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2076
EP - 2084
AU - Akio SAKAMOTO
AU - Xingzhao LIU
AU - Takashi SHIMAMOTO
PY - 1994
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E77-A
IS - 12
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - December 1994
AB - Genetic algorithms have been shown to be very useful in a variety of search and optimization problems. In this paper, we propose a modified genetic channel router. We adopt the compatible crossover operator and newly designed compatible mutation operator in order to search solution space more effectively, where vertical constraints are integrated. By carefully selected fitness function forms and optimized genetic parameters, the current version speeds up benchmarks on average about 5.83 times faster than that of our previous version. Moreover the total convergence to optimal solutions for benchmarks can be always obtained.
ER -
English
