Abstract
AbstractThis 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
