Download as pdf or txt
Download as pdf or txt
You are on page 1of 11

applied

sciences
Article
Dynamic Optimization of Construction Time-Cost for Deep
and Large Foundation Pit Based on BIM Technology and
Genetic Algorithm
Yingxia Yu 1, *, Junjia Han 2 , Haoyu Gu 1 and Yi Yang 3

1 School of Civil Engineering and Architecture, Henan University of Science and Technology,
Luoyang 471000, China; haust0719@163.com
2 School of Mechanical, Electrical & Information Engineering, Shandong University, Weihai 264209, China;
hanlonegen@163.com
3 China Railway 19th Bureau Group Co., Ltd., Beijing 100176, China; haust0719@126.com
* Correspondence: yingxiayu316@163.com

Abstract: With the increasingly fierce market competition, optimizing the construction time-cost of
deep and large foundation pit construction projects has become one of the key factors for construction
enterprises to remain invincible. By dynamically optimizing the time-cost, the optimal time corre-
sponding to the lowest engineering cost can be found. Based on a comprehensive transportation hub
project, considering the time value of capital and the reward and punishment of construction time, a
time-cost dynamic optimization model is constructed. Relying on BIM technology, the feasibility of
construction plan is analyzed from both qualitative and quantitative perspectives, and the project
parameters and resource information is obtained accurately and quickly. Using the MATLAB pro-
gram, time-cost optimization based on genetic algorithm is carried out, and the static and dynamic
optimization results are compared. The results show that the dynamic optimization scheme reduces
the total cost by 1.68% while reducing the total construction time by 8.47%. The dynamic optimization
scheme extends the construction period by 2 days while reducing the total cost by 89,500 yuan com-
pared to static optimization. The peak value of the fund demand curve before and after optimization
has decreased from 128,000 yuan to 127,000 yuan. The time-cost dynamic optimization, considering
Citation: Yu, Y.; Han, J.; Gu, H.; Yang,
the time value of capital is more in line with engineering reality, and the optimization results are
Y. Dynamic Optimization of
more reliable and accurate. BIM technology can accurately and quickly obtain project parameters
Construction Time-Cost for Deep and
and resource information, solving problems such as complex processes in super deep excavation and
Large Foundation Pit Based on BIM
huge engineering data statistics. The genetic algorithm can efficiently and accurately search for the
Technology and Genetic Algorithm.
Appl. Sci. 2023, 13, 10716. https://
optimal solution within the global domain. This study combines BIM technology with the genetic
doi.org/10.3390/app131910716 algorithm to solve the dynamic optimization problem of construction period cost for deep and large
foundation pits. The research results of this study provide a theoretical reference for the optimization
Academic Editor: Edyta
of schedule cost for similar projects.
Plebankiewicz

Received: 2 September 2023 Keywords: super and deep foundation pit; BIM; genetic algorithm; dynamic optimization
Revised: 18 September 2023
Accepted: 22 September 2023
Published: 26 September 2023
1. Foreword
With the rapid development of underground space, complex super and deep founda-
Copyright: © 2023 by the authors.
tion pit construction projects are gradually increasing, and market competition is becoming
Licensee MDPI, Basel, Switzerland.
increasingly fierce. Therefore, through the optimization of construction project manage-
This article is an open access article
ment, in order to shorten the construction time, reduce costs, balance resources, and
distributed under the terms and improve the comprehensive benefits of project management, these become the keys to an
conditions of the Creative Commons invincible position of construction enterprises. By optimizing the construction time-cost,
Attribution (CC BY) license (https:// comparing different construction times and corresponding project costs, the optimal con-
creativecommons.org/licenses/by/ struction time can be found when the project cost is lowest [1]. The genetic algorithm (GA)
4.0/). has a high solving efficiency and good search characteristics, and has been widely used in

Appl. Sci. 2023, 13, 10716. https://doi.org/10.3390/app131910716 https://www.mdpi.com/journal/applsci


Appl. Sci. 2023, 13, 10716 2 of 11

