用于模型结构分析的完整最短独立循环集算法

IF 1.7 3区管理学 Q3 MANAGEMENT System Dynamics Review Pub Date : 2024-07-09 DOI:10.1002/sdr.1787

Serafina Middleton, Mohammad Motamed

{"title":"用于模型结构分析的完整最短独立循环集算法","authors":"Serafina Middleton, Mohammad Motamed","doi":"10.1002/sdr.1787","DOIUrl":null,"url":null,"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.","PeriodicalId":51500,"journal":{"name":"System Dynamics Review","volume":"18 1","pages":""},"PeriodicalIF":1.7000,"publicationDate":"2024-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A complete shortest independent loop set algorithm for model structure analysis\",\"authors\":\"Serafina Middleton, Mohammad Motamed\",\"doi\":\"10.1002/sdr.1787\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":51500,\"journal\":{\"name\":\"System Dynamics Review\",\"volume\":\"18 1\",\"pages\":\"\"},\"PeriodicalIF\":1.7000,\"publicationDate\":\"2024-07-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"System Dynamics Review\",\"FirstCategoryId\":\"91\",\"ListUrlMain\":\"https://doi.org/10.1002/sdr.1787\",\"RegionNum\":3,\"RegionCategory\":\"管理学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"MANAGEMENT\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"System Dynamics Review","FirstCategoryId":"91","ListUrlMain":"https://doi.org/10.1002/sdr.1787","RegionNum":3,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MANAGEMENT","Score":null,"Total":0}

引用次数: 0

摘要

本文探讨了著名的最短独立循环集算法，该算法用于识别系统动力学模型中的独立循环集。文章探讨了该算法因其对大地周期的限制而无法找到完整环集的情况，并介绍了一种修改算法，该算法有可能在任何情况下都能识别出完整的独立环集，同时保持原始算法的效率。修改后的算法使用次短路径来完成循环集。本文特别关注了修改算法所需的次最短路径矩阵的创建，以及该算法在一个模型中的应用，在该模型中，之前用最短独立循环集算法创建的独立循环集已被证明是不完整的。© 2024 系统动力学会。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

A complete shortest independent loop set algorithm for model structure analysis

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

System Dynamics Review Multiple-

CiteScore

6.60

自引率

8.30%

发文量

期刊介绍： The System Dynamics Review exists to communicate to a wide audience advances in the application of the perspectives and methods of system dynamics to societal, technical, managerial, and environmental problems. The Review publishes: advances in mathematical modelling and computer simulation of dynamic feedback systems; advances in methods of policy analysis based on information feedback and circular causality; generic structures (dynamic feedback systems that support particular widely applicable behavioural insights); system dynamics contributions to theory building in the social and natural sciences; policy studies and debate emphasizing the role of feedback and circular causality in problem behaviour.