Skip to main content
Log in

The allocation optimization of promotion budget and traffic volume for an online flash-sales platform

  • S.I.: RealCaseOR
  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

This paper discusses an allocation issue of promotion budget and traffic volume, faced by VIP.com that is the largest online flash-sales platform in China. Through flash sales mode, each day VIP.com provides consumers one hundred authorized brands of products on consignment, which last for a short period of time (frequently 3–5 days), called by VIP.com ‘Dangqi’. As a consignee, VIP.com has no pricing rights of products but can allocate the promotion budget and traffic volume to each brand. Due to different categories of products and different brands of products having different responses to the same promotion budget and different profit margins, it is very necessary for VIP.com to allocate promotion budget and traffic volume among all brands of products offered in each ‘Dangqi’ reasonably in order to improve the usage efficiency of limited resources. Based on the real historical data of VIP.com, we first find main elements that influence the sales revenues of different brands of products through machine learning. We then predict the sales of all brands of products in each ‘Dangqi’ by multiplicative regression model, which has better accuracy of forecasting than other forecast models and obtain the function relationship between the total sales of each brand and its main impact elements. Finally, considering VIP.com’s actual concerns, we develop allocation optimization models with objectives of maximizing VIP.com’s total sales and total sales profit, respectively. The results from VIP.com’s real data tests show that under the same resource investment the presented allocation optimization approach can yield a significant increase in VIP.com’s total sales and sales profit in each ‘Dangqi’.

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

Access this article

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

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16

Similar content being viewed by others

