The petrol station replenishment problem with time windows

被引：100
|
作者：
Cornillier, Fabien [1 ]
Laporte, Gilbert [1 ,2 ]
Boctor, Fayez F. [1 ]
Renaud, Jacques [1 ]
机构：
[1] Univ Laval, Interuniv Res Ctr Enterprise Networks, Logist & Transportat CIRRELT, Quebec City, PQ G1K 7P4, Canada
[2] HEC Montreal, Canada Res Chair Distribut Management, Montreal, PQ H3T 2A7, Canada
来源：
COMPUTERS & OPERATIONS RESEARCH | 2009年 / 36卷 / 03期
基金：
加拿大自然科学与工程研究理事会;
关键词：
Fleet management; Fuel delivery; Replenishment; Routing and scheduling; TANK TRUCKS; REAL-TIME; VEHICLE; DISPATCH;
D O I：
10.1016/j.cor.2007.11.007
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
In the Petrol Station Replenishment Problem with Time Windows (PSRPTW) the aim is to optimize the delivery of several petroleum products to a set of petrol stations using a limited heterogeneous fleet of tank-trucks. More specifically, one must determine the quantity of each product to deliver, the assignment of products to truck compartments. delivery routes, and schedules. The objective is to maximize the total profit equal to the sales revenue, minus the sum of routing costs and of regular and overtime costs. This article first proposes a mathematical formulation of the PSRPTW. It then describes two heuristics based on are preselection and on route preselection. Extensive computational tests oil randomly generated instances confirm the efficiency of the proposed heuristics. Finally. a performance analysis on a real case shows a distance reduction of more than 20% over a solution obtained by an experienced dispatcher. (C) 2007 Elsevier Ltd. All rights reserved.
引用
收藏
页码：919 / 935
页数：17
相关论文
共 50 条
  • [1] 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
  • [2] An exact algorithm for the petrol station replenishment problem
    Cornillier, F.
    Boctor, F. F.
    Laporte, G.
    Renaud, J.
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2008, 59 (05) : 607 - 615
  • [3] Collaborative Multidepot Petrol Station Replenishment Problem with Multicompartments and Time Window Assignment
    Xu, Guangcan
    Xu, Maozeng
    Wang, Yong
    Liu, Yong
    Lv, Qiguang
    JOURNAL OF ADVANCED TRANSPORTATION, 2020, 2020
  • [4] 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
  • [5] A MILP approach combined with clustering to solve a special petrol station replenishment problem
    Hajba, Tamas
    Horvath, Zoltan
    Heitz, Daniel
    Psenak, Balint
    CENTRAL EUROPEAN JOURNAL OF OPERATIONS RESEARCH, 2024, 32 (01) : 95 - 107
  • [6] A Matheuristic Approach for the Multi-Depot Periodic Petrol Station Replenishment Problem
    Carotenuto, Pasquale
    Giordani, Stefano
    Salvatore, Alessio
    MATHEMATICS, 2024, 12 (03)
  • [7] The Multi-period Petrol Station Replenishment Problem: Formulation and Solution Methods
    Boers, Luke
    Atasoy, Bilge
    Correia, Goncalo
    Negenborn, Rudy R.
    COMPUTATIONAL LOGISTICS, ICCL 2020, 2020, 12433 : 600 - 615
  • [8] A MILP approach combined with clustering to solve a special petrol station replenishment problem
    Tamás Hajba
    Zoltán Horváth
    Dániel Heitz
    Bálint Psenák
    Central European Journal of Operations Research, 2024, 32 : 95 - 107
  • [9] SIMULATION MODEL FOR IRP IN PETROL STATION REPLENISHMENT
    Popovic, Drazen
    Vidovic, Milorad
    Bjelic, Nenad
    PROCEEDINGS OF THE 2ND LOGISTICS INTERNATIONAL CONFERENCE, 2015, : 222 - 227
  • [10] An improved tabu search algorithm for the petrol-station replenishment problem with adjustable demands
    Benantar, Abdelaziz
    Ouafi, Rachid
    Boukachour, Jaouad
    INFOR, 2020, 58 (01) : 17 - 37
12345