By Topic

An algorithm for the special two-dimensional cutting problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Fan Zhiping ; Dept. of Inf. Syst., City Univ. of Hong Kong, Kowloon, Hong Kong ; Jian Ma ; Peng Tian

This paper deals with a special case of the two-dimensional cutting problem in which a specified number of rectangular blanks of a single size are required to be cut from rectangular sheets by using orthogonal guillotine cuts in such a way that sheet material will be saved. It is shown how this problem can be decomposed into two cutting sub-problems based on optimal layouts for three sections, and these can be expressed as integer nonlinear programming models respectively. Furthermore, algorithms for solving the two problems are proposed respectively, based on the numerical method, to obtain a global optimal solution. The effectiveness of the algorithms as well as the cutting procedure is illustrated in detail, by a numerical example. All the given algorithms are implemented on a microcomputer and experimented using a real data from a small manufacturing firm

Published in:

Systems, Man, and Cybernetics, 1997. Computational Cybernetics and Simulation., 1997 IEEE International Conference on  (Volume:1 )

Date of Conference:

12-15 Oct 1997