A genetic algorithmic approach to the shortest path (SP) routing problem in large network was presented in order to improve the efficiency of computation.
为提高求解大型网络最短路问题(SP)的效率，采用遗传算法求解。
First, I begin with the problem the shortest path problem which is one classic problem in the routing part.
首先提出最短路径方法及应用，主要分两方面进行展开：点到点最短一条路径和点到点最短多条路径。
应用推荐