Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Botticelli: a supply chain management agent designed to optimize under uncertainty

Botticelli: a supply chain management agent designed to optimize under uncertainty The paper describes the design of the 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. We formalize subproblems that dictate BOTTICELLI's behavior. Stochastic programming approaches to bidding and scheduling are developed in attempt to solve these problems optimally. In addition, we describe greedy methods that yield useful approximations. Test results compare the performance and computational effciency of these two techniques. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM SIGecom Exchanges Association for Computing Machinery

Botticelli: a supply chain management agent designed to optimize under uncertainty

Loading next page...
 
/lp/association-for-computing-machinery/botticelli-a-supply-chain-management-agent-designed-to-optimize-under-S7raF60sWU
Publisher
Association for Computing Machinery
Copyright
Copyright © 2004 by ACM Inc.
ISSN
1551-9031
DOI
10.1145/1120701.1120706
Publisher site
See Article on Publisher Site

Abstract

The paper describes the design of the 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. We formalize subproblems that dictate BOTTICELLI's behavior. Stochastic programming approaches to bidding and scheduling are developed in attempt to solve these problems optimally. In addition, we describe greedy methods that yield useful approximations. Test results compare the performance and computational effciency of these two techniques.

Journal

ACM SIGecom ExchangesAssociation for Computing Machinery

Published: Feb 1, 2004

There are no references for this article.