solution optimization in various industries. Luo Yi et al. [2] combined the small population
real-coded genetic algorithm with the BP neural network to optimize the design of the
voltage sharing circuit of the high-voltage DC voltage divider. Gao Jian et al. [3] established
a 0–1 linear programming model for optimal water distribution in branch and lateral canals
in irrigation districts, and analyzes the advantages and disadvantages of using discrete
binary particle swarm algorithm (BPSO) and genetic algorithm (GA) to optimize water
distribution in irrigation districts. Zhang Xiaocun et al. [4] used a double-objective genetic
algorithm based on discrete variables to optimize the cross-section design of concrete
frame columns, using carbon emissions and cost as indicators. Some scholars have also
combined artificial neural networks with genetic algorithms for scheme optimization and
prediction. Khalaj G. et al. [5,6] predicted the martensite fraction of microalloyed steel
and simulated the correlation between heat treatment, chemical composition, and bainite
fraction of pipeline steel by means of artificial neural networks. Wang Ruihang et al. [7]
established a neural network model for load prediction based on a 4 million tons per year
Fischer–Tropsch synthesis process. The genetic algorithm was used to optimize the initial
weights and thresholds of the neural network to improve the accuracy of model prediction.
Applying the GA to cost optimization can effectively improve the optimization efficiency
and accuracy [8–10]. Feng Jingchun et al. [11,12] studied the cost optimization problem
under the condition of minimizing the cost of project group owners using real number en-
coding and a genetic algorithm that preserves elite offspring. Li Aimin et al. [13] considered
the time value of capital, established a construction time-cost dynamic optimization model,
and solved it through genetic algorithm. Li Hongxian et al. [14] established a mathematical
model for dynamic time/cost optimization and proposed an improved incentive genetic
algorithm. Luo Gang et al. [15] overcame the shortcomings of traditional network planning
optimization using genetic algorithms, making cost optimization more accurate and able to
be solved more efficiently.
The construction time-cost optimization based on genetic algorithms requires a large
amount of engineering data, with the expansion of modern building scale and the increase
in construction process complexity, the limitations of traditional optimization methods in
obtaining engineering data are becoming increasingly prominent. Building Information
Modeling (BIM), as an emerging information technology, is gradually being applied to
engineering construction optimization [16–18]. Wang Yongquan et al. [19] constructed a
schedule-cost optimization system for grid construction projects based on BIM and the
genetic algorithm, fully leveraging the advantages of modern information technology
and traditional theoretical methods. Wang Xumin et al. [20] studied the combination of
NSGA—II algorithm and BIM5D to solve the construction time-cost optimization problem.
BIM technology can accurately and quickly obtain project parameters and resource infor-
mation, solving problems such as complex super and deep excavation processes and large
engineering data statistics; the GA can efficiently search for the optimal solution within the
global domain, improving optimization accuracy, combining BIM technology with GA for
construction time-cost optimization, which can fully leverage the advantages of both.
In summary, the genetic algorithm has been widely applied in scheme optimization
in various industries, and scholars have conducted extensive research and exploration.
Some scholars have also combined BIM technology with genetic algorithms for time-cost
optimization, but few have considered considering the time value of capital and the rewards
and punishments of project duration. Because the deep and large foundation pit of the
comprehensive transportation hub project has the characteristics of large engineering
quantity, heavy labor, high cost, tight construction period, and complex structure, it is
difficult to complete the time cost optimization using traditional optimization methods. At
present, there is relatively little research on the combination of BIM technology and the GA
for optimizing the construction cost of super large deep foundation pits in comprehensive
transportation hub projects, taking into account the time value of funds and the rewards and
punishments of the construction period. Therefore, this article conducted relevant research.
Appl. Sci. 2023, 13, 10716 3 of 11

Based on the construction project of a deep and large foundation pit of a comprehensive
transportation hub project, a dynamic optimization model for time-cost is established. It
utilizes BIM technology to obtain, store, transmit, and update relevant data, and fully
utilizes the advantages of genetic algorithm such as rigorous quantitative analysis and
accurate calculation. By solving the model, the dynamic optimal solution is found. The
research results of this article have solved the dynamic optimization problem of time cost
for complex deep and large foundation pits, making the optimization results more in line
with reality. The combination of BIM technology and genetic algorithm makes optimization
faster and more accurate. The optimization method studied in this article can be generalized
and applied, providing a theoretical reference for time-cost optimization of similar projects.

2. Construction Time-Cost Dynamic Optimization Model


2.1. Construction Time-Cost Function Relationship
The total engineering cost consists of direct and indirect costs; according to the current
budget quota and inventory pricing standards, direct costs include labor costs, material
costs, machinery costs, safety and civilized construction costs, unit price measure fees, and
other measure fees, while indirect costs include regulatory fees and management fees.
According to the literature [4,8], the relationship between the time of work i and the
direct cost is a quadratic function:
ciN − ciM 2 ciM t2iN − ciN t2iM
ci = t + (1)
t2iN − t2iM i t2iN − t2iM
In Equation (1): ci and ti represent the direct cost and time of work i, ciN and ciM
represent the normal and ultimate costs of work i, and tiN and tiM represent the normal and
ultimate time of work i.
The direct cost of the project (C1 ) is the sum of the direct costs of each work i, then:
n
C1 = ∑ ci (2)
i =1

In Equation (2): n represents the number of jobs.


The relationship between indirect cost (C2 ) and construction time is linear, then:

C2 = k × T (3)

In Equation (3): k represents the indirect cost coefficient, and T represents the optimized
construction time.
Consider rewards for early completion of the project or penalties for project delay
(C3 ), then:
C3 = e × ( T − Tp ) (4)
In Equation (4): e represents the reward and punishment coefficient, and T represents
the planned construction time.
The total cost of the project (C) is:
n
C= ∑ ci + k × T + e × (T − Tp ) (5)
i =1

2.2. Dynamic Optimization Model


In this study, the net present value (Pc) of the cost is taken as the economic evaluation
index; the direct costs are paid in one lump sum based on the intermediate time points of
each work; the indirect costs are calculated as interest at the end of each interest time; and
the project rewards and punishments are calculated as interest at the end of each project
time. The dynamic optimization model for construction time-cost is:
Appl. Sci. 2023, 13, 10716 4 of 11