References

  • Akpinar, M., & Yumusak, N. (2016). Year ahead demand forecast of city natural gas using seasonal time series methods. Energies,9(9), 727.

    Google Scholar 

  • Basu, A. K., & Batra, R. (1988). Adsplit: A multi-brand advertising budget allocation model. Journal of Advertising,17(2), 44–51.

    Google Scholar 

  • Berger, P. D., & Bechwati, N. N. (2001). The allocation of promotion budget to maximize customer equity. Omega,29(1), 49–61.

    Google Scholar 

  • Brynjolfsson, E., & Mcelheran, K. (2016). The rapid adoption of data-driven decision-making. American Economic Review,106(5), 133–139.

    Google Scholar 

  • Cao, Q., Parry, M. E., & Leggio, K. B. (2011). The three-factor model and artificial neural networks: Predicting stock price movement in China. Annals of Operations Research,185(1), 25–44.

    Google Scholar 

  • Choi, Y., Lee, H., & Irani, Z. (2018). Big data-driven fuzzy cognitive map for prioritising IT service procurement in the public sector. Annals of Operations Research, 270(1–2), 75–104.

    Google Scholar 

  • Chu, F. L. (2014). Using a logistic growth regression model to forecast the demand for tourism in Las Vegas. Tourism Management Perspectives,12, 62–67.

    Google Scholar 

  • Delahaye, T., Acuna-Agost, R., Bondoux, N., Nguyen, A. Q., & Boudia, M. (2017). Data-driven models for itinerary preferences of air travelers and application for dynamic pricing optimization. Journal of Revenue and Pricing Management,4, 1–19.

    Google Scholar 

  • Dmitri, K., Maria, A., & Anna, A. (2017). Comparison of regression and neural network approaches to forecast daily power consumption. In International forum on strategic technology (pp. 247–250).

  • Everitt and Brian. (2011). Cluster analysis (5th ed.). Hoboken: Wiley.

    Google Scholar 

  • Fan, H., Tarun, P. K., Chen, V. C. P., et al. (2018). Data-driven optimization for Dallas Fort Worth International Airport deicing activities. Annals of Operations Research,263(1–2), 361–384.

    Google Scholar 

  • Ferreira, K. J., Lee, B. H. A., & Simchi-Levi, D. (2016). Analytics for an online retailer: Demand forecasting and price optimization. Manufacturing and Service Operations Management,18(1), 69–88.

    Google Scholar 

  • Gao, J. J., Tan, C. L., Liu, Y., & Yin, Y. F. (2009). Demand forecast using support vector machine for a product category. Journal of Shanghai University,15(1), 71–76.

    Google Scholar 

  • Goldberg, D. E. (1990). Genetic algorithms in search, optimization and machine learning (p. 1990). Reading, MA: Addison-Wesley.

    Google Scholar 

  • Haque, M. M., Souza, A. D., & Rahman, A. (2017). Water demand modelling using independent component regression technique. Water Resources Management,31, 1–14.

    Google Scholar 

  • Hastie, T., Tibshirani, R., & Friedman, J. (2009). The elements of statistical learning: Data mining, inference, and prediction (2nd ed.). New York: Springer.

    Google Scholar 

  • Holthausen, D. M., & Assmus, G. (1982). Advertising budget allocation under uncertainty. Management Science,28(5), 487–499.

    Google Scholar 

  • Huh, W. T., Levi, R., Rusmevichientong, P., & Orlin, J. B. (2011). Adaptive data-driven inventory control with censored demand based on Kaplan–Meier estimator. Operations Research,59(4), 929–941.

    Google Scholar 

  • Izadyar, N., Ghadamian, H., Ong, H. C., Moghadam, Z., Tong, C. W., & Shamshirband, S. (2015). Appraisal of the support vector machine to forecast residential heating demand for the district heating system based on the monthly overall natural gas consumption. Energy,93(9), 1558–1567.

    Google Scholar 

  • Jacko, P. (2016). Resource capacity allocation to stochastic dynamic competitors: Knapsack problem for perishable items and index-knapsack heuristic. Annals of Operations Research,241(1–2), 83–107.

    Google Scholar 

  • Kavaklioglu, K. (2011). Modeling and prediction of Turkey’s electricity consumption using support vector regression. Applied Energy,88(1), 368–375.

    Google Scholar 

  • Lau, H. C. W., Ho, G. T. S., & Zhao, Y. (2013). A demand forecast model using a combination of surrogate data analysis and optimal neural network approach. Decision Support Systems,54(3), 1404–1416.

    Google Scholar 

  • Leon, S. M., & Mitra, S. (2014). Discrete choice model for air-cargo mode selection. International Journal of Logistics Management,25(3), 656–672.

    Google Scholar 

  • Levin, R. I., Mclaughlin, C. P., Lamone, R. P. & Kottas, J. F. (1972). Productions/Operations management: contemporary policy for managing operating systems. New York: McGraw Hill.

    Google Scholar 

  • Louviere, J. J., & Hensher, D. A. (1983). Using discrete choice models with experimental design data to forecast consumer demand for a unique cultural event. Journal of Consumer Research,10(3), 348–361.

    Google Scholar 

  • Majidpour, M., Qiu, C., Chu, P., Gadh, R., & Pota, H. R. (2015). Fast prediction for sparse time series: Demand forecast of EV charging stations for cell phone applications. IEEE Transactions on Industrial Informatics,11(1), 242–250.

    Google Scholar 

  • Maranas, C. D., & Zomorrodi, A. R. (2016). Optimization methods in metabolic networks. Wiley,2016, 02.

    Google Scholar 

  • Nasrabadi, N., Dehnokhalaji, A., Kiani, N. A., et al. (2012). Resource allocation for performance improvement. Annals of Operations Research,196(1), 459–468.

    Google Scholar 

  • Ren, S., Chan, H. L., & Ram, P. (2016). A comparative study on fashion demand forecasting models with multiple sources of uncertainty. Annals of Operations Research,257(1–2), 1–21.

    Google Scholar 

  • Schlosser, R., & Boissier, M. (2016). Dynamic pricing under competition: A data-driven approach. Rochester: Social Science Electronic Publishing.

    Google Scholar 

  • Shimizukawa, J., Chen, C. Y., Iba, K., Hida, Y., Yokoyama, R., Tanaka, K., & Yabe, K. (2009). Multi-regression model for peak load forecast in demand side like university campus. In The international conference on electrical engineering, 2009.

  • Silver, E. A. & Peterson, R. (1985). Decision systems for inventory management and production planning (3rd ed.). New York: Wiley.

    Google Scholar 

  • Yang, Y., Zeng, D., Yang, Y., & Zhang, J. (2015). Optimal budget allocation across search advertising markets. Informs Journal on Computing,27(2), 285–300.

    Google Scholar 

