Application of dynamic programming algorithm to analyse the optimal selection in construction

Abstract

Information technology is commonly applied in all parts of life, as well as in the construction industry, and has become a pressing issue at present. These applications play an important role in the development of the construction industry, aiming to prevent risks during the design, save costs and increase work efficiency during construction and monitoring and bring the best profit for stakeholders. In this article, a dynamic programming algorithm is used to analyse and optimise the selection of construction project items to help contractors achieve the greatest profit. We propose problems ranging from single-condition focusing on time to multi-condition scenarios that include both time and maximum profit of a construction team. The results show that for single-condition problems, the dynamic programming equation with a time variable to sort construction project items can be solved quickly and accurately. For multi-condition problems, the system of equations with time and profit variables in dynamic programming has been improved in this paper to solve 10 construction project items rapidly and efficiently. These obtained results allow the application of the dynamic programming algorithm to analyse and optimise problems in the construction field, aiming to enhance the construction project efficiency.