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 条
  • [1] The petrol station replenishment problem with time windows
    Cornillier, Fabien
    Laporte, Gilbert
    Boctor, Fayez F.
    Renaud, Jacques
    COMPUTERS & OPERATIONS RESEARCH, 2009, 36 (03) : 919 - 935
  • [2] A MILP Approach for Filling Station Replenishment Problem with Time Windows in Initiative Distribution
    Zhang, Haoran
    Liao, Qi
    Yuan, Meng
    Wang, Bohong
    Shen, Yun
    Liang, Yongtu
    2018 7TH INTERNATIONAL CONFERENCE ON INDUSTRIAL TECHNOLOGY AND MANAGEMENT (ICITM 2018), 2018, : 254 - 259
  • [3] Heuristics for the multi-depot petrol station replenishment problem with time windows
    Cornillier, Fabien
    Boctor, Fayez
    Renaud, Jacques
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2012, 220 (02) : 361 - 369
  • [4] Solving the petroleum replenishment and routing problem with variable demands and time windows
    Yan Cheng Hsu
    Jose L. Walteros
    Rajan Batta
    Annals of Operations Research, 2020, 294 : 9 - 46
  • [5] Solving the petroleum replenishment and routing problem with variable demands and time windows
    Hsu, Yan Cheng
    Walteros, Jose L.
    Batta, Rajan
    ANNALS OF OPERATIONS RESEARCH, 2020, 294 (1-2) : 9 - 46
  • [6] Analytical study of the multi-item joint replenishment problem
    Huang, Shuo
    Chen, Jian
    Xitong Gongcheng Lilun yu Shijian/System Engineering Theory and Practice, 2007, 27 (12): : 90 - 95
  • [7] The pickup and delivery problem with alternative locations and overlapping time windows
    Dragomir, Alina G.
    Van Woensel, Tom
    Doerner, Karl F.
    COMPUTERS & OPERATIONS RESEARCH, 2022, 143
  • [8] Solving the multi-buyer joint replenishment problem with the RAND method
    Li, Q
    COMPUTERS & INDUSTRIAL ENGINEERING, 2004, 46 (04) : 755 - 762
  • [9] Mixed Integer Linear Programming and Solution for the Multi-tank Train Stowage Planning Problem of Coils in Steel Industry
    Yang, Fei
    Tang, Lixin
    Yuan, Yuan
    Li, Kun
    ISIJ INTERNATIONAL, 2014, 54 (03) : 634 - 643
  • [10] A modified RAND method with application to the multi-buyer joint replenishment problem
    Zhang, Xing
    Huang, Di
    Advances in Information Sciences and Service Sciences, 2012, 4 (01): : 46 - 53