ACO based optimized scheduling algorithm for computational grids
ACST'07 Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology
An Improvement to Ant Colony Optimization Heuristic
ISNN '08 Proceedings of the 5th international symposium on Neural Networks: Advances in Neural Networks
WSEAS Transactions on Information Science and Applications
A New Ant Colony Optimization Algorithm with an Escape Mechanism for Scheduling Problems
ICCCI '09 Proceedings of the 1st International Conference on Computational Collective Intelligence. Semantic Web, Social Networks and Multiagent Systems
Ant colony optimization for the K-means algorithm in image segmentation
Proceedings of the 48th Annual Southeast Regional Conference
Hybridization of the ant colony optimization with the k-means algorithm for clustering
SCIA'05 Proceedings of the 14th Scandinavian conference on Image Analysis
Efficient stochastic algorithms for document clustering
Information Sciences: an International Journal
| Hi-index | 0.00 |
In this paper, Ant colony optimization heuristic is extended for solving maximum independent set (MIS) problems. MIS problems are quite different from Travelling Salesman Problems (TSP) etc. , in which no concept of "path or order" exists in its solutions. Based on such characteristics, the ant colony optimization heuristic is modified in this paper in the following ways: ( i) a new computation method for heuristic information is adopted; ( ii) the pheromone update rule is augmented; ( iii) a complement solution construction process is designed. the simulation shows that the proposed ant colony optimization heuristic is effective and efficient for MIS problems.