The petrol station replenishment problem with time windows

Fabien Cornillier; Gilbert Laporte; Fayez F. Boctor; Jacques Renaud

doi:10.1016/j.cor.2007.11.007

The petrol station replenishment problem with time windows

Fabien Cornillier
, Gilbert Laporte
, Fayez F. Boctor
, Jacques Renaud

Research output: Contribution to journal › Article › peer-review

127 Scopus citations

Abstract

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 arc preselection and on route preselection. Extensive computational tests on 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.

Original language	English
Pages (from-to)	919-935
Number of pages	17
Journal	Computers and Operations Research
Volume	36
Issue number	3
DOIs	https://doi.org/10.1016/j.cor.2007.11.007
State	Published - Mar 2009
Externally published	Yes

Keywords

Fleet management
Fuel delivery
Replenishment
Routing and scheduling

Access to Document

10.1016/j.cor.2007.11.007

Cite this

@article{312e4f52442e44649418cba945f8059b,

title = "The petrol station replenishment problem with time windows",

abstract = "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 arc preselection and on route preselection. Extensive computational tests on 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.",

keywords = "Fleet management, Fuel delivery, Replenishment, Routing and scheduling",

author = "Fabien Cornillier and Gilbert Laporte and Boctor, \{Fayez F.\} and Jacques Renaud",

note = "Funding Information: This work was partially supported by the Canadian Natural Sciences and Engineering Research Council (NSERC) under Grants OGP0036509, OGP0039682, and OGP0172633. This support is gratefully acknowledged. Thanks are due to Jos{\'e} Eduardo P{\'e}cora Junior, to two referees, and the editor for their valuable comments. ",

year = "2009",

month = mar,

doi = "10.1016/j.cor.2007.11.007",

language = "English",

volume = "36",

pages = "919--935",

journal = "Computers and Operations Research",

issn = "0305-0548",

number = "3",

}

TY - JOUR

T1 - The petrol station replenishment problem with time windows

AU - Cornillier, Fabien

AU - Laporte, Gilbert

AU - Boctor, Fayez F.

AU - Renaud, Jacques

N1 - Funding Information: This work was partially supported by the Canadian Natural Sciences and Engineering Research Council (NSERC) under Grants OGP0036509, OGP0039682, and OGP0172633. This support is gratefully acknowledged. Thanks are due to José Eduardo Pécora Junior, to two referees, and the editor for their valuable comments.

PY - 2009/3

Y1 - 2009/3

N2 - 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 arc preselection and on route preselection. Extensive computational tests on 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.

AB - 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 arc preselection and on route preselection. Extensive computational tests on 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.

KW - Fleet management

KW - Fuel delivery

KW - Replenishment

KW - Routing and scheduling

UR - https://www.scopus.com/pages/publications/53749093444

U2 - 10.1016/j.cor.2007.11.007

DO - 10.1016/j.cor.2007.11.007

M3 - Article

AN - SCOPUS:53749093444

SN - 0305-0548

VL - 36

SP - 919

EP - 935

JO - Computers and Operations Research

JF - Computers and Operations Research

IS - 3

ER -

The petrol station replenishment problem with time windows

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this