30 Search Results for "Kalyanmoy, Deb"

Document
DOI: 10.4230/DagSemProc.09041.1
09041 Abstracts Collection – Hybrid and Robust Approaches to Multiobjective Optimization

Authors: Salvatore Greco, Kalyanmoy Deb, Kaisa Miettinen, and Eckart Zitzler

Published in: Dagstuhl Seminar Proceedings, Volume 9041, Hybrid and Robust Approaches to Multiobjective Optimization (2009)

Abstract
The seminar "Hybrid and Robust Approaches to Multiobjective Optimization" was a sequel to two previous Dagstuhl seminars (04461 in 2004 and 06501 in 2006). The main idea of this seminar series has been to bring together two contemporary fields related to multiobjective optimization – Evolutionary Multiobjective Optimization (EMO) and Multiple Criteria Decision Making (MCDM) -- to discuss critical research and application issues for bringing the entire field further and for fostering future collaboration. This particular seminar was participated by 53 researchers actively working in multiobjective optimization. The purpose of the seminar was to discuss two fundamental research topics related to multiobjective optimization: interactive methods requiring optimization and decision making aspects to be integrated for a practical implementation and robust multiobjective methodologies dealing with uncertainties in problem parameters, objectives, constraints and algorithms. The seminar was structured to have more emphasis on working group discussions, rather than individual presentations, so that the open and free environment and facilities of Schloss Dagstuhl could be fully utilized.
Cite as

Salvatore Greco, Kalyanmoy Deb, Kaisa Miettinen, and Eckart Zitzler. 09041 Abstracts Collection – Hybrid and Robust Approaches to Multiobjective Optimization. In Hybrid and Robust Approaches to Multiobjective Optimization. Dagstuhl Seminar Proceedings, Volume 9041, pp. 1-10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)

Copy BibTex To Clipboard

@InProceedings{greco_et_al:DagSemProc.09041.1,
  author =	{Greco, Salvatore and Deb, Kalyanmoy and Miettinen, Kaisa and Zitzler, Eckart},
  title =	{{09041 Abstracts Collection – Hybrid and Robust Approaches to Multiobjective Optimization}},
  booktitle =	{Hybrid and Robust Approaches to Multiobjective Optimization},
  pages =	{1--10},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2009},
  volume =	{9041},
  editor =	{Kalyanmoy Deb and Salvatore Greco and Kaisa Miettinen and Eckart Zitzler},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.09041.1},
  URN =		{urn:nbn:de:0030-drops-20069},
  doi =		{10.4230/DagSemProc.09041.1},
  annote =	{Keywords: Multi-objective optimization, multiple criteria decision making, evolutionary multi-objective optimization, robust optimization, interactive optimization}
}
Document
DOI: 10.4230/DagSemProc.09041.2
09041 Summary – Hybrid and Robust Approaches to Multiobjective Optimization

Authors: Kalyanmoy Deb, Salvatore Greco, Kaisa Miettinen, and Eckart Zitzler

Published in: Dagstuhl Seminar Proceedings, Volume 9041, Hybrid and Robust Approaches to Multiobjective Optimization (2009)

Abstract
The seminar “Hybrid and Robust Approaches to Multiobjective Optimization” was a sequel to two previous Dagstuhl seminars (04461 in 2004 and 06501 in 2006). The main idea of this seminar series has been to bring together two contemporary fields related to multiobjective optimization – Evolutionary Multiobjective Optimization (EMO) and Multiple Criteria Decision Making (MCDM) – to discuss critical research and application issues for bringing the entire field further and for fostering future collaboration. This particular seminar was participated by 53 researchers actively working in multiobjective optimization. The purpose of the seminar was to discuss two fundamental research topics related to multiobjective optimization: interactive methods requiring optimization and decision making aspects to be integrated for a practical implementation and robust multiobjective methodologies dealing with uncertainties in problem parameters, objectives, constraints and algorithms. The seminar was structured to have more emphasis on working group discussions, rather than individual presentations, so that the open and free environment and facilities of Schloss Dagstuhl could be fully utilized.
Cite as

