The application of genetic algorithms to solve network routing problems

摘要

As the problem of routing is of great importance in network design, the study on the improvement of a core routing algorithm for network service quality has become one of the key problems for current network design. The analysis shows that the routing algorithms used in traditional network design have low efficiency and performance, while it is an ideal way to apply a routing-based genetic algorithm to network design. By constructing a simulation example, the application of a genetic algorithm for the shortest path has been discussed in this paper. The experimental results show that the genetic algorithm can effectively improve the efficiency of the network routing and network performance and reduce the cost, which favourably guarantees the quality of network service. This has certain practical significance for using the genetic algorithm to calculate more complex network parameters.