Abstract
Schematic drawings showing railway tracks and equipment are commonly used to visualize railway operations and to communicate system specifications and construction blueprints. Recent advances in on-line collaboration and modeling tools have raised the expectations for quickly making changes to models, resulting in frequent changes to layouts, text, and/or symbols in schematic drawings. Automating the creation of high-quality schematic views from geographical and topological models can help engineers produce and update drawings efficiently. This paper introduces four methods for automatically producing schematic railway drawings with increasing level of quality and control over the result. The final method, implemented in the open-source tool that we have developed, can use any combination of the following optimization criteria, which can have different priorities in different use cases: width and height of the drawing, the diagonal line lengths, and the number of bends. We show how to encode schematic railway drawings as an optimization problem over Boolean and numerical domains, using combinations of unary number encoding, lazy difference constraints, and numerical optimization into an incremental SAT formulation. We compare drawings resulting from each of the four methods, applied to models of real-world engineering projects and existing railway infrastructure. We also show how to add symbols and labels to the track plan, which is important for the usefulness of the final outputs. Since the proposed tool is customizable and efficiently produces high-quality drawings from railML 2.x models, it can be used (as it is or extended) both as an integrated module in an industrial design tool like RailCOMPLETE, or by researchers for visualization purposes.
Article PDF
Similar content being viewed by others
References
Avelar S (2002) Schematic maps on demand—design, modeling and visualization. Ph.D. thesis, ETH Zürich
Bozzano M, Bruttomesso R, Cimatti A, Junttila TA, van Rossum P, Schulz S, Sebastiani R (2005) An incremental and layered procedure for the satisfiability of linear arithmetic logic. In: Tools and algorithms for the construction and analysis of systems (TACAS), vol 3440 of LNCS, pp 317–333. Springer
Biere A, Heule M, van Maaren H, Walsh T (eds) (2009) Handbook of Satisfiability, volume 185 of Frontiers in Artificial Intelligence and Applications. IOS Press
Björk M(2011) Successful SAT encoding techniques. JSAT 7(4):189–201
Brands A (2016) Automatic generation of schematic diagrams of the Dutch railway network. M.Sc. thesis, Radboud University
Barrett C, Tinelli C(2018) Satisfiability modulo theories. In: Handbook of Model Checking, pp 305–343. Springer
Bane NOR: Model of the Norwegian rail network. http://www.banenor.no/en/startpage1/Market1/Model-of-the-nationalrail-network/, 2016.
Cabello S, de Berg M, van Kreveld MJ (2005) Schematization of networks. Comput Geom 30(3):223–228
Di Battista G, Eades P, Tamassia R, Tollis IG (1994) Algorithms for drawing graphs: an annotated bibliography. Comput Geom 4:235–282
Di Battista G, Eades P, Tamassia R, Tollis IG (1999) Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall
Eén N, Sörensson N (2003) An extensible SAT-solver. In: SAT conference 2003, volume 2919 of LNCS, pp 502–518. Springer
Hürlimann D (2002) Objektorientierte Modellierung von Infrastrukturelementen und Betriebsvorgängen im Eisenbahnwesen. Ph.D. thesis, ETH Zurich
IRS (2016) 30100: RailTopoModel—railway infrastructure topological model. The International Union of Railways (UIC)
Luteberget B, Claessen K, Johansen C (2018) Design-time railway capacity verification using SAT modulo discrete event simulation. In: FMCAD. IEEE
Luteberget B, Claessen K, Johansen C (November 2019) Automated drawing of railway schematics using numerical optimization in SAT. In: Wolfgang A, Silvia Lizeth TT (eds) 15th international conference on integrated formal methods (iFM 2019), volume 11918 of LNCS, pp 341–359. Springer
Nieuwenhuis R, Oliveras A, Tinelli C (2006) Solving SAT and SAT modulo theories: from an abstract Davis–Putnam– Logemann–Loveland procedure to DPLL(T). J ACM 53(6):937–977
Nöllenburg M, Wolff A (2011) Drawing and labeling high-quality metro maps by mixed-integer programming. IEEE Trans Vis Comput Graph 17(5):626–641
Nöllenburg M (2005) Automated drawing of metro maps. Technical Report 25, Universität Karlsruhe, Karlsruhe
Oke O, Siddiqui S (2015) Efficient automated schematic map drawing using multiobjective mixed integer programming. Comput & OR 61:1–17
Ozdal MM (2005) Routing algorithms for high-performance VLSI packaging. Ph.D. thesis, University of Illinois at Urbana- Champaign
Papakostas A, Tollis IG (1998) Algorithms for area-efficient orthogonal drawings. Comput Geom 9(1–2):83–110
Seyedi-Shandiz S (2014) Schematic representation of the geographical railway network used by the Swedish transport administration. M.Sc. thesis, Lund University
Tamassia R (1987) On embedding a graph in the grid with the minimum number of bends. SIAM J Comput 16(3):421–444
van Dijk TC, Lipp F, Markfelder P, Wolff A (2018) Computing storyline visualizations with few block crossings. In: GD, pp 365–378. Springer
Wolff A (2007) Drawing subway maps: a survey. Inf Forsc Entwick 22(1):23–44
Acknowledgements
We would like to thank Koen Claessen and Martin Steffen, as well as engineers from Railcomplete AS, for their help with this work, which was partly funded by Railcomplete AS and the Norwegian Research Council through the project RailCons—Automated Methods and Tools for Ensuring Consistency of Railway Designs.
Author information
Authors and Affiliations
Corresponding author
Additional information
Lizeth Tarifa, Wolfgang Ahrendt and Heike Warheim
Publisher’s Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Luteberget, B., Johansen, C. Drawing with SAT: four methods and A tool for producing railway infrastructure schematics. Form Asp Comp 33, 829–854 (2021). https://doi.org/10.1007/s00165-021-00566-z
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00165-021-00566-z