The ant colony algorithm search time is long and it is easy to fall into the local optimal. Put forward the amplitude descending local phenomenon renovating model. Through analyzing why the present algorithm fall into the local optimal, and using ant colony recombining algorithm, and according to hypothesis deduce amplitude descending local phenomenon renovating model, and analyze influence of model on algorithm complexity. Then use four pheromone renovating models to solve the shortest path problems. The simulation result shows that the model can restrain the algorithm to fall into the local optimal.