Multilayer Network-Based Evaluation of the Efficiency and Resilience of Network Flows

IF 1.7 4区 工程技术 Q2 MATHEMATICS, INTERDISCIPLINARY APPLICATIONS
Complexity Pub Date : 2024-07-18 DOI:10.1155/2024/6940097
András Rácz-Szabó, Tamás Ruppert, János Abonyi
{"title":"Multilayer Network-Based Evaluation of the Efficiency and Resilience of Network Flows","authors":"András Rácz-Szabó,&nbsp;Tamás Ruppert,&nbsp;János Abonyi","doi":"10.1155/2024/6940097","DOIUrl":null,"url":null,"abstract":"<div>\n <p>Supply chain optimization and resource allocation are challenging because of the complex dynamics of flows. We can classify these flows based on whether they perform value-added or nonvalue-added activities in our process. The aim of this article is to present a multilayered temporal network-based model for the analysis of network flows in supply chain optimization and resource allocation. Implementation of a multilayered network distinguishes value-added from nonvalue-added resource flows, enabling a comprehensive view of the flow of resources in the system. Incorporating weighted edges representing the probabilities of time-dependent flows identifies the resource needs and excesses at each supply site, addresses optimal transportation challenges for resource reallocation, and assesses the efficiency and robustness of the system by examining the overlaps in network layers. The proposed method offers a significant extension to the toolsets for network flow analysis, which has the potential to improve decision-making processes for organizations dealing with complex resource management problems. The applicability of the proposed method is demonstrated by analyzing the temporal network extracted from taxi cab flows in New York City. With the application of the method, the results indicate that significant reductions in idle times are achievable.</p>\n </div>","PeriodicalId":50653,"journal":{"name":"Complexity","volume":null,"pages":null},"PeriodicalIF":1.7000,"publicationDate":"2024-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1155/2024/6940097","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Complexity","FirstCategoryId":"5","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1155/2024/6940097","RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

Supply chain optimization and resource allocation are challenging because of the complex dynamics of flows. We can classify these flows based on whether they perform value-added or nonvalue-added activities in our process. The aim of this article is to present a multilayered temporal network-based model for the analysis of network flows in supply chain optimization and resource allocation. Implementation of a multilayered network distinguishes value-added from nonvalue-added resource flows, enabling a comprehensive view of the flow of resources in the system. Incorporating weighted edges representing the probabilities of time-dependent flows identifies the resource needs and excesses at each supply site, addresses optimal transportation challenges for resource reallocation, and assesses the efficiency and robustness of the system by examining the overlaps in network layers. The proposed method offers a significant extension to the toolsets for network flow analysis, which has the potential to improve decision-making processes for organizations dealing with complex resource management problems. The applicability of the proposed method is demonstrated by analyzing the temporal network extracted from taxi cab flows in New York City. With the application of the method, the results indicate that significant reductions in idle times are achievable.

Abstract Image

基于多层网络的网络流效率和弹性评估
供应链优化和资源配置因复杂的动态流动而充满挑战。我们可以根据流程中的增值活动或非增值活动对这些流动进行分类。本文旨在提出一种基于多层时态网络的模型,用于分析供应链优化和资源分配中的网络流。采用多层网络可区分增值和非增值资源流,从而全面了解系统中的资源流。结合代表随时间变化的流动概率的加权边,可以识别每个供应点的资源需求和过剩情况,解决资源重新分配的最佳运输难题,并通过检查网络层的重叠情况来评估系统的效率和稳健性。所提出的方法为网络流量分析工具集提供了重要的扩展,有可能改善处理复杂资源管理问题的组织的决策过程。通过分析从纽约市出租车流中提取的时间网络,证明了所提方法的适用性。结果表明,应用该方法可以显著减少空闲时间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Complexity
Complexity 综合性期刊-数学跨学科应用
CiteScore
5.80
自引率
4.30%
发文量
595
审稿时长
>12 weeks
期刊介绍: Complexity is a cross-disciplinary journal focusing on the rapidly expanding science of complex adaptive systems. The purpose of the journal is to advance the science of complexity. Articles may deal with such methodological themes as chaos, genetic algorithms, cellular automata, neural networks, and evolutionary game theory. Papers treating applications in any area of natural science or human endeavor are welcome, and especially encouraged are papers integrating conceptual themes and applications that cross traditional disciplinary boundaries. Complexity is not meant to serve as a forum for speculation and vague analogies between words like “chaos,” “self-organization,” and “emergence” that are often used in completely different ways in science and in daily life.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信