Summary
The concept of autonomous units to model distributed logistic processes and their interactions in a transport network is introduced. Autonomous units provide a general approach with rigorous semantics that allow the visual modelling of logistic processes in the transport domain in a systematic and structured way. Differing from existing models it especially incorporates the specification of autonomous or self-controlled behaviour of the participating actors. It means that the respective actions are not always predefined but allow for autonomous choice. By example in this paper a negotiation based approach is introduced. Due to this approach being formal and well-defined it supports testing and verification of required properties of the modelled systems at the level of specification.
Research partially supported by the EC Research Training Network SegraVis (Syntactic and Semantic Integration of Visual Modeling Techniques) and by the German Research Foundation (DFG) as part of the Collaborative Research Centre 637 Autonomous Cooperating Logistic Processes — A Paradigm Shift and its Limitations.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
H.-J. Kreowski and S. Kuske. Graph transformation units and modules. In H. Ehrig, G. Engels, H.-J. Kreowski, and G. Rozenberg, editors, Handbook of Graph Grammars and Computing by Graph Transformation, Vol. 2: Applications, Languages and Tools, pages 607–638. World Scientific, Singapore, 1999.
P. Knirsch and H.-J. Kreowski. A note on modeling agent systems by graph transformation. In M. Nagl, A. Schürr, and M. Münch, editors, AGTIVE’ 99 International Workshop on Applications of Graph Transformation with Industrial Relevance, volume 1779 of Lecture Notes in Computer Science, pages 79–86, Berlin, 2000. Springer-Verlag.
R. Klempien-Hinrichs, P. Knirsch, and S. Kuske. Modeling the pickup-and-delivery problem with structured graph transformation. In H.-J. Kreowski and P. Knirsch, editors, Proc. Applied Graph Transformation (AGT’02), 2002. 119–130.
H.-J. Kreowski, S. Kuske, and A. Schürr. Nested graph transformation units. International Journal on Software Engineering and Knowledge Engineering, 7(4):479–502, 1997.
S. Lin and B. W. Kernighan. An effective heuristic algorithm for the traveling salesman problem. Operations Research, 21(9):498–516, 1973.
G. Rozenberg, editor. Handbook on Graph Grammars and Computing by Graph Transformation. Vol. 1: Foundations. World Scientific, Singapore, 1997.
M. W. P. Savelsbergh and M. Sol. The general pickup and delivery problem. Transportation Science, 29(1):17–29, 1995.
M. Wooldridge and N. R. Jennings. Agent theories, architectures, and languages: A survey. In M. J. Wooldridge and N. R. Jennings, editors, Intelligent Agents: ECAI-94 Workshop on Agent Theories, Architectures, and Languages, volume 890 of Lecture Notes in Artificial Intelligence, pages 1–39. Springer, Berlin, 1994.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hölscher, K., Knirsch, P., Kreowski, HJ. (2006). Modelling Transport Networks by Means of Autonomous Units. In: Haasis, HD., Kopfer, H., Schönberger, J. (eds) Operations Research Proceedings 2005. Operations Research Proceedings, vol 2005. Springer, Berlin, Heidelberg . https://doi.org/10.1007/3-540-32539-5_63
Download citation
DOI: https://doi.org/10.1007/3-540-32539-5_63
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-32537-6
Online ISBN: 978-3-540-32539-0
eBook Packages: Business and EconomicsBusiness and Management (R0)