An Adaptive Genetic Algorithm for 2D Packing Problem

Baochun Wang

Modern Applied Science, 2010, vol. 4, issue 4, 107

Abstract: 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.

Date: 2010
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://ccsenet.org/journal/index.php/mas/article/download/5657/4572 (application/pdf)
https://ccsenet.org/journal/index.php/mas/article/view/5657 (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ibn:masjnl:v:4:y:2010:i:4:p:107

Access Statistics for this article

More articles in Modern Applied Science from Canadian Center of Science and Education Contact information at EDIRC.
Bibliographic data for series maintained by Canadian Center of Science and Education ().