On constrained boolean Pareto optimization

IJCAI International Joint Conference on Artificial Intelligence

Volumn 2015-January, Issue , 2015, Pages 389-395

  Qian, Chao ^a   Yu, Yang ^a   Zhou, Zhi Hua ^a  

^a NANJING UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; BOOLEAN FUNCTIONS; COSTS; OPTIMIZATION; PARETO PRINCIPLE;

APPROXIMATE SOLUTION; BI OBJECTIVES; BOOLEAN OPTIMIZATIONS; GREEDY ALGORITHMS; MINIMUM COST; PARETO OPTIMIZATION; PENALTY FUNCTION METHODS; UNCONSTRAINED OPTIMIZATION;

CONSTRAINED OPTIMIZATION;

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

References (30)

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. A. Ben Hadj-Alouane and J. C. Bean. A genetic algorithm for the multiple-choice integer program. Operations Research, 45(1):92-101, 1997.
4. D. P. Bertsekas. Nonlinear Programming. Athena Scientific, Cambridge, MA, 1999.
5. Z. Cai and Y. Wang. A multiobjective optimization-based evolutionary algorithm for constrained optimization. IEEE Transactions on Evolutionary Computation, 10(6):658-675, 2006.
6. V. Chvatal. A greedy heuristic for the set-covering problem. Mathematics of Operations Research, 4(3):233-235, 1979.
7. C. A. Coello Coello. Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: A survey of the state of the art. Computer Methods in Applied Mechanics and Engineering, 191(11):1245-1287, 2002.
8. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. MIT Press, Cambridge, MA, 2001.
9. K. Deb, A. Pratap, S. Agarwal, and T. Meyarivan. A fast and elitist multiobjective genetic algorithm: NSGAII. IEEE Transactions on Evolutionary Computation, 6(2):182-197, 2002.
10. K. Deb. An efficient constraint handling method for genetic algorithms. Computer Methods in Applied Mechanics and Engineering, 186(2):311-338, 2000.
11. B. Doerr, D. Johannsen, and C. Winzen. Multiplicative drift analysis. Algorithmica, 64(4):673-697, 2012.
12. J. Edmonds. Matroids and the greedy algorithm. Mathematical Programming, 1(1):127-136, 1971.
13. T. Friedrich, J. He, N. Hebbinghaus, F. Neumann, and C. Witt. Approximating covering problems by randomized search heuristics using multi-objective models. Evolutionary Computation, 18(4):617-633, 2010.
14. J. He and X. Yao. Drift analysis and average time complexity of evolutionary algorithms. Artificial Intelligence, 127(1):57-85, 2001.
15. A. Homaifar, C. X. Qi, and S. H. Lai. Constrained optimization via genetic algorithms. Simulation, 62(4):242-253, 1994.
16. D. Kempe, J. Kleinberg, and É. Tardos. Maximizing the spread of influence through a social network. In Proceedings of the 9th SIGKDD Conference on Knowledge Discovery and Data Mining, pages 137-146, Washington, DC, 2003.
17. B. Korte and J. Vygen. Combinatorial Optimization: Theory and Algorithms. Springer-Verlag, Berlin, Germany, 2012.
18. A. Krause, B. McMahan, C. Guestrin, and A. Gupta. Robust submodular observation selection. Journal of Machine Learning Research, 9(12):2761-2801, 2008.
19. M. Laumanns, L. Thiele, and E. Zitzler. Running time analysis of multiobjective evolutionary algorithms on pseudo-Boolean functions. IEEE Transactions on Evolutionary Computation, 8(2):170-182, 2004.
20. Z. Michalewicz and M. Schoenauer. Evolutionary algorithms for constrained parameter optimization problems. Evolutionary Computation, 4(1):1-32, 1996.
21. G. L. Nemhauser, L. A. Wolsey, and M. L. Fisher. An analysis of approximations for maximizing submodular set functions - I. Mathematical Programming, 14(1):265-294, 1978.
22. F. Neumann and I. Wegener. Randomized local search, evolutionary algorithms, and the minimum spanning tree problem. Theoretical Computer Science, 378(1):32-40, 2007.
23. F. Neumann and C. Witt. Bioinspired Computation in Combinatorial Optimization - Algorithms and Their Computational Complexity. Springer-Verlag, Berlin, Germany, 2010.
24. C. Qian, Y. Yu, and Z.-H. Zhou. An analysis on recombination in multi-objective evolutionary optimization. Artificial Intelligence, 204:99-119, 2013.
25. C. Qian, Y. Yu, and Z.-H. Zhou. Pareto ensemble pruning. In Proceedings of the 29th AAAI Conference on Artificial Intelligence, pages 2935-2941, Austin, TX, 2015.
26. S. Venkatraman and G. G. Yen. A generic framework for constrained optimization using genetic algorithms. IEEE Transactions on Evolutionary Computation, 9(4):424-435, 2005.
27. L. A. Wolsey. An analysis of the greedy algorithm for the submodular set covering problem. Combinatorica, 2(4):385-393, 1982.
28. 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.
29. Y. Yu, X. Yao, and Z.-H. Zhou. On the approximation ability of evolutionary optimization with application to minimum set cover. Artificial Intelligence, 180:20-33, 2012.
30. Y. Zhou and J. He. A runtime analysis of evolutionary algorithms for constrained optimization problems. IEEE Transactions on Evolutionary Computation, 11(5):608-619, 2007.