Kalyanmoy Deb, Salvatore Greco, Kaisa Miettinen, and Eckart Zitzler. 09041 Summary – Hybrid and Robust Approaches to Multiobjective Optimization. In Hybrid and Robust Approaches to Multiobjective Optimization. Dagstuhl Seminar Proceedings, Volume 9041, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)

Copy BibTex To Clipboard

@InProceedings{deb_et_al:DagSemProc.09041.2,
  author =	{Deb, Kalyanmoy and Greco, Salvatore and Miettinen, Kaisa and Zitzler, Eckart},
  title =	{{09041 Summary – Hybrid and Robust Approaches to Multiobjective Optimization}},
  booktitle =	{Hybrid and Robust Approaches to Multiobjective Optimization},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2009},
  volume =	{9041},
  editor =	{Kalyanmoy Deb and Salvatore Greco and Kaisa Miettinen and Eckart Zitzler},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.09041.2},
  URN =		{urn:nbn:de:0030-drops-20054},
  doi =		{10.4230/DagSemProc.09041.2},
  annote =	{Keywords: Multi-objective optimization, multiple criteria decision making, evolutionary multi-objective optimization, robust optimization, interactive optimization}
}
Document
DOI: 10.4230/DagSemProc.09041.3
09041 Working Group 4: MCDM and RIMO

Authors: Matthias Ehrgott, Jussi Hakanen, Hisao Ishibuchi, Andreas Loehne, Mariano Luque, Kaisa Miettinen, Wlodek Ogryczak, Olexandr Romanko, Theodor J. Stewart, and Andrzej Wierzbicki

Published in: Dagstuhl Seminar Proceedings, Volume 9041, Hybrid and Robust Approaches to Multiobjective Optimization (2009)

Abstract
We were looking at robustness and related issues in the context of interactive MCDM, in different stages of the decision process.
Cite as

Matthias Ehrgott, Jussi Hakanen, Hisao Ishibuchi, Andreas Loehne, Mariano Luque, Kaisa Miettinen, Wlodek Ogryczak, Olexandr Romanko, Theodor J. Stewart, and Andrzej Wierzbicki. 09041 Working Group 4: MCDM and RIMO. In Hybrid and Robust Approaches to Multiobjective Optimization. Dagstuhl Seminar Proceedings, Volume 9041, pp. 1-5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)

Copy BibTex To Clipboard

@InProceedings{ehrgott_et_al:DagSemProc.09041.3,
  author =	{Ehrgott, Matthias and Hakanen, Jussi and Ishibuchi, Hisao and Loehne, Andreas and Luque, Mariano and Miettinen, Kaisa and Ogryczak, Wlodek and Romanko, Olexandr and Stewart, Theodor J. and Wierzbicki, Andrzej},
  title =	{{09041 Working Group 4: MCDM and RIMO}},
  booktitle =	{Hybrid and Robust Approaches to Multiobjective Optimization},
  pages =	{1--5},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2009},
  volume =	{9041},
  editor =	{Kalyanmoy Deb and Salvatore Greco and Kaisa Miettinen and Eckart Zitzler},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.09041.3},
  URN =		{urn:nbn:de:0030-drops-20016},
  doi =		{10.4230/DagSemProc.09041.3},
  annote =	{Keywords: Interactive methods, robustness, MCDM, objectivity, subjectivity}
}
Document
DOI: 10.4230/DagSemProc.09041.4
09041 Working Group on EMO for Interactive Multiobjective Optimization (1st Round)

Authors: Fonseca Carlos, Xavier Gandibleux, Pekka Korhonen, Luis Marti, Boris Naujoks, Lothar Thiele, Wallenius Jyrki, and Eckart Zitzler

Published in: Dagstuhl Seminar Proceedings, Volume 9041, Hybrid and Robust Approaches to Multiobjective Optimization (2009)

Abstract
This group explored the use of EMO in an interactive manner to solve multiobjective optimization problems.
Cite as

