An Optimization Method for Single Container Packing problems Based on A Genetic Algorithm and Heuristic Packing Algorithms

This research presents genetic algorithm (GA) based four heuristic packing algorithms to solve single container packing problems. The core of heuristic packing algorithms is a “clip-extened based spatial evolution technique”, which dynamically defines usable spaces of container (to be called candidated space) during the packing procedure. This research presents a digitally evaluated formula “space match” to evaluate similarity between objects and candidated spaces. Try to place objects on fit space, and get better solutions. In addition, this research uses C# programming language, Microsoft Visual Studio .Net 2003, and Evolver API to implement the proposed models. Finally, this research compares presented packing algorithms with benchmark single container packing problems to verify performance. The results show that the proposed models can generate appropriate solutions.