IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v241y2016i1d10.1007_s10479-013-1312-9.html
   My bibliography  Save this article

Resource capacity allocation to stochastic dynamic competitors: knapsack problem for perishable items and index-knapsack heuristic

Author

Listed:
  • Peter Jacko

    (BCAM – Basque Center for Applied Mathematics)

Abstract

In this paper we propose an approach for solving problems of optimal resource capacity allocation to a collection of stochastic dynamic competitors. In particular, we introduce the knapsack problem for perishable items, which concerns the optimal dynamic allocation of a limited knapsack to a collection of perishable or non-perishable items. We formulate the problem in the framework of Markov decision processes, we relax and decompose it, and we design a novel index-knapsack heuristic which generalizes the index rule and it is optimal in some specific instances. Such a heuristic bridges the gap between static/deterministic optimization and dynamic/stochastic optimization by stressing the connection between the classic knapsack problem and dynamic resource allocation. The performance of the proposed heuristic is evaluated in a systematic computational study, showing an exceptional near-optimality and a significant superiority over the index rule and over the benchmark earlier-deadline-first policy. Finally we extend our results to several related revenue management problems.

Suggested Citation

  • Peter Jacko, 2016. "Resource capacity allocation to stochastic dynamic competitors: knapsack problem for perishable items and index-knapsack heuristic," Annals of Operations Research, Springer, vol. 241(1), pages 83-107, June.
    • Handle: RePEc:spr:annopr:v:241:y:2016:i:1:d:10.1007_s10479-013-1312-9
    DOI: 10.1007/s10479-013-1312-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-013-1312-9
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10479-013-1312-9?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Glazebrook, K. D. & Mitchell, H. M. & Ansell, P. S., 2005. "Index policies for the maintenance of a collection of machines by a set of repairmen," European Journal of Operational Research, Elsevier, vol. 165(1), pages 267-284, August.
    2. Felipe Caro & Jérémie Gallien, 2007. "Dynamic Assortment with Demand Learning for Seasonal Consumer Goods," Management Science, INFORMS, vol. 53(2), pages 276-292, February.
    3. Christoph H. Loch & Stylianos Kavadias, 2002. "Dynamic Portfolio Selection of NPD Programs Using Marginal Returns," Management Science, INFORMS, vol. 48(10), pages 1227-1241, October.
    4. George B. Dantzig, 1957. "Discrete-Variable Extremum Problems," Operations Research, INFORMS, vol. 5(2), pages 266-288, April.
    5. Stephen E. Chick & Noah Gans, 2009. "Economic Analysis of Simulation Selection Problems," Management Science, INFORMS, vol. 55(3), pages 421-437, March.
    6. K. D. Glazebrook & R. Minty, 2009. "A Generalized Gittins Index for a Class of Multiarmed Bandits with General Resource Requirements," Mathematics of Operations Research, INFORMS, vol. 34(1), pages 26-44, February.
    7. Michael N. Katehakis & Arthur F. Veinott, 1987. "The Multi-Armed Bandit Problem: Decomposition and Computation," Mathematics of Operations Research, INFORMS, vol. 12(2), pages 262-268, May.
    8. Wedad Elmaghraby & P{i}nar Keskinocak, 2003. "Dynamic Pricing in the Presence of Inventory Considerations: Research Overview, Current Practices, and Future Directions," Management Science, INFORMS, vol. 49(10), pages 1287-1309, October.
    9. Christopher Dance & Alexei Gaivoronski, 2012. "Stochastic optimization for real time service capacity allocation under random service demand," Annals of Operations Research, Springer, vol. 193(1), pages 221-253, March.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Enlu Zhou & Shalabh Bhatnagar, 2018. "Gradient-Based Adaptive Stochastic Search for Simulation Optimization Over Continuous Space," INFORMS Journal on Computing, INFORMS, vol. 30(1), pages 154-167, February.
    2. Urtzi Ayesta & Manu K. Gupta & Ina Maria Verloop, 2021. "On the computation of Whittle’s index for Markovian restless bandits," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 93(1), pages 179-208, February.
    3. Yong-Wu Zhou & Chuanying Chen & Yuanguang Zhong & Bin Cao, 2020. "The allocation optimization of promotion budget and traffic volume for an online flash-sales platform," Annals of Operations Research, Springer, vol. 291(1), pages 1183-1207, August.
    4. Mou, Shandong & Robb, David J. & DeHoratius, Nicole, 2018. "Retail store operations: Literature review and research directions," European Journal of Operational Research, Elsevier, vol. 265(2), pages 399-422.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Darina Graczová & Peter Jacko, 2014. "Generalized Restless Bandits and the Knapsack Problem for Perishable Inventories," Operations Research, INFORMS, vol. 62(3), pages 696-711, June.
    2. Victor F. Araman & René A. Caldentey, 2022. "Diffusion Approximations for a Class of Sequential Experimentation Problems," Management Science, INFORMS, vol. 68(8), pages 5958-5979, August.
    3. Nathan C. Craig & Ananth Raman, 2016. "Improving Store Liquidation," Manufacturing & Service Operations Management, INFORMS, vol. 18(1), pages 89-103, February.
    4. Jacko, Peter & Niño Mora, José, 2009. "An index for dynamic product promotion and the knapsack problem for perishable items," DES - Working Papers. Statistics and Econometrics. WS ws093111, Universidad Carlos III de Madrid. Departamento de Estadística.
    5. Stephen Chick & Martin Forster & Paolo Pertile, 2017. "A Bayesian decision theoretic model of sequential experimentation with delayed response," Journal of the Royal Statistical Society Series B, Royal Statistical Society, vol. 79(5), pages 1439-1462, November.
    6. Dong Li & Li Ding & Stephen Connor, 2020. "When to Switch? Index Policies for Resource Scheduling in Emergency Response," Production and Operations Management, Production and Operations Management Society, vol. 29(2), pages 241-262, February.
    7. Haijian Si & Stylianos Kavadias & Christoph Loch, 2022. "Managing innovation portfolios: From project selection to portfolio design," Production and Operations Management, Production and Operations Management Society, vol. 31(12), pages 4572-4588, December.
    8. Vishal Ahuja & John R. Birge, 2020. "An Approximation Approach for Response-Adaptive Clinical Trial Design," INFORMS Journal on Computing, INFORMS, vol. 32(4), pages 877-894, October.
    9. Mantrala, Murali K. & Levy, Michael & Kahn, Barbara E. & Fox, Edward J. & Gaidarev, Peter & Dankworth, Bill & Shah, Denish, 2009. "Why is Assortment Planning so Difficult for Retailers? A Framework and Research Agenda," Journal of Retailing, Elsevier, vol. 85(1), pages 71-83.
    10. Ahuja, Vishal & Birge, John R., 2016. "Response-adaptive designs for clinical trials: Simultaneous learning from multiple patients," European Journal of Operational Research, Elsevier, vol. 248(2), pages 619-633.
    11. Ilan Lobel, 2021. "Revenue Management and the Rise of the Algorithmic Economy," Management Science, INFORMS, vol. 67(9), pages 5389-5398, September.
    12. Ilya O. Ryzhov & Warren B. Powell & Peter I. Frazier, 2012. "The Knowledge Gradient Algorithm for a General Class of Online Learning Problems," Operations Research, INFORMS, vol. 60(1), pages 180-195, February.
    13. Warren B. Powell, 2016. "Perspectives of approximate dynamic programming," Annals of Operations Research, Springer, vol. 241(1), pages 319-356, June.
    14. Victor F. Araman & René Caldentey, 2009. "Dynamic Pricing for Nonperishable Products with Demand Learning," Operations Research, INFORMS, vol. 57(5), pages 1169-1188, October.
    15. Vincent Mak & Amnon Rapoport & Eyran J. Gisches & Jiaojie Han, 2014. "Purchasing Scarce Products Under Dynamic Pricing: An Experimental Investigation," Manufacturing & Service Operations Management, INFORMS, vol. 16(3), pages 425-438, July.
    16. Santiago R. Balseiro & David B. Brown & Chen Chen, 2021. "Dynamic Pricing of Relocating Resources in Large Networks," Management Science, INFORMS, vol. 67(7), pages 4075-4094, July.
    17. Martello, Silvano & Pisinger, David & Toth, Paolo, 2000. "New trends in exact algorithms for the 0-1 knapsack problem," European Journal of Operational Research, Elsevier, vol. 123(2), pages 325-332, June.
    18. Régis Chenavaz & Corina Paraschiv & Gabriel Turinici, 2017. "Dynamic Pricing of New Products in Competitive Markets: A Mean-Field Game Approach," Working Papers hal-01592958, HAL.
    19. Zhang, Wei & Rajaram, Kumar, 2017. "Managing limited retail space for basic products: Space sharing vs. space dedication," European Journal of Operational Research, Elsevier, vol. 263(3), pages 768-781.
    20. Dasci, A. & Karakul, M., 2009. "Two-period dynamic versus fixed-ratio pricing in a capacity constrained duopoly," European Journal of Operational Research, Elsevier, vol. 197(3), pages 945-968, September.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:241:y:2016:i:1:d:10.1007_s10479-013-1312-9. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.