Abstract

In construction projects, the relationship between project cost and duration, which is one of the main factors of the project, are considered the parameters decision-makers. When a construction schedule is planned by the planners, additional resources are allocated to shorten the project duration considering the completion time and cost of the activities so that the most suitable construction schedule is prepared by providing a trade-off between project duration and total cost. In the case of time-cost trade-off problems, the total cost of the project is determined by summing each activities’ cost by adding indirect costs. Moreover, total project duration is determined by obtaining total project duration after CPM (Critical Path Method) calculations. Obtaining optimum duration and costs is such a problematic issue with using conventional methods and common software packages. These techniques consider deterministic project values and include CPM calculations for fitness value calculation. Moreover, current studies defined alternatives as non-variable discrete values. However, construction projects are dynamic processes, and quantities are prone to be changed related to project size. In this study, time-cost trade-off optimization is performed by using harmony search method with introducing different implementation that can be more easily used for different projects. The model is implemented in a real construction project, and the conclusions are interpreted.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

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.