The Research Based on the Discrete Cellular Ant Algorithm in the Geometric Constraint Solving

A constraint can describe a relation to be satisfied.Once the user defines a series of relations,the system will select a proper state to satisfy the constraints after the parameters are modified.When transferring the geometric constraint equation group into the optimization model,we adopt a discrete cellular ant algorithm(DCAA) by evolutionary rule of cells and characteristics of ant colony optimization.Discrete cellular ant algorithm is a new type of bionic algorithm,which uses the evolution law of cellular in the discrete cellular space and the characteristics of ant optimization,and it provides an optimal way for solving practical problems.The experiment shows that the algorithm can solve the geometric constraint problems efficiently.