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

被引:5
作者
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 条
  • [21] A multi-agent model for the Vehicle Routing Problem with Time Windows
    Kefi, M
    Ghédira, K
    URBAN TRANSPORT X: URBAN TRANSPORT AND THE ENVIRONMENT IN THE 21ST CENTURY, 2004, 16 : 227 - 234
  • [22] Heuristics for the multi-period orienteering problem with multiple time windows
    Tricoire, Fabien
    Romauch, Martin
    Doerner, Karl F.
    Hartl, Richard F.
    COMPUTERS & OPERATIONS RESEARCH, 2010, 37 (02) : 351 - 367
  • [23] The Multi-Objective Multi-Vehicle Pickup and Delivery Problem with Time Windows
    Grandinetti, L.
    Guerriero, F.
    Pezzella, F.
    Pisacane, O.
    TRANSPORTATION: CAN WE DO MORE WITH LESS RESOURCES? - 16TH MEETING OF THE EURO WORKING GROUP ON TRANSPORTATION - PORTO 2013, 2014, 111 : 203 - 212
  • [24] Exact algorithms for the multi-pickup and delivery problem with time windows
    Aziez, Imadeddine
    Cote, Jean-Francois
    Coelho, Leandro C.
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2020, 284 (03) : 906 - 919
  • [25] Multi-Zone Multi-Trip Vehicle Routing Problem with Time Windows
    Crainic, Teodor Gabriel
    Gajpal, Yuvraj
    Gendreau, Michel
    INFOR, 2015, 53 (02) : 49 - 67
  • [26] A Hybrid Particle Swarm Optimization Algorithm for Multi-Objective Pickup and Delivery Problem with Time Windows
    Zou, Shuilong
    Li, Jin
    Li, Xueqian
    JOURNAL OF COMPUTERS, 2013, 8 (10) : 2583 - 2589
  • [27] A Radial Hybrid Estimation of Distribution Algorithm for the Vehicle Routing Problem with Time Windows
    Perez-Rodriguez, Ricardo
    INDUSTRIAL ENGINEERING AND MANAGEMENT SYSTEMS, 2021, 20 (02): : 172 - 183
  • [28] A Two-Stage Optimization Approach for Multi-Depot Vehicle Routing Problem with Time Windows
    Li, Xiaohui
    He, Bolong
    Zhao, Yi
    Dong, Yuan
    2024 4TH INTERNATIONAL CONFERENCE ON COMPUTER COMMUNICATION AND ARTIFICIAL INTELLIGENCE, CCAI 2024, 2024, : 540 - 545
  • [29] Optimization of Distribution Route and Schedule with Vehicle Routing Problem with Time Windows (VRPTW)
    Sydneyta, Vincencia
    Komarudin
    PROCEEDINGS OF 2017 INTERNATIONAL CONFERENCE ON INDUSTRIAL DESIGN ENGINEERING (ICIDE 2017), 2017, : 121 - 126
  • [30] Multi-Period Pickup and Delivery Problem with Time Windows and Paired Demands
    Al Chami, Zaher
    Manier, Herve
    Manier, Marie-Ange
    2018 15TH INTERNATIONAL CONFERENCE ON CONTROL, AUTOMATION, ROBOTICS AND VISION (ICARCV), 2018, : 337 - 342