article

Computation of robust Pareto points

Authors:

K. WittingAuthors Info & Claims

International Journal of Computing Science and Mathematics, Volume 2, Issue 3

Pages 243 - 266

https://doi.org/10.1504/IJCSM.2009.027876

Published: 01 August 2009 Publication History

Abstract

In a multiobjective optimisation problem the aim is to minimise k objective functions simultaneously. The solution of this problem is given by the set of optimal compromises – the so-called Pareto set which locally typically forms a (k − 1)-dimensional manifold. In this work we consider Multiobjective Optimisation Problems (MOPs) which are parameter-dependent. Our aim is to identify 'robust' Pareto points. These are points which hardly vary under the variation of the system parameter. For this we employ path following techniques in order to identify curves consisting of those specific points.

References

[1]

Allgower, E.L. and Georg, K. (1990) Numerical Continuation Methods, Springer, New York, NY, USA.

[2]

Coello, C.C., Lamont, G.B. and Van Veldhuizen, D.A. (2002) Evolutionary Algorithms for Solving Multi-objective Optimization Problems, 2nd ed., 2007, Kluwer Academic Publishers, Berlin, Germany.

[3]

Das, I. and Dennis, J. (1998) 'Normal boundary intersection: a new method for generating the Pareto surface in nonlinear multicriteria optimization roblems', SIAM J. Optim., Vol. 8, pp. 631-657.

[4]

Deb, K. (2001) Multi-Objective Optimization using Evolutionary Algorithms, Wiley, Chichester, England.

[5]

Dellnitz, M., Schütze, O. and Hestermeyer, T. (2005) 'Covering pareto sets by multilevel subdivision techniques', Journal of Optimization Theory and Application, Vol. 124, No. 1, pp. 113-136.

Digital Library

[6]

Deuflhard, P. and Hohmann, A. (2003) Numerical Analysis in Modern Scientific Computing, Springer, New York, NY, USA.

[7]

Doedel, E., Champneys, A.R., Paffenroth, R.C., Fairgrieve, T.F., Kuznetsov, Y.A., Oldeman, B.E., Sandstede, B. and Wang, X-J. (2000) AUTO2000: Continuation and Bifurcation Software for Ordinary Differential Equations (with HomCont), Tech. Rep., California Institute of Technology, Pasadene, California USA.

[8]

Ehrgott, M. (2000) Multicriteria Optimization, Vol. 491 of Lecture Notes in Economics and Mathematical Systems, Springer-Verlag, Berlin, Germany.

[9]

Fonseca, C.M., Fleming, P., Zitzler, E., Deb, K. and Thiele, L. (2003) Evolutionary Multi-Criterion Optimization. Second International Conference, EMO 2003, Lecture Notes in Computer Science, Springer, Berlin, Germany.

[10]

Hillermeier, C. (2001) Nonlinear Multiobjective Optimization - A Generalized Homotopy Approach, Birkhäuser, Basel, Boston, Berlin.

[11]

Kuhn, H. and Tucker, A. (1951) 'Nonlinear programming', in Neumann, J. (Ed.): Proc. Berkeley Symp. Math. Statist. Probability, California, USA, pp. 481-492.

[12]

Luenberger, D.G. (1984) Linear and Nonlinear Programming, Addison Wesley Publishing Company, 2nd ed., Reading, Massachusetts, USA.

[13]

Miettinen, K. (1999) Nonlinear Multiobjective Optimization, Kluwer Academic Publishers, Boston, USA.

[14]

Schäffler, S., Schultz, R. and Weinzierl, K. (2002) 'A stochastic method for the solution of unconstrained vector optimization problems', J. Opt. Th. Appl., Vol. 114, No. 1, pp. 209-222.

Digital Library

[15]

Schütze, O. (2003) 'A new data structure for the nondominance problem in multi-objective optimization', in Fonseca, C.M., Fleming, P.J., Zitzler, E., Deb, K. and Thiele, L. (Eds.): Evolutionary Multi-Criterion Optimization (EMO 03), Vol. 2, of Springer, Berlin, Germany, pp. 509-518.

[16]

Schütze, O., Mostaghim, S., Dellnitz, M. and Teich, J. (2003) 'Covering pareto sets by multilevel evolutionary subdivision techniques', in Fonseca, C.M., Fleming, P.J., Zitzler, E., Deb, K. and Thiele, L. (Eds.): Evolutionary Multi-Criterion Optimization, Lecture Notes in Computer Science, pp. 118-132.

