Evolution programs have been shown to be very useful in a variety of search and optimization problems, however, until now, there has been little attempt to apply evolution programs to channel routing problem. In this paper, we present an exolution program and identify the key points which are essential to successfully applying evolution programs to channel routing problem. We also indicate how integrating heuristic information related to the problem under consideration helps in convergence on final solutions and illustrate the validity of out approach by providing experimental results obtained for the benchmark tests. compared with the optimal solutions.
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.
Copy
Xingzhao LIU, Akio SAKAMOTO, Takashi SHIMAMOTO, "Restrictive Channel Routing with Evolution Programs" in IEICE TRANSACTIONS on Fundamentals,
vol. E76-A, no. 10, pp. 1738-1745, October 1993, doi: .
Abstract: Evolution programs have been shown to be very useful in a variety of search and optimization problems, however, until now, there has been little attempt to apply evolution programs to channel routing problem. In this paper, we present an exolution program and identify the key points which are essential to successfully applying evolution programs to channel routing problem. We also indicate how integrating heuristic information related to the problem under consideration helps in convergence on final solutions and illustrate the validity of out approach by providing experimental results obtained for the benchmark tests. compared with the optimal solutions.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e76-a_10_1738/_p
Copy
@ARTICLE{e76-a_10_1738,
author={Xingzhao LIU, Akio SAKAMOTO, Takashi SHIMAMOTO, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Restrictive Channel Routing with Evolution Programs},
year={1993},
volume={E76-A},
number={10},
pages={1738-1745},
abstract={Evolution programs have been shown to be very useful in a variety of search and optimization problems, however, until now, there has been little attempt to apply evolution programs to channel routing problem. In this paper, we present an exolution program and identify the key points which are essential to successfully applying evolution programs to channel routing problem. We also indicate how integrating heuristic information related to the problem under consideration helps in convergence on final solutions and illustrate the validity of out approach by providing experimental results obtained for the benchmark tests. compared with the optimal solutions.},
keywords={},
doi={},
ISSN={},
month={October},}
Copy
TY - JOUR
TI - Restrictive Channel Routing with Evolution Programs
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1738
EP - 1745
AU - Xingzhao LIU
AU - Akio SAKAMOTO
AU - Takashi SHIMAMOTO
PY - 1993
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E76-A
IS - 10
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - October 1993
AB - Evolution programs have been shown to be very useful in a variety of search and optimization problems, however, until now, there has been little attempt to apply evolution programs to channel routing problem. In this paper, we present an exolution program and identify the key points which are essential to successfully applying evolution programs to channel routing problem. We also indicate how integrating heuristic information related to the problem under consideration helps in convergence on final solutions and illustrate the validity of out approach by providing experimental results obtained for the benchmark tests. compared with the optimal solutions.
ER -