A Study on the Particle Swarm Optimization with Mutation Operator Constrained Layout Optimization

Taking the layout problem of satellite cabins as background, the authors studies the optimal layout problem of circle group in a circular container with performance constraints of equilibrium, which belong to NP-hard problem. This paper extends the heuristic method called Particle Swarm Optimization(PSO) to deal with the constrained layout optimization problem, proposes the particle presentation for this problem and compares the PSO with GA. By adding the mutation operator to the PSO algorithm in the later phase of convergence, the advanced algorithm can not only escape from the local minimum's basin of attraction of the later phase, but also maintain the characteristic of fast speed in the early convergence phase. The experimental results indicate that the Mutation PSO is a more effective method for constrained optimal layout problem.