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
摘要: DNA遗传算法采用遗传算法的整体结构,借助生物学DNA技术,利用DNA双螺旋结构和碱基互补配对原则进行编码运算,继承了遗传算法全局搜索的能力,提高了算法的有效性和收敛速度,避免了经典的遗传算法容易出现的“早熟收敛”和“收敛速度慢”的难题,求解了曲面最短路径规划问题。数值仿真实例证明了该算法的有效性和实用性。
关键词:
DNA计算,
遗传算法,
曲面最短路径
CLC Number:
ZHANG Lei; YANG Da-di; RAN Rong. Shortest Path Problem on Curved Surface Based on DNA Genetic Algorithm[J]. Computer Engineering, 2007, 33(16): 181-182,.
张 雷;杨大地;冉 戎. 基于DNA遗传算法的曲面最短路径问题[J]. 计算机工程, 2007, 33(16): 181-182,.