Using the max-sum algorithm for supply chain emergence in dynamic multiunit environments

Maria Chli, Michael Winsper

Research output: Contribution to journalArticle

Abstract

Supply chain formation (SCF) is the process of determining the set of participants and exchange relationships within a network with the goal of setting up a supply chain that meets some predefined social objective. Many proposed solutions for the SCF problem rely on centralized computation, which presents a single point of failure and can also lead to problems with scalability. Decentralized techniques that aid supply chain emergence offer a more robust and scalable approach by allowing participants to deliberate between themselves about the structure of the optimal supply chain. Current decentralized supply chain emergence mechanisms are only able to deal with simplistic scenarios in which goods are produced and traded in single units only and without taking into account production capacities or input-output ratios other than 1:1. In this paper, we demonstrate the performance of a graphical inference technique, max-sum loopy belief propagation (LBP), in a complex multiunit unit supply chain emergence scenario which models additional constraints such as production capacities and input-to-output ratios. We also provide results demonstrating the performance of LBP in dynamic environments, where the properties and composition of participants are altered as the algorithm is running. Our results suggest that max-sum LBP produces consistently strong solutions on a variety of network structures in a multiunit problem scenario, and that performance tends not to be affected by on-the-fly changes to the properties or composition of participants.

Original languageEnglish
Pages (from-to)422-435
Number of pages14
JournalIEEE Transactions on Systems, Man, and Cybernetics: Systems
Volume45
Issue number3
Early online date16 Jan 2015
DOIs
Publication statusPublished - 31 Mar 2015

Fingerprint

Supply chains
Chemical analysis
Scalability

Bibliographical note

*

Keywords

  • max-sum algorithm
  • mechanism design
  • supply chain formation (SCF)

Cite this

@article{833b5660b038463488772f9940a5b530,
title = "Using the max-sum algorithm for supply chain emergence in dynamic multiunit environments",
abstract = "Supply chain formation (SCF) is the process of determining the set of participants and exchange relationships within a network with the goal of setting up a supply chain that meets some predefined social objective. Many proposed solutions for the SCF problem rely on centralized computation, which presents a single point of failure and can also lead to problems with scalability. Decentralized techniques that aid supply chain emergence offer a more robust and scalable approach by allowing participants to deliberate between themselves about the structure of the optimal supply chain. Current decentralized supply chain emergence mechanisms are only able to deal with simplistic scenarios in which goods are produced and traded in single units only and without taking into account production capacities or input-output ratios other than 1:1. In this paper, we demonstrate the performance of a graphical inference technique, max-sum loopy belief propagation (LBP), in a complex multiunit unit supply chain emergence scenario which models additional constraints such as production capacities and input-to-output ratios. We also provide results demonstrating the performance of LBP in dynamic environments, where the properties and composition of participants are altered as the algorithm is running. Our results suggest that max-sum LBP produces consistently strong solutions on a variety of network structures in a multiunit problem scenario, and that performance tends not to be affected by on-the-fly changes to the properties or composition of participants.",
keywords = "max-sum algorithm, mechanism design, supply chain formation (SCF)",
author = "Maria Chli and Michael Winsper",
note = "*",
year = "2015",
month = "3",
day = "31",
doi = "10.1109/TSMC.2014.2351782",
language = "English",
volume = "45",
pages = "422--435",
journal = "IEEE Transactions on Systems, Man, and Cybernetics: Systems",
issn = "2168-2216",
publisher = "IEEE",
number = "3",

}

Using the max-sum algorithm for supply chain emergence in dynamic multiunit environments. / Chli, Maria; Winsper, Michael.

In: IEEE Transactions on Systems, Man, and Cybernetics: Systems, Vol. 45, No. 3, 31.03.2015, p. 422-435 .

Research output: Contribution to journalArticle

TY - JOUR

T1 - Using the max-sum algorithm for supply chain emergence in dynamic multiunit environments

AU - Chli, Maria

AU - Winsper, Michael

N1 - *

PY - 2015/3/31

Y1 - 2015/3/31

N2 - Supply chain formation (SCF) is the process of determining the set of participants and exchange relationships within a network with the goal of setting up a supply chain that meets some predefined social objective. Many proposed solutions for the SCF problem rely on centralized computation, which presents a single point of failure and can also lead to problems with scalability. Decentralized techniques that aid supply chain emergence offer a more robust and scalable approach by allowing participants to deliberate between themselves about the structure of the optimal supply chain. Current decentralized supply chain emergence mechanisms are only able to deal with simplistic scenarios in which goods are produced and traded in single units only and without taking into account production capacities or input-output ratios other than 1:1. In this paper, we demonstrate the performance of a graphical inference technique, max-sum loopy belief propagation (LBP), in a complex multiunit unit supply chain emergence scenario which models additional constraints such as production capacities and input-to-output ratios. We also provide results demonstrating the performance of LBP in dynamic environments, where the properties and composition of participants are altered as the algorithm is running. Our results suggest that max-sum LBP produces consistently strong solutions on a variety of network structures in a multiunit problem scenario, and that performance tends not to be affected by on-the-fly changes to the properties or composition of participants.

AB - Supply chain formation (SCF) is the process of determining the set of participants and exchange relationships within a network with the goal of setting up a supply chain that meets some predefined social objective. Many proposed solutions for the SCF problem rely on centralized computation, which presents a single point of failure and can also lead to problems with scalability. Decentralized techniques that aid supply chain emergence offer a more robust and scalable approach by allowing participants to deliberate between themselves about the structure of the optimal supply chain. Current decentralized supply chain emergence mechanisms are only able to deal with simplistic scenarios in which goods are produced and traded in single units only and without taking into account production capacities or input-output ratios other than 1:1. In this paper, we demonstrate the performance of a graphical inference technique, max-sum loopy belief propagation (LBP), in a complex multiunit unit supply chain emergence scenario which models additional constraints such as production capacities and input-to-output ratios. We also provide results demonstrating the performance of LBP in dynamic environments, where the properties and composition of participants are altered as the algorithm is running. Our results suggest that max-sum LBP produces consistently strong solutions on a variety of network structures in a multiunit problem scenario, and that performance tends not to be affected by on-the-fly changes to the properties or composition of participants.

KW - max-sum algorithm

KW - mechanism design

KW - supply chain formation (SCF)

UR - http://www.scopus.com/inward/record.url?scp=84923234044&partnerID=8YFLogxK

U2 - 10.1109/TSMC.2014.2351782

DO - 10.1109/TSMC.2014.2351782

M3 - Article

AN - SCOPUS:84923234044

VL - 45

SP - 422

EP - 435

JO - IEEE Transactions on Systems, Man, and Cybernetics: Systems

JF - IEEE Transactions on Systems, Man, and Cybernetics: Systems

SN - 2168-2216

IS - 3

ER -