IDEAS home Printed from https://ideas.repec.org/a/gam/jsusta/v12y2020i15p5950-d388778.html
   My bibliography  Save this article

Special-Length-Priority Algorithm to Minimize Reinforcing Bar-Cutting Waste for Sustainable Construction

Author

Listed:
  • Dongho Lee

    (Department of Architectural Engineering, Kyung Hee University, Yongin-si, Gyeonggi-do 17104, Korea)

  • Seunghyun Son

    (Department of Architectural Engineering, Kyung Hee University, Yongin-si, Gyeonggi-do 17104, Korea)

  • Doyeong Kim

    (Department of Architectural Engineering, Kyung Hee University, Yongin-si, Gyeonggi-do 17104, Korea)

  • Sunkuk Kim

    (Department of Architectural Engineering, Kyung Hee University, Yongin-si, Gyeonggi-do 17104, Korea)

Abstract

Reinforcing bars (rebar), which have the most embodied carbon dioxide (CO 2 ) per unit weight in built environments, generate a significant amount of cutting waste during the construction phase. Excessive cutting waste not only increases the construction cost but also contributes to a significant amount of CO 2 emissions. The objective of this paper is to propose a special-length-priority cutting waste minimization (CWM) algorithm for rebar, for sustainable construction. In the proposed algorithms, the minimization method by special and stock lengths was applied. The minimization by special length was performed first, and then the combination by stock length was performed for the remaining rebar. As a result of verifying the proposed algorithms through a case application, it was confirmed that the quantity of rebar was reduced by 6.04% compared with the actual quantity used. In the case building, a CO 2 emissions reduction of 406.6 ton-CO 2 and a cost savings of USD 119,306 were confirmed. When the results of this paper are applied in practice, they will be used as a tool for sustainable construction management as well as for construction cost reduction.

