Abstract
We describe a three-pass algorithm for improving the readability of Forrester Diagram in system dynamics. The first pass converts Forrester Diagram to recurrent hierarchy. The second pass sorts the vertices on each level, with the goal of minimizing crossings. The third pass is a finite tuning of the layout that determines the horizontal positions of vertices. An illustrative example is given to verify the result.
Original language | English |
---|---|
Pages (from-to) | 107-130 |
Number of pages | 24 |
Journal | Yugoslav Journal of Operations Research |
Volume | 13 |
Issue number | 1 |
DOIs | |
Publication status | Published - Jan 1 2003 |
Externally published | Yes |
Keywords
- Algorithm
- Forrester Diagram (FD)
- Readability
- Recurrent hierarchies
- System Dynamics (SD)
ASJC Scopus subject areas
- Management Science and Operations Research