arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0908.1184physics.data-anphysics.soc-ph
收藏

供需网络上的最佳运输

Optimal transport on supply-demand networks

Yu-Han Chen, Bing-Hong Wang, Li-Chao Zhao, Changsong Zhou, Tao Zhou

摘要:

以前,传输网络通常被视为同构网络,即每个节点具有相同的功能,同时提供和要求资源。然而,一些真实的网络,如电网和供应链网络,显示了一个完全不同的场景,其中的节点分为两类:供应节点提供某种服务,而需求节点需要它们。在本文中,我们提出了一个通用的运输模型的供需网络,与标准来量化他们的运输能力。在具有异质度分布的供需网络中,其运输能力强烈依赖于供应节点的位置。因此,我们设计了一个模拟退火算法来寻找供应节点的最佳配置,这显着提高了运输能力,并优于度目标算法,介数目标算法,贪婪的方法。这项工作提供了一个起点,系统地分析和优化交通动态的供需网络。

英文摘要:

Previously, transport networks are usually treated as homogeneous networks, that is, every node has the same function, simultaneously providing and requiring resources. However, some real networks, such as power grid and supply chain networks, show a far different scenario in which the nodes are classified into two categories: the supply nodes provide some kinds of services, while the demand nodes require them. In this paper, we propose a general transport model for those supply-demand networks, associated with a criterion to quantify their transport capacities. In a supply-demand network with heterogenous degree distribution, its transport capacity strongly depends on the locations of supply nodes. We therefore design a simulated annealing algorithm to find the optimal configuration of supply nodes, which remarkably enhances the transport capacity, and outperforms the degree target algorithm, the betweenness target algorithm, and the greedy method. This work provides a start point for systematically analyzing and optimizing transport dynamics on supply-demand networks.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