An enhanced whale optimization algorithm for the two-dimensional irregular strip packing problem

2Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Liu, Q., Huang, Z., Zhang, H., & Wei, L. (2020). An enhanced whale optimization algorithm for the two-dimensional irregular strip packing problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 12144 LNAI, pp. 250–261). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-030-55789-8_22

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free