Construction resource scheduling with chaotic particle swarm optimisation. (2016) - Huang, Zenghui
The traditional methods such as critical path method (CPM) and linear programming (LP) have difficulty solving more general scheduling problems such as resource constrained scheduling problems. Emerging techniques such as particle swarm optimisation (PSO) have shown advantages in addressing this problem. However, the performance of simple PSO is greatly dependent on its parameters, and bad selection of the parameters often leads to the problem of being trapped in local optima leading to premature convergence. By introducing chaos mapping into the particle swarm optimisation algorithm, we presented an updated particle swarm optimisation method addressing the construction resource rescheduling problems. In the proposed approach, the parameters of chaotic PSO have little influence on the performance of the algorithm, and thus make the particle swarm optimisation algorithm more robust. The new method has been examined and tested on a practical problem. The results indicate that the new approach solves the problem at a faster convergence rate and with a better precision, as well.