IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v10y2022i24p4651-d997643.html
   My bibliography  Save this article

Optimization Models for Reducing Off-Cuts of Raw Materials in Construction Site

Author

Listed:
  • Haoqing Wang

    (Faculty of Business, The Hong Kong Polytechnic University, Hong Kong, China)

  • Wen Yi

    (Department of Building and Real Estate, The Hong Kong Polytechnic University, Hong Kong, China)

Abstract

More than ten billion tons of construction waste are generated every year in the world. The large volume of construction waste not only increases costs for contractors, but also poses a threat to the environment. A significant proportion of construction waste consists of off-cuts of raw materials. Therefore, to reduce construction waste, this study builds an optimization model to reduce the volume of off-cuts of raw materials. We then develop two solution methods—a mixed-integer linear programming method and a column generation method—to solve the proposed optimization model. We conduct numerical experiments to test the efficiency and applicability of our proposed model. The mixed-integer linear programming method obtains optimal solutions and is suitable for solving small-scale instances, whereas the column generation method gives high-quality solutions within seconds and is suitable for solving large-scale instances. In the large-scale instances, the column generation method reduces waste by over 10% compared to the use of two straightforward decisions rules. Our findings will help construction projects decrease material off-cuts, reduce costs, and achieve sustainable construction.

Suggested Citation

  • Haoqing Wang & Wen Yi, 2022. "Optimization Models for Reducing Off-Cuts of Raw Materials in Construction Site," Mathematics, MDPI, vol. 10(24), pages 1-16, December.
    • Handle: RePEc:gam:jmathe:v:10:y:2022:i:24:p:4651-:d:997643
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/10/24/4651/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/10/24/4651/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Cui, Yaodong & Yang, Yuli, 2010. "A heuristic for the one-dimensional cutting stock problem with usable leftover," European Journal of Operational Research, Elsevier, vol. 204(2), pages 245-250, July.
    2. Luiz Maurício Maués & Norma Beltrão & Isabela Silva, 2021. "GHG Emissions Assessment of Civil Construction Waste Disposal and Transportation Process in the Eastern Amazon," Sustainability, MDPI, vol. 13(10), pages 1-26, May.
    3. 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.
    4. Samuel Eilon & Nicos Christofides, 1971. "The Loading Problem," Management Science, INFORMS, vol. 17(5), pages 259-268, January.
    5. Claudio Arbib & Fabrizio Marinelli & Fabrizio Rossi & Francesco Di Iorio, 2002. "Cutting and Reuse: An Application from Automobile Component Manufacturing," Operations Research, INFORMS, vol. 50(6), pages 923-934, December.
    6. 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.
    7. Sotirios Dimitriadis & Evangelos Kehris, 2009. "Cutting stock process optimisation in custom door and window manufacturing industry," International Journal of Decision Sciences, Risk and Management, Inderscience Enterprises Ltd, vol. 1(1/2), pages 66-80.
    Full references (including those not matched with items on IDEAS)

    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. 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.
    2. Luka Tomat & Mirko Gradišar, 2017. "One-dimensional stock cutting: optimization of usable leftovers in consecutive orders," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 25(2), pages 473-489, June.
    3. Wang, Danni & Xiao, Fan & Zhou, Lei & Liang, Zhe, 2020. "Two-dimensional skiving and cutting stock problem with setup cost based on column-and-row generation," European Journal of Operational Research, Elsevier, vol. 286(2), pages 547-563.
    4. 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.
    5. B. S. C. Campello & C. T. L. S. Ghidini & A. O. C. Ayres & W. A. Oliveira, 2022. "A residual recombination heuristic for one-dimensional cutting stock problems," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 30(1), pages 194-220, April.
    6. Maxence Delorme & Manuel Iori, 2020. "Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems," INFORMS Journal on Computing, INFORMS, vol. 32(1), pages 101-119, January.
    7. Dell’Amico, Mauro & Delorme, Maxence & Iori, Manuel & Martello, Silvano, 2019. "Mathematical models and decomposition methods for the multiple knapsack problem," European Journal of Operational Research, Elsevier, vol. 274(3), pages 886-899.
    8. 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.
    9. Lijun Wei & Zhixing Luo, & Roberto Baldacci & Andrew Lim, 2020. "A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems," INFORMS Journal on Computing, INFORMS, vol. 32(2), pages 428-443, April.
    10. D. N. Nascimento & S. A. Araujo & A. C. Cherri, 2022. "Integrated lot-sizing and one-dimensional cutting stock problem with usable leftovers," Annals of Operations Research, Springer, vol. 316(2), pages 785-803, September.
    11. Cherri, Adriana Cristina & Cherri, Luiz Henrique & Oliveira, Beatriz Brito & Oliveira, José Fernando & Carravilla, Maria Antónia, 2023. "A stochastic programming approach to the cutting stock problem with usable leftovers," European Journal of Operational Research, Elsevier, vol. 308(1), pages 38-53.
    12. Santiago V. Ravelo & Cláudio N. Meneses & Maristela O. Santos, 2020. "Meta-heuristics for the one-dimensional cutting stock problem with usable leftover," Journal of Heuristics, Springer, vol. 26(4), pages 585-618, August.
    13. Jean-François Côté & Manuel Iori, 2018. "The Meet-in-the-Middle Principle for Cutting and Packing Problems," INFORMS Journal on Computing, INFORMS, vol. 30(4), pages 646-661, November.
    14. de Lima, Vinícius L. & Alves, Cláudio & Clautiaux, François & Iori, Manuel & Valério de Carvalho, José M., 2022. "Arc flow formulations based on dynamic programming: Theoretical foundations and applications," European Journal of Operational Research, Elsevier, vol. 296(1), pages 3-21.
    15. Kramer, Arthur & Dell’Amico, Mauro & Iori, Manuel, 2019. "Enhanced arc-flow formulations to minimize weighted completion time on identical parallel machines," European Journal of Operational Research, Elsevier, vol. 275(1), pages 67-79.
    16. Manuel V. C. Vieira & Margarida Carvalho, 2023. "Lexicographic optimization for the multi-container loading problem with open dimensions for a shoe manufacturer," 4OR, Springer, vol. 21(3), pages 491-512, September.
    17. G, Young-Gun & Kang, Maing-Kyu, 2001. "A fast algorithm for two-dimensional pallet loading problems of large size," European Journal of Operational Research, Elsevier, vol. 134(1), pages 193-202, October.
    18. Akhundov, Najmaddin & Ostrowski, James, 2024. "Exploiting symmetry for the job sequencing and tool switching problem," European Journal of Operational Research, Elsevier, vol. 316(3), pages 976-987.
    19. John Martinovic, 2022. "A note on the integrality gap of cutting and skiving stock instances," 4OR, Springer, vol. 20(1), pages 85-104, March.
    20. Pereira, Jordi & Ritt, Marcus, 2023. "Exact and heuristic methods for a workload allocation problem with chain precedence constraints," European Journal of Operational Research, Elsevier, vol. 309(1), pages 387-398.

    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:jmathe:v:10:y:2022:i:24:p:4651-:d:997643. 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.