A Markov Model for Inventory Level Optimization in Supply-Chain Management

We propose a technique for use in supply-chain management that assists the decision-making process for purchases of direct goods Based on projections for future prices and demand, requests-for-quotes are constructed and quotes are accepted that optimize the level of inventory each day, while minimizing total cost The problem is modeled as a Markov decision process (MDP), which allows for the computation of the utility of actions to be based on the utilities of consequential future states Dynamic programming is then used to determine the optimal quote requests and accepts at each state in the MDP The model is then used to formalize the subproblem of determining optimal request quantities, yielding a technique that is shown experimentally to outperform a standard technique from the literature The implementation of our entry in the Trading Agent Competition-Supply Chain Management game is also discussed.

[1]  W. Lam,et al.  Agents for Electronic Commerce , 2000, ICEIS.

[2]  Sean R Eddy,et al.  What is dynamic programming? , 2004, Nature Biotechnology.

[3]  Claudio Bartolini,et al.  Agent-based service composition through simultaneous negotiation in forward and reverse auctions , 2003, EC '03.

[4]  J. Shapiro Modeling the Supply Chain , 2000 .

[5]  Norman M. Sadeh,et al.  The 2003 Supply Chain Management Trading Agent Competition , 2004, ICEC '04.

[6]  Norman Sadeh,et al.  The Supply Chain Management Game for the Trading Agent Competition 2004 , 2004 .

[7]  Ronald A. Howard,et al.  Dynamic Programming and Markov Processes , 1960 .

[8]  John Collins,et al.  The Supply Chain Management Game for the 2007 Trading Agent Competition , 2004 .

[9]  S. Buffett,et al.  An Algorithm for Procurement in Supply-Chain Management , 2022 .

[10]  Martin L. Puterman,et al.  Markov Decision Processes: Discrete Stochastic Dynamic Programming , 1994 .

[11]  Craig Boutilier,et al.  Continuous Value Function Approximation for Sequential Bidding Policies , 1999, UAI.

[12]  Alastair Grant,et al.  A Decision-Theoretic Algorithm for Bundle Purchasing in Multiple Open Ascending-Price Auctions , 2004, Canadian Conference on AI.

[13]  Claudio Bartolini,et al.  Towards Agent-Based Service Composition through Negotiation in Multiple Auctions , 2001 .

[14]  Andrew Byde A Dynamic Programming Model for Algorithm Design in Simultaneous Auctions , 2001, WELCOM.

[15]  Craig Boutilier,et al.  Sequential Auctions for the Allocation of Resources with Complementarities , 1999, IJCAI.