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
关键词
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 条
[41]   One-dimensional heuristics adapted for two-dimensional rectangular strip packing [J].
Belov, G. ;
Scheithauer, G. ;
Mukhacheva, E. A. .
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2008, 59 (06) :823-832
[42]   Using Simulated Annealing with a Neighborhood Heuristic for Roll Cutting Optimization [J].
Martinez Alfaro, Horacio ;
Valenzuela Rendon, Manuel .
COMPUTACION Y SISTEMAS, 2009, 13 (01) :87-95
[43]   One-dimensional Modelling and Optimisation of an Industrial Steam Methane Reformer [J].
Nobandegani, M. Sinaei ;
Darbandi, T. ;
Kheirinik, M. ;
Birjandi, M. R. Sardashti ;
Shahraki, F. ;
Yu, L. .
CHEMICAL AND BIOCHEMICAL ENGINEERING QUARTERLY, 2021, 35 (04) :369-379
[44]   Width-Packing Heuristic for Grouping in Two-Dimensional Irregular Shapes Cutting Stock Problem [J].
Aliya Awais ;
Anjum Naveed .
Arabian Journal for Science and Engineering, 2015, 40 :799-816
[45]   Width-Packing Heuristic for Grouping in Two-Dimensional Irregular Shapes Cutting Stock Problem [J].
Awais, Aliya ;
Naveed, Anjum .
ARABIAN JOURNAL FOR SCIENCE AND ENGINEERING, 2015, 40 (03) :799-816
[46]   A vulcanising decision planning as a particular one-dimensional cutting stock problem with limited part-related tooling in make-to-order industrial environments [J].
Trigos, Federico ;
Manuel Lopez, Eduardo .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2017, 55 (10) :2881-2896
[47]   A general heuristic for two-dimensional nesting problems with limited-size containers [J].
Mundim, Leandro R. ;
Andretta, Marina ;
Carravilla, Maria Antonia ;
Oliveira, Jose Fernando .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2018, 56 (1-2) :709-732
[48]   Consistent neighborhood search for one-dimensional bin packing and two-dimensional vector packing [J].
Buljubasic, Mirsad ;
Vasquez, Michel .
COMPUTERS & OPERATIONS RESEARCH, 2016, 76 :12-21
[49]   Heuristic optimization of wire-cutting process [J].
Dovc, M ;
Bogataj, L .
SOR '97 - THE 4TH INTERNATIONAL SYMPOSIUM ON OPERATIONAL RESEARCH, PROCEEDINGS, 1997, :177-182
[50]   Heuristic and exact methods for the cutting sequencing problem [J].
Faggioli, E ;
Bentivoglio, CA .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1998, 110 (03) :564-575