论文信息 - Multi-period Online Optimization in TAC SCM: The Supplier Offer Acceptance Problem

Multi-period Online Optimization in TAC SCM: The Supplier Offer Acceptance Problem

We formalize the supplier offer acceptance problem in TAC SCM as a multi-stage stochastic program. In addition, we suggest a heuristic for solving this problem using the rollout method, following one or two stage approximations of the multi-stage stochastic program as the base policy during rollouts. We also describe a heuristic based on the notion of marginal utility which is designed to scale our approach to problems with numerous decision variables.

Michael Carl Tschantz | Michael Benisch | Amy Greenwald | Sarah B. M. Bell | Margaret Benthall

[1] Michel Gendreau,et al. DYNAMIC VEHICLE ROUTING AND DISPATCHING , 1998 .

[2] Amy Greenwald,et al. Bidding under Uncertainty: Theory and Experiments , 2004, UAI.

[3] P. M. Berry. Uncertainty in scheduling: probability, problem reduction, abstractions and the user , 1993 .

[4] A. Shapiro,et al. On rate of convergence of Monte Carlo approximations of stochastic programs , 1998 .

[5] Shou-De Lin,et al. A trading agent competition , 2000 .

[6] Alan M. Frieze,et al. A general approach to dynamic packet routing with bounded buffers , 2001, JACM.

[7] D.A. Castanon,et al. Rollout Algorithms for Stochastic Scheduling Problems , 1998, Proceedings of the 37th IEEE Conference on Decision and Control (Cat. No.98CH36171).

[8] John M. Wilson,et al. Introduction to Stochastic Programming , 1998, J. Oper. Res. Soc..

[9] A. Shapiro,et al. The Sample Average Approximation Method for Stochastic Programs with Integer Recourse , 2002 .

[10] Alexander Shapiro,et al. The Sample Average Approximation Method for Stochastic Discrete Optimization , 2002, SIAM J. Optim..

[11] Richard S. Sutton,et al. Reinforcement Learning: An Introduction , 1998, IEEE Trans. Neural Networks.