Information Technology Journal 1812-5638 1812-5646 Asian Network for Scientific Information 10.3923/itj.2012.504.507 Hong Cao Chun- Min Wang Li- Chun-Yan Han Da-Zhe Zhao Bin Zhang 4 2012 11 4 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 n problem. We can solve the problem with GeesePSO optimization. In this paper, an improved algorithm is proposed using the characteristics of the flight of geese for reference. The improved algorithm has superiority over PSO; for one thing, it keeps the population various by ordering all the particles and making each particle fly following its anterior particle; for another thing, it strengthens cooperation and competition between particles by making each particle share more useful information of the other particles. The experiment shows that it can improve the geometric constraint solving efficiency and possess better convergence property than the compared algorithms.

]]> 1 Bo, Y., 1999 The research and implement of geometric constraint solving. 1999 2 Holland, J.H., 1975 Adaptation in Natural and Artificial Systems. 1st Edn., 3 Jin-Yang, L., G. Mao-Zu and D. Chao, 2006 Comput. Sci., 33 166 168 4 Beekman, M. and F.L.W. Rantnieks, 2000 Mellifera L.]]> Funct. Ecol., 14 490 496 5 Wilson, E.O., 1975 Sociobiology: The New Synthesis. 6 Sheng-Li, L., M. Tang and J.X. Dong, 2003 J. Image Graphics, 8 938 945