Fonseca Carlos, Xavier Gandibleux, Pekka Korhonen, Luis Marti, Boris Naujoks, Lothar Thiele, Wallenius Jyrki, and Eckart Zitzler. 09041 Working Group on EMO for Interactive Multiobjective Optimization (1st Round). In Hybrid and Robust Approaches to Multiobjective Optimization. Dagstuhl Seminar Proceedings, Volume 9041, pp. 1-11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)

Copy BibTex To Clipboard

@InProceedings{fonsecacarlos_et_al:DagSemProc.09041.4,
  author =	{Fonseca Carlos and Gandibleux, Xavier and Korhonen, Pekka and Marti, Luis and Naujoks, Boris and Thiele, Lothar and Wallenius Jyrki and Zitzler, Eckart},
  title =	{{09041 Working Group on EMO for Interactive Multiobjective Optimization (1st Round)}},
  booktitle =	{Hybrid and Robust Approaches to Multiobjective Optimization},
  pages =	{1--11},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2009},
  volume =	{9041},
  editor =	{Kalyanmoy Deb and Salvatore Greco and Kaisa Miettinen and Eckart Zitzler},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.09041.4},
  URN =		{urn:nbn:de:0030-drops-20041},
  doi =		{10.4230/DagSemProc.09041.4},
  annote =	{Keywords: Interactive multiobjective optimization}
}
Document
DOI: 10.4230/DagSemProc.09041.5
09041 Working Group on EMO for Robust Multiobjective Optimization (1st Round)

Authors: Joerg Fliege, Nicola Beume, Juergen Branke, Heinrich Braun, Nirupam Chakraborti, Kalyanmoy Deb, Sabine Helwig, Joshua Knowles, Martin Middendorf, Sanaz Mostaghim, Silvia Poles, Salazar Daniel, Shukla Pradymn, and El-Ghazli Talbi

Published in: Dagstuhl Seminar Proceedings, Volume 9041, Hybrid and Robust Approaches to Multiobjective Optimization (2009)

Abstract
This group explored various robust methodologies for multiobjective optimization.
Cite as

Joerg Fliege, Nicola Beume, Juergen Branke, Heinrich Braun, Nirupam Chakraborti, Kalyanmoy Deb, Sabine Helwig, Joshua Knowles, Martin Middendorf, Sanaz Mostaghim, Silvia Poles, Salazar Daniel, Shukla Pradymn, and El-Ghazli Talbi. 09041 Working Group on EMO for Robust Multiobjective Optimization (1st Round). In Hybrid and Robust Approaches to Multiobjective Optimization. Dagstuhl Seminar Proceedings, Volume 9041, pp. 1-5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)

Copy BibTex To Clipboard

@InProceedings{fliege_et_al:DagSemProc.09041.5,
  author =	{Fliege, Joerg and Beume, Nicola and Branke, Juergen and Braun, Heinrich and Chakraborti, Nirupam and Deb, Kalyanmoy and Helwig, Sabine and Knowles, Joshua and Middendorf, Martin and Mostaghim, Sanaz and Poles, Silvia and Salazar Daniel and Shukla Pradymn and Talbi, El-Ghazli},
  title =	{{09041 Working Group on EMO for Robust Multiobjective Optimization (1st Round)}},
  booktitle =	{Hybrid and Robust Approaches to Multiobjective Optimization},
  pages =	{1--5},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2009},
  volume =	{9041},
  editor =	{Kalyanmoy Deb and Salvatore Greco and Kaisa Miettinen and Eckart Zitzler},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.09041.5},
  URN =		{urn:nbn:de:0030-drops-20030},
  doi =		{10.4230/DagSemProc.09041.5},
  annote =	{Keywords: Robust multiobjective optimization}
}
Document
DOI: 10.4230/DagSemProc.09041.6
09041 Working Group on MCDM for Robust Multiobjective Optimization (1st Round)

Authors: Jos Figueira, Martin Geiger, Salvatore Greco, Johannes Jahn, Kathrin Klamroth, Masahiro Inuiguchi, Vincent Mousseau, Sayin Serpil, Roman Slowinski, Margaret M. Wiecek, and Witting Katrin

