How to cite this paper
Wang, Z., Chang, D & Man, X. (2022). Optimization of two-dimensional irregular bin packing problem considering slit distance and free rotation of pieces.International Journal of Industrial Engineering Computations , 13(4), 491-506.
Refrences
Abeysooriya, R. P., Bennell, J. A., & Martinez-Sykora, A. (2018). Jostle heuristics for the 2D-irregular shapes bin packing problems with free rotation. International Journal of Production Economics, 195, 12-26.
Alvarez-Valdes, R., Martinez, A., & Tamarit, J. M. (2013). A branch & bound algorithm for cutting and packing irregularly shaped pieces. International Journal of Production Economics, 145(2), 463-477.
Anand, K. V., & Babu, A. R. (2015). Heuristic and genetic approach for nesting of two-dimensional rectangular shaped parts with common cutting edge concept for laser cutting and profile blanking processes. Computers & Industrial Engineering, 80, 111-124.
Bennell, J. A., Cabo, M., & Martinez-Sykora, A. (2018). A beam search approach to solve the convex irregular bin packing problem with guillotine cuts. European Journal of Operational Research, 270(1), 89-102.
Bennell, J. A., & Oliveira, J. F. (2009). A tutorial in irregular shape packing problems. Journal of the Operational Research Society, 60(sup1), S93-S105.
Boggs, P. T., & Byrd, R. H. (2019). Adaptive, limited-memory BFGS algorithms for unconstrained optimization. SIAM Journal on Optimization, 29(2), 1282-1299.
Burke, E., Hellier, R., Kendall, G., & Whitwell, G. (2006). A new bottom-left-fill heuristic algorithm for the two-dimensional irregular packing problem. Operations Research, 54(3), 587-601.
Cherri, L. H., Mundim, L. R., Andretta, M., Toledo, F. M., Oliveira, J. F., & Carravilla, M. A. (2016). Robust mixed-integer linear programming models for the irregular strip packing problem. European Journal of Operational Research, 253(3), 570-583.
Elkeran, A. (2013). A new approach for sheet nesting problem using guided cuckoo search and pairwise clustering. European Journal of Operational Research, 231(3), 757-769.
Han, W., Bennell, J. A., Zhao, X., & Song, X. (2013). Construction heuristics for two-dimensional irregular shape bin packing with guillotine constraints. European Journal of Operational Research, 230(3), 495-504.
Hansen, A., & Arbab, F. (1992). An algorithm for generating NC tool paths for arbitrarily shaped pockets with islands. ACM Transactions on Graphics, 11(2), 152-182.
Jakobs, S. (1996). On genetic algorithms for the packing of polygons. European Journal of Operational Research, 88(1), 165-181.
Kang, J., & Park, S. (2003). Algorithms for the variable sized bin packing problem. European Journal of Operational Research, 147(2), 365-372.
Leao, A. A., Toledo, F. M., Oliveira, J. F., & Carravilla, M. A. (2016). A semi-continuous MIP model for the irregular strip packing problem. International Journal of Production Research, 54(3), 712-721.
Leao, A. A., Toledo, F. M., Oliveira, J. F., Carravilla, M. A., & Alvarez-Valdés, R. (2020). Irregular packing problems: A review of mathematical models. European Journal of Operational Research, 282(3), 803-822.
Leung, S. C., Lin, Y., & Zhang, D. (2012). Extended local search algorithm based on nonlinear programming for two-dimensional irregular strip packing problem. Computers & Operations Research, 39(3), 678-686.
Liu, Q., Zeng, J., Zhang, H., & Wei, L. (2020, September). A heuristic for the two-dimensional irregular bin packing problem with limited rotations. In International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems (pp. 268-279). Springer, Cham.
López-Camacho, E., Ochoa, G., Terashima-Marín, H., & Burke, E. K. (2013). An effective heuristic for the two-dimensional irregular bin packing problem. Annals of Operations Research, 206(1), 241-264.
Martinez-Sykora, A., Alvarez-Valdés, R., Bennell, J. A., Ruiz, R., & Tamarit, J. M. (2017). Matheuristics for the irregular bin packing problem with free rotations. European Journal of Operational Research, 258(2), 440-455.
Parreño, F., Alvarez-Valdés, R., Oliveira, J. F., & Tamarit, J. M. (2010). A hybrid GRASP/VND algorithm for two-and three-dimensional bin packing. Annals of Operations Research, 179(1), 203-220.
Pinheiro, P. R., Amaro Júnior, B., & Saraiva, R. D. (2016). A random-key genetic algorithm for solving the nesting problem. International Journal of Computer Integrated Manufacturing, 29(11), 1159-1165.
Quader, M. A., Ahmed, S., Dawal, S. Z., & Nukman, Y. (2016). Present needs, recent progress and future trends of energy-efficient Ultra-Low Carbon Dioxide (CO2) Steelmaking (ULCOS) program. Renewable and Sustainable Energy Reviews, 55, 537-549.
Rodrigues, M. O., & Toledo, F. M. (2017). A clique covering MIP model for the irregular strip packing problem. Computers & Operations Research, 87, 221-234.
Sato, A. K., Martins, T. C., Gomes, A. M., & Tsuzuki, M. S. G. (2019). Raster penetration map applied to the irregular packing problem. European Journal of Operational Research, 279(2), 657-671.
Umetani, S., & Murakami, S. (2022). Coordinate descent heuristics for the irregular strip packing problem of rasterized shapes. European Journal of Operational Research.
Zhang, H., Liu, Q., Wei, L., Zeng, J., Leng, J., & Yan, D. (2022). An iteratively doubling local search for the two-dimensional irregular bin packing problem with limited rotations. Computers & Operations Research, 137, 105550.
Alvarez-Valdes, R., Martinez, A., & Tamarit, J. M. (2013). A branch & bound algorithm for cutting and packing irregularly shaped pieces. International Journal of Production Economics, 145(2), 463-477.
Anand, K. V., & Babu, A. R. (2015). Heuristic and genetic approach for nesting of two-dimensional rectangular shaped parts with common cutting edge concept for laser cutting and profile blanking processes. Computers & Industrial Engineering, 80, 111-124.
Bennell, J. A., Cabo, M., & Martinez-Sykora, A. (2018). A beam search approach to solve the convex irregular bin packing problem with guillotine cuts. European Journal of Operational Research, 270(1), 89-102.
Bennell, J. A., & Oliveira, J. F. (2009). A tutorial in irregular shape packing problems. Journal of the Operational Research Society, 60(sup1), S93-S105.
Boggs, P. T., & Byrd, R. H. (2019). Adaptive, limited-memory BFGS algorithms for unconstrained optimization. SIAM Journal on Optimization, 29(2), 1282-1299.
Burke, E., Hellier, R., Kendall, G., & Whitwell, G. (2006). A new bottom-left-fill heuristic algorithm for the two-dimensional irregular packing problem. Operations Research, 54(3), 587-601.
Cherri, L. H., Mundim, L. R., Andretta, M., Toledo, F. M., Oliveira, J. F., & Carravilla, M. A. (2016). Robust mixed-integer linear programming models for the irregular strip packing problem. European Journal of Operational Research, 253(3), 570-583.
Elkeran, A. (2013). A new approach for sheet nesting problem using guided cuckoo search and pairwise clustering. European Journal of Operational Research, 231(3), 757-769.
Han, W., Bennell, J. A., Zhao, X., & Song, X. (2013). Construction heuristics for two-dimensional irregular shape bin packing with guillotine constraints. European Journal of Operational Research, 230(3), 495-504.
Hansen, A., & Arbab, F. (1992). An algorithm for generating NC tool paths for arbitrarily shaped pockets with islands. ACM Transactions on Graphics, 11(2), 152-182.
Jakobs, S. (1996). On genetic algorithms for the packing of polygons. European Journal of Operational Research, 88(1), 165-181.
Kang, J., & Park, S. (2003). Algorithms for the variable sized bin packing problem. European Journal of Operational Research, 147(2), 365-372.
Leao, A. A., Toledo, F. M., Oliveira, J. F., & Carravilla, M. A. (2016). A semi-continuous MIP model for the irregular strip packing problem. International Journal of Production Research, 54(3), 712-721.
Leao, A. A., Toledo, F. M., Oliveira, J. F., Carravilla, M. A., & Alvarez-Valdés, R. (2020). Irregular packing problems: A review of mathematical models. European Journal of Operational Research, 282(3), 803-822.
Leung, S. C., Lin, Y., & Zhang, D. (2012). Extended local search algorithm based on nonlinear programming for two-dimensional irregular strip packing problem. Computers & Operations Research, 39(3), 678-686.
Liu, Q., Zeng, J., Zhang, H., & Wei, L. (2020, September). A heuristic for the two-dimensional irregular bin packing problem with limited rotations. In International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems (pp. 268-279). Springer, Cham.
López-Camacho, E., Ochoa, G., Terashima-Marín, H., & Burke, E. K. (2013). An effective heuristic for the two-dimensional irregular bin packing problem. Annals of Operations Research, 206(1), 241-264.
Martinez-Sykora, A., Alvarez-Valdés, R., Bennell, J. A., Ruiz, R., & Tamarit, J. M. (2017). Matheuristics for the irregular bin packing problem with free rotations. European Journal of Operational Research, 258(2), 440-455.
Parreño, F., Alvarez-Valdés, R., Oliveira, J. F., & Tamarit, J. M. (2010). A hybrid GRASP/VND algorithm for two-and three-dimensional bin packing. Annals of Operations Research, 179(1), 203-220.
Pinheiro, P. R., Amaro Júnior, B., & Saraiva, R. D. (2016). A random-key genetic algorithm for solving the nesting problem. International Journal of Computer Integrated Manufacturing, 29(11), 1159-1165.
Quader, M. A., Ahmed, S., Dawal, S. Z., & Nukman, Y. (2016). Present needs, recent progress and future trends of energy-efficient Ultra-Low Carbon Dioxide (CO2) Steelmaking (ULCOS) program. Renewable and Sustainable Energy Reviews, 55, 537-549.
Rodrigues, M. O., & Toledo, F. M. (2017). A clique covering MIP model for the irregular strip packing problem. Computers & Operations Research, 87, 221-234.
Sato, A. K., Martins, T. C., Gomes, A. M., & Tsuzuki, M. S. G. (2019). Raster penetration map applied to the irregular packing problem. European Journal of Operational Research, 279(2), 657-671.
Umetani, S., & Murakami, S. (2022). Coordinate descent heuristics for the irregular strip packing problem of rasterized shapes. European Journal of Operational Research.
Zhang, H., Liu, Q., Wei, L., Zeng, J., Leng, J., & Yan, D. (2022). An iteratively doubling local search for the two-dimensional irregular bin packing problem with limited rotations. Computers & Operations Research, 137, 105550.