A sequential heuristic procedure for one-dimensional cutting

被引：54
|
作者：
Gradisar, M
Kljajic, M
Resinovic, G
Jesenko, J
机构：
[1] Univ Maribor, Fac Org Sci, Maribor, Slovenia
[2] Univ Ljubljana, Fac Econ, Ljubljana 1000, Slovenia
来源：
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 1999年 / 114卷 / 03期
关键词：
cutting; heuristics; optimisation;
D O I：
10.1016/S0377-2217(98)00140-4
中图分类号：
C93 [管理学];
学科分类号：
12 ; 1201 ; 1202 ; 120202 ;
摘要：
The article examines the Sequential Heuristic Procedure (SHP) for optimising one-dimensional stock cutting when all stock lengths are different. In order to solve a bicriterial multidimensional knapsack problem with side constraints a lexicographic approach is applied. An item-oriented solution was found through a combination of approximations and heuristics that minimize the influence of ending conditions leading to almost optimal solutions. The computer program CUT was developed, based on the proposed algorithm. Two sample problems are presented and solved. A statistical analysis of parameters that affect material utilisation was also made. (C) 1999 Elsevier Science B.V. All rights reserved.
引用
收藏
页码：557 / 568
页数：12
相关论文
共 50 条
  • [1] C-Sets-based sequential heuristic procedure for the one-dimensional cutting stock problem with pattern reduction
    Cui, Yaodong
    Liu, Zhiyong
    OPTIMIZATION METHODS & SOFTWARE, 2011, 26 (01): : 155 - 167
  • [2] A heuristic for the problem of one-dimensional steel coil cutting
    M. H. Pimenta-Zanon
    F. Sakuray
    R. S. V. Hoto
    Computational and Applied Mathematics, 2021, 40
  • [3] A heuristic for the problem of one-dimensional steel coil cutting
    Pimenta-Zanon, M. H.
    Sakuray, F.
    Hoto, R. S., V
    COMPUTATIONAL & APPLIED MATHEMATICS, 2021, 40 (02):
  • [4] 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
  • [5] 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
  • [6] 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
  • [7] 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
  • [8] 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
  • [9] 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
  • [10] A residual recombination heuristic for one-dimensional cutting stock problems
    Campello, B. S. C.
    Ghidini, C. T. L. S.
    Ayres, A. O. C.
    Oliveira, W. A.
    TOP, 2022, 30 (01) : 194 - 220
12345