A stochastic programming approach to determine robust delivery profiles in area forwarding inbound logistics networks

  • Authors:
  • Tim Schöneberg;Achim Koberstein;Leena Suhl

  • Affiliations:
  • Universität Paderborn, Paderborn, Germany 33098;Goethe Universität Frankfurt, Frankfurt am Main, Germany 60323;Universität Paderborn, Paderborn, Germany 33098

  • Venue:
  • OR Spectrum
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

One technique to coordinate the suppliers' and the producers' production plans in a supply chain is the use of delivery profiles, which provide fixed delivery frequencies for all suppliers. The selection of a delivery profile assignment has major effects on the cost efficiency and the robustness of a supply chain and thus should be performed carefully. In this work, we consider planning approaches to select delivery profiles for the case of area forwarding-based inbound logistics networks, which are commonly used in several industries to consolidate supplies in an early stage of transport. We present a two-stage stochastic mixed integer linear programming model to determine robust delivery profile assignments under uncertain and infrequent demands and complex tariff systems. The model is embedded into a solution framework consisting of scenario generation and reduction techniques, a decomposition approach, a genetic algorithm, and a standard MILP solver. On the basis of an industrial case study, we show that our approach is computationally feasible and that the planning solutions obtained by our model outperform both a deterministic approach and the planning methodology prevailing in industrial practice.