Please use this identifier to cite or link to this item: https://hdl.handle.net/10419/330534 
Year of Publication: 
2025
Citation: 
[Journal:] OR Spectrum [ISSN:] 1436-6304 [Volume:] 47 [Issue:] 3 [Publisher:] Springer [Place:] Berlin, Heidelberg [Year:] 2025 [Pages:] 889-931
Publisher: 
Springer, Berlin, Heidelberg
Abstract: 
For some NP-hard lotsizing problems, many different heuristics exist, but they have different solution qualities and computation times depending on the characteristics of the instance. The computation times of the individual heuristics increase significantly with the problem size, so that testing all available heuristics for large instances requires extensive time. Therefore, it is necessary to develop a method that allows a prediction of the best heuristic for the respective instance without testing all available heuristics. The Capacitated Lotsizing Problem (CLSP) is chosen as the problem to be solved, since it is a fundamental model in the field of lotsizing, well researched and several different heuristics exist for it. The CLSP addresses the problem of determining lotsizes on a production line given limited capacity, product-dependent setup costs, and deterministic, dynamic demand for multiple products. The objective is to minimize setup and inventory holding costs. Two different forecasting methods are presented. One of them is a two-layer neural network called CLSP-Net. It is trained on small CLSP instances, which can be solved very fast with the considered heuristics. Due to the use of a fixed number of wisely chosen features that are relative, relevant, and computationally efficient, and which leverage problem-specific knowledge, CLSP-Net is also capable of predicting the most suitable heuristic for large instances.
Subjects: 
Algorithm selection problem
Machine learning
Neural network
Heuristics
Capacitated lotsizing problem
Mixed-integer linear programming
Persistent Identifier of the first edition: 
Creative Commons License: 
cc-by Logo
Document Type: 
Article
Document Version: 
Published Version

Files in This Item:
File
Size





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.