Journal of Computer Applications ›› 2024, Vol. 44 ›› Issue (11): 3386-3395.DOI: 10.11772/j.issn.1001-9081.2023111596

• Data science and technology • Previous Articles     Next Articles

Optimization of edge connection rules for supply chain network based on improved expectation maximization algorithm

Zhongyu WANG1, Xiaodong QIAN2()   

  1. 1.School of Traffic and Transportation,Lanzhou Jiaotong University,Lanzhou Gansu 730070,China
    2.School of Economics and Management,Lanzhou Jiaotong University,Lanzhou Gansu 730070,China
  • Received:2023-11-22 Revised:2024-03-10 Accepted:2024-03-14 Online:2024-03-22 Published:2024-11-10
  • Contact: Xiaodong QIAN
  • About author:WANG Zhongyu, born in 1998, M. S. candidate. His research interests include supply chain networks, complex networks.
  • Supported by:
    Gansu Provincial Natural Science Foundation(23JRRA898)

基于改进期望最大化算法的供应链网络边连接规则优化

王中钰1, 钱晓东2()   

  1. 1.兰州交通大学 交通运输学院,兰州 730070
    2.兰州交通大学 经济管理学院,兰州 730070
  • 通讯作者: 钱晓东
  • 作者简介:王中钰(1998—),男,河南新乡人,硕士研究生,CCF会员,主要研究方向:供应链网络、复杂网络
  • 基金资助:
    甘肃省自然科学基金资助项目(23JRRA898)

Abstract:

Aiming at the problem that the stochastic connection of enterprises may lead to the decrease of network stability and operational efficiency in the evolution stage of supply chain network, an improved connection algorithm of supply chain network based on Expectation Maximization (EM) algorithm was proposed. Firstly, the number of edges of network nodes was added to the algorithm as a new parameter to determine the number of edges possessed by new nodes in the supply chain network more accurately. Secondly, with the number of edges determined, residual edge connection rules was introduced to enhance the selectivity and differentiation of nodes. Finally, by ensuring the smooth operation of the enterprise nodes newly connected to the network, the influence of different initial edge numbers on the network evolution was studied. Simulation results show that compared with the EM algorithm, the proposed improved algorithm only needs 80 iterations to obtain stable results, and the number of connected edges is stable around 4 within the network scale of 1 000 nodes, which matches the evolution process of the actual supply chain network. It can be seen that the proposed algorithm is obviously better than the original EM algorithm in fitting performance of the actual supply chain network.

Key words: supply chain network, complex network, Expectation Maximization (EM) algorithm, connection rule, evolution law

摘要:

针对供应链网络在演化形成阶段,企业随机连接可能会导致网络稳定性和运作效率降低的问题,提出一种基于期望最大化(EM)算法的供应链网络连接改进算法。首先,将网络节点边的数量作为新参数加入算法,以更准确地确定新节点在供应链网络中拥有的边数;其次,在边数确定的情况下,提出剩余边连接规则,以增强节点的选择性和分化度;最后,在保证新企业节点能平稳运行的前提下,研究不同初始边数对网络演化的影响。仿真实验结果表明,与EM算法相比,所提改进算法仅需要迭代计算80次即可得到稳定的结果,并且在1 000个节点的规模内,得到的连边数量稳定在4附近,与实际供应链网络的演化过程相匹配。由此可见,所提算法对实际供应链网络的拟合效果明显优于EM算法。

关键词: 供应链网络, 复杂网络, 期望最大化算法, 连接规则, 演化规律

CLC Number: