Proceedings

Approximation-Guided Evolutionary Multi-Objective Optimization

Download BibTeX Cite

Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence. Pages 1198-1202.

https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-204

Abstract

Multi-objective optimization problems arise frequently in applications but can often only be solved approximately by heuristic approaches. Evolutionary algorithms have been widely used to tackle multi-objective problems. These algorithms use different measures to ensure diversity in the objective space but are not guided by a formal notion of approximation. We present a new framework of an evolutionary algorithm for multi-objective optimization that allows to work with a formal notion of approximation. Our experimental results show that our approach outperforms state-of-the-art evolutionary algorithms in terms of the quality of the approximation that is obtained in particular for problems with many objectives.

Karl Bringmann, Tobias Friedrich, Frank Neumann, and Markus Wagner. 2011. Approximation-Guided Evolutionary Multi-Objective Optimization. In Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence, IJCAI-11. IJCAI, 1198–1202. https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-204
Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards