• CN:11-2187/TH
  • ISSN:0577-6686

›› 2001, Vol. 37 ›› Issue (10): 40-46.

• 论文 • 上一篇    下一篇

扫码分享

基于TSP问题求解的机构同构判定算法

孙晓斌;肖人彬   

  1. 华中科技大学CAD中心
  • 发布日期:2001-10-15

NEW ISOMORPHISM IDENTIFICATION METHOD BASED ON THE ADAPTIVE APPROACH TO TSP

Sun Xiaobin;Xiao Renbin   

  1. Huazhong University of Science and Technology
  • Published:2001-10-15

摘要: 提出了描述运动链拓扑结构特征的一种新参量——条件最大结构码及其求解方法。在此基础上,将机构同构判定问题转化为了最大结构码的求解问题,并进一步阐明了该问题实质上可等同成一个可降次的TSP(Travelling salesman problems)问题。遵循上述思路,将算法分成降次和遗传求解TSP问题两个阶段分别进行深入讨论。通过一个特殊的算例进一步验证了该算法的有效性。

关键词: 机构, 降次, 同构, 拓扑, 遗传

Abstract: A new parameter named the maximum lever-structural code that can be used for describing mechanism’s topological structure is proposed, and an efficient approach to acquire this code is discussed. Through the above idea, the isomorphism identification problem (IIP for short) is translated an genetic adaptive method to this problem. Thus, the genetic adaptive model for the graph isomorphism identification I developed, which includes the construction of an effective method decreasing the problem’s dimensions and an evolutionary searching strategy. A case study is provided to demonstrate the preliminary success of the approach. An important motivation of this study is based on an observation that existing methods to IIP have not provided robust and efficient solutions, because of the NP hard nature of this problem.

Key words: Decrease dimension, Genetic algorithm, Isomorphism, Mechanism, Topology

中图分类号: