An exact algorithm for the petrol station replenishment problem

Case Oriented Paper


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.


replenishment loading vehicle routing assignment matching column generation 



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 two referees for their valuable comments.


  1. ALK Technologies, Inc. (2001). PC*MILER User's Guide.Google Scholar
  2. Avella P, Boccia M and Sforza A (2004). Solving a fuel delivery problem by heuristic and exact approaches. Eur J Opl Res 152: 170–179.CrossRefGoogle Scholar
  3. Brown GG and Graves GW (1981). Real-time dispatch of petroleum tank trucks. Mngt Sci 27: 19–32.CrossRefGoogle Scholar
  4. Brown GG, Ellis CJ, Graves GW and Ronen D (1987). Real-time, wide area dispatch of Mobil tank trucks. Interfaces 17(1): 107–120.CrossRefGoogle Scholar
  5. Bukchin Y and Sarin SC (2006). Discrete and dynamic versus continuous and static loading policy for a multi-compartment vehicle. Eu J Opl Res 174: 1329–1337.CrossRefGoogle Scholar
  6. Christofides N (1985). Vehicle routing. In: Lawler EL, Lenstra JK, Kan AHGR and Shmoys D (eds). The Traveling Salesman Problem. A Guided Tour of Combinatorial Optimization. Wiley: Chichester, pp. 431–448.Google Scholar
  7. Christofides N, Mingozzi A and Toth P (1979). Loading problems. In: Toth P, Christofides N and Sandi C (eds). Combinatorial Optimization. Wiley: Chichester, pp. 339–369.Google Scholar
  8. Edmonds J (1965). Paths, trees and flowers. Canadian J Math 17: 449–467.CrossRefGoogle Scholar
  9. Gabow HN (1976). An efficient implementation of Edmonds' algorithm for maximum matching on graphs. J ACM 23: 221–234.CrossRefGoogle Scholar
  10. Malépart V, Boctor FF, Renaud J and Labilois S (2003). Nouvelles approches pour l'approvisionnement des stations d'essence. Rev Fr Gestion Ind 22: 15–31.Google Scholar
  11. Malépart V, Renaud J, and Boctor FF (1998). La distribution des produits pétroliers au Québec: État de la situation. Technical report, Université du Québec.Google Scholar
  12. MRNQ (2004). Prix de l'essence ordinaire par région administrative. Technical report, Ministère des ressources naturelles du Québec.Google Scholar
  13. Smith JC (2003). A genetic algorithm approach to solving a multiple inventory loading problem. Int J Ind Eng 10: 7–16.Google Scholar
  14. Toth P and Vigo D (2002). The Vehicle Routing Problem. Society for Industrial and Applied Mathematics: Philadelphia.CrossRefGoogle Scholar
  15. Van der Bruggen L, Gruson R and Salomon M (1995). Reconsidering the distribution structure of gasoline products for a large oil company. Eur J Opl Res 81: 460–473.CrossRefGoogle Scholar
  16. Yuceer U (1997). A multi-product loading problem: A model and solution method. Eur J Opl Res 101: 519–531.CrossRefGoogle Scholar

Copyright information

© Palgrave Macmillan Ltd 2007

Authors and Affiliations

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

Personalised recommendations