We study an inbound inventory routing problem concerned with the minimal-cost collection of distinct components from a network of suppliers and subsequent delivery to a manufacturing plant. We assume known and constant production of end products at the plant that generates a synchronized production of components at each supplier. The lean production philosophy motivates two distinctive features of our formulation. To facilitate standardized work, we consider inventory collection plans that are cyclic and repeatable into the near future. To support the notion of level production planning, we consider inventory collection plans such that the pickup amount at each supplier is a multiple of the daily demand and in exact proportion to the number of days since the last pickup. We study the polyhedron of the convex hull of our mathematical formulation and define new valid inequalities that we implement within our branch-and-cut algorithm for the problem. As our computational experiments confirm, our cyclic formulation is significantly more difficult to solve to optimality than the standard non-cyclic formulation. Regardless, our three-phase approach obtains competitive results for one-, two-, and three-vehicle instances over three- and six-period planning horizons.

An exact approach for cyclic inbound inventory routing in a level production system

Lagana D.;Paradiso R.
2020-01-01

Abstract

We study an inbound inventory routing problem concerned with the minimal-cost collection of distinct components from a network of suppliers and subsequent delivery to a manufacturing plant. We assume known and constant production of end products at the plant that generates a synchronized production of components at each supplier. The lean production philosophy motivates two distinctive features of our formulation. To facilitate standardized work, we consider inventory collection plans that are cyclic and repeatable into the near future. To support the notion of level production planning, we consider inventory collection plans such that the pickup amount at each supplier is a multiple of the daily demand and in exact proportion to the number of days since the last pickup. We study the polyhedron of the convex hull of our mathematical formulation and define new valid inequalities that we implement within our branch-and-cut algorithm for the problem. As our computational experiments confirm, our cyclic formulation is significantly more difficult to solve to optimality than the standard non-cyclic formulation. Regardless, our three-phase approach obtains competitive results for one-, two-, and three-vehicle instances over three- and six-period planning horizons.
2020
Branch-and-cut; Cyclic planning horizon; Inventory clearing policy; Lean production; Routing
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/20.500.11770/300985
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 13
  • ???jsp.display-item.citation.isi??? 9
social impact