For packing problems that are complex optimisation problems, the solutions must rely on heuristics. Particle swarm optimisation PSO is an emerging technique that utilises heuristics. Because of its simplicity, PSO has been widely applied to a variety of fields, including applications to the packing problem. This paper researches the search efficiency of the PSO algorithm. Through fitting the data to the length of the solution interval and the number of iterations, a strong search capability for the PSO is proved. Then, the results of experiments with comparisons of many disturbance strategies show that a stochastic strategy is beneficial for raising the search capability of the algorithm.
['Jinmin Wang', 'Yang Qi', 'Jing Zhang']
Research on PSO algorithms for the rectangular packing problem