Suggested Citation

  • Dongho Lee & Seunghyun Son & Doyeong Kim & Sunkuk Kim, 2020. "Special-Length-Priority Algorithm to Minimize Reinforcing Bar-Cutting Waste for Sustainable Construction," Sustainability, MDPI, vol. 12(15), pages 1-15, July.
    • Handle: RePEc:gam:jsusta:v:12:y:2020:i:15:p:5950-:d:388778
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2071-1050/12/15/5950/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2071-1050/12/15/5950/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. P. C. Gilmore & R. E. Gomory, 1961. "A Linear Programming Approach to the Cutting-Stock Problem," Operations Research, INFORMS, vol. 9(6), pages 849-859, December.
    2. L. V. Kantorovich, 1960. "Mathematical Methods of Organizing and Planning Production," Management Science, INFORMS, vol. 6(4), pages 366-422, July.
    3. Gleb Belov & Guntram Scheithauer, 2007. "Setup and Open-Stacks Minimization in One-Dimensional Stock Cutting," INFORMS Journal on Computing, INFORMS, vol. 19(1), pages 27-35, February.
    4. Gradisar, Miro & Kljajic, Miroljub & Resinovic, Gortan & Jesenko, Joze, 1999. "A sequential heuristic procedure for one-dimensional cutting," European Journal of Operational Research, Elsevier, vol. 114(3), pages 557-568, May.
    5. Hatem Ben Amor & José Valério de Carvalho, 2005. "Cutting Stock Problems," Springer Books, in: Guy Desaulniers & Jacques Desrosiers & Marius M. Solomon (ed.), Column Generation, chapter 0, pages 131-161, Springer.
    6. Robert W. Haessler, 1975. "Controlling Cutting Pattern Changes in One-Dimensional Trim Problems," Operations Research, INFORMS, vol. 23(3), pages 483-493, June.
    7. Chen, Chuen-Lung S. & Hart, Stephen M. & Tham, Wai Mui, 1996. "A simulated annealing heuristic for the one-dimensional cutting stock problem," European Journal of Operational Research, Elsevier, vol. 93(3), pages 522-535, September.
    8. P. C. Gilmore & R. E. Gomory, 1963. "A Linear Programming Approach to the Cutting Stock Problem---Part II," Operations Research, INFORMS, vol. 11(6), pages 863-888, December.
    9. Harald Dyckhoff, 1981. "A New Linear Programming Approach to the Cutting Stock Problem," Operations Research, INFORMS, vol. 29(6), pages 1092-1104, December.
    10. Haessler, Robert W. & Sweeney, Paul E., 1991. "Cutting stock problems and solution procedures," European Journal of Operational Research, Elsevier, vol. 54(2), pages 141-150, September.
    11. Cherri, Adriana Cristina & Arenales, Marcos Nereu & Yanasse, Horacio Hideki, 2009. "The one-dimensional cutting stock problem with usable leftover - A heuristic approach," European Journal of Operational Research, Elsevier, vol. 196(3), pages 897-908, August.
    12. Goulimis, Constantine, 1990. "Optimal solutions for the cutting stock problem," European Journal of Operational Research, Elsevier, vol. 44(2), pages 197-208, January.
    13. Vahrenkamp, Richard, 1996. "Random search in the one-dimensional cutting stock problem," European Journal of Operational Research, Elsevier, vol. 95(1), pages 191-200, November.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Sunkuk Kim, 2021. "Technology and Management for Sustainable Buildings and Infrastructures," Sustainability, MDPI, vol. 13(16), pages 1-3, August.
    2. Keehoon Kwon & Doyeong Kim & Sunkuk Kim, 2021. "Cutting Waste Minimization of Rebar for Sustainable Structural Work: A Systematic Literature Review," Sustainability, MDPI, vol. 13(11), pages 1-21, May.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Keehoon Kwon & Doyeong Kim & Sunkuk Kim, 2021. "Cutting Waste Minimization of Rebar for Sustainable Structural Work: A Systematic Literature Review," Sustainability, MDPI, vol. 13(11), pages 1-21, May.
    2. Delorme, Maxence & Iori, Manuel & Martello, Silvano, 2016. "Bin packing and cutting stock problems: Mathematical models and exact algorithms," European Journal of Operational Research, Elsevier, vol. 255(1), pages 1-20.
    3. Song, X. & Chu, C.B. & Nie, Y.Y. & Bennell, J.A., 2006. "An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem," European Journal of Operational Research, Elsevier, vol. 175(3), pages 1870-1889, December.
    4. Ramiro Varela & Camino Vela & Jorge Puente & María Sierra & Inés González-Rodríguez, 2009. "An effective solution for a real cutting stock problem in manufacturing plastic rolls," Annals of Operations Research, Springer, vol. 166(1), pages 125-146, February.
    5. Umetani, Shunji & Yagiura, Mutsunori & Ibaraki, Toshihide, 2003. "One-dimensional cutting stock problem to minimize the number of different patterns," European Journal of Operational Research, Elsevier, vol. 146(2), pages 388-402, April.
    6. Hajizadeh, Iman & Lee, Chi-Guhn, 2007. "Alternative configurations for cutting machines in a tube cutting mill," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1385-1396, December.
    7. Melega, Gislaine Mara & de Araujo, Silvio Alexandre & Jans, Raf, 2018. "Classification and literature review of integrated lot-sizing and cutting stock problems," European Journal of Operational Research, Elsevier, vol. 271(1), pages 1-19.
    8. Jie Fang & Yunqing Rao & Qiang Luo & Jiatai Xu, 2023. "Solving One-Dimensional Cutting Stock Problems with the Deep Reinforcement Learning," Mathematics, MDPI, vol. 11(4), pages 1-16, February.
    9. Sierra-Paradinas, María & Soto-Sánchez, Óscar & Alonso-Ayuso, Antonio & Martín-Campo, F. Javier & Gallego, Micael, 2021. "An exact model for a slitting problem in the steel industry," European Journal of Operational Research, Elsevier, vol. 295(1), pages 336-347.
    10. Tao Wu & Kerem Akartunal? & Raf Jans & Zhe Liang, 2017. "Progressive Selection Method for the Coupled Lot-Sizing and Cutting-Stock Problem," INFORMS Journal on Computing, INFORMS, vol. 29(3), pages 523-543, August.
    11. W. D. D. Madhavee & N. Saldin & U. C. Vaidyarathna & C. J. Jayawardene, 2018. "A Practical Application of the Generalized Cutting Stock Algorithm," Academic Journal of Applied Mathematical Sciences, Academic Research Publishing Group, vol. 4(3), pages 15-21, 03-2018.
    12. Krzysztof C. Kiwiel, 2010. "An Inexact Bundle Approach to Cutting-Stock Problems," INFORMS Journal on Computing, INFORMS, vol. 22(1), pages 131-143, February.
    13. Mateus Martin & Horacio Hideki Yanasse & Luiz Leduíno Salles-Neto, 2022. "Pattern-based ILP models for the one-dimensional cutting stock problem with setup cost," Journal of Combinatorial Optimization, Springer, vol. 44(1), pages 557-582, August.
    14. Cherri, Adriana Cristina & Arenales, Marcos Nereu & Yanasse, Horacio Hideki & Poldi, Kelly Cristina & Gonçalves Vianna, Andréa Carla, 2014. "The one-dimensional cutting stock problem with usable leftovers – A survey," European Journal of Operational Research, Elsevier, vol. 236(2), pages 395-402.
    15. Wagner, Bret J., 1999. "A genetic algorithm solution for one-dimensional bundled stock cutting," European Journal of Operational Research, Elsevier, vol. 117(2), pages 368-381, September.
    16. Aktin, Tülin & Özdemir, RIfat Gürcan, 2009. "An integrated approach to the one-dimensional cutting stock problem in coronary stent manufacturing," European Journal of Operational Research, Elsevier, vol. 196(2), pages 737-743, July.
    17. Holthaus, Oliver, 2002. "Decomposition approaches for solving the integer one-dimensional cutting stock problem with different types of standard lengths," European Journal of Operational Research, Elsevier, vol. 141(2), pages 295-312, September.
    18. Gradisar, Miro & Resinovic, Gortan & Kljajic, Miroljub, 1999. "A hybrid approach for optimization of one-dimensional cutting," European Journal of Operational Research, Elsevier, vol. 119(3), pages 719-728, December.
    19. Valerio de Carvalho, J. M., 2002. "LP models for bin packing and cutting stock problems," European Journal of Operational Research, Elsevier, vol. 141(2), pages 253-273, September.
    20. Sesh Murthy & Rama Akkiraju & Richard Goodwin & Pinar Keskinocak & John Rachlin & Frederick Wu & James Yeh & Robert Fuhrer & Santhosh Kumaran & Alok Aggarwal & Martin Sturzenbecker & Ranga Jayaraman &, 1999. "Cooperative Multiobjective Decision Support for the Paper Industry," Interfaces, INFORMS, vol. 29(5), pages 5-30, October.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jsusta:v:12:y:2020:i:15:p:5950-:d:388778. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.