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.

Full Text:



Modern Applied Science   ISSN 1913-1844 (Print)   ISSN 1913-1852 (Online)

Copyright © Canadian Center of Science and Education

To make sure that you can receive messages from us, please add the '' domain to your e-mail 'safe list'. If you do not receive e-mail in your 'inbox', check your 'bulk mail' or 'junk mail' folders.