Article
Version 1
Preserved in Portico This version is not peer-reviewed
Lagrange Relaxation for the Capacitated Multi-item Lot-Sizing Problem
Version 1
: Received: 13 June 2024 / Approved: 13 June 2024 / Online: 13 June 2024 (14:24:14 CEST)
A peer-reviewed article of this Preprint also exists.
Gao, Z.; Li, D.; Wang, D.; Yu, Z. Lagrange Relaxation for the Capacitated Multi-Item Lot-Sizing Problem. Appl. Sci. 2024, 14, 6517. Gao, Z.; Li, D.; Wang, D.; Yu, Z. Lagrange Relaxation for the Capacitated Multi-Item Lot-Sizing Problem. Appl. Sci. 2024, 14, 6517.
Abstract
The capacitated multi-item lot-sizing problem abbreviated as CLSP, is to determine the lot sizes of products in each period in a given planning horizon of finite periods meeting the product demand and resource limits in each period, and minimize the total cost consisting of production, inventory holding, and setup costs. CLSPs are often encountered in industry production settings and thus the solution is significant. In this paper, we propose a Lagrange relaxation (LR) approach for the solution of its. The approach decomposes the CLSP into several uncapacitated single-item lot-sizing problems each of which can be easily solved by dynamic programming. The feasible solutions are achieved by solving the resulting transportation problems with a proposed stepping-stone algorithm and a fix-up procedure. The Lagrange multipliers are updated by using subgradient optimization. Experimental results show that the LR approach explores high-quality solutions and has better applicability compared with other commonly used solution approaches in the literature.
Keywords
Lagrange relaxation; lot-sizing; CLSP; subgradient optimization
Subject
Computer Science and Mathematics, Artificial Intelligence and Machine Learning
Copyright: This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Comments (0)
We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.
Leave a public commentSend a private comment to the author(s)
* All users must log in before leaving a comment