The rectangular packing problem: local optimum search methods based on block structures

The rectangular packing problem: local optimum search methods based on block structures

0.00 Avg rating0 Votes
Article ID: iaor20042819
Country: Netherlands
Volume: 65
Issue: 2
Start Page Number: 248
End Page Number: 257
Publication Date: Feb 2004
Journal: Automation and Remote Control
Authors: ,
Keywords: location
Abstract:

Orthogonal packing of rectangles in a semi-infinite strip and its representation by block structures, which reduces the problem to a special linear cutting problem, are studied. Schemes for constructing local optimum search methods and deterministic and probabilistic algorithms are designed. The results of a numerical experiment corroborating the effectiveness of new methods are given.

Reviews

Required fields are marked *. Your email address will not be published.