摘要
将复杂网络理论应用于制造业中的产品族零部件关系领域,构建了产品族零部件关系网络.为进一步深入研究零部件关系网络,需要搜索零部件关系网络中的简单路径.提出了一种有向无环网络中任意两节点间所有简单路径的通用搜索算法.编制程序实现了该算法,对算法效率进行了分析.将算法应用于产品族零部件关系网络,对零部件关系网络进行了分析,对算法进行了验证.
Applying complex network theory to parts relation field of product family in manufacturing, a kind of parts relation network of product family was constructed. In order to research parts relation network of product family deeply, it is necessary to detect simple paths in parts relation network. A universal algorithm for detecting all simple paths between any two nodes in weighted directed acyclic network was presented. The algorithm was realized through program, the efficiency of the algorithm was analyzed. Applying the algorithm to parts relation network, the network was analyzed and the algorithm was validated.
出处
《系统工程理论与实践》
EI
CSCD
北大核心
2006年第4期9-13,84,共6页
Systems Engineering-Theory & Practice
基金
国家自然科学基金(60374057
50575204)
关键词
有向无环网络
复杂网络
简单路径
搜索算法
directed acyclic network
complex network
simple path
detecting algorithm
