Journal of the Operational Research Society

, Volume 59, Issue 5, pp 607–615

An exact algorithm for the petrol station replenishment problem

Case Oriented Paper

DOI: 10.1057/palgrave.jors.2602374

Cite this article as:
Cornillier, F., Boctor, F., Laporte, G. et al. J Oper Res Soc (2008) 59: 607. doi:10.1057/palgrave.jors.2602374

Abstract

In the petrol station replenishment problem (PSRP), the aim is to deliver petroleum products to petrol stations by means of an unlimited heterogeneous fleet of compartmented tank trucks. The problem consists of jointly determining quantities to deliver within a given interval, of allocating products to tank truck compartments and of designing delivery routes to stations. This article describes an exact algorithm which decomposes the PSRP into a truck loading problem and a routing problem. An algorithm which makes use of assignment, optimality tests and possibly standard ILP algorithm is proposed to solve the loading problem. The routing problem is handled using two different strategies, based either on a matching approach or on a column generation scheme. This algorithm was extensively tested on randomly generated data and on a real-life case arising in Eastern Quebec.

Keywords

replenishmentloadingvehicle routingassignmentmatchingcolumn generation

Copyright information

© Palgrave Macmillan Ltd 2008

Authors and Affiliations

  1. 1.Université LavalQuébecCanada
  2. 2.HEC MontréalMontréalCanada