z-logo
open-access-imgOpen Access
An Adaptive Genetic Algorithm for 2D Packing Problem
Author(s) -
Wang Bao-chun
Publication year - 2010
Publication title -
modern applied science
Language(s) - English
Resource type - Journals
eISSN - 1913-1852
pISSN - 1913-1844
DOI - 10.5539/mas.v4n4p107
Subject(s) - rectangle , mathematical optimization , computer science , genetic algorithm , packing problems , algorithm , optimization problem , mathematics , geometry

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here