计算机应用 ›› 2009, Vol. 29 ›› Issue (11): 3056-3059.
• 人工智能与先进计算 • 上一篇 下一篇
王延峰1,申永鹏2,张勋才3,崔光照3
收稿日期:
修回日期:
发布日期:
出版日期:
通讯作者:
基金资助:
Yan-feng WANG,Yong-peng SHEN,Xun-cai ZHANG,Guang-zhao CUI
Received:
Revised:
Online:
Published:
Contact:
摘要： 针对DNA计算中的编码序列设计问题，分析了DNA编码序列设计的目标和需要满足的约束条件，并建立了相应的数学模型。通过将约束条件引入非支配排序过程，提出了一种改进的NSGA-Ⅱ算法。实验结果表明，该算法具有良好的收敛特性和种群多样性，能为可控的DNA计算提供可靠的编码序列。
关键词: DNA计算, 编码序列, 遗传算法, NSGA-Ⅱ
Abstract: Concerning DNA codewords design, the authors set up the mathematical model by analyzing the objectives and the restrictions that should be satisfied. A new codewords design method named the Improved Non-dominated Sorting Genetic Algorithm (INSGA-Ⅱ) was proposed by introducing the constraints to the non-dominated sorting process. The experiments demonstrate that INSGA-Ⅱ has higher convergence speed and better population diversity than those of NSGA, and can provide reliable and effective codewords for the controllable DNA computing.
Key words: DNA algorithm, oded sequence, Genetic Algorithm (GA), NSGA-Ⅱ
王延峰 申永鹏 张勋才 崔光照. 基于改进非支配遗传算法的DNA编码序列优化方法[J]. 计算机应用, 2009, 29(11): 3056-3059.
Yan-feng WANG Yong-peng SHEN Xun-cai ZHANG Guang-zhao CUI. DNA codewords design based on improved NSGA-Ⅱ[J]. Journal of Computer Applications, 2009, 29(11): 3056-3059.
0 / 推荐
导出引用管理器 EndNote|Ris|BibTeX
链接本文: http://www.joca.cn/CN/
http://www.joca.cn/CN/Y2009/V29/I11/3056
