Dynamic Optimization of Construction Time-Cost for Deep and Large Foundation Pit Based on BIM Technology and Genetic Algorithm

Author:

Yu Yingxia1,Han Junjia2,Gu Haoyu1,Yang Yi3

Affiliation:

1. School of Civil Engineering and Architecture, Henan University of Science and Technology, Luoyang 471000, China

2. School of Mechanical, Electrical & Information Engineering, Shandong University, Weihai 264209, China

3. China Railway 19th Bureau Group Co., Ltd., Beijing 100176, China

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 corresponding 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 program, 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 compared 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 the time value of capital is more in line with engineering reality, and the optimization results are more reliable and accurate. BIM technology can accurately and quickly obtain project parameters and resource information, solving problems such as complex processes in super deep excavation and huge engineering data statistics. The genetic algorithm can efficiently and accurately search for the optimal solution within the global domain. This study combines BIM technology with the genetic 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 of schedule cost for similar projects.

Funder

National Natural Science Foundation of China

Key Scientific Research Project of China Railway 19th Bureau Group Co., Ltd.

Publisher

MDPI AG

Subject

Fluid Flow and Transfer Processes,Computer Science Applications,Process Chemistry and Technology,General Engineering,Instrumentation,General Materials Science

Reference21 articles.

1. Liu, Y. (2008). Engineering Project Planning and Control. [Ph.D. Thesis, China Architecture & Building Press].

2. Optimization design of grading ring structure of HVDC voltage divider based on SPRGA;Luo;Eng. J. Wuhan Univ.,2022

3. Gao, J., and Zhang, Y. (2023). 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., 1–13. Available online: http://kns.cnki.net/kcms/detail/42.1420.TV.20230914.1122.002.html.

4. Sectional optimization design of concrete frame column based on low-carbon indicator;Zhang;J. Build. Struct.,2022

5. (Iran): Prediction of martensite fraction of microalloyed steel by artificial neural networks;Khalaj;Neural Netw. World,2013

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3