Nesting problems have been tackled by researchers using a vast number of algorithms in the past. Most of the algorithms, however, need to perform on a one-dimensional space. Therefore, the problem must be transformed into a one-dimensional space problem similar to the travelling salesman problem. Consequently, loss of solutions due to the dimensional reduction may occur. In this study, an object-based evolutionary algorithm for rectangular piece nesting problems is proposed. This methodology is created on truly two-dimensional space, allowing new mechanisms (i.e., individual representation, initialization, etc.) and new object-based genetic operators (i.e., hill-climbing, mutation, and recombination operators) to perform effectively on the space. Since no dimensional reduction is used, therefore, no solution losses during the searching. Simulation/animation of the layouts shows the continual improvement by using this method over generations. Experimental results are promising.

Meeting Name

IEEE International Conference on Systems, Man, and Cybernetics, 1997


Engineering Management and Systems Engineering

Keywords and Phrases

2D Space; Dimensional Reduction; Genetic Algorithms; Genetic Operators; Object-Based Evolutionary Algorithm; Operations Research; Rectangular Piece Nesting Problems; Search Problems; Search Space

Document Type

Article - Conference proceedings

Document Version

Final Version

File Type





© 1997 Institute of Electrical and Electronics Engineers (IEEE), All rights reserved.