Decision Support for Agri-Food Supply Chains in the E-Commerce Era: the in-Bound Inventory Routing Problem with Perishable Products

EasyChair Preprint 7988

Abstract

We consider an integrated planning problem that combines purchasing, inventory, and inbound transportation decisions in an agri-food supply chains where several suppliers (farmers) offer a subset of products with different selling prices and available quantities. We provide a mixed-integer programming formulation of the problem and a matheuristic decomposition that divides the problem into two stages. First, the purchasing and inventory problem is solved; second, the capacitated vehicle routing problem is solved using a split CVRP procedure. Computational experiments on a set of generated test instances show that the matheuristic can solve instances of large size within reasonably short computational times, providing better solutions than its MIP counterpart (in the absence of other approaches in the literature with which to make direct comparisons).

Keyphrases: Agri-food supply chain, Inbound transportation, Inventory Routing Problem, perishable products

@booklet{EasyChair:7988,
  author    = {Daniel Cuellar-Usaquén and Camilo Gomez and Marlin Ulmer and David Álvarez-Martínez},
  title     = {Decision Support for Agri-Food Supply Chains in the E-Commerce Era: the in-Bound Inventory Routing Problem with Perishable Products},
  howpublished = {EasyChair Preprint 7988},
  year      = {EasyChair, 2022}}