Using geometric techniques to improve dynamic programming algorithms for the economic lot-sizing problem and extensions

Using geometric techniques to improve dynamic programming algorithms for the economic lot-sizing problem and extensions

0.00 Avg rating0 Votes
Article ID: iaor1998148
Country: Netherlands
Volume: 75
Issue: 2
Start Page Number: 312
End Page Number: 331
Publication Date: Jun 1994
Journal: European Journal of Operational Research
Authors: , ,
Keywords: programming: dynamic
Abstract:

In this paper we discuss two basic geometric techniques that can be used to speed up certain types of dynamic programs. We first present the algorithms in a general form, and then we show how these techniques can be applied to the economic lot-sizing problem and extensions. Furthermore, it is illustrated that the geometric techniques can be used to give elegant and insightful proofs of structural results, like Wagner and Whitin’s planning horizon theorem. Finally, we present results of computational experiments in which new algorithms for the economic lot-sizing problem are compared with each other, as well as with other algorithms from the literature.

Reviews

Required fields are marked *. Your email address will not be published.