An improved particle swarm optimization algorithm for geometric constraint solving problem

Abstract

Geometric constraint problem is equivalent to the problem of solving a set of nonlinear equations substantially. The constraint problem can be transformed to an optimization problem. We can solve the problem by an improved PSO algorithm (IPSO), which is based on the “alldifferent” constraint. It combines the particle swarm optimization algorithm with genetic operators together effectively. When a particle is going to stagnate, the mutation operator is used to search its neighborhood. The experiment indicates that the algorithm can be used to solve geometric constraint problem effectively.