Published in: Dagstuhl Seminar Proceedings, Volume 9041, Hybrid and Robust Approaches to Multiobjective Optimization (2009)

Abstract
This group explored MCDM techniques for robust multiobjective optimization.
Cite as

Jos Figueira, Martin Geiger, Salvatore Greco, Johannes Jahn, Kathrin Klamroth, Masahiro Inuiguchi, Vincent Mousseau, Sayin Serpil, Roman Slowinski, Margaret M. Wiecek, and Witting Katrin. 09041 Working Group on MCDM for Robust Multiobjective Optimization (1st Round). In Hybrid and Robust Approaches to Multiobjective Optimization. Dagstuhl Seminar Proceedings, Volume 9041, pp. 1-2, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)

Copy BibTex To Clipboard

@InProceedings{figueira_et_al:DagSemProc.09041.6,
  author =	{Figueira, Jos and Geiger, Martin and Greco, Salvatore and Jahn, Johannes and Klamroth, Kathrin and Inuiguchi, Masahiro and Mousseau, Vincent and Sayin Serpil and Slowinski, Roman and Wiecek, Margaret M. and Witting Katrin},
  title =	{{09041 Working Group on MCDM for Robust Multiobjective Optimization (1st Round)}},
  booktitle =	{Hybrid and Robust Approaches to Multiobjective Optimization},
  pages =	{1--2},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2009},
  volume =	{9041},
  editor =	{Kalyanmoy Deb and Salvatore Greco and Kaisa Miettinen and Eckart Zitzler},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.09041.6},
  URN =		{urn:nbn:de:0030-drops-20025},
  doi =		{10.4230/DagSemProc.09041.6},
  annote =	{Keywords: Robust multiobjective optimization}
}
Document
DOI: 10.4230/DagSemProc.09041.7
A Polynomial Chaos Approach to Robust Multiobjective Optimization

Authors: Silvia Poles and Alberto Lovison

Published in: Dagstuhl Seminar Proceedings, Volume 9041, Hybrid and Robust Approaches to Multiobjective Optimization (2009)

Abstract
Robust design optimization is a modeling methodology, combined with a suite of computational tools, which is aimed to solve problems where some kind of uncertainty occurs in the data or in the model. This paper explores robust optimization complexity in the multiobjective case, describing a new approach by means of Polynomial Chaos expansions (PCE). The aim of this paper is to demonstrate that the use of PCE may help and speed up the optimization process if compared to standard approaches such as Monte Carlo and Latin Hypercube sampling.
Cite as

Silvia Poles and Alberto Lovison. A Polynomial Chaos Approach to Robust Multiobjective Optimization. In Hybrid and Robust Approaches to Multiobjective Optimization. Dagstuhl Seminar Proceedings, Volume 9041, pp. 1-15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)

Copy BibTex To Clipboard

@InProceedings{poles_et_al:DagSemProc.09041.7,
  author =	{Poles, Silvia and Lovison, Alberto},
  title =	{{A Polynomial Chaos Approach to Robust Multiobjective Optimization}},
  booktitle =	{Hybrid and Robust Approaches to Multiobjective Optimization},
  pages =	{1--15},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2009},
  volume =	{9041},
  editor =	{Kalyanmoy Deb and Salvatore Greco and Kaisa Miettinen and Eckart Zitzler},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.09041.7},
  URN =		{urn:nbn:de:0030-drops-20009},
  doi =		{10.4230/DagSemProc.09041.7},
  annote =	{Keywords: Uncertainty Quantification, Multiobjective Robust Design, Monte Carlo, Latin Hypercube, Polynomial Chaos}
}
Document
DOI: 10.4230/DagSemProc.09041.8
Decomposition and Coordination for Multiobjective Complex Systems

Authors: Margaret M. Wiecek and Melissa Gardenghi

Published in: Dagstuhl Seminar Proceedings, Volume 9041, Hybrid and Robust Approaches to Multiobjective Optimization (2009)

