A Scalable Message-Passing Algorithm for Supply Chain Formation

Supply Chain Formation (SCF) is the process of determining the participants in a supply chain, who will exchange what with whom, and the terms of the exchanges. Decentralized SCF appears as a highly intricate task because agents only possess local information and have limited knowledge about the capabilities of other agents. The decentralized SCF problem has been recently cast as an optimization problem that can be efficiently approximated using max-sum loopy belief propagation. Along this direction, in this paper we propose a novel encoding of the problem into a binary factor graph (containing only binary variables) as well as an alternative algorithm. We empirically show that our approach allows to significantly increase scalability, hence allowing to form supply chains in market scenarios with a large number of participants and high competition.

Authors

• Toni Penya-Alba Instituto de Investigación en Inteligencia Artificial (IIIA) Consejo Superior de Investigaciones Cientificas (CSIC)
• Meritxell Vinyals University of Southampton
• Jesus Cerquides Instituto de Investigación en Inteligencia Artificial (IIIA) Consejo Superior de Investigaciones Cientificas (CSIC)
• Juan Rodriguez-Aguilar Instituto de Investigación en Inteligencia Artificial (IIIA) Consejo Superior de Investigaciones Cientificas (CSIC)

Keywords

No keywords are indexed for this paper.