n
(1 + r ) T − 1
min PC = ∑ ci (1 + r)−(ESi +ti /2) + C2 × r (1 + r ) T
+ C3 × (1 + r )−T (6)
i =1

ti , ESi ≥ 0




 tiM ≤ ti ≤ tiN



s.t. ci N ≤ ci ≤ ciM (7)

 ES = max{ ES + t }, ES = 0


 i h i 1

T = max{ ESk + tk }

In Equations (6) and (7): ESi is the earliest start time for work i, ES1 is the earliest start
time for work without prior work, ESh is the earliest start time of the immediate work of
work i, ESk and tk are the earliest start time and work time of the work without immediate
work, r is the discount rate, and other parameters are the same as above.

3. Construction Time-Cost Dynamic Optimization


3.1. Project Overview
The total construction area of a certain comprehensive transportation hub project is
170,000 square meters, which is a link project to achieve various comprehensive zero transfer
transportation. The east–west length of the project foundation pit is about 648~706 m,
the north–south width is about 85~162 m, the depth is about 8~18 m, and the area of the
foundation pit is about 100,000 m2 . The open cut method is used for construction, with
a total excavation volume of approximately 1,300,000 m3 . In order to ensure the stability
of the slope, retaining piles, anchor cables and slope excavation, the soil nailing wall and
other forms of support have been adopted.
The planned construction time for the foundation pit project is 4 months with a daily
earthwork excavation volume of approximately 12,500 m3 , indicating high construction
intensity. The construction area is located in front of the building of the high-speed railway
station, with a large flow of vehicles and people, and a complex construction environment.
The requirements for safe and civilized construction and environmental protection are high;
there may be policy shutdown in the late construction time, resulting in a less effective
working time and a tight schedule. The construction of foundation pit engineering directly
affects the construction progress of the main structure in the later stage, and has a significant
impact on the engineering cost. Therefore, it is particularly important for the project to
optimize the construction time-cost and find the lowest cost optimized schedule.
The construction of foundation pits is divided into four construction processes: re-
taining cast-in-place piles (GZ), crown beam (GL), excavation (WT), and foundation pit
support (ZH), with layered and segmented organization of flow construction. The retaining
cast-in-place piles and crown beams are not layered, and the flow construction is organized
by two and three sections, respectively. Excavation and foundation pit support are divided
into five construction layers: the first layer of excavation is divided into four construction
sections, and the second to fifth layers of excavation and the first to fifth layers of the
foundation pit support are both divided into two construction sections, which are divided
into a total of 27 tasks; the initial network plan is shown in Figure 1. The meaning of the
letter abbreviations in Figure is annotated below Tables 1 and 2. The key route is GZ1-
GZ2-GL3-WT1-4-WT2-1-WT2-2-WT3-1-WT3-2-WT4-1-WT4-2-WT5-1-WT5-2-ZH5-2 with
a construction period of 118 days. The construction period for other non-line projects is
between 93 and 115. So, the planned construction period is 118 days, which meets the
contract requirements.
meaning of the letter abbreviations in Figure is annotated below Tables 1 and 2. The key
route is GZ1-GZ2-GL3-WT1-4-WT2-1-WT2-2-WT3-1-WT3-2-WT4-1-WT4-2-WT5-1-WT5-
2-ZH5-2 with a construction period of 118 days. The construction period for other non-
Appl. Sci. 2023, 13, 10716 5 of 11
line projects is between 93 and 115. So, the planned construction period is 118 days, which
meets the contract requirements.

Figure 1.
Figure 1. The initial network
The initial network plan.
plan.

Table1.1.Limit
Table Limittime and
time direct
and costcost
direct rate.rate.

