Online Stochastic Reservation Systems
This paper considers online stochastic reservation problems, where requests come online and must be dynamically allocated to limited resources in order to maximize profit. Multi-knapsack problems with or without overbooking are examples of such online stochastic reservations. The paper studies how to adapt the online stochastic framework and the consensus and regret algorithms proposed earlier to online stochastic reservation systems. On the theoretical side, it presents a constant sub-optimality approximation of multi-knapsack problems, leading to a regret algorithm that evaluates each scenario with a single mathematical programming optimization followed by a small number of dynamic programs for one-dimensional knapsacks. On the experimental side, the paper demonstrates the effectiveness of the regret algorithm on multi-knapsack problems (with and without overloading) based on the benchmarks proposed earlier.
KeywordsKnapsack Problem Constraint Programming Online Algorithm Master Problem Vehicle Route Problem
Unable to display preview. Download preview PDF.
- 2.Bent, R., Katriel, I., Van Hentenryck, P.: Sub-Optimality Approximation. In: Eleventh International Conference on Principles and Practice of Constraint Programming, Stiges, Spain (2005)Google Scholar
- 5.Bent, R., Van Hentenryck, P.: Regrets Only. Online Stochastic Optimization under Time Constraints. In: Proceedings of the 19th National Conference on Artificial Intelligence (AAAI 2004), San Jose, CA (July 2004)Google Scholar
- 6.Bent, R., Van Hentenryck, P.: Scenario Based Planning for Partially Dynamic Vehicle Routing Problems with Stochastic Customers. Operations Research 52(6) (2004)Google Scholar
- 7.Bent, R., Van Hentenryck, P.: The Value of Consensus in Online Stochastic Scheduling. In: Proceedings of the 14th International Conference on Automated Planning & Scheduling (ICAPS 2004), Whistler, British Columbia, Canada (2004)Google Scholar
- 8.Bent, R., Van Hentenryck, P.: Online Stochastic Optimization without Distributions. In: Proceedings of the 15th International Conference on Automated Planning & Scheduling (ICAPS 2005), Monterey, CA (2005)Google Scholar
- 9.Campbell, A., Savelsbergh, M.: Decision Support for Consumer Direct Grocery Initiatives. Report TLI-02-09, Georgia Institute of Technology (2002)Google Scholar
- 10.Chang, H., Givan, R., Chong, E.: On-line Scheduling Via Sampling. In: Artificial Intelligence Planning and Scheduling (AIPS 2000), pp. 62–71 (2000)Google Scholar
- 11.Dean, B., Goemans, M.X., Vondrak, J.: Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity. In: Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, Rome, Italy, pp. 208–217 (2004)Google Scholar