Research on Route Optimization of Dynamic Random Network Based on Genetic Algorithm

Abstract:

Article Preview

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.

Info:

Periodical:

Advanced Materials Research (Volumes 121-122)

Edited by:

Donald C. Wunsch II, Honghua Tan, Dehuai Zeng, Qi Luo

Pages:

792-796

DOI:

10.4028/www.scientific.net/AMR.121-122.792

Citation:

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

Online since:

June 2010

Authors:

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.