[17]

Witting, K., Schulz, B., Dellnitz, M., Böcker, J. and Fröhleke, N. (2008) 'A new approach for online multiobjective optimization of mechatronical systems', International Journal on Software Tools for Technology Transfer STTT, Springer, Berlin, Heidelberg, Germany, Vol. 10, No. 3, pp. 223-231.

[18]

Zitzler, E., Laumanns, M. and Thiele, L. (2002) 'SPEA2: improving the strength Pareto evolutionary algorithm', Evolutionary Methods for Design, Optimisation and Control with Applications to Industrial Problems, pp. 95-100.

Cited By

Nag KPal TMudi RPal N(2018)Robust Multiobjective Optimization With Robust ConsensusIEEE Transactions on Fuzzy Systems10.1109/TFUZZ.2018.284826126:6(3743-3754)Online publication date: 1-Dec-2018
https://dl.acm.org/doi/10.1109/TFUZZ.2018.2848261
Catania VAraldo APatti D(2015)Parameter Space Representation of Pareto Front to Explore Hardware-Software DependenciesACM Transactions on Embedded Computing Systems10.1145/276445714:4(1-25)Online publication date: 9-Sep-2015
https://dl.acm.org/doi/10.1145/2764457
Witting KOber-Blöbaum SDellnitz M(2013)A variational approach to define robustness for parametric multiobjective optimization problemsJournal of Global Optimization10.1007/s10898-012-9972-657:2(331-345)Online publication date: 1-Oct-2013
https://dl.acm.org/doi/10.1007/s10898-012-9972-6

Computation of robust Pareto points
1. Information systems
  1. Data management systems
    1. Database administration
2. Theory of computation
  1. Design and analysis of algorithms

Recommendations

Methodology to select solutions from the pareto-optimal set: a comparative study
GECCO '07: Proceedings of the 9th annual conference on Genetic and evolutionary computation

The resolution of a Multi-Objective Optimization Problem (MOOP) does not end when the Pareto-optimal set is found. In real problems, a single solution must be selected. Ideally, this solution must belong to the non-dominated solutions set and must take ...
What Weights Work for You? Adapting Weights for Any Pareto Front Shape in Decomposition-Based Evolutionary Multiobjective Optimisation
The quality of solution sets generated by decomposition-based evolutionary multi-objective optimisation (EMO) algorithms depends heavily on the consistency between a given problem's Pareto front shape and the specified weights' distribution. A set of ...
Searching for knee regions of the Pareto front using mobile reference points
Special Issue on Evolutionary Optimization and Learning

Evolutionary Algorithms (EAs) have been recognized to be well suited to approximate the Pareto front of Multi-objective Optimization Problems (MOPs). In reality, the Decision Maker (DM) is not interested in discovering the whole Pareto front rather than ...

Comments

Information & Contributors

Information

Published In

cover image International Journal of Computing Science and Mathematics

International Journal of Computing Science and Mathematics Volume 2, Issue 3

August 2009

89 pages

ISSN:1752-5055

EISSN:1752-5063

Issue’s Table of Contents

Publisher

Inderscience Publishers

Geneva 15, Switzerland

Publication History

Published: 01 August 2009

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 28 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Nag KPal TMudi RPal N(2018)Robust Multiobjective Optimization With Robust ConsensusIEEE Transactions on Fuzzy Systems10.1109/TFUZZ.2018.284826126:6(3743-3754)Online publication date: 1-Dec-2018
https://dl.acm.org/doi/10.1109/TFUZZ.2018.2848261
Catania VAraldo APatti D(2015)Parameter Space Representation of Pareto Front to Explore Hardware-Software DependenciesACM Transactions on Embedded Computing Systems10.1145/276445714:4(1-25)Online publication date: 9-Sep-2015
https://dl.acm.org/doi/10.1145/2764457
Witting KOber-Blöbaum SDellnitz M(2013)A variational approach to define robustness for parametric multiobjective optimization problemsJournal of Global Optimization10.1007/s10898-012-9972-657:2(331-345)Online publication date: 1-Oct-2013
https://dl.acm.org/doi/10.1007/s10898-012-9972-6

View Options

View options

Figures

Tables

Media

View Issue’s Table of Contents