On the generalised stock–cutting problem

被引:0
|
作者
N. Georgis
M. Petrou
J. Kittler
机构
[1] Centre for Vision,
[2] Speech and Signal Processing,undefined
[3] School of Electronic Engineering,undefined
[4] Information Technology and Mathematics,undefined
[5] University of Surrey,undefined
[6] Guildford GU2 5XH,undefined
[7] UK ,undefined
来源
关键词
Key words:Stock–cutting – Mathematical morphology – Optimisation – Simulated annealing – Mathematical programming;
D O I
暂无
中图分类号
学科分类号
摘要
In this paper, we formulate the two-stage stock-cutting problem, according to which a set of rectangular pieces of prespecified dimensions are to be cut from an arbitrarily shaped object with arbitrarily shaped holes or defective regions. We show how mathematical morphological operators can be used in order to determine the optimal shifting for a given cutting pattern. It is then proved that the problem of obtaining the optimal cutting pattern is \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} ${\cal NP}$\end{document}-hard and a solution to the unconstrained problem using mathematical programming is proposed. However, for the general problem, good sub-optimal solutions can be obtained using the technique of simulated annealing. Experimental results are also included.
引用
收藏
页码:231 / 241
页数:10
相关论文
共 50 条