An ant colony optimization algorithm for the minimum weight vertex cover problem

Annals of Operations Research

Volumn 131, Issue 1-4, 2004, Pages 283-304

  Shyu, Shyong Jian ^a   Yin, Peng Yeng ^b   Lin, Bertrand M T ^b  

^a MING CHUAN UNIVERSITY   (Taiwan)

^b NATIONAL CHI NAN UNIVERSITY   (Taiwan)

Author keywords

ant colony optimization; meta heuristic algorithm; minimum weight vertex cover

Indexed keywords

EID: 4444318428     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1023/B:ANOR.0000039523.95673.33     Document Type: Article

References (38)

1. Alimonti, P. and V. Kann. (2000). "Some APX-Completeness Results for Cubic Graphs." Theoretical Computer Science 237, 123-134.
2. Balasubramanian, R., M.R. Fellows, and V. Raman. (1998). "An Improved Fixed-Parameter Algorithm for Vertex Cover." Information Processing Letters 65, 163-168.
3. Bar-Yehuda, R. and S. Even. (1985). "A Local-Ratio Theorem for Approximating with the Weighted Vertex Cover Problem." Annals of Discrete Mathematics 25, 27-45.
4. Bullnheimer, B., R.F. Hartl, and C. Strauss. (1999). "A New Rank-Based Version of the Ant System: A Computational Study." Central European Journal of Operations Research and Economics 7, 25-38.
5. Chen, J., I.A. Kanj, and W. Jia. (1999). "Vertex Cover: Further Observations and Further Improvements." In The 25th International Workshop on Graph-Theoretical Concepts in Computer Science.
6. Clarkson, K.L. (1983). "A Modification of the Greedy Algorithm for Vertex Cover." Information Processing Letters 16, 23-25.
7. Chvatal, V. (1979). "A Greedy-Heuristic for the Set Cover Problem." Mathematics of Operations Research 4, 233-235.
8. Colorni, A., M. Dorigo, and V. Maniezzo. (1991). "Distributed Optimization by Ant Colonies." In Proceedings of European Conference on Artificial Life, Paris, France. Elsevier Science Publishing, pp. 134-142.
9. Costa, D. and A. Hertz. (1997). "Ants Can Color Graphs." Journal of the Operational Research Society 48, 295-305.
10. Dinur, I. and S. Safra. (2001). "The Importance of Being Biased." Technical Report, Department of Computer Science, Tel Aviv University, Israel.
11. Dorigo, M., E. Bonabeau, and G. Theraulaz. (2000). "Ant Algorithm and Stigmergy." Future Generation Computer Systems 16, 851-871.
12. Dorigo, M., G.D. Caro, and L.M. Gambardella. (1999). "Ant Algorithms for Optimization." Artificial Life 5(3), 137-72.
13. Dorigo, M. and L.M. Gambardella. (1997a). "Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem." IEEE Transactions on Evolutionary Computation 1(1), 53-66.
14. Dorigo, M. and L.M. Gambardella. (1997b). "Ant Colonies for the Traveling Salesman Problem." BioSystems 43, 73-81.
15. Dorigo, M., V. Maniezzo, and A. Colorni. (1991). "Positive Feedback as a Search Strategy." Technical Report, 91-016, Politecnico idi Milano.
16. Dorigo, M., V. Maniezzo, and A. Colorni. (1996). "The Ant System: Optimization by a Colony of Cooperating Agents." IEEE Transactions on Systems, Man, and Cybernetics - Part B 26(1), 29-41.
17. Downey, R.G. and M.R. Fellows. (1995a). "Fixed-Parameter Tractability and Completeness I: Basic Results." SIAM Journal on Computing 24, 873-921.
18. Downey, R.G. and M.R. Fellows. (1995b). "Parameterized Computational Feasibility." In P. Clote and J. Remmel (eds.), Feasible Mathematics, Vol. II. Boston, pp. 219-244.
19. Feige, U. (1998). "A Threshold of 1n n for Approximating Set Cover." Journal of the ACM 45(4), 634-652.
20. Gambardella, L.M. and M. Dorigo. (1995). "Ant-Q: A Reinforcement Learning Approach to the Traveling Salesman Problem." In A. Prieditis and S. Russell (eds.), Proceedings of the Twelfth International Conference on Machine Learning, ML-95, Tahoe City, CA. Morgan Kaufmann, pp. 252-260.
21. Garey, M.R. and D.S. Johnson. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco, CA: W.H. Freeman.
22. Glover, F. (1989). "Tabu Search - Part I." ORSA Journal on Computing 1(3), 190-206.
23. Glover, F. (1990). "Tabu Search: A Tutorial." Interface 20, 74-94.
24. Hastad, J. (2001). "Some Optimal Inapproximability Results." Journal of the ACM 48(4), 798-859.
25. Jayaraman, V.K., B.D. Kulkarni, S. Karale, and P. Shelokar. (2000). "Ant Colony Framework for Optimal Design and Scheduling of Batch Plants." Computers and Chemical Engineering 24, 1901-1912.
26. Johnson, D.S., C.R. Aragon, L.A. McGeoch, and C. Schevon. (1989a). "Optimization by Simulated Annealing: An Experimental Evaluation, Part I: Graph Partitioning." Operations Research 37, 875-892.
27. Johnson, D.S., C.R. Aragon, L.A. McGeoch, and C. Schevon. (1989b). "Optimization by Simulated Annealing: An Experimental Evaluation, Part II: Graph Coloring and Number Partitioning." Operations Research 39, 378-406.
28. Karp, R.M. (1972). "Reducibility Among Combinatorial Problems." In R.E. Miller and J.W. Theater (eds.), Complexity of Computer Computations. New York: Plenum Press.
29. Kirkpatrick, S., C.D. Gellatt, and M.P. Vechi. (1983). "Optimization by Simulated Annealing." Science 220, 671-680.
30. Maniezzo, V. (1998). "Exact and Approximate Non-Deterministic Tree-Search Procedures for the Quadratic Assignment Problem." Research Report CSR 98-1, Scienze dell'Informazione, University Di Bologna, Sede Di Cesena, Italy.
31. Monien, B. and E. Speckenmeyer. (1985). "Ramsey Numbers and an Approximation Algorithm for the Vertex Cover Problem." Acta Informatica 22, 115-123.
32. Motwani, R. (1992). "Lecture Notes on Approximation Algorithms." Technical Report, STAN-CS-92-1435, Department of Computer Science, Stanford University.
33. Niedermeter, R. and P. Rossmanith. (1999). "Upper Bounds for Vertex Cover Further Improved." In Proc. of STACS'99, Lecture Notes in Computer Science, Vol. 1536, pp. 561-570.
34. Paschos, V.T. (1997). "A Survey of Approximately Optimal Solutions to Some Covering and Packing Problems." ACM Computing Surveys 29(2), 171-209.
35. Pitt, E. (1985). "A Simple Probabilistic Approximation Algorithm for Vertex Cover." Technical Report, YaleU/DCS/TR-404, Department of Computer Science, Yale University.
36. Shyu, S.J., B.M.T. Lin, and P.Y. Yin. (2001). "Application of Ant Colony Optimization for No-Wait Flowshop Scheduling Problem to Minimize the Total Completion Time." Presented at the INFORMS Meeting, Maui, Hawaii, June.
37. Shyu, S.J., P.Y. Yin, B.M.T. Lin, and M. Haouari. (2003). "Ant-Tree: An Ant Colony System for the Generalized Minimum Spanning Tree Problem." Journal of Experimental & Theoretical Artificial Intelligence 15(1), 103-112.
38. Stutzle, T. and H. Hoos. (1997). "Improvements on the Ant System: Introducing MAX-MIN Ant System." In Proceedings of the International Conference on Artificial Neural Networks and Genetic Algorithms, Springer, pp. 245-249.