Work
WorkCode
Code Limit
LimitTime/Day
Time/Day Direct
Direct CostRate/Yuan
Cost Rate/Yuan Per
Per Day
Day
GZGZ 28
28 9300
9300
GLGL 12
12 2700
2700
WT 70 3900
WT 70 3900
ZH 70 5200
ZH 70 5200
Annotation: GZ represents retaining cast-in-place pile, GL represents crown beam, WT represents excavation, ZH
Annotation:
represents GZ represents
foundation retaining cast-in-place pile, GL represents crown beam, WT represents
pit support.
excavation, ZH represents foundation pit support.
Table 2. Dynamic optimization results.
Table 2. Dynamic optimization results.
Critical or Not Critical or Not
Construction
Construc- Critical or Not Construction Critical or Not
Work Cost/Day Before/After Work Name Construction
Cost/Day Before/After
Work tion Before/After
Optimization
Work Name Before/After
Optimization
Op-
Cost/Day
Cost/Day Optimization timization
GZ1 9 Yes/Yes WT 4-2 16 Yes/Yes
GZ1
GZ2 279 Yes/Yes
Yes/Yes WT 4-2
WT 5-1 16 2 Yes/Yes
Yes/Yes
GZ2
GL1 27
4 Yes/Yes
No/No WT WT5-1 5-2 2 16 Yes/Yes
Yes/Yes
GL2
GL1 84 No/No
No/No WT ZH5-21-1 1614 No/No
Yes/Yes
GL3
GL2 38 Yes/Yes
No/No ZH ZH1-11-2 14 2 No/Yes
No/No
WT 1-1 2 No/No ZH 2-1 14 No/Yes
GL3
WT 1-2 7
3 Yes/Yes
No/No
ZH 1-2
ZH 2-2
2 2 No/Yes
No/Yes
WT1-3
WT 1-1 52 No/No
No/No ZH ZH2-13-1 1414 No/Yes
No/Yes
WT1-4
WT 1-2 37 No/No
Yes/Yes ZH ZH2-23-2 2 2 No/Yes
No/Yes
WT
WT2-11-3 25 Yes/Yes
No/No ZH ZH3-14-1 1414 No/Yes
No/Yes
WT 2-2 13 Yes/Yes ZH 4-2 2 No/Yes
WT 1-4 3 Yes/Yes ZH 3-2 2 No/Yes
WT 3-1 2 Yes/Yes ZH 5-1 14 No/Yes
WT3-2
WT 2-1 152 Yes/Yes
Yes/Yes ZH ZH4-15-2 14 2 No/Yes
No/Yes
WT4-1
WT 2-2 13
2 Yes/Yes
Yes/Yes ZH 4-2 2 No/Yes
WT 3-1GZi represents
Annotation: 2 the i-th construction
Yes/Yes sectionZH 5-1
of retaining 14 pile, GLi represents
cast-in-place No/Yesthe i-th
construction section of crown beam, WTi-j represents the j-th construction section of the i-th construction layer of
WT 3-2 15 Yes/Yes ZH 5-2 2 No/Yes
excavation, ZHi-j represents the j-th construction section of the i-th construction layer of foundation pit support.
WT 4-1 2 Yes/Yes
Annotation:
3.2. Genetic GZi represents the i-th construction section of retaining cast-in-place pile, GLi repre-
Algorithm
sents the i-th construction section of crown beam, WTi-j represents the j-th construction section of
Theconstruction
the i-th genetic algorithm
layer of simulates
excavation,the evolution
ZHi-j process
represents of genetic
the j-th variation
construction of biological
section of the i-th
chromosomes, reflecting the rule of survival
construction layer of foundation pit support. of the fittest [21]. Through selection, crossover,
variation and other genetic processes, individuals who adapt to the genetic environment
are
3.2. retained to continue inheritance, and those who cannot adapt are eliminated. After
Genetic Algorithm
screening, the optimal individuals are gradually propagated to the next generation. Repeat
The genetic algorithm simulates the evolution process of genetic variation of biolog-
the above genetic steps until the termination conditions are met, and find the optimal an-
ical chromosomes, reflecting the rule of survival of the fittest. [21] Through selection,
swer globally. The steps for solving a genetic algorithm based on MATLAB’s programming
are as follows:
(1) Determine variables and parameters. The time of each work determines the total
cost of the project and is a decision variable that affects the target value. Project parameters
include logical relationships, normal time, ultimate time, normal cost, and ultimate cost.
Genetic parameters include individual coding string length L, population size P, iteration
frequency G, crossover probability Pc , and mutation probability Pm . This project takes the
eration. Repeat the above genetic steps until the termination conditions are met, and find
the optimal answer globally. The steps for solving a genetic algorithm based on
MATLAB’s programming are as follows:
(1) Determine variables and parameters. The time of each work determines the total
cost of the project and is a decision variable that affects the target value. Project parameters
Appl. Sci. 2023, 13, 10716
include logical relationships, normal time, ultimate time, normal cost, and ultimate 6cost. of 11

Genetic parameters include individual coding string length L, population size P, iteration
frequency G, crossover probability Pc, and mutation probability Pm. This project takes the
number of
number of jobs
jobs as the string length, i.e., L = 27. P, P, G, Pc, and Pmm are are 400,
400, 1200,
1200, 0.5,
0.5, and
and
0.0003, respectively.
0.0003, respectively.
(2) Parameter
(2) Parametercoding.
coding.In In order
order to facilitate
to facilitate genetic
genetic algorithm
algorithm solving,
solving, the actual
the actual prob-
problem is transformed into a problem represented by parameters.
lem is transformed into a problem represented by parameters. There are 27 works in- There are 27 works
involved
volved in in
thethe construction
construction ofof the
the foundation
foundation pitsininthis
pits thisstudy,
study,with
withaalarge
largecapacity.
capacity. ToTo
simplify the encoding and decoding steps, real number encoding is used.
simplify the encoding and decoding steps, real number encoding is used. Each chromo- Each chromosome
has 27has
some genes, representing
27 genes, 27 works.
representing The attributes
27 works. of theofgenes
The attributes include
the genes workwork
include name,name,
time,
earliest
time, start time
earliest start of work,
time and previous
of work, work. The
and previous work. chromosome
The chromosomecomposition is shown
composition is
in Figure 2.
shown in Figure 2.

Figure 2. Chromosome composition.


