Approximate dynamic programming methods for an inventory allocation problem under uncertainty

Topaloglu, H and Kunnumkal, S (2006) Approximate dynamic programming methods for an inventory allocation problem under uncertainty. Naval Research Logistics, 53 (8). pp. 822-841.

[img]
Preview
(Postprint)
| Preview

Abstract

We propose two approximate dynamic programming methods to optimize the distribution operations of a company manufacturing a certain product at multiple production plants and shipping it to different customer locations for sale. We begin by formulating the problem as a dynamic program. Our first approximate dynamic programming method uses a linear approximation of the value function and computes the parameters of this approximation by using the linear programming representation of the dynamic program. Our second method relaxes the constraints that link the decisions for different production plants. Consequently, the dynamic program decomposes by the production plants. Computational experiments show that the proposed methods are computationally attractive, and in particular, the second method performs significantly better than standard benchmarks.

ISB Creators:
ISB CreatorsORCiD
Kunnumkal, SUNSPECIFIED
Item Type: Article
Uncontrolled Keywords: inventory, dynamic programming, approximate dynamic programming
Subjects: Business and Management
Depositing User: LRC ISB
Date Deposited: 14 Apr 2015 08:19
Last Modified: 14 Apr 2015 08:19
URI: http://eprints.exchange.isb.edu/id/eprint/380
Publisher URL: http://dx.doi.org/10.1002/nav.20164
Publisher OA policy: http://www.sherpa.ac.uk/romeo/issn/1520-6750/
Related URLs:

Actions (login required)

View Item View Item
Statistics for DESI ePrint 380 Statistics for this ePrint Item