Browse > Article

An Ant Colony Optimization Approach for the Maximum Independent Set Problem  

Choi, Hwayong (Department of Industrial Engineering, KAIST)
Ahn, Namsu (Department of Industrial Engineering, KAIST)
Park, Sungsoo (Department of Industrial Engineering, KAIST)
Publication Information
Journal of Korean Institute of Industrial Engineers / v.33, no.4, 2007 , pp. 447-456 More about this Journal
Abstract
The ant colony optimization (ACO) is a probabilistic Meta-heuristic algorithm which has been developed in recent years. Originally ACO was used for solving the well-known Traveling Salesperson Problem. More recently, ACO has been used to solve many difficult problems. In this paper, we develop an ant colony optimization method to solve the maximum independent set problem, which is known to be NP-hard. In this paper, we suggest a new method for local information of ACO. Parameters of the ACO algorithm are tuned by evolutionary operations which have been used in forecasting and time series analysis. To show the performance of the ACO algorithm, the set of instances from discrete mathematics and computer science (DIMACS)benchmark graphs are tested, and computational results are compared with a previously developed ACO algorithm and other heuristic algorithms.
Keywords
Maximum Independent Set(MIS); Ant Colony Optimization(ACO); Heuristic Algorithm;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Bondy, J. A. and Murty, U. S. R (1976), Graph Theory with Application, American Elsevier Publishing
2 Marchiori, E. (2002), Genetic, Iterated and Multistart Local Search for the Maximum Clique Problem, Applications of Evolutionary Computing, 2279
3 Dorigo, M and Gambardella, L. M (1997), Ant colony system : a cooperative learning approach to the traveling salesman problem, IEEE Transactions on Evolutionary Computation, 1(1), 53-66   DOI   ScienceOn
4 Gambardella, L. M., Taillard, E. D, and Giovanni, A. (1999), A Multiple Ant Colony System for Vehicle Routing Problems with Time Windows, Advanced Topics In Computer Science Series. Mcgraw-Hill
5 Gambardella, L. M, Taillard, E. D, and Dorigo, M (1999), Ant Colonies for the Quadratic Assignment Problem, Journal of the Operational Research Society, 50(2), 167-176   DOI   ScienceOn
6 Li, Y. and Xu, Z. (2003), An Ant Colony Optimization Heuristic for Solving Maximum Independent Set Problems, Computational Intelligence and Multimedia Applications, Fifth International Conference 206-211
7 Montgomery, D. C. (1970), Adaptive Control of Exponential Smoothing Parameters by Evolutionary Operation, IlE Transactions, 2(3), 268-269
8 DIMACS directories, Second DIMACS implementation challenge. http://dimacs.rutger.edu/Challenges/index.html
9 Gerla, M and Tsai, J. T-C. (1995), Multicluster, mobile, multimedia radio network. Wireless Networks, 1(3), 255-265   DOI
10 Garey, M. and Johnson, D. (1979), Computers and Intractability- A guide to the Theory of NP-Completeness, W. H. Freeman and Company
11 Parpinelli, R, Lopes, S. H. S. and Freitas, A. A. (2002), Data mining with an ant colony optimization algorithm, IEEE Transactions on Evolutionary Computation, 6(4), 321-332   DOI   ScienceOn