Figure 2. Chromosome composition.

(3)
(3) Initialize
Initialize population.
population. This This study
study randomly
randomly generates
generates an an initial
initial population
population that that
satisfies constraint conditions and basic assumptions as the initial solution
satisfies constraint conditions and basic assumptions as the initial solution of the problem. If of the problem.
If
thethe population
population sizesize is too
is too large,
large, it will
it will resultresult in individual
in individual optimal
optimal solutions
solutions not domi-
not dominating
nating
the evolutionary direction of all solution. If the population size is too small, it willitcause
the evolutionary direction of all solution. If the population size is too small, will
cause the genetic algorithm to converge prematurely, leading
the genetic algorithm to converge prematurely, leading to inaccurate solution results. This to inaccurate solution re-
sults.
studyThis study randomly
randomly initializes theinitializes
populationthe population with a population
with a population size of 400.size of 400.
(4)
(4) Fitness
Fitnessevaluation.
evaluation.Fitness Fitness reflects
reflectsthethe
degree
degree to which
to whichindividuals approach
individuals approach the
objective
the objective function. In this
function. Instudy, the objective
this study, function
the objective shownshown
function in Equation (6) is the
in Equation (6)fitness
is the
function to calculate
fitness function the fitness
to calculate thevalue.
fitnessThe smaller
value. The the fitness
smaller thevalue,
fitnessthe betterthe
value, thebetter
individ-
the
ual, the greater their chances of reproduction, and the greater
individual, the greater their chances of reproduction, and the greater the probability the probability of being of
selected for thefor
being selected nextthegenetic operation
next genetic operation
(5)
(5) Genetic
Genetic manipulation.
manipulation. ThroughThrough selection,
selection, crossover,
crossover, and and mutation
mutation operations,
operations, the the
reproductive
reproductive function of organisms organismsisissimulated,
simulated,new newindividuals
individualsare aregenerated,
generated,and andbetter
bet-
ter populations
populations areare formed.
formed. This This
studystudyusesuses
the the
MonteMonteCarlo Carlo selection
selection method
method andand uni-
uniform
form crossover
crossover method method to randomly
to randomly select aselect
node fora node for variation
variation of construction
of construction status.
status. If the If
result
is satisfactory,
the the optimalthe
result is satisfactory, solution
optimal is output.
solution Otherwise,
is output.steps (4)–(5) will
Otherwise, stepsbe(4)–(5)
repeated willuntil
be
the resultuntil
repeated is satisfactory.
the result is satisfactory.

3.3. Construction
3.3. Construction Time-Cost
Time-Cost Optimization
Optimization Process
Process
Combined with the project data, the time-cost optimization process based on BIM
technology and genetic algorithm is established, as shown in Figure 3. This process mainly
includes the BIM module and GA module. The ultimate goal of the BIM module is to
obtain project parameter information for feasible solutions. The main function of the GA
module is to dynamically optimize the time-cost through MATLAB programming. The
specific steps are as follows:
(1) This study establishes a BIM model and exports engineering quantity files based
on BIM calculations. Based on the budget quota, the time of each work is calculated and
the network diagram is drawn, as shown in Figure 1.
(2) This study imports engineering quantity files into BIM pricing software. Combining
budget quotas and pricing standards, pricing files are generated. The direct cost of the
project is 5.7331 million yuan, and the indirect cost is 770,200 yuan.
Appl. Sci. 2023, 13, 10716 7 of 11

(3) Based on the BIM model, a 3D site layout is conducted and a 3D site layout model
file is generated.
(4) The network diagram file, 3D site layout model file, and pricing file are imported
into the BIM5D construction management platform to complete the association of model,
schedule, and cost information. The feasibility of the plan is judged through BIM5D
construction simulation. If the plan can be successfully implemented, it indicates from
a qualitative perspective that the plan is feasible. For qualitatively feasible solutions,
quantitative parameters such as labor, funds, and materials are output through the BIM5D
platform. If the output parameters meet the actual needs of the project, it indicates that the
scheme is feasible from a quantitative perspective. For schemes that meet the requirements
for qualitative and quantitative evaluation, the required project parameter information
Appl. Sci. 2023, 13, x FOR PEER REVIEW for
7 of 11
optimization is output through the BIM5D platform.
(5) Through MATLAB programming, the dynamic optimization of time-cost is carried
out based on the genetic
Combined with thealgorithm. According
project data, to the solution
the time-cost steps introduced
optimization in Section
process based on BIM 3.2
oftechnology
this article, after iterative convergence, the optimized solution is obtained.
and genetic algorithm is established, as shown in Figure 3. This process mainly
(6) According
includes the BIM to the optimized
module and GA plan, the pricing
module. file andgoal
The ultimate network
of thediagram are adjusted
BIM module is to
and
obtain project parameter information for feasible solutions. The main function ofand
step (4) is repeated. If the optimization plan is feasible in both qualitative the direc-
GA
tional
module aspects, the optimal plan
is to dynamically is obtained.
optimize Otherwise,
the time-cost throughsteps (1)–(6) will
MATLAB be repeatedThe
programming. until
the solution is feasible.
specific steps are as follows:

