Parallel Search Algorithm for Geometric Constraints Solving

In this paper, we propose a hybrid algorithm -(parallel search algorithm) to solve geometric constraint problems. First, particle swarm optimization is employed to gain parallelization while solution diversity is maintained. Second, simplex method reduces the number of infeasible solutions while solution quality is improved with an operation order search. Performance results on geometric constraint problems show that parallel search algorithm outperforms existing techniques.