A Physarum-inspired approach to supply chain network design

被引:21
|
作者
Zhang, Xiaoge [1 ,5 ]
Adamatzky, Andrew [2 ]
Yang, Xin-She [3 ]
Yang, Hai [4 ]
Mahadevan, Sankaran [5 ]
Deng, Yong [1 ,5 ]
机构
[1] Southwest Univ, Sch Comp & Informat Sci, Chongqing 400715, Peoples R China
[2] Univ W England, Unconvent Comp Ctr, Bristol BS16 1QY, Avon, England
[3] Middlesex Univ, Sch Sci & Technol, London NW4 4BT, England
[4] Hong Kong Univ Sci & Technol, Dept Civil & Environm Engn, Hong Kong, Hong Kong, Peoples R China
[5] Vanderbilt Univ, Sch Engn, Nashville, TN 37235 USA
基金
中国国家自然科学基金; 国家高技术研究发展计划(863计划);
关键词
supply chain design; Physarum; capacity investments; network optimization; adaptivity; SLIME-MOLD; PROGRAMMING APPROACH; GENETIC ALGORITHM; OPTIMIZATION; COST; COMPUTATION; INTEGRATION; ALLOCATION; MOTORWAYS; DEMAND;
D O I
10.1007/s11432-015-5417-4
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
A supply chain is a system which moves products from a supplier to customers, which plays a very important role in all economic activities. This paper proposes a novel algorithm for a supply chain network design inspired by biological principles of nutrients' distribution in protoplasmic networks of slime mould Physarum polycephalum. The algorithm handles supply networks where capacity investments and product flows are decision variables, and the networks are required to satisfy product demands. Two features of the slime mould are adopted in our algorithm. The first is the continuity of flux during the iterative process, which is used in real-time updating of the costs associated with the supply links. The second feature is adaptivity. The supply chain can converge to an equilibrium state when costs are changed. Numerical examples are provided to illustrate the practicality and flexibility of the proposed method algorithm.
引用
收藏
页数:14
相关论文
共 50 条
  • [1] A Physarum-inspired approach to supply chain network design
    Xiaoge ZHANG
    Andrew ADAMATZKY
    Xin-She YANG
    Hai YANG
    Sankaran MAHADEVAN
    Yong DENG
    [J]. Science China(Information Sciences), 2016, 59 (05) : 191 - 204
  • [2] Physarum-Inspired Enterprise Network Redesign
    Habib, Sami J.
    Marimuthu, Paulvanna N.
    [J]. INFORMATION SYSTEMS AND TECHNOLOGIES, VOL 1, WORLDCIST 2023, 2024, 799 : 3 - 13
  • [3] Physarum-Inspired Bicycle Lane Network Design in a Congested Megacity
    Akhand, M. A. H.
    Habib, Md Ahsan
    Kamal, Md Abdus Samad
    Siddique, Nazmul
    [J]. APPLIED SCIENCES-BASEL, 2021, 11 (15):
  • [4] A Physarum-Inspired Approach for Influence Maximization
    Lopez-Garcia, Alvaro O.
    Rodriguez-Gomez, Gustavo
    Lopez-Lopez, Aurelio
    [J]. METAHEURISTICS AND NATURE INSPIRED COMPUTING, META 2021, 2022, 1541 : 18 - 32
  • [5] A Physarum-inspired approach to supply chain network design基于多头绒泡菌模型的供应链网络设计算法
    Xiaoge Zhang
    Andrew Adamatzky
    Xin-She Yang
    Hai Yang
    Sankaran Mahadevan
    Yong Deng
    [J]. Science China Information Sciences, 2016, 59
  • [6] A Physarum-inspired approach to the Euclidean Steiner tree problem
    Sheryl Hsu
    Fidel I. Schaposnik Massolo
    Laura P. Schaposnik
    [J]. Scientific Reports, 12
  • [7] A Physarum-inspired approach to the Euclidean Steiner tree problem
    Hsu, Sheryl
    Massolo, Fidel I. Schaposnik
    Schaposnik, Laura P.
    [J]. SCIENTIFIC REPORTS, 2022, 12 (01)
  • [8] Physarum solver: a bio-inspired method for sustainable supply chain network design problem
    Zhang, Xiaoge
    Adamatzky, Andrew
    Chan, Felix T. S.
    Mahadevan, Sankaran
    Deng, Yong
    [J]. ANNALS OF OPERATIONS RESEARCH, 2017, 254 (1-2) : 533 - 552
  • [9] Network Division Method Based on Cellular Growth and Physarum-inspired Network Adaptation
    Yang, Hanchao
    Deng, Yong
    Jones, Jeff
    [J]. INTERNATIONAL JOURNAL OF UNCONVENTIONAL COMPUTING, 2018, 13 (06) : 477 - 491
  • [10] Physarum solver: a bio-inspired method for sustainable supply chain network design problem
    Xiaoge Zhang
    Andrew Adamatzky
    Felix T. S. Chan
    Sankaran Mahadevan
    Yong Deng
    [J]. Annals of Operations Research, 2017, 254 : 533 - 552