Abstract
To address the 2D rectangular packing problem, this paper presents a basic algorithm based on corner areas, and presents a beauty degree enumeration algorithm. For two sets of representative benchmark instances c1-c21 and zdf1-zdf16, the algorithm outperforms the best algorithms in the literature. When the orientation of the rectangles is fixed, the algorithm finds better packing con gurations than the best reported results of four open benchmark instances zdf6-zdf9. The proposed algorithm finds the optimal solutions for zdf8 and zdf9; to the best of our knowledge, this is the first time this has been achieved.
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.
