Optimal joint replenishment, delivery and inventory management policies for perishable products

Leandro C. Coelho, Gilbert Laporte

Research output: Contribution to journalArticlepeer-review

107 Citations (Scopus)

Abstract

In this paper we analyze the optimal joint decisions of when, how and how much to replenish customers with products of varying ages. We discuss the main features of the problem arising in the joint replenishment and delivery of perishable products, and we model them under general assumptions. We then solve the problem by means of an exact branch-and-cut algorithm, and we test its performance on a set of randomly generated instances. Our algorithm is capable of computing optimal solutions for instances with up to 30 customers, three periods, and a maximum age of two periods for the perishable product. For the unsolved instances the optimality gap is always small, less than 1.5% on average for instances with up to 50 customers. We also implement and compare two suboptimal selling priority policies with an optimized policy: always sell the oldest available items first to avoid spoilage, and always sell the fresher items first to increase revenue.

Original languageEnglish
Pages (from-to)42-52
Number of pages11
JournalComputers and Operations Research
Volume47
DOIs
Publication statusPublished - 1 Jul 2014

Keywords

  • Branch-and-cut algorithm
  • Inventory control
  • Inventory-routing
  • Perishable products
  • Replenishment
  • Vendor-managed inventory

ASJC Scopus subject areas

  • Computer Science(all)
  • Modelling and Simulation
  • Management Science and Operations Research

Fingerprint Dive into the research topics of 'Optimal joint replenishment, delivery and inventory management policies for perishable products'. Together they form a unique fingerprint.

Cite this