An enhanced ant colony optimization metaheuristicfor the minimum dominating set problem

Applied Artificial Intelligence

Volumn 20, Issue 10, 2006, Pages 881-903

  Ho, Chin Kuan ^a   Singh, Yashwant Prasad ^b   Ewe, Hong Tat ^a  

^a MULTIMEDIA UNIVERSITY   (Malaysia)

^b JAYPEE INSTITUTE OF INFORMATION TECHNOLOGY   (India)

Author keywords

[No Author keywords available]

Indexed keywords

CONVERGENCE OF NUMERICAL METHODS; GENETIC ALGORITHMS; GLOBAL OPTIMIZATION; PROBABILITY; PROBLEM SOLVING; SET THEORY;

ANT COLONY OPTIMIZATION (ACO); MINIMUM DOMINATING SET (MDS); SET PROBLEMS; TOURNAMENT SELECTION;

HEURISTIC METHODS;

EID: 33845612391     PISSN: 08839514     EISSN: 10876545     Source Type: Journal    
DOI: 10.1080/08839510600940132     Document Type: Article

References (24)

1. Bettstetter, C. 2002. On the minimum node degree and connectivity of a wireless multihop network. In: Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC 02), pages 80-90, Lausanne, Switzerland.
2. Birattari, M. 2004. The Problem of Tuning Metaheuristics as Seen from a Machine Learning Perspective. Ph.D. Thesis, Université Libre de Bruxelles.
3. Blum, C. and A. Roli. 2003. Metaheuristics in combinatorial optimization: Overview and conceptual comparison. ACM Computing Surveys 35(3):268-308.
4. Bonabeau, E. and G. Théraulaz. 2000. Swarm smarts. Scientific American 282(3):72-79.
5. Botee, H. M. and E. Bonabeau. 1998. Evolving ant colony optimization. Adv. Complex Systems 1:149-159.
6. Cordon, O., I. Fernández, F. Herrera, and L. Moreno. 2000. A new AGO model integrating evolutionary computation concepts: The best-worst ant system. In: Proceedings of the Second International Workshop on Ant Algorithms, pages 22-29, Brussels, Belgium.
7. Czarn, A., C. MacNish, K Vijayan, B. Turlach, and R. Gupta. 2004. Statistical exploratory analysis of genetic algorithms. IEEE Trans. Evolutionary Computation 8(4):405-421.
8. Dorigo, M. and L. M. Gambardella. 1996. Ant colony system: Optimization by a colony of cooperating agents. IEEE Trans. Systems, Man, and Cybernetics - Part B 26(1):29-41.
9. Dorigo, M., V. Maniezzo, and A Colorni. 1991. Positive Feedback as a Search Strategy. Tech. Rep. 91-016, Politecnico di Milano, Italy.
10. Dorigo, M. and T. Stützle. 2004. Ant Colony Optimization. Cambridge, MA: MIT Press.
11. Goldberg, D. E. 1989. Genetic Algorithms in Search, Optimization, and Machine Learning. Boston, MA: Addison-Wesley.
12. Ho, C. K., Y. P. Singh, and H. T. Ewe. 2004. Selecting cluster heads in ad hoc networks using ant colony optimization: An experimental study. In: Proceedings of the 6th International Conference on Optmization: Techniques and Applications, pages 32-39, Ballarat, Australia.
13. Leguizamón, G. and Z. Michalewicz. 1999. A new version of ant system for subset problems. In: Proceedings of the 1999 Congress on Evolutionary Computation, 2 vol., pages 1464-1469, Washington, D.C., USA
14. Meyer, B. 2004. Convergence control in AGO. In: Proceedings of the Genetic and Evolutionary Computation Conference, Seattle, Washington, USA.
15. Montgomery, D. C. 1996. Statistical Quality Control. New York: Wiley.
16. Montgomery, J., M. Randall, and T. Hendtlass. 2003. Automated Selection of Appropriate Pheromone Representations in Ant Colony Optimization, Tech. Rep. 03-09, School of Information Technology, Bond University, Australia.
17. Nakamichi, Y. and T. Arita. 2001. Diversity control in ant colony optimization. In: Proceedings of the Inaugural Workshop on Artificial Life (AL' 01), pages 70-78, Adelaide, Australia.
18. Oikonomou, K., A. Vaios, A. Simoens, P. Pellati, and I. Stavrakakis. 2003. A centralized ad-hoc network architecture (CANA) based on enhanced HiperLAN/2. In: Proceedings of the IEEE Personal Indoor Mobile Radio Communications (PIMRC), pages 1336-1340, Beijing, China.
19. Randall, M. and E. Tonkes. 2002. Intensification and diversification strategies in ant colony system. Complexity International 9:1-7.
20. Sanchis, L. A. 2002. Experimental analysis of heuristic algorithms for the dominating set problem. Algorithmica 33:3-18.
21. Solnon, C. 2002a. Boosting ACO with a preprocessing step. In: EvoWorkshops 2002, Lecture Notes in Computer Science 2279:163-172.
22. Solnon, C. 2002b. Ants can solve constraint satisfaction problems. IEEE Trans. On Evolutionary Computation 6(4):347-357.
23. Toh, C. K. 2001. Ad Hoc Mobile Wireless Networks: Protocols and Systems. Upper Saddle River, NJ: Prentice Hall.
24. Tsai, C.-F., C.-W. Tsai, H.-C. Wu, and T. Yang. 2004. ACODF: A novel data clustering approach for data mining in large databases, Journal of Systems and Software - Special Issue: Performance modelling and analysis of computer systems and networks 73(1):133-145.