Abstract
A deep energy retrofit of building envelopes is a vital strategy to reduce final energy use in existing buildings towards their net-zero emissions performance. Building energy modeling is a reliable technique that provides a pathway to analyze and optimize various energy-efficient building envelope measures. However, conventional optimization analyses are time-consuming and computationally expensive, especially for complex buildings and many optimization parameters. Therefore, this paper proposed a novel optimization algorithm, MEVO (metamodel-based evolutionary optimizer), developed to efficiently identify optimal retrofit solutions for building envelopes while minimizing the need for extensive simulations. The key innovation of MEVO lies in its integration of evolutionary techniques with design-of-computer experiments, machine learning, and metaheuristic optimization. This approach continuously refined a machine learning model through metaheuristic optimization, crossover, and mutation operations. Comparative assessments were conducted against four alternative metaheuristic algorithms and Bayesian optimization, demonstrating MEVO’s effectiveness in reliably finding the best solution within a reduced computation time. A hypothesis test revealed that the proposed algorithm is significantly better than Bayesian optimization in finding the best cost values. Regarding computation time, the proposed algorithm is 4–7 times faster than the particle swarm optimization algorithm and has a similar computational speed as Bayesian Optimization.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.