Essec\Faculty\Model\Contribution {#2188
  #_index: "academ_contributions"
  #_id: "14244"
  #_source: array:26 [
    "id" => "14244"
    "slug" => "on-the-zero-inventory-ordering-policy-in-the-inventory-routing-problem"
    "yearMonth" => "2024-02"
    "year" => "2024"
    "title" => "On the zero-inventory-ordering policy in the inventory routing problem"
    "description" => "DIABAT, A., BIANCHESSI, N. et ARCHETTI, C. (2024). On the zero-inventory-ordering policy in the inventory routing problem. <i>European Journal of Operational Research</i>, 312(3), pp. 1024-1038."
    "authors" => array:3 [
      0 => array:3 [
        "name" => "ARCHETTI Claudia"
        "bid" => "B00773540"
        "slug" => "archetti-claudia"
      ]
      1 => array:1 [
        "name" => "DIABAT Ali"
      ]
      2 => array:1 [
        "name" => "BIANCHESSI Nicola"
      ]
    ]
    "ouvrage" => ""
    "keywords" => array:4 [
      0 => "Routing"
      1 => "Inventory routing problem"
      2 => "Zero-inventory-ordering"
      3 => "Branch-and-cut"
    ]
    "updatedAt" => "2024-03-11 10:44:31"
    "publicationUrl" => "https://www.sciencedirect.com/science/article/pii/S0377221723005519"
    "publicationInfo" => array:3 [
      "pages" => "1024-1038"
      "volume" => "312"
      "number" => "3"
    ]
    "type" => array:2 [
      "fr" => "Articles"
      "en" => "Journal articles"
    ]
    "support_type" => array:2 [
      "fr" => "Revue scientifique"
      "en" => "Scientific journal"
    ]
    "countries" => array:2 [
      "fr" => null
      "en" => null
    ]
    "abstract" => array:2 [
      "fr" => "The Inventory Routing Problem (IRP) aims at determining the best distribution plan of a certain commodity from a supplier to a set of customers over a given planning horizon. Customers face a per period consumption and the plan has to be such that they can always satisfy it. The aim is to minimize the total cost of the distribution plan, which is given by the sum of routing and inventory holding cost. A replenishment strategy that has become common in the recent literature is the Maximum Level (ML) strategy, where no restriction is imposed on when the customers are visited and what the quantity delivered is, provided that a maximum inventory level at each customer (corresponding to the customer′s warehouse capacity) is not exceeded. This strategy is highly flexible and this clearly provides cost advantages. However, it might also create inconveniences to customers, who might receive visits when their inventory level is still relatively high. Towards addressing this issue, we study in this paper the Zero-Inventory-Ordering (ZIO) replenishment strategy for the IRP, where customers can be served only when their inventory level is zero. The aim is to analyze the impact of a policy which is more customer-orientedthan the ML."
      "en" => "The Inventory Routing Problem (IRP) aims at determining the best distribution plan of a certain commodity from a supplier to a set of customers over a given planning horizon. Customers face a per period consumption and the plan has to be such that they can always satisfy it. The aim is to minimize the total cost of the distribution plan, which is given by the sum of routing and inventory holding cost. A replenishment strategy that has become common in the recent literature is the Maximum Level (ML) strategy, where no restriction is imposed on when the customers are visited and what the quantity delivered is, provided that a maximum inventory level at each customer (corresponding to the customer′s warehouse capacity) is not exceeded. This strategy is highly flexible and this clearly provides cost advantages. However, it might also create inconveniences to customers, who might receive visits when their inventory level is still relatively high. Towards addressing this issue, we study in this paper the Zero-Inventory-Ordering (ZIO) replenishment strategy for the IRP, where customers can be served only when their inventory level is zero. The aim is to analyze the impact of a policy which is more customer-orientedthan the ML."
    ]
    "authors_fields" => array:2 [
      "fr" => "Systèmes d’Information, Sciences de la Décision et Statistiques"
      "en" => "Information Systems, Decision Sciences and Statistics"
    ]
    "indexedAt" => "2024-04-27T23:21:48.000Z"
    "docTitle" => "On the zero-inventory-ordering policy in the inventory routing problem"
    "docSurtitle" => "Journal articles"
    "authorNames" => "<a href="/cv/archetti-claudia">ARCHETTI Claudia</a>, DIABAT Ali, BIANCHESSI Nicola"
    "docDescription" => "<span class="document-property-authors">ARCHETTI Claudia, DIABAT Ali, BIANCHESSI Nicola</span><br><span class="document-property-authors_fields">Information Systems, Decision Sciences and Statistics</span> | <span class="document-property-year">2024</span>"
    "keywordList" => "<a href="#">Routing</a>, <a href="#">Inventory routing problem</a>, <a href="#">Zero-inventory-ordering</a>, <a href="#">Branch-and-cut</a>"
    "docPreview" => "<b>On the zero-inventory-ordering policy in the inventory routing problem</b><br><span>2024-02 | Journal articles </span>"
    "docType" => "research"
    "publicationLink" => "<a href="https://www.sciencedirect.com/science/article/pii/S0377221723005519" target="_blank">On the zero-inventory-ordering policy in the inventory routing problem</a>"
  ]
  +lang: "en"
  +"_type": "_doc"
  +"_score": 8.743915
  +"parent": null
}