IDEAS home Printed from https://ideas.repec.org/a/taf/tjorxx/v70y2019i6p986-997.html
   My bibliography  Save this article

A shortest path-based algorithm for the inventory routing problem of waste vegetable oil collection

Author

Listed:
  • Romain Montagné
  • Michel Gamache
  • Michel Gendreau

Abstract

We consider an inventory routing problem over a time horizon in which wasted vegetable oil has to be collected from source points periodically. These source points have different accumulation rates and limited storage capacities that must not be exceeded. Collected waste is then processed and used as raw material for producing high-quality grease, oils and tallows. The decision problem is to determine for each day which source points to visit as well as the routes of the vehicles operating, such that cost-effectiveness is maximised. In this paper, we tackle this problem with two different but complementary approaches. First, we develop integer programming techniques to solve a relaxed version of the problem, without routing constraints. Then, we propose a constructive heuristic based on the shortest path and split procedures. Performances are compared with the actual company’s solution; numerical tests performed on real-world data with up to 3000 customers served on a 30 day time horizon show that our algorithms are able to increase cost-effectiveness by up to 20%.

Suggested Citation

  • Romain Montagné & Michel Gamache & Michel Gendreau, 2019. "A shortest path-based algorithm for the inventory routing problem of waste vegetable oil collection," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 70(6), pages 986-997, June.
    • Handle: RePEc:taf:tjorxx:v:70:y:2019:i:6:p:986-997
    DOI: 10.1080/01605682.2018.1476801
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/01605682.2018.1476801
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/01605682.2018.1476801?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

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

    Citations

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


    Cited by:

    1. Cárdenas-Barrón, Leopoldo E. & Melo, Rafael A., 2021. "A fast and effective MIP-based heuristic for a selective and periodic inventory routing problem in reverse logistics," Omega, Elsevier, vol. 103(C).

    More about this item

    Statistics

    Access and download statistics

    Corrections

    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:taf:tjorxx:v:70:y:2019:i:6:p:986-997. See general information about how to correct material in RePEc.

    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.

    We have no bibliographic references for this item. You can help adding them by using 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.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/tjor .

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

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.