Approximate dynamic programming for stochastic linear control problems on compact state spaces

• Published in: European journal of operational research 2015-02, Vol.241 (1), p.85-98
• Main Authors: Woerner, Stefan, Laumanns, Marco, Zenklusen, Rico, Fertis, Apostolos
• Format: Article
• Language: English
• Subjects: Algorithms; Decision making models; Dual sourcing; Dynamic programming; Heuristic; Inventory; Inventory management; Markov analysis; Markov processes; Multiple sourcing; Optimization algorithms; Studies
• ISSN: 0377-2217; 1872-6860
• DOI: 10.1016/j.ejor.2014.08.003

•Proof of existence of optimal policies for stochastic linear control problems.•Proof of existence of convex bounded solutions to Average Cost Optimality Equation.•New ADP algorithm providing good policies and lower bounds to the optimal costs.•Tests of algorithm on multiple sourcing where optimality gap can be bounded by 5%.•On all tested instances algorithm performs better than state-of-the-art heuristic. This paper addresses Markov Decision Processes over compact state and action spaces. We investigate the special case of linear dynamics and piecewise-linear and convex immediate costs for the average cost criterion. This model is very general and covers many interesting examples, for instance in inventory management. Due to the curse of dimensionality, the problem is intractable and optimal policies usually cannot be computed, not even for instances of moderate size. We show the existence of optimal policies and of convex and bounded relative value functions that solve the average cost optimality equation under reasonable and easy-to-check assumptions. Based on these insights, we propose an approximate relative value iteration algorithm based on piecewise-linear convex relative value function approximations. Besides computing good policies, the algorithm also provides lower bounds to the optimal average cost, which allow us to bound the optimality gap of any given policy for a given instance. The algorithm is applied to the well-studied Multiple Sourcing Problem as known from inventory management. Multiple sourcing is known to be a hard problem and usually tackled by parametric heuristics. We analyze several MSP instances with two and more suppliers and compare our results to state-of-the-art heuristics. For the considered scenarios, our policies are always at least as good as the best known heuristic, and strictly better in most cases. Moreover, by using the computed lower bounds we show for all instances that the optimality gap has never exceeded 5%, and that it has been much smaller for most of them.