Abstract
In this paper, we propose a heuristic for the two-dimensional irregular bin packing problems (2DIRBPP) with limited rotations. To solve the 2DIRBPP, we use the First Fit Decreasing (FFD) strategy to assign the pieces to the bins, then use the Bottom-Left algorithm and the pieces exchange method to place pieces into each bin, and finally perform a local search to improve the solution. The results show that our approach is competitive with all existing approaches on several sets of standard benchmark.
Author supplied keywords
Cite
CITATION STYLE
Liu, Q., Zeng, J., Zhang, H., & Wei, L. (2020). A heuristic for the two-dimensional irregular bin packing problem with limited rotations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 12144 LNAI, pp. 268–279). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-030-55789-8_24
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
