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 条
[21]   Algorithms for the one-dimensional two-stage cutting stock problem [J].
Muter, Ibrahim ;
Sezer, Zeynep .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2018, 271 (01) :20-32
[22]   Heuristics for the integer one-dimensional cutting stock problem: A computational study [J].
Wascher, G ;
Gau, T .
OR SPEKTRUM, 1996, 18 (03) :131-144
[23]   Optimization System Design for One-Dimensional Cutting-Stock Problem [J].
Cao Shukun ;
Zhao Fang ;
Ai Changsheng ;
Dong Ke .
2008 IEEE INTERNATIONAL SYMPOSIUM ON KNOWLEDGE ACQUISITION AND MODELING WORKSHOP PROCEEDINGS, VOLS 1 AND 2, 2008, :877-+
[24]   Better-Fit Heuristic for One-Dimensional Bin-Packing Problem [J].
Bhatia, A. K. ;
Hazra, M. ;
Basu, S. K. .
2009 IEEE INTERNATIONAL ADVANCE COMPUTING CONFERENCE, VOLS 1-3, 2009, :193-+
[25]   A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting [J].
Belov, G ;
Scheithauer, G .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2006, 171 (01) :85-106
[26]   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)
[27]   Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths [J].
Poldi, Kelly Cristina ;
Arenales, Marcos Nereu .
COMPUTERS & OPERATIONS RESEARCH, 2009, 36 (06) :2074-2081
[28]   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
[29]   ONE-DIMENSIONAL CUTTING STOCK PROBLEM WITH DIVISIBLE ITEMS: A CASE STUDY IN STEEL INDUSTRY [J].
Tanir, D. ;
Ugurlu, O. ;
Guler, A. ;
Nuriyev, U. .
TWMS JOURNAL OF APPLIED AND ENGINEERING MATHEMATICS, 2019, 9 (03) :473-484
[30]   A GENERALIZED APPROACH TO THE SOLUTION OF ONE-DIMENSIONAL STOCK-CUTTING PROBLEM FOR SMALL SHIPYARDS [J].
Dikili, Ahmet Cemil ;
Barlas, Baris .
JOURNAL OF MARINE SCIENCE AND TECHNOLOGY-TAIWAN, 2011, 19 (04) :368-376
12345