Skip to main content

Optimizing Fresh Warehouse Networks Using MIP and SARIMA Forecasting

  • Conference paper
  • First Online:
Computing and Combinatorics (COCOON 2024)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 15163))

Included in the following conference series:

  • 70 Accesses

Abstract

The rapid expansion of fresh produce e-commerce demands efficient warehouse network optimization. This paper employs mixed-integer programming (MIP) to minimize logistics costs and uses the Seasonal Autoregressive Integrated Moving Average (SARIMA) model [1] for order forecasting. For the static warehouse network layout, we formulate an MIP model using order demand data. By applying the branch-and-bound method with the Gurobi solver, we determine the optimal logistics plans, resulting in 6 RDC’s (8 warehouses) and a total logistics cost of 9.9029 million yuan. For order forecasting, we compare the Error-Trend-Seasonality (ETS), Random Forest, and SARIMA models, selecting SARIMA for its superior accuracy with an 80/20 training-validation split. For the dynamic multi-period layout, we simulate demand using an empirical distribution function (EDF) with fluctuations. By integrating short-term historical data analysis and long-term forecast validation, we identify 6 robust, mandatory RDC’s locations.

The authors converted their report from the “Spark Cup” Joint Competition of Mathematical Modeling into an LNCS-style paper for the Competition Workshop of COCOON 2024.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Box, G.E.P., Jenkins, G.M., Reinsel, G.C., Ljung, G.M.: Time Series Analysis: Forecasting and Control. Wiley, Germany (2015)

    Google Scholar 

  2. Fang, W., Ai, S., Wang, Q., Fan, J.: Research on cold chain logistics distribution path optimization based on hybrid ant colony algorithm. Chin. J. Manage. Sci. (CJMS). 27(11), 107–115 (2019)

    Google Scholar 

  3. Zhang, Q., Xiong, Y., He, M., Zhang, H.: Multi-objective model of distribution route problem for fresh electricity commerce under uncertain demand. J. Syst. Simul. (JSS). 31(8), 1582–1590 (2019)

    Google Scholar 

  4. Ming, X., Zhu, L.: Study on optimization technology of city fresh food cold chain logistics distribution path. Packag. Food Mach. (PFM). 40(2), 76–81 (2022)

    Google Scholar 

  5. Wang, Y.: Research on cold chain logistics demand prediction in Gansu province based on GM(1,1) model. Logistics Eng. Manage. (LEM). 46(3), 1–3 (2024)

    Google Scholar 

  6. Wang, X.: Demand trend forecasting for agricultural cold chain logistics based on a weighted combination method. Stat. Decision (SD). 34(9), 57–60 (2018)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yunlong Yang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2025 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Qi, M., Chen, J., Yang, Y. (2025). Optimizing Fresh Warehouse Networks Using MIP and SARIMA Forecasting. In: Chen, Y., Gao, X., Sun, X., Zhang, A. (eds) Computing and Combinatorics. COCOON 2024. Lecture Notes in Computer Science, vol 15163. Springer, Singapore. https://doi.org/10.1007/978-981-96-1195-9_11

Download citation

  • DOI: https://doi.org/10.1007/978-981-96-1195-9_11

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-96-1194-2

  • Online ISBN: 978-981-96-1195-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics