Search

Making use of basic principles of ant colony algorithm, optimization problem which is multi-dimensional and constrained are transformed into unified multi-variable target function by the way of punished factors, and all of the independent variables are divided into different equivalent area, and obtained constructional-graph which the ant visits an area of each variable acts as feasible solutions of optimization problem. So the process for accomplishing feasible solutions is called rough searching of ant colony algorithm. The solutions that rough searching obtained will be implemented the operation of crossover and mutation in order to construct the subtle searching ant colony algorithm and acquire more accurate global solution. So the specific algorithm is given. Compared the others three kinds optimization methods with the method of this paper for solving the planetary gear system's optimization problem, the results indicate that this optimization method has higher accuracy and efficiency. [ABSTRACT FROM PUBLISHER]