Particle Swarm Optimization for Constrained Layout Optimization

Taking the layout problem of satellite cabins as the background, the authors make a study of the optimal layout problem of circle groups in a circular container with performance constraints of equilibrium and inertia, which belong to NP-Hard problem. This paper extends the heuristic 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 the contrast experiments of three test suits, it has been proved that the PSO is a more effective method for Constrained Layout Optimization problem.