.png){kind=icon}
返回
Using agents for solving a multi-commodity-flow problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2008.01.002.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We investigate a commodity trading problem in a flow network with arbitrary topology where sinks combine commodities into bundles in order to generate profits. Our focus is the profit maximization problem for the trading network under both central and distributed control. We compute solutions for the central control problem using an integer linear program while we compute solutions for the distributed case by implementing the nodes in the network as software-agents that exchange messages in order to establish profitable trades. We report on computational results using both methods and demonstrate that there is a connection between agent profits and a centrality measure developed for the problem. We also demonstrate that with our current agent strategy, there is a trade-off between the agents acting too quickly before enough information is available and waiting too long and thus giving each agent too much information and thus too much power over the outcome. (C) 2008 Elsevier B.V. All rights reserved.
Keyword:
Distributed decision making
Multi-agent systems
Integer programming
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
7.6W
机构
引用论文
Studies on phenylmercury(II) complexes of nitrogen–sulfur ligands: Synthesis, spectral, structural characterization, TD-DFT and photoluminescent properties.png)
Polyhedron
PolyhedronIF0
PREAI
分享收藏Synthesis of novel Bi/Bi4O5Br2 via a UV light irradiation for decomposing the oil field pollutants
PREAI
分享收藏 没有更多内容
没有更多内容