Abstract
In optimization studies including multi-objective optimization, the main focus is usually placed in finding the global optimum or global Pareto-optimal frontier, representing the best possible objective values. However, in practice, users may not always be interested in finding the global best solutions, particularly if these solutions are quite sensitive to the variable perturbations which cannot be avoided in practice. In such cases, practitioners are interested in finding the so-called robust solutions which are less sensitive to small changes in variables. Although robust optimization has been dealt in detail in single-objective optimization studies, in this paper, we present two different robust multi-objective optimization procedures, where the emphasis is to find the robust optimal frontier, instead of the global Pareto-optimal front. The first procedure is a straightforward extension of a technique used for single-objective robust optimization and the second procedure is a more practical approach enabling a user to control the extent of robustness desired in a problem. To demonstrate the subtle differences between global and robust multi-objective optimization and the differences between the two robust optimization procedures, we define four test problems and show simulation results using NSGA-II. The results are useful and should encourage further studies considering robustness in multi-objective optimization.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Branke, J.: Creating robust solutions by means of an evolutionary algorithm. Parallel Problem Solving from Nature, 119–128 (1998)
Branke, J., Schmidt, C.: Faster convergence by means of fitness estimation. In: Soft Computing (2000)
Jin, Y., Sendhoff, B.: Trade-off between performance and robustness: An evolutionary multiobjective approach. In: EMO2003, pp. 237–251 (2003)
Tsutsui, S., Ghosh, A.: Genetic algorithms with a robust solution searching scheme. IEEE transactions on Evolutionary Computation, 201–219 (1997)
Parmee, I.C.: The maintenance of search diversity for effective design space decomposition using cluster-oriented genetic algorithms(cogas) and multi-agent strategies(gaant). In: ACEDC (1996)
Teich, J.: Pareto-front exploration with uncertain objectives. In: Proceedings of the First International Conference on Evolutionary Multi-Criterion Optimization (EMO2001), pp. 314–328 (2001)
Hughes, E.J.: Evolutionary multi-objective ranking with uncertainty and noise. In: Proceedings of the First International Conference on Evolutionary Multi-Criterion Optimization (EMO2001), pp. 329–343 (2001)
Branke, J.: Efficient evolutionary algorithms for searching robust solutions. ACDM, 275–286 (2000)
Deb, K.: Multi-objective optimization using evolutionary algorithms. Wiley, Chichester (2001)
Deb, K., Agrawal, S., Pratap, A., Meyarivan, T.: A fast and elitist multi-objective genetic algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation 6(2), 182–197 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Deb, K., Gupta, H. (2005). Searching for Robust Pareto-Optimal Solutions in Multi-objective Optimization. In: Coello Coello, C.A., Hernández Aguirre, A., Zitzler, E. (eds) Evolutionary Multi-Criterion Optimization. EMO 2005. Lecture Notes in Computer Science, vol 3410. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31880-4_11
Download citation
DOI: https://doi.org/10.1007/978-3-540-31880-4_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24983-2
Online ISBN: 978-3-540-31880-4
eBook Packages: Computer ScienceComputer Science (R0)