| 求解最短路径问题的DNA动态规划算法 |
| |
| 引用本文： | 李步军,王继顺,王顺绪. 求解最短路径问题的DNA动态规划算法[J]. 齐齐哈尔轻工业学院学报, 2010, 0(4): 76-78 |
| |
| 作者姓名： | 李步军 王继顺 王顺绪 |
| |
| 作者单位： | [1]淮海工学院理学院,江苏连云港222005 [2]连云港师范高等专科学校数学系,江苏连云港222006 |
| |
| 基金项目： | 淮海工学院特色专业项目建设（5509007）; 信息与计算科学专业实践教学的研究与探索（5509002） |
| |
| 摘 要： | 最短路径问题是一个组合优化问题,许多交通运输、工程、管理等实际问题可转化为最短路径问题进行求解。文中利用DNA计算的并行计算模式,给出一个求解最短路径问题的DNA动态规划算法,该算法最多需要7n-11个生物操作。
|
| 关 键 词： | 最短路径问题 DNA计算 动态规划算法 |
DNA dynamic programmimg algorithm for solving the shortest path problem |
| |
| LI Bu-jun,WANG Ji-shun,WANG Shun-xu. DNA dynamic programmimg algorithm for solving the shortest path problem[J]. , 2010, 0(4): 76-78 |
| |
| Authors: | LI Bu-jun WANG Ji-shun WANG Shun-xu |
| |
| Affiliation: | 1.Department of Science,Huaihai Institute of Technology,Jiangsu Lianyungang 222005,China 2.Department of Mathematics,Lianyungang Normal College,Jiangsu Lianyungang 222006,China) |
| |
| Abstract: | The shortest path problem is a problem of combinatorial optimization,many problems in transportation,engineering and management can be solved by being converted to the shortest path problem.We give a DNA dynamic programmimg algorithm for solving the shortest path problem using DNA computing of a new parallel model in this paper,it only needs 7n-1 1 biological operations at most. |
| |
| Keywords: | shortest path problem DNA computing dynamic programmimg algorithm |
| 本文献已被 维普 等数据库收录！ |
|
