Abstract: The hybridizations of Ant Colony Optimization(ACO) with Guided Local Search(GLS) can be used to solve the problem that ACO is easily trapped in local optima.However,there is a problem that the algorithmic optima prematurely converges to suboptimal solutions.This paper presented a Perturbation Guided Ant Colony Optimization(PGACO) algorithm to avoid the problem.A proposed perturbation method is used to move current solution to a neighbor solution space to build new global optimal solutions when the algorithm is prone to premature convergence.The experimental results show that PGACO can effectively avoid a premature convergence of the algorithm to suboptimal solutions.PGACO can generate a better solution,simultaneously has a better global search capability.

Key words: Ant colony optimization,Guided local search,Perturbation