IDEAS home Printed from https://ideas.repec.org/p/hal/journl/hal-04333507.html
   My bibliography  Save this paper

The inventory-routing problem of returnable transport items with time windows and simultaneous pickup and delivery in closed-loop supply chains

Author

Listed:
  • Galina Iassinovskaia

    (Louvain School of Management, Université Catholique de Louvain)

  • Sabine Limbourg

    (QuantOM HEC Management School University of Liege (ULg))

  • Fouad Riane

    (Mechanical Engineering Industrial Management and Innovation Laboratory Hassan Premier University Ecole Centrale Casablanca)

Abstract

Reducing environmental impact, related regulations and potential for operational benefits are the main reasons why companies share their returnable transport items (RTIs) among the different partners of a closed-loop supply chain. In this paper, we consider a producer, located at a depot, who has to distribute his products packed in RTIs to a set of customers. Customers define a time window wherein the service can begin. The producer is also in charge of the collection of empty RTIs for reuse in the next production cycle. Each partner has a storage area composed of both empty and loaded RTI stock, as characterized by initial levels and maximum storage capacity. As deliveries and returns are performed by a homogeneous fleet of vehicles that can carry simultaneously empty and loaded RTIs, this research addresses a pickup and delivery inventory-routing problem within time windows (PDIRPTW) over a planning horizon. A mixed-integer linear program is developed and tested on small-scale instances. To handle more realistic large-scale problems, a cluster first-route second matheuristic is propose

Suggested Citation

  • Galina Iassinovskaia & Sabine Limbourg & Fouad Riane, 2017. "The inventory-routing problem of returnable transport items with time windows and simultaneous pickup and delivery in closed-loop supply chains," Post-Print hal-04333507, HAL.
  • Handle: RePEc:hal:journl:hal-04333507
    DOI: 10.1016/j.ijpe.2016.06.024
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    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:hal:journl:hal-04333507. 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: CCSD (email available below). General contact details of provider: https://hal.archives-ouvertes.fr/ .

    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.