A complete shortest independent loop set algorithm for model structure analysis

Serafina Middleton and Mohammad Motamed

System Dynamics Review, 2024, vol. 40, issue 3

Abstract: This article looks at the well‐known shortest independent loop set algorithm, which is used to identify an independent loop set in system dynamics models. It addresses the cases where the algorithm fails to find a complete set due to its limitation to geodetic cycles and introduces a modification that has the potential to identify a complete independent loop set in every case while maintaining the efficiency of the original algorithm. The modified algorithm uses second‐shortest paths to complete the loop set. Special attention is given to the creation of the second‐shortest path matrix required for the modified algorithm, and to the application of the algorithm to a model where the independent loop set created by the shortest independent loop set algorithm was previously shown to be incomplete. © 2024 System Dynamics Society.

Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/sdr.1787

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:bla:sysdyn:v:40:y:2024:i:3:n:e1787

Ordering information: This journal article can be ordered from
http://www.blackwell ... bs.asp?ref=0883-7066

Access Statistics for this article

More articles in System Dynamics Review from System Dynamics Society
Bibliographic data for series maintained by Wiley Content Delivery ().