Abstract
Complex systems are modeled as collections of multiobjective programs each representing a subsystem (or component) of the overall system. The subsystems interact with each other in various ways adding to the complexity of the overall problem. Since the calculation of efficient sets of these complex systems presents a challenging problem, it is desirable to decompose the overall system into component multiobjective programs that are more easily solvable and then construct the efficient set of the overall system. Selected cases of complex system are presented and relationships between their efficient sets the efficient sets of their subsystems are given.
Cite as

Margaret M. Wiecek and Melissa Gardenghi. Decomposition and Coordination for Multiobjective Complex Systems. In Hybrid and Robust Approaches to Multiobjective Optimization. Dagstuhl Seminar Proceedings, Volume 9041, pp. 1-9, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)

Copy BibTex To Clipboard

@InProceedings{wiecek_et_al:DagSemProc.09041.8,
  author =	{Wiecek, Margaret M. and Gardenghi, Melissa},
  title =	{{Decomposition and Coordination for Multiobjective Complex Systems}},
  booktitle =	{Hybrid and Robust Approaches to Multiobjective Optimization},
  pages =	{1--9},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2009},
  volume =	{9041},
  editor =	{Kalyanmoy Deb and Salvatore Greco and Kaisa Miettinen and Eckart Zitzler},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.09041.8},
  URN =		{urn:nbn:de:0030-drops-19992},
  doi =		{10.4230/DagSemProc.09041.8},
  annote =	{Keywords: Multiobjective programs, complex systems, efficient set, decomposition, coordination}
}
Document
DOI: 10.4230/DagSemProc.06501.1
06501 Abstracts Collection – Practical Approaches to Multi-Objective Optimization

Authors: Jürgen Branke, Kalyanmoy Deb, Kaisa Miettinen, and Roman Slowinski

Published in: Dagstuhl Seminar Proceedings, Volume 6501, Practical Approaches to Multi-Objective Optimization (2007)

Abstract
From 10.12.06 to 15.12.06, the Dagstuhl Seminar 06501 ``Practical Approaches to Multi-Objective Optimization'' was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available.
Cite as

Jürgen Branke, Kalyanmoy Deb, Kaisa Miettinen, and Roman Slowinski. 06501 Abstracts Collection – Practical Approaches to Multi-Objective Optimization. In Practical Approaches to Multi-Objective Optimization. Dagstuhl Seminar Proceedings, Volume 6501, pp. 1-15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)

Copy BibTex To Clipboard

@InProceedings{branke_et_al:DagSemProc.06501.1,
  author =	{Branke, J\"{u}rgen and Deb, Kalyanmoy and Miettinen, Kaisa and Slowinski, Roman},
  title =	{{06501 Abstracts Collection – Practical Approaches to Multi-Objective Optimization}},
  booktitle =	{Practical Approaches to Multi-Objective Optimization},
  pages =	{1--15},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2007},
  volume =	{6501},
  editor =	{J\"{u}rgen Branke and Kalyanmoy Deb and Kaisa Miettinen and Roman Slowinski},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.06501.1},
  URN =		{urn:nbn:de:0030-drops-11224},
  doi =		{10.4230/DagSemProc.06501.1},
  annote =	{Keywords: Multi-criteria optimization, evolutionary and classical methods, interaction}
}
Document
DOI: 10.4230/DagSemProc.06501.2
Reference Point Approaches and Objective Ranking

Authors: Andrzej P. Wierzbicki

Published in: Dagstuhl Seminar Proceedings, Volume 6501, Practical Approaches to Multi-Objective Optimization (2007)

Abstract
The paper presents a reflection on some of the basic assumptions and philosophy of reference point approaches, stressing their unique concentra-tion on the sovereignty of the subjective decision maker. As a new devel-opment in reference point approaches also the concept of objective ranking is stressed, defined as dependent only on a given set of data, relevant for the decision situation, and independent from any more detailed specifica-tion of personal preferences than that given by defining criteria and the partial order in criterion space. Rational objective ranking can be based on reference point approach, because reference levels needed in this approach can be established objectively statistically from the given data set. Exam-ples show that such objective ranking can be very useful in many man-agement situations.
Cite as

Andrzej P. Wierzbicki. Reference Point Approaches and Objective Ranking. In Practical Approaches to Multi-Objective Optimization. Dagstuhl Seminar Proceedings, Volume 6501, pp. 1-20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)

