基于改进遗传算法的最短路径路由优化算法的设计与实现-计算机技术专业论文.docxVIP

HAbstract H Abstract The shortest path problem is a classical algorithm one in the study of graph theory， but also is the hot topic of research in the field·-···-·-routing optimization algorithm for network optimization,which purpose is to search for the shortest path between nodes from the diagram(which formed by the junction point and the path of the diagram)． Wi也the rapid development of Interact，network optimization is imperative for higher requirements for the computer network scalability，stability，security，and fast convergence． There are a lot of auto—adapt Router Algorithms．The Dijkstra Algorithm and Floyd Algorithm ale two famous auto-adapt Router Algorithms in this field．These two algorithms in sowing the Shortest Path routing optimization problem has its own specific advantages．Dijkstra algorithm is suitable for solVing the shortest path routing problem which the starting point have been determined(That is the problem which the starting node is known,seek all the shortest path from the junction line between the start崦node and the rest node of the graph)．But Floyd algorithm is more suitable for solVing the global shortest path routing problem(Which means we should seek all the shortest path from any two nodes of the graph)．HoweveL with the increasing number of the nodes in network,the complexity of these algorithms will be presented geometric progression of growth．ObViously，these algorithms are not well adapted to large-scale networks． In recent years，Genetic Algorithm(Genetic Algorithm，GA)with its strong self-adaptability,global optimization and a strong parallelism，in solVing complex optimization problems has shown a strong problem-solVing abilities，which superior performance has aroused extensive attention．For the adaptive routing algorithm，GA is more effective methods．Compared with traditional algorithm，fast convergence and low computational complexity of the Genetic Algorithm，which makes that it has IIIcertain III certain advantages in researching of th