Entropy-based algorithm for supply-chain complexity assessment (Q2331428)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 7123879
Language Label Description Also known as
default for all languages
No label defined
    English
    Entropy-based algorithm for supply-chain complexity assessment
    scientific article; zbMATH DE number 7123879

      Statements

      Entropy-based algorithm for supply-chain complexity assessment (English)
      0 references
      0 references
      0 references
      0 references
      29 October 2019
      0 references
      Summary: This paper considers a graph model of hierarchical supply chains. The goal is to measure the complexity of links between different components of the chain, for instance, between the principal equipment manufacturer (a root node) and its suppliers (preceding supply nodes). The information entropy is used to serve as a measure of knowledge about the complexity of shortages and pitfalls in relationship between the supply chain components under uncertainty. The concept of conditional (relative) entropy is introduced which is a generalization of the conventional (non-relative) entropy. An entropy-based algorithm providing efficient assessment of the supply chain complexity as a function of the SC size is developed.
      0 references
      industrial supply chain
      0 references
      supply chain complexity
      0 references
      information entropy
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references