IDEAS home Printed from https://ideas.repec.org/a/bla/sysdyn/v40y2024i3ne1787.html
   My bibliography  Save this article

A complete shortest independent loop set algorithm for model structure analysis

Author

Listed:
  • Serafina Middleton
  • Mohammad Motamed

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.

Suggested Citation

  • Serafina Middleton & Mohammad Motamed, 2024. "A complete shortest independent loop set algorithm for model structure analysis," System Dynamics Review, System Dynamics Society, vol. 40(3), July.
    • Handle: RePEc:bla:sysdyn:v:40:y:2024:i:3:n:e1787
    DOI: 10.1002/sdr.1787
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/sdr.1787
    Download Restriction: no
    File URL: https://libkey.io/10.1002/sdr.1787?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:bla:sysdyn:v:40:y:2024:i:3:n:e1787. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: http://onlinelibrary.wiley.com/journal/10.1111/0883-7066 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.