科研之友
微信
新浪微博
Facebook
分享链接
摘要
Graph theory can be used efficiently for both kinematic and dynamics analysis of mechanical structures. One of the most important and difficult issues in graphs theory-based structures design is graphs isomorphism discernment. The problem is vital for graph theory-based kinematic structures enumeration, which is known to be nondeterministic polynomial-complete problem. To solve the problem, a Hopfield neural networks (HNN) model is presented and some operators are improved to prevent premature convergence. By comparing with genetic algorithm, the computation times of the HNN model shows less affection when the number of nodes were enhanced. It is concluded that the algorithm presented in this paper is efficient for large-scale graphs isomorphism problem.
