A fast approximation-guided evolutionary multi-objective algorithm

GECCO 2013 - Proceedings of the 2013 Genetic and Evolutionary Computation Conference

Volumn , Issue , 2013, Pages 687-694

  Wagner, Markus ^a   Neumann, Frank ^a  

^a UNIVERSITY OF ADELAIDE   (Australia)

Author keywords

Approximation; Evolutionary algorithms; Multi objective optimization

Indexed keywords

APPROXIMATION; APPROXIMATION PROCESS; APPROXIMATION QUALITY; COMPUTATIONAL COSTS; EVOLUTIONARY MULTI-OBJECTIVE ALGORITHMS; MULTI OBJECTIVE ALGORITHM; MULTI-OBJECTIVE PROBLEM; NON-DOMINATED POINTS;

EVOLUTIONARY ALGORITHMS; MULTIOBJECTIVE OPTIMIZATION;

TURBOJET ENGINES;

EID: 84883084727     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2463372.2463448     Document Type: Conference Paper

References (23)

1. R. B. Agrawal and K. Deb. Simulated binary crossover for continuous search space. Technical report, 1994.
2. A. Auger, J. Bader, D. Brockhoff, and E. Zitzler. Theory of the hypervolume indicator: optimal μ-distributions and the choice of the reference point. In Proc. 10th International Workshop on Foundations of Genetic Algorithms (FOGA '09), pages 87-102. ACM Press, 2009.
3. K. Bringmann and T. Friedrich. Approximating the volume of unions and intersections of high-dimensional geometric objects. Computational Geometry: Theory and Applications, 43:601-610, 2010.
4. K. Bringmann, T. Friedrich, F. Neumann, and M. Wagner. Approximation-guided evolutionary multi-objective optimization. In Proc. 21nd International Joint Conference on Artificial Intelligence (IJCAI '11), pages 1198-1203, Barcelona, Spain, 16-22 July 2011. IJCAI/AAAI.
5. T. C. E. Cheng, A. Janiak, and M. Y. Kovalyov. Bicriterion single machine scheduling with resource dependent processing times. SIAM J. on Optimization, 8:617-630, 1998.
6. C. Daskalakis, I. Diakonikolas, and M. Yannakakis. How good is the Chord algorithm? In Proc. 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '10), pages 978-991, 2010.
7. K. Deb, A. Pratap, S. Agrawal, and T. Meyarivan. A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evolutionary Computation, 6(2):182-197, 2002.
8. K. Deb, L. Thiele, M. Laumanns, and E. Zitzler. Scalable test problems for evolutionary multiobjective optimization. In Evolutionary Multiobjective Optimization, Advanced Information and Knowledge Processing, pages 105-145. 2005.
9. I. Diakonikolas and M. Yannakakis. Small approximate Pareto sets for biobjective shortest paths and other problems. SIAM Journal on Computing, 39:1340-1371, 2009.
10. J. J. Durillo, A. J. Nebro, and E. Alba. The jMetal framework for multi-objective optimization: Design and architecture. In Proc. Congress on Evolutionary Computation (CEC '10), pages 4138-4325. IEEE Press, 2010.
11. M. T. M. Emmerich, N. Beume, and B. Naujoks. An EMO algorithm using the hypervolume measure as selection criterion. In Proc. Third International Conference on Evolutionary Multi-Criterion Optimization (EMO '05), pages 62-76. Springer, 2005.
12. T. Friedrich, C. Horoba, and F. Neumann. Multiplicative approximations and the hypervolume indicator. In Proc. 11th annual Conference on Genetic and Evolutionary Computation (GECCO '09), pages 571-578. ACM Press, 2009.
13. M. Gong, L. Jiao, H. Du, and L. Bo. Multiobjective immune algorithm with nondominated neighbor-based selection. Evolutionary Computation, 16(2):225-255, 2008.
14. S. Huband, L. Barone, R. L. While, and P. Hingston. A scalable multi-objective test problem toolkit. In C. A. C. Coello, A. H. Aguirre, and E. Zitzler, editors, Evolutionary Multi-Criterion Optimization, (EMO '05), volume 3410 of LNCS, pages 280-295. Springer, 2005.
15. M. Laumanns, L. Thiele, K. Deb, and E. Zitzler. Combining convergence and diversity in evolutionary multiobjective optimization. Evolutionary Computation, 10(3):263-282, 2002.
16. H. Li and Q. Zhang. Multiobjective optimization problems with complicated pareto sets, MOEA/D and NSGA-II. IEEE Trans. on Evolutionary Computation, 13(2):284-302, 2009.
17. O. Schütze, M. Laumanns, C. A. C. Coello, M. Dellnitz, and E.-G. Talbi. Convergence of stochastic search algorithms to finite size pareto set approximations. Journal of Global Optimization, 41(4):559-577, 2008.
18. O. Schütze, M. Laumanns, E. Tantar, C. A. C. Coello, and E.-G. Talbi. Computing gap free pareto front approximations with stochastic search algorithms. Evolutionary Computation, 18(1):65-96, 2010.
19. D. A. Van Veldhuizen and G. B. Lamont. Multiobjective evolutionary algorithm research: A history and analysis. Technical report, Citeseer, 1998.
20. S. Vassilvitskii and M. Yannakakis. Efficiently computing succinct trade-off curves. Theor. Comput. Sci., 348:334-356, 2005.
21. E. Zitzler and S. Künzli. Indicator-based selection in multiob-jective search. In Proc. 8th International Conference Parallel Problem Solving from Nature (PPSN VIII), volume 3242 of LNCS, pages 832-842. Springer, 2004.
22. E. Zitzler, M. Laumanns, and L. Thiele. SPEA2: Improving the strength Pareto evolutionary algorithm for multiobjective optimization. In Proc. Evolutionary Methods for Design, Optimisation and Control with Application to Industrial Problems (EUROGEN '01), pages 95-100, 2002.
23. E. Zitzler and L. Thiele. Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach. IEEE Trans. Evolutionary Computation, 3:257-271, 1999.