An Adaptive Genetic Algorithm for 2D Packing Problem
- Baochun Wang
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.
- Full Text:
PDF
- DOI:10.5539/mas.v4n4p107
This work is licensed under a Creative Commons Attribution 4.0 License.
- ISSN(Print): 1913-1844
- ISSN(Online): 1913-1852
- Started: 2007
- Frequency: semiannual
Journal Metrics
(The data was calculated based on Google Scholar Citations)
h5-index (July 2022): N/A
h5-median(July 2022): N/A
Index
- Aerospace Database
- American International Standards Institute (AISI)
- BASE (Bielefeld Academic Search Engine)
- CAB Abstracts
- CiteFactor
- CNKI Scholar
- Elektronische Zeitschriftenbibliothek (EZB)
- Excellence in Research for Australia (ERA)
- JournalGuide
- JournalSeek
- LOCKSS
- MIAR
- NewJour
- Norwegian Centre for Research Data (NSD)
- Open J-Gate
- Polska Bibliografia Naukowa
- ResearchGate
- SHERPA/RoMEO
- Standard Periodical Directory
- Ulrich's
- Universe Digital Library
- WorldCat
- ZbMATH
Contact
- Sunny LeeEditorial Assistant
- mas@ccsenet.org