Hybrid Ant Colony Optimization for the Channel Assignment Problem in Wireless Communication

Assignment Problem Based on Improved Ant Colony Algorithm

“…In other words,two experiments respectively are calculated by 20 times,the average running time of the algorithm is 0.48 seconds and 5.63 seconds,the average number of iteration is 14 times and 39 times,the performacnce of the algorithm is improved as compared with the reference [4].…”

“…In order to overcome some shortcomings of the reference [4] ,in this paper,we proposed a series of improvement strategies, then the procedure the improved ant colony algorithm is introduced, further analysis and comparisons illustrate the advantages of our approach.…”

“…

Assignment problem is a combinatorial optimization problem.In this paper,a improved ant colony algorithm is proposed to solve the assignment problem.According to the rule of state-shift and strategty of updating pheromone, parameters of the ant colony Algorithm are optimized and changed,the best solution can be found rapidly,the simulative results show that the improvement strategies can well improve convergence speed and quality.

1.IntroductionThe assignment problem is a kind of special operations in linear programming problem. It has significant importance for real life.There are some deficiencies on the applicability,universality and correctness in the Hungarian algorithm [1], the closed circle DNA algorithm.In recent years, the ant colony algorithm has been widespreadly concerned, many scholars apply them successfully on the studies such as ccombinational optimization,network routing,robots and so on.In order to overcome some shortcomings of the reference [4] ,in this paper,we proposed a series of improvement strategies, then the procedure the improved ant colony algorithm is introduced, further analysis and comparisons illustrate the advantages of our approach.

…”