Applications of genetic algorithms to optimal multilevel design of MPLS-based networks
Computer Communications
| Hi-index | 0.00 |
In this paper, the topology design of B-ISDN networks is addressed. We model the topological planning as a non-linear mixed-integer programming problem. The genetic algorithm, an effective optimization method, is applied to this problem. Since the randomness of the genetic algorithm cannot guarantee the biconnectivity requirement in the topologies generated by the genetic algorithm, we propose an algorithm to make all topologies at least biconnected while increasing the overall cost of the topologies the least. The result for a 20-node test case is presented in the paper and it is shown that the algorithm we propose has a very good convergence property.