Abstract
A new priority heuristic is presented for the guillotine rectangular packing problem. This heuristic first selects one available item for a given position by a priority strategy. Then it divides the remaining space into two rectangular bins and packs them recursively, and its worst-case time complexity is T(n)=O(n2). The proposed algorithm is a general, simple and efficient method, and can solve different packing problems. Computational results on a wide range of benchmark problems have shown that the proposed algorithm outperforms existing heuristics in the literature, on average.
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.