Download references

Acknowledgements

The authors gratefully appreciate the helpful comments and suggestions of the editor and the anonymous referees. This work is supported by the National Nature Science Foundation of China 71871097, 71520107001, 71501077, 71601079 and the GDUPS(2017).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yuanguang Zhong.

Appendices

Appendix A: The comparison of different similarity measurement methods

1.1 A1: Euclidean distance

First, we give out the expression of Euclidean distance, which is:

$$ d\left( {X,Y \, } \right) = \sqrt {(x_{1} - y_{1} )^{2} \, + \, \cdots \, + \, (x_{i} - y_{i} )^{2} \, + \, \cdots \, + \, (x_{n} - y_{n} )^{2} } . $$
(7)

Use Euclidean distance as the measurement of the similarity of two brands, and according to the process explained in Sect. 3.2, we get the optimal number of brand groups under suit dress category is 4, the results of forecasting are shown in Table 5.

Table 5 The forecasting accuracy of different models for 4 BGs with Euclidean distance

1.2 A2: Minkowski distance

First, we give out the expression of Minkowski distance, which is:

$$ d\left( {X,Y} \right) = \left[ {\sum\limits_{i \in N} {\left| {x_{i} - y_{i} } \right|^{m} } } \right]^{{\frac{1}{m}}} . $$
(8)

Similarly, use Minkowski distance as the measurement of the similarity of two brands, and according to the process explained in Sect. 3.2, we get the optimal number of brand groups under suit dress category is 5, the results of forecasting are shown below (Table 6)

Table 6 The forecasting accuracy of different models for 5 BGs with Minkowski distance

Next table gives out the comparison of the results from three different similarity measurement methods.

As we can see from Table 7, using cosine value of two brands to present their similarity brings higher forecasting accuracy. On other hand, we also see that regardless of the similarity measurement methods we use, multiplicative regression model is always better than other regression models with respect to forecasting accuracy, which verifies the reasonability of forecasting model we use.

Table 7 The results of different similarity measurement methods

Appendix B: Error normality test

To verify the correctness of the results of stepwise regression and the reasonability of the final forecasting model, we carry out normality test for the forecasting error, take suit dress category as example (Fig. 17):

Fig. 17
figure 17

Error distribution for different brand groups under suit dress category

We use K–S test to exam the error data, the results are (significance level: 0.05):

From Table 8, the p values of all brand groups are much bigger than the significance level, therefore, the errors are normally distributed in our test, which proves the correctness of our forecasting model.

Table 8 The results of K–S test

Appendix C: The results of 5 and 6 BGs

See Figs. 18, 19 and Tables 9, 10, 11, 12.

Fig. 18
figure 18

The midpoints of 5 BGs

Fig. 19
figure 19

The midpoints of 6 BGs

Table 9 Independent variables for 5 BGs
Table 10 Independent variables for 6 BGs
Table 11 The forecasting accuracy of different models for 5 BGs
Table 12 The forecasting accuracy of different models for 6 BGs

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zhou, YW., Chen, C., Zhong, Y. et al. The allocation optimization of promotion budget and traffic volume for an online flash-sales platform. Ann Oper Res 291, 1183–1207 (2020). https://doi.org/10.1007/s10479-018-3065-y

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-018-3065-y

Keywords

Navigation