A sequential heuristic procedure for one-dimensional cutting |
| |
Affiliation: | 1. Departamento de Estadística e Investigación Operativa, Universidad de Valencia, Spain;2. ASAP Research Group, School of Computer Science, University of Nottingham, UK |
| |
Abstract: | 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. |
| |
Keywords: | |
本文献已被 ScienceDirect 等数据库收录! |
|