An Object-Based Evolutionary Algorithm for Solving Rectangular Piece Nesting Problems

Kanchitpol Ratanapan
Cihan H. Dagli, Missouri University of Science and Technology

This document has been relocated to

There were 6 downloads as of 28 Jun 2016.


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.