Abstract
The packing of rectangles is a NP-Complete problem and possesses widespread applications in the industry, such as the cutting of clothing, metal and composition of news. In this paper, an orthogonal rectangle packing problem with rotation of items and without the guillotine packing constraint is considered. A layer-based heuristic algorithm is presented with the combination of gene tic algorithm. This heuristic algorithm is mainly based on heuristic strategies inspired by the wall-building rule of bricklayers in daily life. The computational results on Benchmark problems have shown that this algorithm not only runs in shorter time than known meta-heuristic but also finds shorter height.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
