IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v13y2025i7p1172-d1626794.html
   My bibliography  Save this article

Study of Impact of Moment Information in Demand Forecasting on Distributionally Robust Fulfillment Rate Improvement Algorithm

Author

Listed:
  • Haodong Feng

    (School of Management, Zhejiang University, Hangzhou 310030, China)

Abstract

Front distribution centers are extensively employed in E-commerce distribution networks to shorten the delivery time, thereby stimulating customers’ purchase intentions and enhancing customer loyalty. When a customer places an order, the designated front distribution center quickly processes it to ensure prompt delivery. If the front distribution center is out of stock, the order will be fulfilled by its corresponding regional distribution center, which will result in a longer delivery time. Once the regional distribution center is also out of stock, a lost sale occurs. This paper improves a distributionally robust allocation model aimed at enhancing the fulfillment rates of front distribution centers while also preserving the overall fulfillment rate within the region. We reformulate this distributionally robust allocation model into an equivalent mixed-integer linear programming model and develop a corresponding approximation algorithm. Through numerical experiments, we comprehensively reveal the impact of moment information in demand forecasting on the distributionally robust fulfillment rate improvement algorithm by discovering how demand forecasting influences the allocation rule and how forecasted variance influences the fulfillment rates at fixed or changing inventory levels.

