摘要
对供应链建模与分析研究现状进行简述 ,并介绍笔者先前提出的基于 Meta图的供应链建模方法 ;在此基础上提出最大 Meta路的概念 ,并给出其数学定义 ;提出基于 Meta图邻接矩阵传递闭包的最大 Meta路的算法 ,并对其算法复杂度进行分析 ,结果表明该算法的复杂度为多项式的 ;通过实例对最大Meta路在供应链建模及其结构分析中的应用进行讨论 。
First, we briefly discuss the current situation about the research on the modeling of supply chain and introduce a metagraph based modeling approach we previously proposed. Then, a concept of maximum metapath is defined mathematically, based on the concept of metagraph and metapath. An algorithm to find the maximum metapaths on the basis of the closure of the adjacency matrix of the metagraph has been given. Analysis shows that the complexity of the algorithm is polynomial. At last we use a case study to discuss the application of the maximum metapath to the analysis of supply chain construction. The computing results show that it is a very effective quantitative appraisal method before the supply chain has actually been constructed.
出处
《系统工程》
CSCD
北大核心
2003年第4期43-48,共6页
Systems Engineering
基金
广东省自然科学基金资助项目 (0 2 135 2 )
广东省"千百十人才工程"基金资助项目 (Q0 2 119)
关键词
最大Meta路
META图
供应链
建模
分析
Supply Chain Modeling
Metagraph
The maximum Metapath
Quantitative Analysis
