IDEAS home Printed from
   My bibliography  Save this article

Trip packing in petrol stations replenishment


  • Boctor, Fayez F.
  • Renaud, Jacques
  • Cornillier, Fabien


This paper considers a generalized version of the trip packing problem that we encountered as a sub-problem of the petrol stations replenishment problem. In this version we have to assign a number of trips to a fleet composed of a limited number of non-identical tank-trucks. Each trip has a specific duration, working time of vehicles is limited and the net revenue of each trip depends on the truck used. The paper provides a mathematical formulation of the problem and proposes some construction, improvement and neighbourhood search solution heuristics. A set of benchmark problem instances is created in a way that reflects real-life situations and used to analyse the performance of the proposed heuristics. A real-life case is also used to further assess the proposed heuristics.

Suggested Citation

  • Boctor, Fayez F. & Renaud, Jacques & Cornillier, Fabien, 2011. "Trip packing in petrol stations replenishment," Omega, Elsevier, vol. 39(1), pages 86-98, January.
  • Handle: RePEc:eee:jomega:v:39:y:2011:i:1:p:86-98

    Download full text from publisher

    File URL:
    Download Restriction: Full text for ScienceDirect subscribers only

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    1. Brandao, Jose & Mercer, Alan, 1997. "A tabu search algorithm for the multi-trip vehicle routing and scheduling problem," European Journal of Operational Research, Elsevier, vol. 100(1), pages 180-191, July.
    2. Barcia, Paulo & Jornsten, Kurt, 1990. "Improved Lagrangean decomposition: An application to the generalized assignment problem," European Journal of Operational Research, Elsevier, vol. 46(1), pages 84-92, May.
    3. B.J. Os & J.J. Meulman, 2004. "Improving Dynamic Programming Strategies for Partitioning," Journal of Classification, Springer;The Classification Society, vol. 21(2), pages 207-230, September.
    4. Cornillier, Fabien & Boctor, Fayez F. & Laporte, Gilbert & Renaud, Jacques, 2008. "A heuristic for the multi-period petrol station replenishment problem," European Journal of Operational Research, Elsevier, vol. 191(2), pages 295-305, December.
    5. Doerner, K.F. & Gutjahr, W.J. & Hartl, R.F. & Strauss, C. & Stummer, C., 2008. "Nature-inspired metaheuristics for multiobjective activity crashing," Omega, Elsevier, vol. 36(6), pages 1019-1037, December.
    6. YazgI Tütüncü, G. & Carreto, Carlos A.C. & Baker, Barrie M., 2009. "A visual interactive approach to classical and mixed vehicle routing problems with backhauls," Omega, Elsevier, vol. 37(1), pages 138-154, February.
    7. G.Y. Tütüncü & B.M. Carreto Baker, 2009. "A visual interactive approach to the classical and mixed vehicle routing problems with backhauls," Post-Print hal-00581628, HAL.
    Full references (including those not matched with items on IDEAS)


    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.

    Cited by:

    1. Eben Upton & William J. Nuttall, 2013. "Fuel Panics - insights from spatial agent-based simulation," Cambridge Working Papers in Economics 1309, Faculty of Economics, University of Cambridge.
    2. Relvas, Susana & Boschetto Magatão, Suelen N. & Barbosa-Póvoa, Ana Paula F.D. & Neves, Flávio, 2013. "Integrated scheduling and inventory management of an oil products distribution system," Omega, Elsevier, vol. 41(6), pages 955-968.
    3. Dell'Amico, Mauro & Hadjicostantinou, Eleni & Iori, Manuel & Novellani, Stefano, 2014. "The bike sharing rebalancing problem: Mathematical formulations and benchmark instances," Omega, Elsevier, vol. 45(C), pages 7-19.


    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:jomega:v:39:y:2011:i:1:p:86-98. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Dana Niculescu). General contact details of provider: .

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.