One-Dimensional Cutting Stock Optimisation by Suborders

被引：1

作者：

Gradisar, Mirko ^{[1
]}

Cesar, Mihael ^{[1
]}

Tomat, Luka ^{[1
]}

机构：

[1] Univ Ljubljana, Fac Econ, Kardeljeva Ploscad 17, Ljubljana 1000, Slovenia

来源：

TEHNICKI VJESNIK-TECHNICAL GAZETTE | 2018年 / 25卷

关键词：

algorithm; cutting stock problem; discrete optimisation; large order; PROGRAMMING APPROACH; STAINLESS-STEEL; ALGORITHM;

D O I：

10.17559/TV-20160427184747

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

This paper introduces a method for solving a one-dimensional cutting stock problem by suborders. The method is used for large orders that for technological and logistical reasons cannot be filled in a single order, but only in several successive suborders. The method has two stages. In the first stage, the suborders are generated and in the second the trim-loss is minimised. All leftovers longer than D are returned to stock and reused. Shorter leftovers are treated as trim-loss and discarded. A detailed description of the method is provided by using a practical case. The method is tested by solving 108 randomly generated problem instances.

引用

页码：474 / 480

页数：7

共 50 条

[31] Mathematical models and a heuristic method for the multiperiod one-dimensional cutting stock problem [J].

Poldi, Kelly Cristina ;

de Araujo, Silvio Alexandre .

ANNALS OF OPERATIONS RESEARCH, 2016, 238 (1-2) :497-520

[32] Mathematical models and a heuristic method for the multiperiod one-dimensional cutting stock problem [J].

Kelly Cristina Poldi ;

Silvio Alexandre de Araujo .

Annals of Operations Research, 2016, 238 :497-520

[33] Integrated lot-sizing and one-dimensional cutting stock problem with usable leftovers [J].

do Nascimento, D. N. ;

de Araujo, S. A. ;

Cherri, A. C. .

ANNALS OF OPERATIONS RESEARCH, 2022, 316 (02) :785-803

[34] THE MODIFIED INTEGER ROUND-UP PROPERTY OF THE ONE-DIMENSIONAL CUTTING STOCK PROBLEM [J].

SCHEITHAUER, G ;

TERNO, J .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1995, 84 (03) :562-571

[35] Minimal proper non-IRUP instances of the one-dimensional cutting stock problem [J].

Kartak, Vadim M. ;

Ripatti, Artem V. ;

Scheithauer, Guntram ;

Kurz, Sascha .

DISCRETE APPLIED MATHEMATICS, 2015, 187 :120-129

[36] Integrated lot-sizing and one-dimensional cutting stock problem with usable leftovers [J].

D. N. do Nascimento ;

S. A. de Araujo ;

A. C. Cherri .

Annals of Operations Research, 2022, 316 :785-803

[37] Using genetic algorithms in solving the one-dimensional cutting stock problem in the construction industry [J].

Shahin, AA ;

Salem, OM .

CANADIAN JOURNAL OF CIVIL ENGINEERING, 2004, 31 (02) :321-332

[38] AUGMENTED LAGRANGIAN BASED SOLUTION METHOD FOR ONE-DIMENSIONAL CUTTING STOCK AND ASSORTMENT PROBLEM [J].

Kasimbeyli, Nergiz ;

Sarac, Tugba ;

Kasimbeyli, Refail .

PROCEEDINGS OF THE 6TH INTERNATIONAL CONFERENCE ON CONTROL AND OPTIMIZATION WITH INDUSTRIAL APPLICATIONS, VOL I, 2018, :225-227

[39] Application of the two-stage one-dimensional cutting stock problem in the steel industry [J].

Santos, Jose Luis ;

Santos, Joni ;

Ferreira, Manuel Joao ;

Alves, Nelson ;

Guevara, Miguel .

2018 IEEE 27TH INTERNATIONAL SYMPOSIUM ON INDUSTRIAL ELECTRONICS (ISIE), 2018, :683-690

[40] C-Sets-based sequential heuristic procedure for the one-dimensional cutting stock problem with pattern reduction [J].

Cui, Yaodong ;

Liu, Zhiyong .

OPTIMIZATION METHODS & SOFTWARE, 2011, 26 (01) :155-167

← 1 2 3 4 5 →