摘要
In this papert the routing problem in virtual circuit networks is considered. We consider the problem of choosing a path for each origin-destination pair to minimize the average delay encountered by packts. We give the usual formulation of this problem as a nonlinear combinatorial optimization problem. We present a genetic algorithm to solve this problem. Extensive computational results across a variety of networks are reported. These results indicate that our method outperforms the other methods in the literature.
In this papert the routing problem in virtual circuit networks is considered. We consider the problem of choosing a path for each origin-destination pair to minimize the average delay encountered by packts. We give the usual formulation of this problem as a nonlinear combinatorial optimization problem. We present a genetic algorithm to solve this problem. Extensive computational results across a variety of networks are reported. These results indicate that our method outperforms the other methods in the literature.
出处
《数值计算与计算机应用》
CSCD
北大核心
1998年第1期1-8,共8页
Journal on Numerical Methods and Computer Applications
