Using the Max-Sum Algorithm for Supply Chain Formation in Dynamic Multi-Unit Environments

The max-sum loopy belief propagation (LBP) algorithm was shown in [4] to produce strong results in a simple decentralised supply chain formation (SCF) scenario where goods are traded in single units. In this paper, we demonstrate the performance of LBP in a multi-unit SCF scenario with additional constraints. We also provide experimental analysis of LBP’s performance in dynamic scenarios where the properties and composition of participants are altered while the algorithm is running. Our results suggest that LBP continues to produce strong solutions in multi-unit scenarios, and that performance remains solid in a dynamic setting.

Authors

• Michael Winsper
• Maria Chli Department of Computer Science, Aston University

Keywords

• Supply Chain Formation
• Loopy Belief Propagation