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 条

[21] One-dimensional stock cutting: optimization of usable leftovers in consecutive orders [J].

Luka Tomat ;

Mirko Gradišar .

Central European Journal of Operations Research, 2017, 25 :473-489

[22] Branch-and-Price Algorithms for the One-Dimensional Cutting Stock Problem [J].

Pamela H. Vance .

Computational Optimization and Applications, 1998, 9 :211-228

[23] Branch-and-price algorithms for the one-dimensional cutting stock problem [J].

Vance, PH .

COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 1998, 9 (03) :211-228

[24] One-dimensional cutting stock problem to minimize the number of different patterns [J].

Umetani, S ;

Yagiura, M ;

Ibaraki, T .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2003, 146 (02) :388-402

[25] New model and heuristic solution approach for one-dimensional cutting stock problem with usable leftovers [J].

Cui, Yaodong ;

Song, Xiang ;

Chen, Yan ;

Cui, Yi-Ping .

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2017, 68 (03) :269-280

[26] Arc-flow formulations for the one-dimensional cutting stock problem with multiple manufacturing modes [J].

da Silva, Heloisa Vasques ;

Lemos, Felipe Kesrouani ;

Cherri, Adriana Cristina ;

de Araujo, Silvio Alexandre .

RAIRO-OPERATIONS RESEARCH, 2023, 57 (01) :183-200

[27] Annealing genetic algorithm and its application in one-dimensional cutting stock problem [J].

Wang Jie ;

Zhang Binyan ;

Li Dawei ;

Wang Li .

Proceedings of the 24th Chinese Control Conference, Vols 1 and 2, 2005, :1341-1344

[28] SOME OBSERVATIONS ON THE N-NESTED ONE-DIMENSIONAL CUTTING STOCK PROBLEM [J].

JOHNSTON, RE .

ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 1993, 10 (01) :1-14

[29] Mathematical models for the one-dimensional cutting stock problem with setups and open stacks [J].

Guimaraes, Gabriel Gazzinelli ;

Poldi, Kelly Cristina ;

Martin, Mateus .

JOURNAL OF COMBINATORIAL OPTIMIZATION, 2025, 49 (03)

[30] Prototyping the One-Dimensional Cutting Stock Problem with Usable Leftovers for the Furniture Industry [J].

Oliveira, Oscar ;

Gamboa, Dorabela ;

Fernandes, Pedro .

NEW CONTRIBUTIONS IN INFORMATION SYSTEMS AND TECHNOLOGIES, VOL 1, PT 1, 2015, 353 :671-677

← 1 2 3 4 5 →