Abstract
This paper concerns a two-product, multi-period nonstationary newsvendor model in which the inventory is not allowed to be carried between periods and each period the newsvendor is subject to a budget constraint and has to decide his order quantities on each product. The Weak Aggregating Algorithm (WAA) developed in computer science is an online learning method of prediction with expert advice; it makes decisions by considering all the experts advice, and each expert’s weight is updated according to his performance in previous periods. Without making statistical assumption on future demand sequence, we propose newsvendor ordering policy by applying WAA to nonstationary ordering policy that can switch between different order quantities in all trading periods. Theoretically, we prove that the proposed ordering policy preserves great competitiveness when compared with the best nonstationary ordering policy with not too many switches. We consider both real-valued and integer-valued ordering policies. Numerical examples with different nonstationary demand types of product 1 illustrate the great competitive performance of the proposed ordering policy. It is found that as the budget increases, the order quantities on the two products and the ordering policy’s cumulative gains increase.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Alfares HK, Elmorra HH (2005) The distribution-free newsboy problem: extension to the shortage penalty case. Int J Prod Econ 93–94:465–477
Chen L,H, Chen YC (2010) A multiple-item budget-constraint newsboy problem with a reservation policy. Omega Int J Manag Sci 38:431–439
Feng XH, Moon I, Ryu K (2015) Supply chain coordination under budget constraints. Comput Ind Eng 88:487–500
Gallego G, Moon I (1993) The distribution free newsboy problem: review and extensions. J Oper Res Soc 44:825–834
Guder F, Zydiak J, Chaudhry S (1994) Capacitated multiple-item ordering with incremental quantity discounts. J Oper Res Soc 45(10):1197–1205
Hadley G, Whitin TM (1963) Analysis of inventory systems. Prentice Hall, Englewood Cliffs 1963
Hua GW, Wang SY, Cheng TCE (2012) Optimal pricing and order quantity for the newsvendor problem with free shipping. Int J Prod Econ 135:162–169
Huang WH, Cheng YC (2015) Threshold free shipping policies for internet shoppers. Transp Res Part A 82:193–203
Ji X, Shao Z (2006) Model and algorithm for bilevel newsboy problem with fuzzy demands and discounts. Appl Math Comput 172:163–174
Jucker JV, Rosenblatt MJ (1985) Single period inventory models with demand uncertainty and quantity discounts: behavioral implications and a new solution procedure. Naval Res Logist Q 32:537–550
Kalnishkan Y, Vyugin MV (2008) The weak aggregating algorithm and weak mixability. J Comput Syst Sci 74:1228–1244
Kamburowski J (2014) The distribution-free newsboy problem under the worst-case and best-case scenarios. Eur J Oper Res 237:106–112
Keisuke M (2006) The multi-period newsboy problem. Eur J Oper Res 171:170–188
Khouja M (1995) The newsboy problem under progressive multiple discounts. Eur J Oper Res 84:458–466
Khouja M (1999) The single period (newsvendor) problem: literature review and suggestions for future research. Omega Int J Manag Sci 27:537–542
Levina T, Levin Y, McGill J, Nediak M, Vovk V (2010) Weak aggregating algorithm for the distribution-free perishable inventory problem. Oper Res Lett 38:516–521
Moon I, Choi S (1995) Distribution free newsboy problem with balking. J Oper Res Soc 46:537–542
Moon I, Choi S (1997) Distribution free procedures for make-to-order (MTO), make-in-advance (MIA), and composite policies. Int J Prod Econ 48:21–28
Qin Y, Wang R, Vakharia AJ, Chen Y, Seref MMH (2011) The newsvendor problem: review and directions for future research. Eur J Oper Res 213:361–374
Scarf H (1958) A min-max solution of an inventory problem. In: Arrow K, Karlin S, Scarf H (eds) Studies in the mathematical theory of inventory and production. Stanford University Press, California, pp 201–209
Serel DA (2012) Multi-item quick response system with budget constraint. Int J Prod Econ 137:235–249
Shi JM, Zhang GQ (2010) Multi-product budget-constrained acquisition and pricing with uncertain demand and supplier quantity discounts. Int J Prod Econ 128:322–331
Silver EA, Pyke DF, Peterson R (1998) Inventory management and production planning and scheduling, 3rd edn. Wiley, New York, p 1998
Vairaktarakis GL (2000) Robust multi-item newsboy models with a budget constraint. Int J Prod Econ 66:213–226
Zhang Y, Vovk V, Zhang WG (2014) Probability-free solutions to the non-stationary newsvendor problem. Ann Oper Res 223:433–449
Zhang Y, Yang XY (2016) Online ordering policies for a two-product, multi-period stationary newsvendor problem. Comput Oper Res 74:143–151
Acknowledgements
This research was supported by the National Natural Science Foundation of China (71501049, 71720107002, 71301029, 71471065) and the GDUPS (2016).
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The author declares that they have no conflict of interest.
Additional information
Communicated by V. Loia.
Rights and permissions
About this article
Cite this article
Zhang, Y., Zhang, W., Yang, X. et al. A two-product, multi-period nonstationary newsvendor problem with budget constraint. Soft Comput 23, 4277–4287 (2019). https://doi.org/10.1007/s00500-018-3082-4
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00500-018-3082-4