Copy BibTex To Clipboard

@InProceedings{wierzbicki:DagSemProc.06501.2,
  author =	{Wierzbicki, Andrzej P.},
  title =	{{Reference Point Approaches and Objective Ranking}},
  booktitle =	{Practical Approaches to Multi-Objective Optimization},
  pages =	{1--20},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2007},
  volume =	{6501},
  editor =	{J\"{u}rgen Branke and Kalyanmoy Deb and Kaisa Miettinen and Roman Slowinski},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.06501.2},
  URN =		{urn:nbn:de:0030-drops-11210},
  doi =		{10.4230/DagSemProc.06501.2},
  annote =	{Keywords: Multiple criteria optimization and decisions; reference point approaches; objectivity and subjectivity in decision support}
}
Document
DOI: 10.4230/DagSemProc.04461.1
04461 Abstracts Collection – Practical Approaches to Multi-Objective Optimization

Authors: Jürgen Branke, Deb Kalyanmoy, Kaisa Miettinen, and Ralph E. Steuer

Published in: Dagstuhl Seminar Proceedings, Volume 4461, Practical Approaches to Multi-Objective Optimization (2005)

Abstract
From 07.11.04 to 12.11.04, the Dagstuhl Seminar 04461 ``Practical Approaches to Multi-Objective Optimization'' was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available.
Cite as

Jürgen Branke, Deb Kalyanmoy, Kaisa Miettinen, and Ralph E. Steuer. 04461 Abstracts Collection – Practical Approaches to Multi-Objective Optimization. In Practical Approaches to Multi-Objective Optimization. Dagstuhl Seminar Proceedings, Volume 4461, pp. 1-17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)

Copy BibTex To Clipboard

