| 基于粘贴和删除系统求解旅行商问题的DNA算法 |
| |
| 引用本文： | 董敏,汤建钢.基于粘贴和删除系统求解旅行商问题的DNA算法[J].江汉大学学报(自然科学版),2011,39(4):7-10. |
| |
| 作者姓名： | 董敏 汤建钢 |
| |
| 作者单位： | 伊犁师范学院数学与统计学院,新疆伊宁,835000 |
| |
| 基金项目： | 新疆维吾尔自治区自然科学基金资助项目(2011211A051); 伊犁师范学院2011年度研究生课题资助项目(2011YNYJS007) |
| |
| 摘 要： | 旅行商问题（Traveling Salesman Problem,TSP）是一个典型的NP完全问题.粘贴和删除模型是DNA计算的两个基本计算模型.结合上述两个模型的优点,构造粘贴-删除模型,并利用该模型给出求解旅行商问题一种新的DNA算法.
|
| 关 键 词： | 旅行商问题 DNA计算 粘贴模型 删除模型 |
DNA Algorithm for Traveling Salesman Problem Based on Sticker and Delection Systems |
| |
| DONG Min,TANG Jian-gang.DNA Algorithm for Traveling Salesman Problem Based on Sticker and Delection Systems[J].Journal of Jianghan University:Natural Sciences,2011,39(4):7-10. |
| |
| Authors: | DONG Min TANG Jian-gang |
| |
| Institution: | DONG Min,TANG Jian-gang(College of Mathematics and Statistics,YI NI Normal University,Yining 835000,Xinjiang,China) |
| |
| Abstract: | Traveling Salesman Problem(TSP)is a typical NP-complete problem.In combination with the advantages of sticker and delection models,which are two basic kinds of DNA computing models,the sticker-delection model has been formulated,and a new DNA algorithm for TSP based on this model has been proposed. |
| |
| Keywords: | traveling salesman problem DNA computing sticker system delete system |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
