Eine Plattform für die Wissenschaft: Bauingenieurwesen, Architektur und Urbanistik
Eine Plattform für die Wissenschaft: Bauingenieurwesen, Architektur und Urbanistik
Solving Stochastic Time-Cost Trade-Off Problems via Modified Double-Loop Procedure with Adaptive Domain Decomposition Method
Stochastic time-cost trade-off (TCT) problems are of significant concern to project managers because various uncertain factors have to be considered when making appropriate balance between project completion time and cost. In the paper we consider the stochastic TCT problem, where the project completion time (PCT) unreliability is involved and constrained to be less than a prescribed threshold. To tackle the concerned problem, previous studies have implemented the double loop procedure, where a genetic algorithm (GA) is used in the outer loop for optimization, and Monte Carlo simulation (MCS) is used in the inner loop for examining the unreliability constraint. The original double loop procedure is computationally inefficient, taking hours or days even for a small to medium project. The present study proposes an efficient simulation method, referred to as adaptive domain decomposition method (DDM), to replace MCS for credibly examining the unreliability constraint. By modifying the double loop procedure with adaptive DDM, the computational resources can be effectively allocated, and the computational efficiency can be greatly improved. As shown in the illustrative example, the modified procedure significantly outperforms the original procedure, and it is hundreds of times faster to obtain similar optimization results. With the great efficiency improvement, this study contributes to the widespread acceptance of stochastic TCT analysis in practical applications.
Solving Stochastic Time-Cost Trade-Off Problems via Modified Double-Loop Procedure with Adaptive Domain Decomposition Method
Stochastic time-cost trade-off (TCT) problems are of significant concern to project managers because various uncertain factors have to be considered when making appropriate balance between project completion time and cost. In the paper we consider the stochastic TCT problem, where the project completion time (PCT) unreliability is involved and constrained to be less than a prescribed threshold. To tackle the concerned problem, previous studies have implemented the double loop procedure, where a genetic algorithm (GA) is used in the outer loop for optimization, and Monte Carlo simulation (MCS) is used in the inner loop for examining the unreliability constraint. The original double loop procedure is computationally inefficient, taking hours or days even for a small to medium project. The present study proposes an efficient simulation method, referred to as adaptive domain decomposition method (DDM), to replace MCS for credibly examining the unreliability constraint. By modifying the double loop procedure with adaptive DDM, the computational resources can be effectively allocated, and the computational efficiency can be greatly improved. As shown in the illustrative example, the modified procedure significantly outperforms the original procedure, and it is hundreds of times faster to obtain similar optimization results. With the great efficiency improvement, this study contributes to the widespread acceptance of stochastic TCT analysis in practical applications.
Solving Stochastic Time-Cost Trade-Off Problems via Modified Double-Loop Procedure with Adaptive Domain Decomposition Method
J. Constr. Eng. Manage.
Wang, Jia (Autor:in) / Huang, Wei (Autor:in) / Chen, Yahan (Autor:in)
01.02.2025
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
Automated BIM schedule generation approach for solving time–cost trade-off problems
| Emerald Group Publishing | 2021
Solution of discrete time–cost trade-off problem with adaptive search domain
| Emerald Group Publishing | 2025
Stochastic Construction Time-Cost Trade-Off Analysis
| British Library Online Contents | 2000
Utility of Genetic Algorithms for Solving Large-Scale Construction Time-Cost Trade-Off Problems
| British Library Online Contents | 2018