ACM Home Page
Please provide us with feedback. Feedback
CMieux: adaptive strategies for competitive supply chain trading
Full text PdfPdf (272 KB)
Source ACM SIGecom Exchanges archive
Volume 6 ,  Issue 1  (June 2006) table of contents
Pages: 1 - 10  
Year of Publication: 2006
ISSN:1551-9031
Authors
Michael Benisch  School of Computer Science, Carnegie Mellon University
Alberto Sardinha  School of Computer Science, Carnegie Mellon University
James Andrews  School of Computer Science, Carnegie Mellon University
Norman Sadeh  School of Computer Science, Carnegie Mellon University
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 12,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1150735.1150737
What is a DOI?

ABSTRACT

Existing supply chain management practices consist primarily of static interactions between established partners. Global competition, shorter product life cycles and the emergence of Internet-mediated business solutions create an incentive for exploring more dynamic supply chain practices. The Supply Chain Trading Agent Competition (TAC SCM) was designed to explore approaches to dynamic supply chain trading. TAC SCM pits against one another trading agents developed by teams from around the world. This paper presents Carnegie Mellon University's 2005 TAC SCM entry, the CMieux supply chain trading agent. CMieux implements a novel approach to coordinating supply chain bidding, procurement and planning, with an emphasis on the ability to rapidly adapt to changing market conditions. We present empirical results based on 200 games involving agents entered by 25 different teams during what can be seen as the most competitive phase of the 2005 tournament. Not only did CMieux perform among the top five agents, it significantly outperformed these agents in procurement while matching their bidding performance.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
ARUNACHALAM, R. AND SADEH, N. 2005. The supply chain trading agent competition. Electronic Commerce Research Applications 4, 1.
 
2
BENISCH, M., ANDREWS, J., AND SADEH, N. 2005. Pricing for customers with probabilistic valuations as a continuous knapsack problem. Tech. Rep. CMU-ISRI-05-137, School of Computer Science, Carnegie Mellon University. December.
 
3
 
4
BENISH, M., SARDINHA, A., ANDREWS, J., AND SADEH, N. Cmieux 2005: Design and analysis of carnegie mellon universitys entry in the supply chain trading agent competition. Tech. rep.
 
5
CHOPRA, S. AND MEINDL, P. 2004. Supply Chain Management. Pearson Prentice Hall, New Jersey.
 
6
COLLINS, J., ARUNACHALLAM, R., SADEH, N., ERIKSSON, J., FINNE, N., AND JANSON, S. 2005. The supply chain management game for 2005 trading agent competition.
 
7
ESTELLE, J., VOROBEYCHIK, Y., SINGH, M. P. W. S., KIEKINTVELD, C., AND SONI, V. 2003. Strategic interactions in a supply chain game.
 
8
HE, M., ROGERS, A., Luo, X., AND JENNINGS, N. R. 2006. Designing a successful trading agent for supply chain management. In Proceedings of AAMAS'06.
 
9
 
10
PARDOE, D. AND STONE, P. 2006. Predictive planning for supply chain management. In Proceedings of Automated Planning and Scheduling'06.
 
11
SADEH, N., HILDUM, D., KJENSTAD, D., AND TSENG, A. 1999. Mascot: an agent-based architecture for coordinated mixed-initiative supply chain planning and scheduling. In Proceedings of Workshop on Agent-Based Decision Support in Managing the Internet-Enabled Supply-Chain at Agents'99.
 
12

Collaborative Colleagues:
Michael Benisch: colleagues
Alberto Sardinha: colleagues
James Andrews: colleagues
Norman Sadeh: colleagues