@InProceedings{branke_et_al:DagSemProc.04461.1,
  author =	{Branke, J\"{u}rgen and Kalyanmoy, Deb and Miettinen, Kaisa and Steuer, Ralph E.},
  title =	{{04461 Abstracts Collection – Practical Approaches to Multi-Objective Optimization}},
  booktitle =	{Practical Approaches to Multi-Objective Optimization},
  pages =	{1--17},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2005},
  volume =	{4461},
  editor =	{J\"{u}rgen Branke and Kalyanmoy Deb and Kaisa Miettinen and Ralph E. Steuer},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.04461.1},
  URN =		{urn:nbn:de:0030-drops-2551},
  doi =		{10.4230/DagSemProc.04461.1},
  annote =	{Keywords: Multi-objective optimization, evolutionary algorithms, decision support system}
}
Document
DOI: 10.4230/DagSemProc.04461.16
On Continuation Methods for the Numerical Treatment of Multi-Objective Optimization Problems

Authors: Oliver Schütze, Alessandro Dell'Aere, and Michael Dellnitz

Published in: Dagstuhl Seminar Proceedings, Volume 4461, Practical Approaches to Multi-Objective Optimization (2005)

Abstract
In this report we describe how continuation methods can be used for the numerical treatment of multi-objective optimization problems (MOPs): starting with a given Karush-Kuhn-Tucker point (KKT-point) x of an MOP, these techniques can be applied to detect further KKT-points in the neighborhood of x. In the next step, again further points are computed starting with these new-found KKT-points, and so on. In order to maintain a good spread of these solutions we use boxes for the representation of the computed parts of the solution set. Based on this background, we propose a new predictor-corrector variant, and show some numerical results indicating the strength of the method, in particular in higher dimensions. Further, the data structure allows for an efficient computation of MOPs with more than two objectives, which has not been considered so far in most existing continuation methods.
Cite as

Oliver Schütze, Alessandro Dell'Aere, and Michael Dellnitz. On Continuation Methods for the Numerical Treatment of Multi-Objective Optimization Problems. In Practical Approaches to Multi-Objective Optimization. Dagstuhl Seminar Proceedings, Volume 4461, pp. 1-15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)

Copy BibTex To Clipboard

@InProceedings{schutze_et_al:DagSemProc.04461.16,
  author =	{Sch\"{u}tze, Oliver and Dell'Aere, Alessandro and Dellnitz, Michael},
  title =	{{On Continuation Methods for the Numerical Treatment of Multi-Objective Optimization Problems}},
  booktitle =	{Practical Approaches to Multi-Objective Optimization},
  pages =	{1--15},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2005},
  volume =	{4461},
  editor =	{J\"{u}rgen Branke and Kalyanmoy Deb and Kaisa Miettinen and Ralph E. Steuer},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.04461.16},
  URN =		{urn:nbn:de:0030-drops-3497},
  doi =		{10.4230/DagSemProc.04461.16},
  annote =	{Keywords: multi-objective optimization, continuation, k-manifolds}
}
Document
DOI: 10.4230/DagSemProc.04461.7
Application Issues for Multiobjective Evolutionary Algorithms

Authors: Thomas Hanne

Published in: Dagstuhl Seminar Proceedings, Volume 4461, Practical Approaches to Multi-Objective Optimization (2005)

Abstract
In the talk, various issues of the design and application of multiobjective evolutionary algorithms for real-life optimization problems are discussed. In particular, questions on problem-specific data structures and evolutionary operators and the determination of method parameters are treated. Three application examples in the areas of constrained global optimization (electronic circuit design), semi-infinite programming (design centering problems), and discrete optimization (project scheduling) are discussed.
Cite as

Thomas Hanne. Application Issues for Multiobjective Evolutionary Algorithms. In Practical Approaches to Multi-Objective Optimization. Dagstuhl Seminar Proceedings, Volume 4461, pp. 1-11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)

Copy BibTex To Clipboard

@InProceedings{hanne:DagSemProc.04461.7,
  author =	{Hanne, Thomas},
  title =	{{Application Issues for Multiobjective Evolutionary Algorithms}},
  booktitle =	{Practical Approaches to Multi-Objective Optimization},
  pages =	{1--11},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2005},
  volume =	{4461},
  editor =	{J\"{u}rgen Branke and Kalyanmoy Deb and Kaisa Miettinen and Ralph E. Steuer},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.04461.7},
  URN =		{urn:nbn:de:0030-drops-3443},
  doi =		{10.4230/DagSemProc.04461.7},
  annote =	{Keywords: Multiobjective optimization, Pareto set, evolutionary algorithm, discrete optimization, continuous optimization, electronic circuit design, semi-infin}
}
Document
DOI: 10.4230/DagSemProc.04461.15
NBI and MOGA-II, two complementary algorithms for Multi-Objective optimizations

Authors: Enrico Rigoni and Silvia Poles

Published in: Dagstuhl Seminar Proceedings, Volume 4461, Practical Approaches to Multi-Objective Optimization (2005)

Abstract
The NBI-NLPQLP optimization method is tested on several multi-objective optimization problems. Its performance is compared to that of MOGA-II: since NBI-NLPQLP is based on the classical gradient-based NLPQLP, it is fast and accurate, but not as robust, in comparison with the genetic algorithm. Furthermore a discontinuous Pareto frontier can give rise to problems in the NBI´s convergence. In order to overcome this problem, a hybridization technique coupled with a partitioning method is proposed.
Cite as

Enrico Rigoni and Silvia Poles. NBI and MOGA-II, two complementary algorithms for Multi-Objective optimizations. In Practical Approaches to Multi-Objective Optimization. Dagstuhl Seminar Proceedings, Volume 4461, pp. 1-22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)

Copy BibTex To Clipboard

