Research on Route Optimization of Dynamic Random Network Based on Genetic Algorithm
The traditional algorithms of shortest path, different path and etc can only solve the path optimization problems of static network. Based on the fact of actual transport network as dynamic random network, the paper used method of shortest route to optimize the path. The solution of shortest route was on the basis of genetic algorithm. The paper designed operators of crossover, mutation and selection. In addition, the specific example of dynamic random network route selection based on the proposed algorithm also verified the feasibility of the algorithm.
Donald C. Wunsch II, Honghua Tan, Dehuai Zeng, Qi Luo
C. L. Zhang "Research on Route Optimization of Dynamic Random Network Based on Genetic Algorithm", Advanced Materials Research, Vols. 121-122, pp. 792-796, 2010