Hybrid genetic algorithm for container packing in three dimensions

The concept of genetics using multiple-chromosomes is applied to a 3D container packing problem. The 3D packing problem deals with packing a given set of regular shaped boxes of different sizes and weights into larger containers. The algorithm must seek to minimize the wasted space under a constraint: the heavier and the larger boxes must be placed below the lighter ones. The present emphasis is to find a good solution quickly by heuristic means. A set of heuristic rules is incorporated into the genetic algorithm (GA) approach to aid in optimization. This hybrid GA yields an optimization algorithm that outperforms either of the parts. The simulation results showed that the new algorithm has better adaptivity for large problems and near optimal solutions for small problems