As the ant colony algorithm can not use in continuous spaces, an improved ant colony algorithm by particle swarm optimization is proposed. This algorithm divides the total domain averagely, and integrates random operations with particle swarm optimization, and uses the variation operation of pheromone to jump algorithm stagnation. The mixoptimization owns the largescale search and the local search ability. it also can search the high quantity optimization solution and ensure global convergence. And the result about the emulated test demonstrates the mixoptimization’s possibility and superiority.