Skip to main content
SpringerLink
Log in

Online stochastic reservation systems

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

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. It also proposes several integer programming models for handling cancellations and proves their equivalence. On the experimental side, the paper demonstrates the effectiveness of the regret algorithm on multi-knapsack problems (with and without overbooking) based on the benchmarks proposed earlier.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Benoist, T., Bourreau, E., Caseau, Y., & Rottembourg, B. (2001). Towards stochastic constraint programming: a study of online multi-choice knapsack with deadlines. In Proceedings of the seventh international conference on principles and practice of constraint programming (CP’01), London, UK (pp. 61–76). Berlin: Springer.

    Google Scholar 

  • Bent, R., Katriel, I., & Van Hentenryck, P. (2005). Sub-optimality approximation. In Eleventh international conference on principles and practice of constraint programming, Stiges, Spain, 2005.

  • Bent, R., & Van Hentenryck, P. (2004a). A two-stage hybrid local search for the vehicle routing problem with time windows. Transportation Science, 8(4), 515–530.

    Article  Google Scholar 

  • Bent, R., & Van Hentenryck, P. (2004b). Online stochastic and robust optimization. In Proceeding of the 9th Asian Computing Science Conference (ASIAN’04), Chiang Mai University, Thailand, December 2004.

  • Bent, R., & Van Hentenryck, P. (2004c). Regrets only. Online stochastic optimization under time constraints. In Proceedings of the 19th national conference on artificial intelligence (AAAI’04), San Jose, CA, July 2004.

  • Bent, R., & Van Hentenryck, P. (2004d). Scenario based planning for partially dynamic vehicle routing problems with stochastic customers. Operations Research, 52(6), 977–987.

    Article  Google Scholar 

  • Bent, R., & Van Hentenryck, P. (2004e). 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.

  • Bent, R., & Van Hentenryck, P. (2005). Online stochastic optimization without distributions. In Proceedings of the 15th international conference on automated planning & scheduling (ICAPS 2005), Monterey, CA, 2005.

  • Campbell, A., & Savelsbergh, M. (2002). Decision support for consumer direct grocery initiatives. Report TLI-02-09, Georgia Institute of Technology.

  • Chang, H., Givan, R., & Chong, E. (2000). On-line scheduling via sampling. In Artificial intelligence planning and scheduling (AIPS’00) (pp. 62–71).

  • Dean, B., Goemans, M. X., & Vondrak, J. (2004). Approximating the stochastic knapsack problem: the benefit of adaptivity. In Proceedings of the 45th annual IEEE symposium on foundations of computer science (pp. 208–217). Rome, Italy, 2004.

  • Puterman, M. (1994). Markov decision processes. New York: Wiley.

    Book  Google Scholar 

  • Shaw, P. (1998). Using constraint programming and local search methods to solve vehicle routing problems. In Proceedings of fourth international conference on the principles and practice of constraint programming (CP’98) (pp. 417–431). Pisa, October 1998.

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Brown University, Providence, RI, 02912, USA

    Pascal Van Hentenryck, Russell Bent, Luc Mercier & Yannis Vergados

Authors
  1. Pascal Van Hentenryck
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Russell Bent
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Luc Mercier
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Yannis Vergados
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Pascal Van Hentenryck.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Van Hentenryck, P., Bent, R., Mercier, L. et al. Online stochastic reservation systems. Ann Oper Res 171, 101–126 (2009). https://doi.org/10.1007/s10479-008-0402-6

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-008-0402-6

Keywords

Search

Navigation