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

被引:6
作者
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 条
[41]   Multi-depot multi-trip vehicle routing problem with time windows and release dates [J].
Zhen, Lu ;
Ma, Chengle ;
Wang, Kai ;
Xiao, Liyang ;
Zhang, Wei .
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2020, 135
[42]   Demonstrating the importance of using total time balance instead of route balance on a multi-objective vehicle routing problem with time windows [J].
V. Sivaramkumar ;
M. R. Thansekhar ;
R. Saravanan ;
S. Miruna Joe Amali .
The International Journal of Advanced Manufacturing Technology, 2018, 98 :1287-1306
[43]   An arc flow formulation to the multitrip production, inventory, distribution, and routing problem with time windows [J].
Ramos, Bruna ;
Alves, Claudio ;
Valerio de Carvalho, Jose .
INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2022, 29 (01) :526-553
[44]   A joint replenishment supply model for multi-products grouped by several variables with random and time dependence demand [J].
Rojas, Fernando .
JOURNAL OF MODELLING IN MANAGEMENT, 2020, 15 (01) :276-296
[45]   Variable Neighborhood Descent for Multi-Compartment and Multi-Objective Vehicle Routing Problem in Refined Product Distribution [J].
Wang, Xuping ;
Fan, Wenping ;
Zhan, Hongxin ;
Sun, Zilai .
ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2022, 39 (02)
[46]   Multi-Depot Joint Distribution Vehicle Routing Problem Considering Energy Consumption with Time-Dependent Networks [J].
Hou, Dengkai ;
Fan, Houming ;
Ren, Xiaoxue .
SYMMETRY-BASEL, 2021, 13 (11)
[47]   A general VNS for the multi-depot open vehicle routing problem with time windows [J].
Bezerra, Sinaide Nunes ;
de Souza, Sergio Ricardo ;
Freitas Souza, Marcone Jamilson .
OPTIMIZATION LETTERS, 2023, 17 (09) :2033-2063
[48]   An exact approach for the multi-depot electric bus scheduling problem with time windows [J].
Gkiotsalitis, K. ;
Iliopoulou, C. ;
Kepaptsoglou, K. .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2023, 306 (01) :189-206
[49]   An improved multi-objective evolutionary algorithm for the vehicle routing problem with time windows [J].
Garcia-Najera, Abel ;
Bullinaria, John A. .
COMPUTERS & OPERATIONS RESEARCH, 2011, 38 (01) :287-300
[50]   Strong cutting planes for the capacitated multi-pickup and delivery problem with time windows [J].
Kohar, Amit ;
Jakhar, Suresh Kumar ;
Agarwal, Yogesh K. .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2023, 176