A heuristic for the problem of one-dimensional steel coil cutting

The compartmentalized knapsack problem can be applied to activities that carry out cutting in two phases of an one-dimensional manner, such as cutting one-dimensional steel coils. The compartmentalized knapsack problem is a variation of the classic knapsack problem, which is a problem from the NP-Ha...

Full description

Saved in:
Bibliographic Details
Published inComputational & applied mathematics Vol. 40; no. 2
Main Authors Pimenta-Zanon, M. H., Sakuray, F., Hoto, R. S. V.
Format Journal Article
LanguageEnglish
Published Cham Springer International Publishing 01.03.2021
Springer Nature B.V
Subjects
Applications of Mathematics
Applied physics
Coils
Computational mathematics
Computational Mathematics and Numerical Analysis
Cutting
Discounts
Knapsack problem
Mail order
Mathematical Applications in Computer Science
Mathematical Applications in the Physical Sciences
Mathematics
Mathematics and Statistics
90C10
Discrete linear optimization
Cutting steel coils
90-08
90C59
90C05
Compartmentalized knapsack problem
Heuristic
Online AccessGet full text

Cover

More Information
Summary:The compartmentalized knapsack problem can be applied to activities that carry out cutting in two phases of an one-dimensional manner, such as cutting one-dimensional steel coils. The compartmentalized knapsack problem is a variation of the classic knapsack problem, which is a problem from the NP-Hard type. It is discussed in the literature the heuristic approaches to solving the compartmentalized knapsack problem. This paper presents new heuristics for the resolution of the compartmentalized knapsack problem applied to the two-phase cutting of one-dimensional steel coils. Computational simulations show the efficiency of the proposed method, with precision close to the linear method.
ISSN:2238-3603
1807-0302
DOI:10.1007/s40314-021-01421-w