@InProceedings{rigoni_et_al:DagSemProc.04461.15,
  author =	{Rigoni, Enrico and Poles, Silvia},
  title =	{{NBI and MOGA-II, two complementary algorithms for Multi-Objective optimizations}},
  booktitle =	{Practical Approaches to Multi-Objective Optimization},
  pages =	{1--22},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2005},
  volume =	{4461},
  editor =	{J\"{u}rgen Branke and Kalyanmoy Deb and Kaisa Miettinen and Ralph E. Steuer},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.04461.15},
  URN =		{urn:nbn:de:0030-drops-2728},
  doi =		{10.4230/DagSemProc.04461.15},
  annote =	{Keywords: Genetic Algorithms, Normal-Boundary Intersection, Designs optimizations}
}
Document
DOI: 10.4230/DagSemProc.04461.19
Runtime Analysis of a Simple Multi-Objective Evolutionary Algorithm

Authors: Oliver Giel

Published in: Dagstuhl Seminar Proceedings, Volume 4461, Practical Approaches to Multi-Objective Optimization (2005)

Abstract
Practical knowledge on the design and application of multi-objective evolutionary algorithms (MOEAs) is available but well-founded theoretical analyses of the runtime are rare. Laumanns, Thiele, Zitzler, Welzel and Deb (2002) have started such an analysis for two simple mutation-based algorithms including SEMO. These algorithms search locally in the neighborhood of their current population by selecting an individual and flipping one randomly chosen bit. Due to its local search operator, SEMO cannot escape from local optima, and, therefore, has no finite expected runtime in general. In this talk, we investigate the runtime of a variant of SEMO whose mutation operator flips each bit independently. It is proven that its expected runtime is O(n^n) for all objective functions f: {0,1}^n -> R^m, and that there are bicriteria problems among the hardest problem for this algorithm. Moreover, for each d between 2 and n, a bicriteria problem with expected runtime Theta(n^d) is presented. This shows that bicriteria problems cover the full range of potential runtimes of this variant of SEMO. For the problem LOTZ (Leading-Ones-Trailing Zeroes), the runtime does not increase substantially if we use the global search operator. Finally, we consider the problem MOCO (Multi-Objective-Counting-Ones). We show that the conjectured bound O((n^2)log n) on the expected runtime is wrong for both variants of SEMO. In fact, MOCO is almost a worst case example for SEMO if we consider the expected runtime; however, the runtime is O((n^2)log n) with high probability. Some ideas from the proof will be presented.
Cite as

Oliver Giel. Runtime Analysis of a Simple Multi-Objective Evolutionary Algorithm. In Practical Approaches to Multi-Objective Optimization. Dagstuhl Seminar Proceedings, Volume 4461, pp. 1-4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)

Copy BibTex To Clipboard

@InProceedings{giel:DagSemProc.04461.19,
  author =	{Giel, Oliver},
  title =	{{Runtime Analysis of a Simple Multi-Objective Evolutionary Algorithm}},
  booktitle =	{Practical Approaches to Multi-Objective Optimization},
  pages =	{1--4},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2005},
  volume =	{4461},
  editor =	{J\"{u}rgen Branke and Kalyanmoy Deb and Kaisa Miettinen and Ralph E. Steuer},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.04461.19},
  URN =		{urn:nbn:de:0030-drops-2711},
  doi =		{10.4230/DagSemProc.04461.19},
  annote =	{Keywords: Runtime analysis, multi-objecive evolutionary algorithms}
}
  • Refine by Author
  • 7 Deb, Kalyanmoy
  • 6 Miettinen, Kaisa
  • 4 Greco, Salvatore
  • 4 Zitzler, Eckart
  • 3 Branke, Jürgen
  • Show More...

  • Refine by Classification

  • Refine by Keyword
  • 5 Multi-objective optimization
  • 2 Genetic Algorithms
  • 2 Multi-objective Optimization
  • 2 Pareto set
  • 2 Robust multiobjective optimization
  • Show More...

  • Refine by Type
  • 30 document

  • Refine by Publication Year
  • 20 2005
  • 8 2009
  • 2 2007

Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact