A Quantum Genetic Algorithm for Shortest Path Routing(SPR) Problem 一种求解最短路径路由(SPR)问题的量子遗传算法
Research on a genetic algorithm for heuristic shortest path routing 一种启发式SP路由遗传算法的研究
This paper presents a heuristic genetic algorithmic solve to shortest path routing optimization problem. 论述了用启发式遗传算法解决最短路径路由(SPR)的优化问题。
The longest covered-time and the shortest path routing algorithms are proposed, which are analyzed and simulated. Route reconstructed rate and datagram loss rate are compared for the two algorithms. 提出了最长覆盖时间和最短路径的路由算法,并作了相应的分析和仿真,对两种算法的路由重构率和数据报丢失率等方面作了比较。
We have made a more careful improvement based on the shortest path routing. In order to reaction the real features of network, we have adopted the weighted network as the network model. 我们在最短路径的策略基础上做了更细致的改进,并且为了更真实的反应网络的基本特征,我们采用了加权网络作为网络模型。