Information Technology Journal 1812-5638 1812-5646 Asian Network for Scientific Information 10.3923/itj.2012.496.499 Cao Chunhong Chuan Tang Zhao Dazhe Zhang Bin 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 cell membrane optimization. By studying the characteristics of cell membrane and the mode of material transfer, proposed a new global optimization algorithm: Cell Membrane Optimization (CMO), combined with global optimization algorithm. The experiment shows that it can improve the geometric constraint solving efficiency and possess better convergence property than the compared algorithms.

]]> Bo, Y., 1999 The Research and Implement of Geometric Constraint Solving Technology. Holland, J.H., 1975 Adaptation in Natural and Artificial Systems. 1st Edn., Colorni, A., M. Dorigo and V. Maniezzo, 1991 Proceedings of the 1st European Conference on Artificial Life, 1991 pp: 134 142 Kennedy, J. and R. Eberhart, 1995 Proc. IEEE Int. Conf. Neural Networks, 4 1942 1948 Xiaolei, L., 2003 A New Intelligent Optimization Method-Artificial Fish School Algorithm. Eusuff, M.M. and K.E. Lansey, 2003 J. Water Resour. Plann. Manage., 129 210 225 Zhou, Y.Y. and Z.Y. Mao, 2003 J. South China Univ. Technol. Nat. Sci., 31 1 5 Karaboga, D., 2005 An idea based on honey bee swarm for numerical optimization. 2005 Tan, S.H. and W.Y. Yu, 2011 Appl. Res. Comput., 2011 455 457 Sheng-Li, L., M. Tang and J.X. Dong, 2003 J. Image Graphics, 8 938 945