A Mixed-Integer Linear Programming Model for the Cutting Stock Problem in the Steel Industry

被引：4

作者：

Morillo-Torres, Daniel ^{[1
]}

Torres Baena, Mauricio ^{[1
]}

Wilmer Escobar, John ^{[1
,2
]}

Romero-Conrado, Alfonso R. ^{[3
]}

Coronado-Hernandez, Jairo R. ^{[3
]}

Gatica, Gustavo ^{[4
]}

机构：

[1] Pontificia Univ Javeriana Cali, Cali, Colombia

[2] Univ Valle, Cali, Colombia

[3] Univ Costa, Barranquilla, Colombia

[4] Univ Andres Bello, Santiago, Chile

来源：

APPLIED COMPUTER SCIENCES IN ENGINEERING, WEA 2021 | 2021年 / 1431卷

关键词：

Cutting stock problem; Mixed-integer linear programming; Steel bars; Industrial application; COLUMN GENERATION; BIN-PACKING; TYPOLOGY;

D O I：

10.1007/978-3-030-86702-7_27

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

A mixed-integer linear programming (MILP) model is proposed for solving a one dimension cutting stock problem (1D-CSP) in the steel industry. A case study of a metallurgical company is presented and the objective is to minimize waste in the cutting process of steel bars, considering inventory constraints and the potential use of the resulting leftovers. The computational results showed that an optimal solution was always found with an average improvement in waste reduction of 80%. There was no significant difference when comparing results between the complete model and the model without inventory constraints.

引用

页码：315 / 326

页数：12

共 27 条

[1] A comparative study of exact methods for the bi-objective integer one-dimensional cutting stock problem [J].