On the approximation ability of evolutionary optimization with application to minimum set cover

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2013, Pages 3190-3194

  Yu, Yang ^a   Yao, Xin ^b   Zhou, Zhi Hua ^a  

^a NANJING UNIVERSITY   (China)

^b UNIVERSITY OF BIRMINGHAM   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ABILITY; APPROXIMATION PERFORMANCE; APPROXIMATION RATIOS; APPROXIMATION RESULTS; EVOLUTIONARY ALGORITHMS (EAS); EVOLUTIONARY OPTIMIZATIONS; HEURISTIC OPTIMIZATION ALGORITHMS; MINIMUM SET COVER PROBLEM;

ALGORITHMS; OPTIMAL SYSTEMS;

ARTIFICIAL INTELLIGENCE;

EID: 84896061774     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (25)

1. A. Auger and B. Doerr. Theory of Randomized Search Heuristics-Foundations and Recent Developments. World Scientific, Singapore, 2011.
2. T. Bäck. Evolutionary Algorithms in Theory and Practice: Evolution Strategies, Evolutionary Programming, Genetic Algorithms. Oxford University Press, Oxford, UK, 1996.
3. E. Benkhelifa, G. Dragffy, A.G. Pipe, and M. Nibouche. Design innovation for real world applications, using evolutionary algorithms. In Proceedings of 2009 IEEE Congress on Evolutionary Computation, pages 918-924, Trondheim, Norway, 2009.
4. V. Chvátal. A greedy heuristic for the setcovering problem. Mathematics of Operations Research, 4(3):233-235, 1979.
5. B. Doerr, A. V. Eremeev, C. Horoba, F. Neumann, and M. Theile. Evolutionary algorithms and dynamic programming. In Proceedings of GECCO'09, pages 771-778, Montreal, Canada, 2009.
6. U. Feige. A threshold of ln n for approximating set cover. Journal of the ACM, 45(4):634-652, 1998.
7. T. Friedrich, J. He, N. Hebbinghaus, F. Neumann, and C.Witt. Analyses of simple hybrid algorithms for the vertex cover problem. Evolutionary Computation, 17(1):3-19, 2009.
8. T. Friedrich, J. He, N. Hebbinghaus, F. Neumann, and C. Witt. Approximating covering problems by randomized search heuristics using multiobjective models. Evolutionary Computation, 18(4):617-633, 2010.
9. O. Giel and I. Wegener. Evolutionary algorithms and the maximum matching problem. In Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science, pages 415-426, Berlin, Germany, 2003.
10. R. Hassin and A. Levin. A betterthan-greedy approximation algorithm for the minimum set cover problem. SIAM Journal on Computing, 35(1):189-200, 2005.
11. J. He and X. Yao. Drift analysis and average time complexity of evolutionary algorithms. Artifical Intelligence, 127(1):57-85, 2001.
12. J. He and X. Yao. An analysis of evolutionary algorithms for finding approximation solutions to hard optimisation problems. In Proceedings of 2003 IEEE Congress on Evolutionary Computation, pages 2004-2010, Canberra, Australia, 2003.
13. G. S. Hornby, A. Globus, D. S. Linden, and J. D. Lohn. Automated antenna design with evolutionary algorithms. In Proceedings of 2006 American Institute of Aeronautics and Astronautics Conference on Space, pages 19-21, San Jose, CA, 2006.
14. J. R. Koza, M. A. Keane, and M. J. Streeter. What's AI done for me lately? Genetic programming's human-competitive results. IEEE Intelligent Systems, 18(3):25-31, 2003.
15. M. Laumanns, L. Thiele, E. Zitzler, E. Welzl, and K. Deb. Running time analysis of multiobjective evolutionary algorithms on a simple discrete optimization problem. In Proceedings of PPSN'02, pages 44-53, London, UK, 2002.
16. J. Mestre. Greedy in approximation algorithms. In Proceedings of the 14th Annual European Symposium on Algorithms, pages 528-539, Zurich, Switzerland, 2006.
17. F. Neumann and J. Reichel. Approximating minimum multicuts by evolutionary multiobjective algorithms. In Proceedings of PPSN'08, pages 72-81, Dortmund, Germany, 2008.
18. F. Neumann and I. Wegener. Minimum spanning trees made easier via multi-objective optimization. In Proceedings of GECCO'05, pages 763-769, Washington DC, 2005.
19. F. Neumann and I. Wegener. Can single-objective optimization profit from multiobjective optimization? In J. Knowles, D. Corne, and K. Deb, editors, Multiobjective Problem Solving from Nature-From Concepts to Applications, pages 115-130. Springer, Berlin, Germany, 2007.
20. F. Neumann and C. Witt. Bioinspired Computation in Combinatorial Optimization-Algorithms and Their Computational Complexity. Springer-Verlag, Berlin, Germany, 2010.
21. F. Neumann, J. Reichel, and M. Skutella. Computing minimum cuts by randomized search heuristics. In Proceedings of GECCO'08, pages 779-786, Atlanta, GA, 2008.
22. P. Oliveto, J. He, and X. Yao. Analysis of the (1+1)-EA for finding approximate solutions to vertex cover problems. IEEE Transactions on Evolutionary Computation, 13(5):1006-1029, 2009.
23. J. Scharnow, K. Tinnefeld, and I. Wegener. Fitness landscapes based on sorting and shortest paths problems. In Proceedings of PPSN'02, pages 54-63, Granada, Spain, 2002.
24. C. Witt. Worst-case and average-case approximations by simple randomized search heuristics. In Proceedings of the 22nd Annual Symposium on Theoretical Aspects of Computer Science, pages 44-56, Stuttgart, Germany, 2005.
25. Y. Yu and Z.-H. Zhou. A new approach to estimating the expected first hitting time of evolutionary algorithms. Artificial Intelligence, 172(15):1809-1832, 2008.