Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Altman, A., Tennenholtz, M. (2005): Ranking systems: the PageRank axioms. Proceedings of the 6th ACM conference on Electronic commerce, Vancouver, BC, Canada, 1–8.
Arnold, D., Furmans, K. (2007): Materialfluss in Logistiksystemen. 5. Auflage, Springer, Berlin.
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.
Langville, A. N., Meyer, C. D. (2006): Google’s PageRank and Beyond: The Science of Search Engine Rankings. Princeton University Press, Princeton, NJ.
Meyer, C. D. (2000): Matrix Analysis and Applied Linear Algebra. SIAM, Philadelphia.
Page, L., Brin, S., Motwani, R., Winograd, T. (1999): The PageRank citation ranking: Bringing order to the web. Technical report, Stanford University.
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.
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.
Tutsch, D. (2006): Performance Analysis of Network Architectures. Springer, Berlin, Heidelberg, New York.
Vahrenkamp, R. (2007): Logistik: Management und Strategien. 5. Auflage, Oldenbourg, München.
Acknowledgment
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”.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer -Verlag Berlin Heidelberg
About this paper
Cite this paper
Scholz-Reiter, B., Wirth, F., Dashkovskiy, S., Kosmykov, M., Makuschewitz, T., Schönlein, M. (2011). An Approach to Model Reduction of Logistic Networks Based on Ranking. In: Kreowski, HJ., Scholz-Reiter, B., Thoben, KD. (eds) Dynamics in Logistics. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11996-5_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-11996-5_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-11995-8
Online ISBN: 978-3-642-11996-5
eBook Packages: EngineeringEngineering (R0)