An Approach to Model Reduction of Logistic Networks Based on Ranking
Simulations or mathematical analysis of a real-world logistic network require a model. In this context two challenges occur for modelling: First, the model should represent the real-world logistic network in an accurate way. Second, it should foster simulations or analytical analysis to be conducted in a reasonable time. A large size is often a drawback of many models. In the case of logistic networks this drawback can be overcome by reducing the number of locations and transportation links of the graph model. In this paper we present an approach to model reduction of a logistic network based on ranking. The rank of a given location states the importance of the location for the whole network. In order to calculate the importance of a location we introduce an adaptation of the PageRank algorithm for logistic networks. The information about the rank and the structural relations between the locations are used for our approach to model reduction. Depending on the structural relation between locations we suggest three different approaches to obtain a model of lower size.
KeywordsMaterial Flow Model Reduction Logistic Network Reduction Rule Ranking Algorithm
B. Scholz-Reiter, F. Wirth, M. Kosmykov, T. Makuschewitz and M. Schönlein are supported by the Volkswagen Foundation (Project Nr. I/82684 “Dynamic Large-Scale Logistics Networks”). S. Dashkovskiy is partially supported by the DFG as a part of Collaborative Research Center 637 “Autonomous Cooperating Logistic Processes—A Paradigm Shift and its Limitations”.
- Altman, A., Tennenholtz, M. (2005): Ranking systems: the PageRank axioms. Proceedings of the 6th ACM conference on Electronic commerce, Vancouver, BC, Canada, 1–8.Google Scholar
- Arnold, D., Furmans, K. (2007): Materialfluss in Logistiksystemen. 5. Auflage, Springer, Berlin.Google Scholar
- Baeza-Yates, R., Davis, E. (2004): Web Page Ranking Using Link Attributes. Archive Proceedings of the 13th international World Wide Web conference, Alternate Track Papers & Posters, New York, NY, USA, 328–329.Google Scholar
- Langville, A. N., Meyer, C. D. (2006): Google’s PageRank and Beyond: The Science of Search Engine Rankings. Princeton University Press, Princeton, NJ.Google Scholar
- Meyer, C. D. (2000): Matrix Analysis and Applied Linear Algebra. SIAM, Philadelphia.Google Scholar
- Page, L., Brin, S., Motwani, R., Winograd, T. (1999): The PageRank citation ranking: Bringing order to the web. Technical report, Stanford University.Google Scholar
- Scholz-Reiter, B., Wirth, F., Dashkovskiy, S., Jagalski, T., Makuschewitz, T. (2008): Analyse der Dynamik großskaliger Netzwerke in der Logistik. In: Industrie Management, 3, 37–40.Google Scholar
- Scholz-Reiter, B., Wirth, F., Dashkovskiy, S., Makuschewitz, T., Kosmykov, M., Schönlein, M. (2009): Application of the PageRank algorithm for ranking locations of a production network. Proceedings of 42nd CIRP Conference on Manufacturing Systems.Google Scholar
- Tutsch, D. (2006): Performance Analysis of Network Architectures. Springer, Berlin, Heidelberg, New York.Google Scholar
- Vahrenkamp, R. (2007): Logistik: Management und Strategien. 5. Auflage, Oldenbourg, München.Google Scholar