Credit Optimization Algorithm for Calculating LEED Costs
- Authors
- Park, Jae-Yong; Choi, Sul-Geon; Kim, Da-Kyung; Jeong, Min-Chul; Kong, Jung-Sik
- Issue Date
- 9월-2017
- Publisher
- MDPI
- Keywords
- green building; LEED; credit; building energy; certification; LEED cost
- Citation
- SUSTAINABILITY, v.9, no.9
- Indexed
- SCIE
SSCI
SCOPUS
- Journal Title
- SUSTAINABILITY
- Volume
- 9
- Number
- 9
- URI
- https://scholar.korea.ac.kr/handle/2021.sw.korea/82385
- DOI
- 10.3390/su9091607
- ISSN
- 2071-1050
- Abstract
- As environmental and energy issues continue to emerge as global concerns, Leadership in Energy and Environmental Design (LEED) certification is becoming highly valued. However, since additional costs for LEED certification cannot be estimated before proceeding with certification projects, financial losses are often incurred. Additional construction costs are the most significant issue faced by enterprises aiming for LEED certification. Rough estimates of the range of additional construction costs are available, but it is difficult to identify factors that increase or decrease the price of a building. Thus, there is a need for a program that provides average data for LEED certification costs and suggests the easiest way to attain credits for a building. Considering that LEED certification is a rating system, this study develops an optimization algorithm that aims to derive the minimum score for a desired LEED level at minimal cost. Credits are studied and classified by their difficulty and the required cost, allowing for an algorithm that can suggest a customized approach to acquire the minimal required score. The practical, data-driven program developed herein helps shorten the consulting process and increases the accessibility of LEED certification.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Engineering > School of Civil, Environmental and Architectural Engineering > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.