The petrol station replenishment problem with time windows

Authors:
Fabien Cornillier;Gilbert Laporte;Fayez F. Boctor;Jacques Renaud
Affiliations:
Interuniversity Research Centre on Enterprise Networks, Logistics and Transportation (CIRRELT), Université Laval, Québec, Canada G1K 7P4;Interuniversity Research Centre on Enterprise Networks, Logistics and Transportation (CIRRELT), Université Laval, Québec, Canada G1K 7P4 and Canada Research Chair in Distribution Managem ...;Interuniversity Research Centre on Enterprise Networks, Logistics and Transportation (CIRRELT), Université Laval, Québec, Canada G1K 7P4;Interuniversity Research Centre on Enterprise Networks, Logistics and Transportation (CIRRELT), Université Laval, Québec, Canada G1K 7P4
Venue:
Computers and Operations Research
Year:
2009

Citing 2
Cited 3

The Granular Tabu Search and Its Application to the Vehicle-Routing Problem

INFORMS Journal on Computing
A tabu search approach for the livestock collection problem

Computers and Operations Research

An adaptive guidance approach for the heuristic solution of a minimum multiple trip vehicle routing problem

Computers and Operations Research
Solving the ship inventory routing and scheduling problem with undedicated compartments

Computers and Industrial Engineering
An insertion heuristic manpower scheduling for in-flight catering service application

ICCL'12 Proceedings of the Third international conference on Computational Logistics

Quantified Score

Hi-index	0.01

Visualization

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.