Figure 3. Time-cost optimization process.


Figure 3. Time-cost optimization process.

(1) This
4. Analysis ofstudy establishes
Optimization a BIM model and exports engineering quantity files based
Results
on BIM
Based on the managementthe
calculations. Based on budget quota,
philosophy the space,
of “full time ofsufficient
each work is calculated
time”, andis
the project
the network
organized viadiagram is drawn, as In
flow construction. shown in Figure
the initial 1.
schedule, GZ, GL and WT are key works.
(2) This study imports engineering quantity files
The project contract time is 122 days, and the initial plannedinto BIMtime
pricing software.
is 118 Combin-
days. The initial
ing budget quotas and pricing standards, pricing files are generated. The direct cost of the
network plan meets contract requirements. According to the contract, the penalty for
project is 5.7331 million yuan, and the indirect cost is 770,200 yuan.
project delay is 100,000 yuan per day. After calculation, the direct cost of the project under
(3) Based on the BIM model, a 3D site layout is conducted and a 3D site layout model
normal construction time is 5.7331 million yuan. The limit time and direct cost rate of each
file is generated.
work are shown in Table 1. The indirect rate is 6527 yuan per day.
(4) The network diagram file, 3D site layout model file, and pricing file are imported
into the BIM5D
4.1. Dynamic construction
Optimization managementTime-Cost
of Construction platformandto complete the association of model,
Result Analysis
schedule, and cost information. The feasibility of the plan is judged through BIM5D con-
The annual interest rate of the project loan is 6%. By incorporating project parameter
struction simulation. If the plan can be successfully implemented, it indicates from a qual-
information into Equations (6) and (7) and using MATLAB programming, the dynamic
itative perspective that the plan is feasible. For qualitatively feasible solutions, quantita-
optimization of time-cost is carried out based on the genetic algorithm. After 1200 iterations,
tive parameters such as labor, funds, and materials are output through the BIM5D plat-
the optimal solution is obtained by satisfying the termination conditions. Figure 4 shows
form. If the output parameters meet the actual needs of the project, it indicates that the
the minimum and mean values of the population for each iteration, and the convergence
scheme is feasible from a quantitative perspective. For schemes that meet the require-
of the calculation results is good. Table 2 shows the optimization results, with multiple
ments for qualitative and quantitative evaluation, the required project parameter infor-
mation for optimization is output through the BIM5D platform.
(5) Through MATLAB programming, the dynamic optimization of time-cost is car-
ried out based on the genetic algorithm. According to the solution steps introduced in
Section 3.2 of this article, after iterative convergence, the optimized solution is obtained.
(6) According to the optimized plan, the pricing file and network diagram are ad-
information into Equations (6) and (7) and using MATLAB programming, the
optimization of time-cost is carried out based on the genetic algorithm. After 1
tions, the optimal solution is obtained by satisfying the termination conditions
Appl. Sci. 2023, 13, 10716 shows the minimum and mean values of the population for each iteration, 8 of 11 and
vergence of the calculation results is good. Table 2 shows the optimization res
multiple critical paths. The optimal present value of the total cost of the deep e
critical paths.
project The million
is 6.3938 optimal present
yuan, value of the
and the total cost
present of theof
value deep excavation
direct project
costs is 5.6295 mill
is 6.3938 million yuan, and the present value of direct costs is 5.6295 million yuan. The
The optimal construction time is 108 days.
optimal construction time is 108 days.

4. Optimal
Figure 4.
Figure Optimal solution and mean
solution value ofvalue
and mean each generation of population.of population.
of each generation
(1) Comparing Figure 1, Tables 1 and 2, the time of each work is between the normal
and (1)
limitComparing Figure
values, and critical 1, is
work Tables 1 and 2, into
not compressed the non-critical
time of each work.work is between th
The method
of searching
and for the and
limit values, optimal solution
critical workusingisgenetic algorithm is ininto
not compressed line non-critical
with engineering
work. Th
practice and basic assumptions, and the results obtained are true and reliable.
of searching for the optimal solution using genetic algorithm is in line with en
(2) The total cost of optimization is increased from 6.5033 million yuan to 6.3938 million
practice
yuan, andand basic assumptions,
the construction time is changedandfromthe118results
days to obtained
108 days. The are true andtime
construction reliable.
(2) Theby
is shortened total costand
10 days, of optimization is increased
the total cost is reduced from
by 109,500 6.5033
yuan. million yuan to 6
The optimization
lion yuan, and the construction time is changed from 118 days toor108
effect is good. Some individuals in each generation of population are close to equal to
days. The
the optimal solution, which is a feasible solution for project implementation and can be
tion time is shortened by 10 days, and the total cost is reduced by 109,500 yuan.
selected based on engineering practice.
mization effecttoisthegood.
According Some results,
optimization individuals in each
the network generation
diagram file, 3D siteof population
layout model are c
equal to pricing
file, and the optimal solution,
file are adjusted andwhich
imported is into
a feasible
the BIM5D solution for project
construction implement
management
platform to simulate the construction process. The optimized plan runs smoothly, with
can be selected based on engineering practice.
no conflicts in various work arrangements, and the construction progress is reasonable
and According
feasible. to the optimization results, the network diagram file, 3D site layo
file, and(1) Inpricing file solution
the optimal are adjusted
networkand imported
diagram, the keyinto the BIM5D
line route is changedconstruction
from one ma
to multiple, and the original key line remains unchanged, which
platform to simulate the construction process. The optimized plan runs smoothl conforms to the basic
assumption. The optimization plan reached its peak on the 19th to 21st day of construction,
conflicts in various work arrangements, and the construction progress is reaso
with a total daily capital demand of 127,000 yuan. Based on the analysis of the project site
feasible.
situation, various resources and funding supply of the project can meet the needs of the
(1) Insolution.
optimized the optimal solution network diagram, the key line route is changed
to multiple, dynamic
(2) After and theoptimization,
original key the unbalanced
line remains coefficient of fund demand
unchanged, whichchanges
conforms to
from 2.08 to 2.16. The peak value of the fund demand curve before and after optimization
does not change much, but the number of key routes increases, making project manage-
ment more difficult. During the implementation of the project, the BIM5D construction
management platform is used to monitor the progress of the project in real-time and verify
Appl. Sci. 2023, 13, 10716 9 of 11

