The petrol station replenishment problem with time windows

被引：102

作者：

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

共 23 条

[1]

Allah D. T., 2000, APII-JESA Journal Europeen des Systemes Automatises, V34, P11

[2]

[Anonymous], 2003, REV FRANCAISE GESTIO

[3] Solving a fuel delivery problem by heuristic and exact approaches [J].