Computerized Planning of Distribution Centers using Graph Theory

Authors

  • Boris Sebastian Jobi Miebach Consulting GmbH, Berlin
  • Karl-Heinz Wehking Institut für Fördertechnik und Logistik (IFT), Universität Stuttgart

DOI:

https://doi.org/10.2195/lj_NotRev_jobi_de_201310_01

Abstract

Although Distribution Centers (DC) are central components of delivery chains, currently no structured method for an objective, systematic and complete – from the receiving area to the picking area up to the issuing area – planning of them is in existence today. The following article deals with this scientific gap and describes how with the idea of analytically modeled standard-modules within the different functional ranges of an DC complete variants of DC’s can be generated by using approaches of the graph theory. In order to find the optimal combination of standard-modules respectively in order to generate the optimal DC-variant automatically modified algorithms to find the shortest path within an (intra-logistical) graph are used.

Downloads

Published

2013-10-02

How to Cite

Jobi, B. S., & Wehking, K.-H. (2013). Computerized Planning of Distribution Centers using Graph Theory. Logistics Journal: Editorial-Reviewed. https://doi.org/10.2195/lj_NotRev_jobi_de_201310_01