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 条
  • [11] Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths
    Poldi, Kelly Cristina
    Arenales, Marcos Nereu
    COMPUTERS & OPERATIONS RESEARCH, 2009, 36 (06) : 2074 - 2081
  • [12] Solving one-dimensional cutting stock problems exactly with a cutting plane algorithm
    Scheithauer, G
    Terno, J
    Müller, A
    Belov, G
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2001, 52 (12) : 1390 - 1401
  • [13] A heuristic for the one-dimensional cutting stock problem with usable leftover
    Cui, Yaodong
    Yang, Yuli
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2010, 204 (02) : 245 - 250
  • [14] A simulated annealing heuristic for the one-dimensional cutting stock problem
    Chen, CLS
    Hart, SM
    Tham, WM
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1996, 93 (03) : 522 - 535
  • [15] Genetic algorithm solution for one-dimensional bundled stock cutting
    Dept. of Business Administration, College of Business and Economics, University of Delaware, Newark, DE 19716-2710, United States
    Eur J Oper Res, 2 (368-381):
  • [16] Modified Greedy Heuristic for the one-dimensional cutting stock problem
    Cerqueira, Goncalo R. L.
    Aguiar, Sergio S.
    Marques, Marlos
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2021, 42 (03) : 657 - 674
  • [17] Modified Greedy Heuristic for the one-dimensional cutting stock problem
    Gonçalo R. L. Cerqueira
    Sérgio S. Aguiar
    Marlos Marques
    Journal of Combinatorial Optimization, 2021, 42 : 657 - 674
  • [18] A heuristic for the one-dimensional cutting stock problem with pattern reduction
    Cui, Y.
    Zhao, X.
    Yang, Y.
    Yu, P.
    PROCEEDINGS OF THE INSTITUTION OF MECHANICAL ENGINEERS PART B-JOURNAL OF ENGINEERING MANUFACTURE, 2008, 222 (06) : 677 - 685
  • [19] A residual recombination heuristic for one-dimensional cutting stock problems
    B. S. C. Campello
    C. T. L. S. Ghidini
    A. O. C. Ayres
    W. A. Oliveira
    TOP, 2022, 30 : 194 - 220
  • [20] THE ONE-DIMENSIONAL CUTTING STOCK PROBLEM USING 2 OBJECTIVES
    SINUANYSTERN, Z
    WEINER, I
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1994, 45 (02) : 231 - 236
12345