| 1. | Anthinetic of dijkstra yield an effective way to solve this question
Dijkstra算法为解决这类问题提供了一种很好的算法。 |
| 2. | Finally i implement two location model with common di jkstra algorithm and stimulation annealing merged with gas , at the same time i give out some experiment datas and the idea of algorithm
最后对两类选地址模型分别用传统的dijkstra算法和模拟退火遗传混合算法实现，并给出相应的实验数据和算法思想。 |
| 3. | The dijkstra algorithm of the least of hops is used for path calculated in olsr . but the protocol only tries its best to transmit data , not considering the state of wireless link
它采用dijkstra算法计算跳数最短路径,并尽力而为地传送数据包,没有考虑无线链路时延、带宽等状态和节点拥塞程度,这样的路径计算方式已经不能满足用户对网络提供服务质量的要求。 |
| 4. | Choosing route for passengers is the key technology in the bus information system . there are many classic algorithms such as dijkstra algorithm and floyd algorithm to solve the problem . but they do n ' t fit for this problem
选择路径是公交信息系统中的关键技术，有很多经典的算法解决最短路径问题，如dijkstra算法和floyd算法，但大都不适合于公交查询最短路径。 |
| 5. | Base on exist hardware and network equipment the grid computing experimental environment is constituted in this paper . the parallel dijkstra algorithm to solve the short path problem is tested in the experimental environment
本文在介绍网格计算基本理论基础上，在现有硬件环境下架构了globus试验平台，并在globus网格环境下测试了最短路径问题的并行dijkstra算法。 |
| 6. | ( 4 ) an efficient approach of the shortest path algorithm which is based on dijkstra algorithm is realized . a motorcade - optimized dispatching software is realized . finally , future applications of the urban traffic flow guidance system are discussed
( 4 )用dijkstra算法实现了城市中两点间最短路径搜索，在此基础上，实现了基于电子地图的大型车队优化调度及管理的系统软件。 |
| 7. | The theory and algorithm of shortest path in gis is studied in the dissertation . especially , the traditional dijkstra algorithm and heuristic search algorithm are discussed as well as their own characteristics and conditions
论文对gis中最短路径理论和实现算法进行了分析和研究，特别是对传统的dijkstra算法和启发式搜索算法a ~ *算法进行了详细的探讨，并说明了各自的特点及适用条件。 |
| 8. | ( 5 ) this thesis analyzes the path plan algorithms for vehicle location and navigation system . dijkstra algorithm is used to calculate the shortest path . at last some notable problems of optimum method and path plan in gis environments are proposed
( 5 )对路径规划算法进行了分析，用dijkstra算法实现了最优路径的计算；提出了在gis环境下的优化方法以及路径规划过程中需要注意的问题。 |
| 9. | At the end of this paper , the different results of pcnn algorithm and dijkstra algorithm is compared , the reason of the difference is analyzed under their internal mechanism , then the conclusion of pcnn has more advantages is drawn
最后，本文还通过计算实例将脉冲耦合神经网络算法与dijkstra算法的结果进行了比较，从算法思想上探讨了计算结果不同的原因，说明了pcnn算法具有一定的优越性。 |
| 10. | This paper focuses on the following research work : 1 . proposes a genetic algorithm based on matrix encoding for next hop route with load and time delay ; 2 . proposes a genetic algorithm for shortest route via designated node , solves the problem which dijkastra algorithm need two times or more to compute ; 3 . proposes a scheme of dividing populations and dividing time in order to improve the success ratio ; 4 . proposes a network model for directional motion , performs evaluation for mobile ip based on wlan , and concludes some useful results
提出了解决移动ip中过指定点的路由的遗传算法，解决了dijkstra算法需要分次计算的问题，通过记录遗传算法的叠代结果还可以给出次优解路由； 3引入了分群和分周期的操作策略，对过指点最短路由的遗传算法进行了改进，仿真分析表明使用该遗传算法求解过指定点的路由获得了比inagaki算法更高的成功率； 4 |
