Heuristic approach on dynamic lot-sizing model for durable products with end-of-use constraints

详细信息    查看全文

• 作者：Yongjian Li ; Xiaoqiang Cai ; Lei Xu ; Wenxia Yang
• 刊名：Annals of Operations Research
• 出版年：2016
• 出版时间：July 2016
• 年：2016
• 卷：242
• 期：2
• 页码：265-283
• 全文大小：1,050 KB
• 刊物类别：Business and Economics
• 刊物主题：Economics
  Operation Research and Decision Theory
  Combinatorics
  Theory of Computation
  
• 出版者：Springer Netherlands
• ISSN：1572-9338
• 卷排序：242

文摘

A version of the dynamic lot-sizing (DLS) problem involving durable products with end-of-use constraints is analyzed in this paper. First, we mathematically formulate this problem, then certain properties are derived to construct the structure of the optimal solution. Next, based on these properties, a recursive optimization algorithm is proposed for a single-item problem. Moreover, an approximate algorithm is designed on the basis of the optimization algorithm, with linear computational complexity. A heuristic approach is proposed for solving the two-item DLS problem. The difficulty in solving this problem lies in its decomposition into item-level subproblems while ensuring the feasibility of the solution. The proposed technique aims to resolve this issue by combining the capabilities of Lagrangian relaxation to decompose the problem into smaller subproblems, and a genetic algorithm (GA) is used to update the Lagrangian multipliers. Further, the computational results obtained using the proposed approach are enumerated to demonstrate its effectiveness. Finally, the conclusion and remarks are given to discuss the possible future works.KeywordsDynamic lot-sizingDurable productsDynamic programGenetic algorithmLagrangian relaxationHeuristics