Using agents for solving a multi-commodity-flow problem
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.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Theo Arentze & Harry Timmermans, 2003. "A multiagent model of negotiation processes between multiple actors in urban developments: a framework for and results of numerical experiments," Environment and Planning B: Planning and Design, Pion Ltd, London, vol. 30(3), pages 391-410, May.
- Dudek, Gregor & Stadtler, Hartmut, 2005. "Negotiation-based collaborative planning between supply chains partners," European Journal of Operational Research, Elsevier, vol. 163(3), pages 668-687, June.
When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:194:y:2009:i:3:p:888-900. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Shamier, Wendy)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.