An aggregation-based approximate dynamic programming approach for the periodic review model with random yield

Voelkel, Michael A. and Sachs, Anna-Lena and Thonemann, Ulrich W. (2020) An aggregation-based approximate dynamic programming approach for the periodic review model with random yield. European Journal of Operational Research, 281 (2). pp. 286-298. ISSN 0377-2217

Text (An_aggregation_based_ADP)
An_aggregation_based_ADP.pdf - Accepted Version
Available under License Creative Commons Attribution Non-commercial No Derivatives.
Download (2MB)

Abstract

A manufacturer places orders periodically for products that are shipped from a supplier. During transit, orders get damaged with some probability, that is, the order is subject to random yield. The manufacturer has the option to track orders to receive information on damages and to potentially place additional orders. Without tracking, the manufacturer identifies potential damages after the order has arrived. With tracking, the manufacturer is informed about the damage when it occurs and can respond to this information. We model the problem as a dynamic program with stochastic demand, tracking cost, and random yield. For small problem sizes, we provide an adjusted value iteration algorithm that finds the optimal solution. For moderate problem sizes, we propose a novel aggregation-based approximate dynamic programming (ADP) algorithm and provide solutions for instances for which it is not possible to obtain optimal solutions. For large problem sizes, we develop a heuristic that takes tracking costs into account. In a computational study, we analyze the performance of our approaches. We observe that our ADP algorithm achieves savings of up to 16% compared to existing heuristics. Our heuristic outperforms existing ones by up to 8.1%. We show that dynamic tracking reduces costs compared to tracking always or never and identify savings of up to 3.2%.