Utility of Genetic Algorithms for Solving Large-Scale Construction Time-Cost Trade-Off Problems

被引:46
作者
Agdas, Duzgun [1 ]
Warne, David J. [2 ]
Osio-Norgaard, Jorge [3 ]
Masters, Forrest J. [4 ]
机构
[1] Queensland Univ Technol, Sch Civil Engn & Built Environm, 2 George St, Brisbane, Qld 4001, Australia
[2] Queensland Univ Technol, High Performance Comp & Adv Res Comp Support, 2 George St, Brisbane, Qld 4001, Australia
[3] Univ Colorado, Dept Civil Environm & Architectural Engn, Boulder, CO 80309 USA
[4] Univ Florida, Herbert Wertheim Coll Engn, Gainesville, FL 32611 USA
关键词
OPTIMIZATION; EXTENSIONS; CRITERIA;
D O I
10.1061/(ASCE)CP.1943-5487.0000718
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
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 optimization 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 decrease 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. Findings in this article 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 less than 10 min. The same method can also be used to solve larger networks of up to 6,300 variables with reasonable accuracy (similar to 7% deviation) at the expense of longer processing 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. This article also presents 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. (c) 2017 American Society of Civil Engineers.
引用
收藏
页数:10
相关论文
共 40 条
[1]  
Affenzeller M, 2009, NUMER INSIGHT, pXXV
[2]   A robust genetic algorithm for resource allocation in project scheduling [J].
Alcaraz, J ;
Maroto, C .
ANNALS OF OPERATIONS RESEARCH, 2001, 102 (1-4) :83-109
[3]  
Amdahl GM, 1967, P APR 18 20 1967 SPR, P483, DOI [DOI 10.1145/1465482.1465560, 10.1145/1465482.1465560]
[4]   Discrete particle swarm optimization method for the large-scale discrete time-cost trade-off problem [J].
Aminbakhsh, Saman ;
Sonmez, Rifat .
EXPERT SYSTEMS WITH APPLICATIONS, 2016, 51 :177-185
[5]  
[Anonymous], PYTH
[6]  
[Anonymous], 1999, Genetic Algorithms + Data Structures = Evolution Programs
[7]  
[Anonymous], RED HAT ENT LIN VERS
[8]   A survey on optimization metaheuristics [J].
Boussaid, Ilhern ;
Lepagnot, Julien ;
Siarry, Patrick .
INFORMATION SCIENCES, 2013, 237 :82-117
[9]   Time-cost optimization of construction projects with generalized activity constraints [J].
Chassiakos, AP ;
Sakellaropoulos, SP .
JOURNAL OF CONSTRUCTION ENGINEERING AND MANAGEMENT, 2005, 131 (10) :1115-1124
[10]  
Cormen T. H., 2001, Introduction to Algorithms, V2nd