Abstract

In this paper, we propose an enhanced whale optimization algorithm for the two-dimensional strip packing problem, which requires cutting a given set of polygons from a sheet with fixed-width such that the used length of the sheet is minimized. Based on the original whale swarm algorithm, this algorithm introduces strategies such as adaptive weighting factors, local perturbation, and global beat variation, which can better balance the global optimization and local optimization search capabilities of the whale algorithm. The proposed algorithm was tested using the standard test case and compared with other algorithms in the literature. The results show that the proposed algorithm can improve the best-known solution for some instances.

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 call

Disclaimer: 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.