ONE-DIMENSIONAL CUTTING STOCK PROBLEM WITH DIVISIBLE ITEMS: A CASE STUDY IN STEEL INDUSTRY

被引：0

作者：

Tanir, D. ^{[1
]}

Ugurlu, O. ^{[2
]}

Guler, A. ^{[3
]}

Nuriyev, U. ^{[2
]}

机构：

[1] Kafkas Univ, Fac Econ & Adm Sci, Dept Management & Informat Syst, Kars, Turkey

[2] Ege Univ, Fac Sci, Dept Math, Izmir, Turkey

[3] Yasar Univ, Vocat Sch, Dept Comp Technol, Izmir, Turkey

来源：

TWMS JOURNAL OF APPLIED AND ENGINEERING MATHEMATICS | 2019年 / 9卷 / 03期

关键词：

Production; Cutting Stock Problems; Skiving option; Heuristics; Steel Industry; COLUMN GENERATION; BIN-PACKING; ALGORITHM; OPTIMIZATION; MODEL;

D O I：

暂无

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

This paper considers the one-dimensional cutting stock problem (1D-CSP) with divisible items, which arises in the steel industries. While planning the steel cutting operations, each item can be divided into smaller pieces, then they can be recombined by welding. The objective is to minimize both the trim loss and the number of the welds. The problem can be seen as a natural generalization of the cutting stock problem (CSP) with skiving option [1] where recombining operation has a cost. In this paper, a mathematical model for the problem is given and a dynamic programming based heuristic algorithm is proposed in accordance with the company needs. Furthermore, a software, which is based on the proposed heuristic algorithm, is developed to use in MKA Company, and its performance is analyzed by solving real-life problems in the steel industry. The computational experiments show the efficiency of the proposed algorithm.

引用

页码：473 / 484

页数：12

共 32 条

[31] An improved tabu search approach with mixed objective function for one-dimensional cutting stock problems [J].

Yang, Chien-Tung ;

Sung, Tso-Chung ;

Weng, Wei-Chu .

ADVANCES IN ENGINEERING SOFTWARE, 2006, 37 (08) :502-513

[32]

Zak E. J., 2003, International Transactions in Operational Research, V10, P637, DOI 10.1111/1475-3995.00433

← 1 2 3 4 →