Skip to main content

Research Repository

Advanced Search

Design optimisation using convex programming: Towards waste-efficient building designs

Bilal, Muhammad; Oyedele, Lukumon O.; Akinade, Olugbenga O.; Delgado, Juan Manuel Davila; Akanbi, Lukman A.; Ajayi, Anuoluwapo O.; Younis, Muhammad S.

Design optimisation using convex programming: Towards waste-efficient building designs Thumbnail


Authors

Muhammad Bilal Muhammad.Bilal@uwe.ac.uk
Associate Professor - Big Data Application

Lukumon Oyedele L.Oyedele@uwe.ac.uk
Professor in Enterprise & Project Management

Olugbenga Akinade Olugbenga.Akinade@uwe.ac.uk
Associate Professor - AR/VR Development with Artificial Intelligence

Manuel Davila Delgado Manuel.Daviladelgado@uwe.ac.uk
Associate Professor - AR/VR Development with Artificial Intelligence

Dr Lukman Akanbi Lukman.Akanbi@uwe.ac.uk
Associate Professor - Big Data Application Developer

Anuoluwapo Ajayi Anuoluwapo.Ajayi@uwe.ac.uk
Associate Professor - Big Data Application

Muhammad S. Younis



Abstract

© 2019 The Authors A non-modular building layout is amongst the leading sources of offcut waste, resulting from a substantial amount of onsite cutting and fitting of bricks, blocks, plasterboard, and tiles. The field of design for dimensional coordination is concerned with finding an optimal configuration for non-overlapping spaces in the layout to reduce materials waste. In this article, we propose a convex optimisation-based algorithm for finding alternative floor layouts to enforce the design for dimensional coordination. At the crux of the proposed algorithm lies two mathematical models. The first is the convex relaxation model that establishes the topology of spaces within the layout through relative positioning constraints. We employed acyclic graphs to generate a minimal set of relative positioning constraints to model the problem. The second model optimises the geometry of spaces based on the modular size. The algorithm exploits aspect ratio constraints to restrict the generation of alternate layouts with huge variations. The algorithm is implemented in the BIMWaste tool for automating the design exploration process. BIMWaste is capable of investigating the degree to which designers consider dimensional coordination. We tested the algorithm over 10 completed building projects to report its suitability and accuracy. The algorithm generates competitive floor layouts for the same client intent that are likely to be tidier and more modular. More importantly, those floor layouts have improved waste performance (i.e., 8.75% less waste) due to a reduced tendency for material cutting and fitting. This study, for the first time, used convex programming for the design optimisation with a focus to reduce construction waste.

Citation

Bilal, M., Oyedele, L. O., Akinade, O. O., Delgado, J. M. D., Akanbi, L. A., Ajayi, A. O., & Younis, M. S. (2019). Design optimisation using convex programming: Towards waste-efficient building designs. Journal of Building Engineering, 23, 231-240. https://doi.org/10.1016/j.jobe.2019.01.022

Journal Article Type Article
Acceptance Date Jan 14, 2019
Online Publication Date Jan 22, 2019
Publication Date May 1, 2019
Deposit Date Jan 22, 2019
Publicly Available Date Feb 15, 2019
Journal Journal of Building Engineering
Electronic ISSN 2352-7102
Publisher Elsevier
Peer Reviewed Peer Reviewed
Volume 23
Pages 231-240
DOI https://doi.org/10.1016/j.jobe.2019.01.022
Keywords Space layout planning; Convex programming; Design for dimensional coordination; Waste reduction; Floor layout optimisation
Public URL https://uwe-repository.worktribe.com/output/846327
Publisher URL https://doi.org/10.1016/j.jobe.2019.01.022

Files




You might also like



Downloadable Citations