loading...
Botticelli: A Supply Chain Management Agent
New York City, New York, USA July 19-July 23
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/AAMAS.2004.10203Third International Joint Conference ...
 This Article 
 
PDF
HTML
IEEE Xplore Subscribers
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
M. Benisch, Brown University
A. Greenwald, Brown University
I. Grypari, Brown University
R. Lederman, Brown University
V. Naroditskiy, Brown University
M. Tschantz, Brown University

The paper describes the architecture of Brown University?s agent, Botticelli, a finalist in the 2003 Trading Agent Competition in Supply Chain Management (TAC SCM). In TAC SCM, a simulated computer manufacturing scenario, Botticelli competes with other agents to win customer orders and negotiates with suppliers to procure the components necessary to complete its orders.

In this paper, two subproblems that dictate Botticelli?s behavior are formalized: bidding and scheduling. Mathematical programming approaches are applied in attempt to solve these problems optimally. In addition, greedy methods that yield useful approximations are described. Test results compare the performance and computational efficiency of these alternative techniques.

Citation:
M. Benisch, A. Greenwald, I. Grypari, R. Lederman, V. Naroditskiy, M. Tschantz, "Botticelli: A Supply Chain Management Agent," aamas, vol. 3, pp.1174-1181, Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 3 (AAMAS'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.