Abstract

The Time/Cost Trade-off (TCT) problem has long been a popular optimization question for construction engineering and management researchers. The problem manifests itself as the opti- mization of total costs of construction projects that consist of indirect project costs and individual activity costs. The trade-off occurs as project duration and, as a result, indirect project costs de- crease with reduced individual activity duration. This reduction in individual activity duration is achieved by increasing resource allocation to individual activities, which increases their costs to completion. Historically, metaheuristic solutions have been applied to small scale problems due to computational complexities and requirements of larger networks. In this paper, we demonstrate that the metaheuristic approach is highly effective for solving large scale construction TCT problems. A custom Genetic Algorithm (GA) is developed and used to solve large benchmark networks of up to 630 variables with high levels of accuracy (<3% deviation) consistently using computational power of a personal computer in under ten minutes. The same method can also be used to solve larger net- works of up to 6,300 variables with reasonable accuracy (∼7% deviation) at the expense of longerprocessing times. A number of simple, yet effective, techniques that improve GA performance for TCT problems are demonstrated; the most effective of which is a novel problem encoding, based on weighted graphs, that enables the critical path problem to be partially solved for all candidate solutions a priori, thus significantly increasing fitness evaluation. Other improvements include parallel fitness evaluations, optimal algorithm parameters, and the addition of a stagnation criteria. We also present some guidelines of optimal algorithm parameter selection through a comprehensive parameter sweep and a computational demand profile analysis. Moreover, the methods proposed in this article are based on open source development projects that enable scalable solutions without significant development efforts. This information will be beneficial for other researchers in improving computational efficiency of their solution in addressing TCT problems.

Full Text
Published version (Free)

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