the allocation of project resources and construction costs. Any deviations are identified and
adjusted in a timely manner to ensure progress.

4.2. Static Optimization of Time-Cost


Without considering the time value of capital, the objective function is:
n
minC = ∑ ci + C2 + C3 (8)
i =1

The parameters in Equation (8) are the same as before, while the constraints and other
parameters remain unchanged. The total cost of static optimization is 6.4833 million yuan,
and the optimized construction time is 106 days. The original key route remains unchanged.
Comparing the results of static and dynamic optimization, the dynamic optimization can ex-
tend the construction time by 2 days while reducing the total cost by 89,500 yuan compared
to static optimization. Dynamic optimization takes into account the time value of capital,
which is more in line with the actual engineering situation. The optimization plan is more
advantageous for the overall benefits of the project. The comprehensive transportation hub
deep foundation pit project in this study was implemented according to the optimization
results and successfully completed in December 2022. The project implementation process
and results indicate that the optimization method and results presented in this article are
accurate and reliable, effectively ensuring the smooth implementation of the project.

5. Conclusions
(1) Considering the time value of capital and the rewards and punishments for the
construction time, a quadratic curve is used to represent the relationship between the direct
cost and the construction time of each work, and the relationship between the construction
time and cost function is determined. Taking the net present value of costs as the economic
evaluation indicator, the direct costs are paid once at the intermediate time points of each
work, the indirect costs are calculated once at the end of each interest period, and the project
rewards and punishments are calculated once at the end of the project period. A dynamic
optimization model of time-cost for deep foundation pits is established.
(2) BIM technology can quickly and accurately obtain project information, and genetic
algorithms can search globally. By combining BIM technology with the genetic algorithm,
the time-cost optimization process is established. By adopting a flow construction method,
the construction of deep and large foundation pits in the project is decomposed into
27 works, and the project parameters are reasonably determined. The genetic parameters L,
P, G, Pc , and Pm are 27, 400, 1200, 0.5, and 0.0003, respectively.
(3) The dynamic optimization scheme reduces the total cost by 1.68% while reducing
the total construction time by 8.47%. The static optimization scheme reduces the total cost
by 0.31% while reducing the total construction time by 10.17%. The dynamic optimiza-
tion scheme extends the construction period by 2 days while reducing the total cost by
89,500 yuan compared to static optimization. Dynamic optimization considers the time
value of funds, which is more in line with engineering reality and has greater guidance
value for the project.
(4) Visual construction simulation is conducted on the dynamic optimization scheme
using the BIM5D platform, and combined with the funding demand curve, the feasibility of
the scheme is verified from both qualitative and quantitative perspectives. The peak value
of the fund demand curve before and after optimization has not changed much, reaching
128,000 yuan and 127,000 yuan, respectively. The various resources and funding supply
of the project can meet the needs of optimizing the operation of the plan. The uneven
coefficient of fund demand has changed from 2.08 to 2.16, and the number of key routes has
changed from one to multiple, making construction management more difficult. During
the implementation of the project, real-time monitoring of the project progress is carried
out using the BIM5D platform, and any deviations are promptly adjusted.
Appl. Sci. 2023, 13, 10716 10 of 11

Author Contributions: Conceptualization, Y.Y. (Yingxia Yu); software, J.H.; validation, H.G.; re-
sources, Y.Y. (Yi Yang).; data curation, J.H.; writing—original draft preparation, Y.Y. (Yingxia Yu);
writing—review and editing, Y.Y. (Yingxia Yu) and H.G.; project administration, Y.Y. (Yingxia Yu); All
authors have read and agreed to the published version of the manuscript.
Funding: This research were funded by National Natural Science Foundation of China and the Key
Scientific Research Project of China Railway 19th Bureau Group Co., Ltd., grant number U1604135
and 19-A04.
Institutional Review Board Statement: The research does not require ethical approval.
Informed Consent Statement: Not applicable. The research did not involve humans.
Data Availability Statement: No new data were created or analyzed in this study. Data sharing is
not applicable to this article.
Acknowledgments: We thank all authors for their assistance with this research.
Conflicts of Interest: The authors declare no conflict of interest.

