An Adaptive Genetic Algorithm for 2D Packing Problem

  •  Baochun Wang    


Rectangle packing problems solved belong to NP-Hard Problems. It is complex combination optimization in nature. This, an adaptive hybrid algorithm is proposed, in order to deal with optimization Algorithm limitations. In the end, the high efficiency of the layout optimization strategy and reasoned conclusions is verified by simulation results.

This work is licensed under a Creative Commons Attribution 4.0 License.