Strip-packing using hybrid genetic approach
A hybrid genetic approach is proposed for the two-dimensional strip packing problems. With a combination of genetic algorithm and a novel heuristic allocation method, the packing problem is transformed into a simple permutation problem which can be effectively solved by a genetic algorithm and the searching domain is greatly reduced. The time complexity of the heuristic method is found to be O(n) for the best and average cases. From the simulation results, it is demonstrated that optimal results can be obtained in a reasonably short period of time for problems with different sizes.
strip packing genetic algorithms heuristic method