作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2007, Vol. 33 ›› Issue (16): 181-182,. doi: 10.3969/j.issn.1000-3428.2007.16.063

• 人工智能及识别技术 • 上一篇    下一篇

基于DNA遗传算法的曲面最短路径问题

张 雷1,2,杨大地2,冉 戎2   

  1. (1. 重庆交通大学理学院,重庆 400074;2. 重庆大学数理学院,重庆 400044)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2007-08-20 发布日期:2007-08-20

Shortest Path Problem on Curved Surface Based on DNA Genetic Algorithm

ZHANG Lei1,2, YANG Da-di2, RAN Rong2   

  1. (1. College of Sciences, Chongqing Jiaotong University, Chongqing 400074; 2. College of Mathematics and Sciences, Chongqing University, Chongqing 400044)
  • Received:1900-01-01 Revised:1900-01-01 Online:2007-08-20 Published:2007-08-20

摘要: DNA遗传算法采用遗传算法的整体结构,借助生物学DNA技术,利用DNA双螺旋结构和碱基互补配对原则进行编码运算,继承了遗传算法全局搜索的能力,提高了算法的有效性和收敛速度,避免了经典的遗传算法容易出现的“早熟收敛”和“收敛速度慢”的难题,求解了曲面最短路径规划问题。数值仿真实例证明了该算法的有效性和实用性。

关键词: DNA计算, 遗传算法, 曲面最短路径

Abstract: Based on GA frame and biological thery of DNA technology, DNA-GA utilizes double helix structure of DNA and utilizes molecular satisfying the waston-crick complementary condition to code and operate. DNA-GA inherits global search capability, enhances validity and speed of convergence, avoids prematurely and lower convergent speed of classic genetic algorithm. It is fit for solving the problem of shortest path planning on curved surface. Numerical simulation example shows its effectiveness and validity.

Key words: DNA computation, genetic algorithm, shortest path on curved surface

中图分类号: