A Single-Product Multi-Period Inventory Routing Problem under Intermittent Demand

被引:0
|
作者
Song, Xin [1 ]
Chang, Daofang [2 ]
Luo, Tian [3 ]
机构
[1] Shanghai Maritime Univ, Sch Econ & Management, Shanghai 201306, Peoples R China
[2] Shanghai Maritime Univ, Logist Engn Coll, Shanghai 201306, Peoples R China
[3] Hangzhou Normal Univ, Alibaba Business Sch, Hangzhou 311121, Peoples R China
关键词
inventory routing; transshipment; adaptive large-neighborhood search; LARGE NEIGHBORHOOD SEARCH; ALGORITHM;
D O I
10.3390/info14060331
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Demand fluctuations and uncertainty bring challenges to inventory management, and intermittent demand patterns increase the risk of inventory backlogs and raise inventory holding costs. In previous studies on inventory routing problems, different variants have been proposed to cope with complicated industrial scenarios. However, there are few studies on inventory routing problems with intermittent demand patterns. To solve this problem, we introduce a lateral transshipment strategy and build a single-product multi-period inventory routing mixed integer programming model to reduce customers' inventory backlogs, balance regional inventory, reduce inventory holding costs, and improve inventory management efficiency. Furthermore, we design an adaptive large-neighborhood search algorithm with new operators to improve the solving efficiency. The experimental results show that an appropriate transshipment price can reduce the share of distribution costs. Another finding is that higher-capacity vehicles lead to higher revenue. Our findings not only expand the scope of the IRP domain but also provide actionable management insights for business practitioners.
引用
收藏
页数:17
相关论文
共 50 条
  • [31] Optimization and Control for Multi-period Multilevel Inventory in Supply Chain under Uncertain Demand
    Liu Yugang
    Xia, Luo
    Li Fazhi
    [J]. ICPOM2008: PROCEEDINGS OF 2008 INTERNATIONAL CONFERENCE OF PRODUCTION AND OPERATION MANAGEMENT, VOLUMES 1-3, 2008, : 499 - 505
  • [32] Reinforcement Learning Approach for Multi-period Inventory with Stochastic Demand
    Shakya, Manoj
    Ng, Huey Yuen
    Ong, Darrell Joshua
    Lee, Bu-Sung
    [J]. ARTIFICIAL INTELLIGENCE APPLICATIONS AND INNOVATIONS, AIAI 2022, PART I, 2022, 646 : 282 - 291
  • [33] Multi-period inventory model with fuzzy cost and fuzzy demand
    Roy, T.K.
    Maiti, M.
    [J]. Advances in Modeling and Analysis B, 1998, 39 (02): : 25 - 38
  • [34] Multi-period Vehicle Routing Problem with Due dates
    Archetti, Claudia
    Jabali, Ola
    Speranza, M. Grazia
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2015, 61 : 122 - 134
  • [35] A Branch-Price-and-Cut Algorithm for Single-Product Maritime Inventory Routing
    Engineer, Faramroze G.
    Furman, Kevin C.
    Nemhauser, George L.
    Savelsbergh, Martin W. P.
    Song, Jin-Hwa
    [J]. OPERATIONS RESEARCH, 2012, 60 (01) : 106 - 122
  • [36] On the multi-period combined maintenance and routing optimisation problem
    Lopez-Santana, Eduyn
    Mendez, German
    Franco, Carlos
    [J]. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2023, 61 (23) : 8265 - 8290
  • [37] Management Policies in a Dynamic Multi-Period Routing Problem
    Angelelli, Enrico
    Bianchessi, Nicola
    Mansini, Renata
    Speranza, M. Grazia
    [J]. INNOVATIONS IN DISTRIBUTION LOGISTICS, 2009, 619 : 1 - +
  • [38] Affinely adjustable robust optimization for a multi-period inventory problem with capital constraints and demand uncertainties
    Qiu, Ruozhen
    Sun, Yimeng
    Sun, Minghe
    Yu, Yue
    [J]. INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2024, 31 (01) : 415 - 447
  • [39] A bi-objective green multi-period inventory-routing problem with multi-speed vehicles
    Jandaghi H.
    Safaei A.S.
    Divsalar A.
    [J]. International Journal of Applied Decision Sciences, 2021, 14 (03) : 321 - 342
  • [40] On solving the multi-period single-sourcing problem under uncertainty
    Alonso-Ayuso, A.
    Escudero, L. F.
    Pizarro, C.
    Romeijn, H. E.
    Romero Morales, D.
    [J]. COMPUTATIONAL MANAGEMENT SCIENCE, 2006, 3 (01) : 29 - 53