Suggested Citation

  • Haodong Feng, 2025. "Study of Impact of Moment Information in Demand Forecasting on Distributionally Robust Fulfillment Rate Improvement Algorithm," Mathematics, MDPI, vol. 13(7), pages 1-35, April.
    • Handle: RePEc:gam:jmathe:v:13:y:2025:i:7:p:1172-:d:1626794
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/13/7/1172/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/13/7/1172/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Ping Josephine Xu & Russell Allgor & Stephen C. Graves, 2009. "Benefits of Reevaluating Real-Time Order Fulfillment Decisions," Manufacturing & Service Operations Management, INFORMS, vol. 11(2), pages 340-355, January.
    2. Yanzhe (Murray) Lei & Stefanus Jasin & Amitabh Sinha, 2018. "Joint Dynamic Pricing and Order Fulfillment for E-commerce Retailers," Manufacturing & Service Operations Management, INFORMS, vol. 20(2), pages 269-284, May.
    3. Han Zhu & Youhua (Frank) Chen & Ming Hu & Yi Yang, 2021. "Technical Note–A Simple Heuristic Policy for Stochastic Distribution Inventory Systems with Fixed Shipment Costs," Operations Research, INFORMS, vol. 69(6), pages 1651-1659, November.
    4. Shiman Ding & Philip M. Kaminsky, 2020. "Centralized and Decentralized Warehouse Logistics Collaboration," Manufacturing & Service Operations Management, INFORMS, vol. 22(4), pages 812-831, July.
    5. Anna Franceschetti & Dorothée Honhon & Gilbert Laporte & Tom Van Woensel, 2018. "A Shortest-Path Algorithm for the Departure Time and Speed Optimization Problem," Transportation Science, INFORMS, vol. 52(4), pages 756-768, August.
    6. Sagnik Das & R. Ravi & Srinath Sridhar, 2023. "Order Fulfillment Under Pick Failure in Omnichannel Ship-From-Store Programs," Manufacturing & Service Operations Management, INFORMS, vol. 25(2), pages 508-523, March.
    7. Dai, B. & Chen, H.X. & Li, Y.A. & Zhang, Y.D. & Wang, X.Q. & Deng, Y.M., 2021. "Inventory replenishment planning of a distribution system with storage capacity constraints and multi-channel order fulfilment," Omega, Elsevier, vol. 102(C).
    8. Gábor Nagy & Niaz A. Wassan & M. Grazia Speranza & Claudia Archetti, 2015. "The Vehicle Routing Problem with Divisible Deliveries and Pickups," Transportation Science, INFORMS, vol. 49(2), pages 271-294, May.
    9. Kevin H. Shang & Zhijie Tao & Sean X. Zhou, 2015. "Optimizing Reorder Intervals for Two-Echelon Distribution Systems with Stochastic Demand," Operations Research, INFORMS, vol. 63(2), pages 458-475, April.
    10. Amir Ardestani-Jaafari & Erick Delage, 2016. "Robust Optimization of Sums of Piecewise Linear Functions with Application to Inventory Problems," Operations Research, INFORMS, vol. 64(2), pages 474-494, April.
    11. Levi DeValve & Yehua Wei & Di Wu & Rong Yuan, 2023. "Understanding the Value of Fulfillment Flexibility in an Online Retailing Environment," Manufacturing & Service Operations Management, INFORMS, vol. 25(2), pages 391-408, March.
    12. Alexandar Angelus, 2011. "A Multiechelon Inventory Problem with Secondary Market Sales," Management Science, INFORMS, vol. 57(12), pages 2145-2162, December.
    13. Xiaobei Shen & Yimin Yu & Jing-Sheng Song, 2022. "Optimal Policies for a Multi-Echelon Inventory Problem with Service Time Target and Expediting," Manufacturing & Service Operations Management, INFORMS, vol. 24(4), pages 2310-2327, July.
    14. Stefanus Jasin & Amitabh Sinha, 2015. "An LP-Based Correlated Rounding Scheme for Multi-Item Ecommerce Order Fulfillment," Operations Research, INFORMS, vol. 63(6), pages 1336-1351, December.
    15. Sentao Miao & Stefanus Jasin & Xiuli Chao, 2022. "Asymptotically Optimal Lagrangian Policies for Multi-Warehouse, Multi-Store Systems with Lost Sales," Operations Research, INFORMS, vol. 70(1), pages 141-159, January.
    16. Dawsen Hwang & Patrick Jaillet & Vahideh Manshadi, 2021. "Online Resource Allocation Under Partially Predictable Demand," Operations Research, INFORMS, vol. 69(3), pages 895-915, May.
    17. Erick Delage & Yinyu Ye, 2010. "Distributionally Robust Optimization Under Moment Uncertainty with Application to Data-Driven Problems," Operations Research, INFORMS, vol. 58(3), pages 595-612, June.
    18. Yongchao Liu & Alois Pichler & Huifu Xu, 2019. "Discrete Approximation and Quantification in Distributionally Robust Optimization," Mathematics of Operations Research, INFORMS, vol. 44(1), pages 19-37, February.
    Full references (including those not matched with items on IDEAS)

    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. Jiu, Song & Wang, Dan & Ma, Zujun, 2024. "Benders decomposition for robust distribution network design and operations in online retailing," European Journal of Operational Research, Elsevier, vol. 315(3), pages 1069-1082.
    2. Zhang, Yuankai & Lin, Wei-Hua & Huang, Minfang & Hu, Xiangpei, 2021. "Multi-warehouse package consolidation for split orders in online retailing," European Journal of Operational Research, Elsevier, vol. 289(3), pages 1040-1055.
    3. Xueqi Wu & Zhi‐Long Chen, 2022. "Fulfillment scheduling for buy‐online‐pickup‐in‐store orders," Production and Operations Management, Production and Operations Management Society, vol. 31(7), pages 2982-3003, July.
    4. Jiang, Jie & Peng, Shen, 2024. "Mathematical programs with distributionally robust chance constraints: Statistical robustness, discretization and reformulation," European Journal of Operational Research, Elsevier, vol. 313(2), pages 616-627.
    5. Gabor, Adriana F. & van Ommeren, Jan-Kees & Sleptchenko, Andrei, 2022. "An inventory model with discounts for omnichannel retailers of slow moving items," European Journal of Operational Research, Elsevier, vol. 300(1), pages 58-72.
    6. Zhou, Yong-Wu & Zhang, Xiong & Zhong, Yuanguang & Cao, Bin & Cheng, T.C. Edwin, 2021. "Dynamic pricing and cross-channel fulfillment for omnichannel retailing industry: An approximation policy and implications," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 156(C).
    7. Yannan Chen & Hailin Sun & Huifu Xu, 2021. "Decomposition and discrete approximation methods for solving two-stage distributionally robust optimization problems," Computational Optimization and Applications, Springer, vol. 78(1), pages 205-238, January.
    8. van Eekelen, Wouter, 2023. "Distributionally robust views on queues and related stochastic models," Other publications TiSEM 9b99fc05-9d68-48eb-ae8c-9, Tilburg University, School of Economics and Management.
    9. Cheng, Lihong & Guo, Xiaolong & Li, Xiaoxiao & Yu, Yugang, 2022. "Data-driven ordering and transshipment decisions for online retailers and logistics service providers," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 161(C).
    10. Shanshan Wang & Erick Delage, 2024. "A Column Generation Scheme for Distributionally Robust Multi-Item Newsvendor Problems," INFORMS Journal on Computing, INFORMS, vol. 36(3), pages 849-867, May.
    11. Libo Sun & Guodong Lyu & Yugang Yu & Chung‐Piaw Teo, 2020. "Fulfillment by Amazon versus fulfillment by seller: An interpretable risk‐adjusted fulfillment model," Naval Research Logistics (NRL), John Wiley & Sons, vol. 67(8), pages 627-645, December.
    12. Karthik Natarajan & Melvyn Sim & Joline Uichanco, 2018. "Asymmetry and Ambiguity in Newsvendor Models," Management Science, INFORMS, vol. 64(7), pages 3146-3167, July.
    13. Jie Jiang, 2024. "Distributionally Robust Variational Inequalities: Relaxation, Quantification and Discretization," Journal of Optimization Theory and Applications, Springer, vol. 203(1), pages 227-255, October.
    14. Mengshi Lu & Zuo‐Jun Max Shen, 2021. "A Review of Robust Operations Management under Model Uncertainty," Production and Operations Management, Production and Operations Management Society, vol. 30(6), pages 1927-1943, June.
    15. Ardjmand, Ehsan & Sanei Bajgiran, Omid & Rahman, Shakil & Weckman, Gary R. & Young, William A., 2018. "A multi-objective model for order cartonization and fulfillment center assignment in the e-tail/retail industry," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 115(C), pages 16-34.
    16. Zhu, Shan & Hu, Xiangpei & Huang, Kai & Yuan, Yufei, 2021. "Optimization of product category allocation in multiple warehouses to minimize splitting of online supermarket customer orders," European Journal of Operational Research, Elsevier, vol. 290(2), pages 556-571.
    17. Pichka, Khosro & Alwan, Layth C. & Yue, Xiaohang, 2022. "Fulfillment and pricing optimization for omni-channel retailers considering shipment of in-store demand," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 167(C).
    18. Li, Shuqin & Jia, Shuai, 2019. "A Benders decomposition algorithm for the order fulfilment problem of an e-tailer with a self-owned logistics system," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 122(C), pages 463-480.
    19. Zhi Chen & Melvyn Sim & Huan Xu, 2019. "Distributionally Robust Optimization with Infinitely Constrained Ambiguity Sets," Operations Research, INFORMS, vol. 67(5), pages 1328-1344, September.
    20. Ho-Yin Mak & Zuo-Jun Max Shen, 2014. "Pooling and Dependence of Demand and Yield in Multiple-Location Inventory Systems," Manufacturing & Service Operations Management, INFORMS, vol. 16(2), pages 263-269, May.

    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:gam:jmathe:v:13:y:2025:i:7:p:1172-:d:1626794. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.