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 theoretical optimal assembly sequence are presented. By designing DNA simulation model, the optimal assembly sequence is generated on computer. It demonstrates that DNA computation can process huge amount of data in parallel compared with traditional optimal methods and can be applied in engineering problem with high computation complexity.%为了解决装配序列规划中的NP问题,引入DNA计算的方法进行最优装配序列求解.依据信息论中信息熵的概念,采用信息分解转换法提取装配体信息,提出用装配信息熵评价零件之间的关联,将装配序列规划问题转化为求最小Hamilton回路问题.研究了DNA计算理论,并给出了利用DNA计算求解最优装配序列的步骤.设计了DNA计算的仿真模型,求出最优装配序列.与传统优化方法进行了比较,证明了DNA计算能够并行地处理海量数据,解决计算复杂度高的工程问题.
展开▼
