Abstract
Two-dimensional strip packing problem is to pack given rectangular pieces on a strip of stock sheet having fixed width and infinite height. Its aim is to minimize the height of the strip such that non-guillotinable and fix orientation constraints are meet. In this paper, an improved scoring rule is developed and the least waste priority strategy is introduced, and a randomized algorithm is presented for solving this problem. This algorithm is very simple and does not need to set any parameters. Computational results on a wide range of benchmark problem instances show that the proposed algorithm obtains a better or matching performance as compared to the most of the previously published meta-heuristics.
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.