References
1. Liu, Y. Engineering Project Planning and Control. Ph.D. Thesis, China Architecture & Building Press, Beijing, China, 2008.
2. Luo, Y.; Zhai, S.; Xiao, Y.; Wang, D.; Wang, E. Optimization design of grading ring structure of HVDC voltage divider based on
SPRGA. Eng. J. Wuhan Univ. 2022, 55, 1256–1262.
3. Gao, J.; Zhang, Y. Research on optimal water distribution in two-stage canal system of branch and lateral based on genetic
algorithm optimized particle swarm algorithm. Water Sav. Irrig. 2023, 1–13. Available online: http://kns.cnki.net/kcms/detail/
42.1420.TV.20230914.1122.002.html (accessed on 15 September 2023).
4. Zhang, X.; Wang, F. Sectional optimization design of concrete frame column based on low-carbon indicator. J. Build. Struct. 2022,
43, 77–85.
5. Khalaj, G.; Nazari, A.; Pouraliakbar, H. (Iran): Prediction of martensite fraction of microalloyed steel by artificial neural networks.
Neural Netw. World 2013, 23, 117–130. [CrossRef]
6. Khalaj, G.; Pouraliakbar, H.; Mamaghani, K.R.; Khalaj, M.-J. Modeling the correlation between heat treatment, chemical composition and
bainite fraction of pipeline steels by means of artifcial neural networks. Neural Netw. World 2013, 23, 351–368. [CrossRef]
7. Wang, R.; Ding, W.; Wen, R.; Liao, Z.; Li, H. Loading optimization of Fischer-Tropsch synthesis using artificial neural networks
and genetic algorithm. J. Chem. Eng. Chin. Univ. 2023, 37, 608–614.
8. Wang, Y. Research on Time Cost Optimization Based on Hybrid Genetic Algorithm. Ph.D. Thesis, Dalian University of Technology,
Dalian, China, 2015.
9. Dong, G.; Chen, Z.; Zhao, C.; Li, X.; Yang, Z. Parameter optimization and forming limit prediction of sheet metal ductile fracture
criterion based on neural network and genetic algorithm. Chin. J. Nonferrous Met. 2021, 31, 85–94.
10. Liao, Y. Optimization of Workshop Facility Layout Based on Genetic Algorithm. Ph.D. Thesis, University of Nanhua,
Hengyang, China, 2018.
11. Feng, J.; Shi, J.; Feng, H.; Zhang, K. Optimization of Project Group time-Cost Based on Genetic Algorithm. Sci. Technol. Manag.
Res. 2020, 40, 212–218.
12. Feng, J.; Zhao, Y.; Chen, R.; Feng, H. Cost optimization under the condition of minimum owner cost of project group. J. Syst.
Manag. 2021, 30, 451–460.
13. Li, A.; Yang, F.; Wang, H. Dynamic optimization of project time cost based on genetic algorithm. Friends Account. 2013, 34, 114–117.
14. Li, H.; Xuan, W.; Tan, F.; Zhang, Y. Research on the application of improved genetic algorithm in dynamic time/cost trade-off.
J. Syst. Eng. 2007, 22, 333–336.
15. Luo, G.; Liu, E.; Wang, J. Time-cost Tradeoff Optimization of Construction Projects Using Genetic Algorithms. Ind. Eng. J. 2005,
8, 77–81.
16. Li, H.; Guo, H.; Gao, Y.; Liu, W.; Wei, X. BIM-based Optimization of Design and Construction for Bridge Projects. J. Eng. Manag.
2012, 26, 48–52.
17. Xie, L.; He, D.; Le, Y. Automatic Patching Research Based on Construction Project Schedule Plan of BIM. Constr. Technol. 2019,
48, 40–44+112.
18. Chen, L.; Wang, X.; Qin, K.; Tang, G.; Lu, Z. Research on Construction Schedule Management Based on BIM and PDCA. Constr.
Technol. 2019, 48, 131–137.
19. Wang, Y.; Huang, Y.; Wei, F.; Zhang, C. Research on Construction Schedule-cost Optimization of Grid Engineering Based on BIM
and Genetic Algorithm. Constr. Technol. 2020, 49, 18–66.
Appl. Sci. 2023, 13, 10716 11 of 11

20. Wang, X.; Wang, Q. Time Cost Optimization Based Improved NSGA-II Algorithm and BIM5D. J. Hubei Univ. Technol. 2021,
36, 81–85.
21. Sun, J.; Li, J.; Wang, D.; Nie, F.; Lin, P. Sparse Array Synthesis Based on Real Coded Genetic Algorithm. Telecommun. Eng. 2022,
62, 1272–1277.

Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual
author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to
people or property resulting from any ideas, methods, instructions or products referred to in the content.

You might also like