Optimized scheduling of resource-constraints in projects for smart construction

In real-life applications, resources in construction projects are always limited. It is of great practical importance to shorten the project duration by using intelligent models (i.e., evolutionary computations such as genetic algorithm (GA) and particle swarm optimization (PSO) to make the construction process reasonable considering the limited resources. However, in the general EC-based model, for example, PSO easily falls into a local optimum when solving the problem of limited resources and the shortest period in scheduling a large network. This paper proposes two PSO-based models, which are resource-constrained adaptive particle swarm optimization (RC-APSO) and an input-adaptive particle swarm optimization (iRC-APSO) to respectively solve the static and dynamic situations of resource-constraint problems. The RC-APSO uses adaptive heuristic particle swarm optimization (AHPSO) to solve the limited resource and shortest duration problem based on the analysis of the constraints of process resources, time limits, and logic. The iRC-APSO method is a combination of AHPSO and network scheduling and is used to solve the proposed dynamic resource minimum duration problem model. From the experimental results, the probability of obtaining the shortest duration of the RC-APSO is higher than that of the genetic PSO and GA models, and the accuracy and stability of the algorithm are significantly improved compared with the other two algorithms, providing a new method for solving the resource-constrained shortest duration problem. In addition, the computational results show that iRC-APSO can obtain the shortest time constraint and the design scheme after each delay, which is more valuable than the static problem for practical project planning.