[1]李扬,周亮,曹刚,等.装配序列规划的DNA计算及其仿真[J].哈尔滨理工大学学报,2011,(03):17-21.
 LI Yang,ZHOU Liang,CAO Gang,et al.DNA Computation for Assembly Sequence Planning and its Simulation[J].哈尔滨理工大学学报,2011,(03):17-21.
点击复制

装配序列规划的DNA计算及其仿真()
分享到:

《哈尔滨理工大学学报》[ISSN:1007-2683/CN:23-1404/N]

卷:
期数:
2011年03期
页码:
17-21
栏目:
机械动力工程
出版日期:
2011-06-25

文章信息/Info

Title:
DNA Computation for Assembly Sequence Planning and its Simulation
作者:
李扬; 周亮; 曹刚; 任彦海;
哈尔滨理工大学计算机科学与技术学院; 哈尔滨工业大学机电工程学院; 哈尔滨电业局;
Author(s):
LI Yang1; ZHOU Liang2; CAO Gang3; REN Yan-hai2
1.School of Computer Science and Technology; Harbin University of Science and Technology; Harbin 150080; China; 2.School of Mechatronics Engineering; Harbin Institute of Technology; Harbin 150001; 3.Harbin Power Bureau; Harbin 150010; China
关键词:
装配序列 DNA计算 信息熵
Keywords:
assembly sequence DNA computation information entropy
分类号:
TP391.7
文献标志码:
A
摘要:
为了解决装配序列规划中的NP问题,引入DNA计算的方法进行最优装配序列求解.依据信息论中信息熵的概念,采用信息分解转换法提取装配体信息,提出用装配信息熵评价零件之间的关联,将装配序列规划问题转化为求最小Hamilton回路问题.研究了DNA计算理论,并给出了利用DNA计算求解最优装配序列的步骤.设计了DNA计算的仿真模型,求出最优装配序列.与传统优化方法进行了比较,证明了DNA计算能够并行地处理海量数据,解决计算复杂度高的工程问题.
Abstract:
To solve the NP problem in assembly sequence planning,DNA computation is introduced to obtain the optimal assembly sequence.According to the conception of information entropy in information theory,information entropy of assembly is proposed to evaluate the relationship between parts using information decomposition and transformation method.By this means,assembly sequence planning problem is converted into the optimal Hamilton circle problem.Employing DNA computation theory,the steps of DNA computation for t...
更新日期/Last Update: 2011-11-16