Hybrid optimization algorithm for solving maximum independent set problems
基于混合优化算法的最大独立集问题求解

Ant Colony Optimization(ACO) behaves well in finding local optimum,whereas its global search depends on selection of the evaporation coefficient.An unsuitable evaporation coefficient may result in local optimum of final solution.Tabu Search(TS) behaves well in finding global optimum of combined optimization problems.To compensate for the limitations of the single algorithms,the authors integrated the two algorithms together and put forward Tabu Search and Ant Colony Optimization based Hybrid Optimization Algorithm HTSACO to solve maximum independent set.As compared with the standard ant colony optimization,the proposed algorithm demonstrates quite high global optimization capability and computing efficiency.