Skip to main content
SpringerLink
Log in

A single-resource allocation problem with Poisson resource requirements

  • Original Paper
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

We consider a stochastic resource allocation problem that generalizes the knapsack problem to account for random item weights that follow a Poisson distribution. When the sum of realized weights exceeds capacity, a penalty cost is incurred. We wish to select the items that maximize expected profit. We provide an effective solution method and illustrate the advantages of this approach via computational experiments.

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

  1. Barnhart, C., Cohn, A.M.: The stochastic knapsack problem with random weights: a heuristic approach to robust transportation planning. In: Proceedings of Tristan III, Puerto Rico, pp. 17–23 (1998)

  2. Carraway R.L., Schmidt R.L., Weatherford L.R.: An algorithm for maximizing target achievement in the stochastic knapsack problem with normal returns. Nav. Res. Logist. 40, 161–173 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  3. Dean, B.C., Goemans, M.X., Vondrak, J.: Approximating the stochastic knapsack problem: the benefitt of adaptivity. In: Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science (2004)

  4. Goel, A., Indyk, P.: Stochastic load balancing and related problems. In: Proceedings of the 40th Annual Symposium on Foundations of Computer Science, pp. 579–586 (1999)

  5. Henig M.: Risk criteria in a stochastic knapsack problem. Oper. Res. 38, 820–825 (1990)

    Article  MathSciNet  Google Scholar 

  6. Kleywegt A., Papastavrou J.D.: The dynamic and stochastic knapsack problem. Oper. Res. 46, 17–35 (1999)

    Article  MathSciNet  Google Scholar 

  7. Kleywegt A., Papastavrou J.D.: The dynamic and stochastic knapsack problem with random sized items. Oper. Res. 49, 26–41 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  8. Kleywegt A., Shapiro A., Homem-de-Mello T.: The sample average approximation method for stochastic discrete optimization. SIAM J. Optim. 12(2), 479–502 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  9. Merzifonluoğlu, Y., Geunes, J., Romeijn, H.E.: The Static Stochastic Knapsack Problem with Normally Distributed Item Sizes. Working paper, University of Florida, Department of Industrial and Systems Engineering, Gainesville, FL (2008)

  10. Papastavrou J.D., Rajagopalan S., Kleywegt A.: The dynamic and stochastic knapsack problem with deadlines. Manag. Sci. 42, 1706–1718 (1996)

    Article  MATH  Google Scholar 

  11. Rosenthal R.E.: GAMS—A User’s Guide. GAMS Development Corporation, Washington (2007)

    Google Scholar 

  12. Ross K.W., Tsang D.H.K.: The stochastic knapsack problems. IEEE Trans. Commun. 37, 740–747 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  13. Ross S.M.: Introduction to Probability Models, 5th edn. Academic Press, San Diego (1993)

    MATH  Google Scholar 

  14. Steinberg E., Parks M.S.: A preference order dynamic program for a knapsack problem with stochastic rewards. J. Oper. Res. Soc. 30, 141–147 (1979)

    Article  MATH  Google Scholar 

  15. Zipkin P.H.: Foundations of Inventory Management. McGraw-Hill, Boston (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial and Systems Engineering, University of Florida, PO Box 116595, Gainesville, FL, 32611, USA

    Semra Ağralı & Joseph Geunes

Authors
  1. Semra Ağralı
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Joseph Geunes
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Joseph Geunes.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ağralı, S., Geunes, J. A single-resource allocation problem with Poisson resource requirements. Optim Lett 3, 559–571 (2009). https://doi.org/10.1007/s11590-009-0135-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-009-0135-8

Keywords

Search

Navigation