Multi-tank joint replenishment problem with overlapping time windows in refined oil distribution

被引:4
|
作者
Xu, Xiaofeng [1 ]
Lin, Ziru [1 ]
Zhang, Wei [2 ]
Yi, Wanli [3 ]
机构
[1] China Univ Petr, Sch Econ & Management, 66 Changjiang West Rd, Qingdao 266580, Peoples R China
[2] Sichuan Univ, Sch Publ Adm, 24,Sect 1 South,First Ring Rd, Chengdu 610065, Peoples R China
[3] Kunlun Digital Technol Co Ltd, 1 Qinglong Hutong, Beijing 100007, Peoples R China
基金
中国国家自然科学基金;
关键词
MTJRP; Refined oil distribution; Joint replenishment; Overlapping time windows; GOBL-DE algorithm; PARTICLE SWARM OPTIMIZATION; VEHICLE-ROUTING PROBLEM; DIFFERENTIAL EVOLUTION; ALGORITHM;
D O I
10.1007/s10479-023-05512-1
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
The refined oil distribution provides energy security for residential consumption and economic operation. The unified replenishment of multiple tanks in a gasoline station is likely to result in single tank stock-outs, while replenishment of individual tanks can lead to high distribution costs. To balance these two contradictory issues, this study considers the overlapping time windows of multiple tanks at gasoline stations and conducts a strategy of distribution replenishment. Firstly, a detailed mechanism explanation of the multi-tank joint replenishment strategy with the overlapping time windows is provided. Based on the multi-tank joint replenishment problem, a refined oil distribution model is proposed, and the one-time replenishment of multiple tanks in a gasoline station is achieved by minimizing the total cost. Next, a differential evolution algorithm with generalized opposition-based learning (GOBL-DE) algorithm is developed to solve this distribution model by combining the advantages of opposition-based learning in quick convergence and DE in population diversity. Finally, a case study was conducted with the Guangdong sales company in China, where five consecutive cycles of replenishment were carried out. The results show that the distribution model with joint replenishment proposed in this paper can effectively prevent single tank stock-outs and reduce distribution costs. The replenishment of each cycle increases the time window overlap by 17.92%, significantly improving distribution efficiency. In addition, comparative analysis of the algorithm indicates that the GOBL-DE is a significant improvement about 12.23% on the classical heuristic algorithm and 13.57% on other improved algorithms due to its good convergence and search capability, which shows superiority in solving the distribution model with joint replenishment strategy. Therefore, applying the multi-tank joint replenishment strategy to the refined oil distribution network and offers the possibility of increased efficiency and reduced costs.
引用
收藏
页数:30
相关论文
共 50 条
  • [11] Heuristics for the joint multi-item replenishment problem under trade credits
    Tsao, Yu-Chung
    Teng, Wei-Guang
    IMA JOURNAL OF MANAGEMENT MATHEMATICS, 2013, 24 (01) : 63 - 77
  • [12] Solving the multi-buyer joint replenishment problem with a modified genetic algorithm
    Chan, CK
    Cheung, BKS
    Langevin, A
    TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2003, 37 (03) : 291 - 299
  • [13] Logistics Distribution Vehicle Routing Problem with Time Windows
    Chen Ailing
    AUTOMATION EQUIPMENT AND SYSTEMS, PTS 1-4, 2012, 468-471 : 2047 - 2051
  • [14] Multi-period vehicle routing problem with time windows for drug distribution in the epidemic situation
    Zhang, Jie
    Li, Yanfeng
    Lu, Zhaoyang
    TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, 2024, 160
  • [15] The multi-pickup and delivery problem with time windows
    Naccache, Salma
    Cote, Jean-Francois
    Coelho, Leandro C.
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2018, 269 (01) : 353 - 362
  • [16] A Multi-Trip Split-Delivery Vehicle Routing Problem with Time Windows for Inventory Replenishment Under Stochastic Travel Times
    Chu, James C.
    Yan, Shangyao
    Huang, Han-Jheng
    NETWORKS & SPATIAL ECONOMICS, 2017, 17 (01): : 41 - 68
  • [17] A Multi-Trip Split-Delivery Vehicle Routing Problem with Time Windows for Inventory Replenishment Under Stochastic Travel Times
    James C. Chu
    Shangyao Yan
    Han-Jheng Huang
    Networks and Spatial Economics, 2017, 17 : 41 - 68
  • [18] An integrated algorithm for solving multi-customer joint replenishment problem with districting consideration
    Yao, Ming-Jong
    Lin, Jen-Yen
    Lin, Yu-Liang
    Fang, Shu-Cherng
    TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2020, 138
  • [19] Multi-retailer joint replenishment problem under different carbon regulation policies
    Hariga, Moncer
    As'ad, Rami
    Ben-Daya, Mohamed
    SUPPLY CHAIN FORUM, 2024, 25 (03): : 281 - 295
  • [20] A novel multi-item joint replenishment problem considering multiple type discounts
    Cui, Ligang
    Zhang, Yajun
    Deng, Jie
    Xu, Maozeng
    PLOS ONE, 2018, 13 (06):