<?xml version="1.0" encoding="UTF-8"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-07-20T05:46:26Z</responseDate>
  <request identifier="252" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:252</identifier>
        <datestamp>2024-03-06T11:06:02Z</datestamp>
        <setSpec>ddc:004</setSpec>
        <setSpec>open_access</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
          <dc:title>A Tutorial on Evolutionary Multi-Objective Optimization (EMO)</dc:title>
          <dc:creator>Deb, Kalyanmoy</dc:creator>
          <dc:subject>Multi-objective optimization</dc:subject>
          <dc:subject>multi-criterion optimization</dc:subject>
          <dc:subject>Pareto-optimal solutions</dc:subject>
          <dc:subject>Evolutionary methods</dc:subject>
          <dc:subject>EMO</dc:subject>
          <dc:description>Many real-world search and optimization problems are naturally posed&#13;
as non-linear programming problems having multiple objectives. &#13;
Due to lack of suitable solution techniques, such problems are &#13;
artificially converted into a single-objective problem and solved. &#13;
The difficulty arises because such problems give rise to a set &#13;
of Pareto-optimal solutions, instead of a single optimum solution. &#13;
It then becomes important to find not just one Pareto-optimal &#13;
solution but as many of them as possible. Classical methods are &#13;
not quite efficient in solving these problems because they require &#13;
repetitive applications to find multiple Pareto-optimal solutions &#13;
and in some occasions repetitive applications do not guarantee &#13;
finding distinct Pareto-optimal solutions. The population approach &#13;
of evolutionary algorithms (EAs) allows an efficient way to find &#13;
multiple Pareto-optimal solutions simultaneously in a single &#13;
simulation run. &#13;
&#13;
In this tutorial, we discussed the following aspects related to&#13;
EMO:&#13;
&#13;
1. The basic differences in principle of EMO with classical methods.&#13;
2. A gentle introduction to evolutionary algorithms with simple&#13;
examples. A simple method of handling constraints was also &#13;
discussed.&#13;
3. The concept of domination and methods of finding non-dominated&#13;
solutions in a population of solutions were discussed. &#13;
4. A brief history of the development of EMO is highlighted. &#13;
5. A number of main EMO methods (NSGA-II, SPEA and PAES) were&#13;
discussed. &#13;
6. The advantage of EMO methodologies was discussed by presenting&#13;
a number of case studies. They clearly showed the advantage of&#13;
finding a number of Pareto-optimal solutions simultaneously.&#13;
7. Three advantages of using an EMO methodology were stressed:&#13;
 (i)   For a better decision making (in terms of choosing a &#13;
compromised solution) in the presence of multiple solutions&#13;
 (ii)  For finding important relationships among decision variables&#13;
(useful in design optimization). Some case studies from engineering&#13;
demonstrated the importance of such studies. &#13;
 (iii) For solving other optimization problems efficiently. For&#13;
example, in solving genetic programming problems, the so-called&#13;
`bloating problem of increased program size can be solved by using&#13;
a second objective of minimizing the size of the programs. &#13;
8. A number of salient research topics were highlighted. Some of&#13;
them are as follows:&#13;
 (i) Development of scalable test problems&#13;
 (ii) Development of computationally fast EMO methods&#13;
 (iii) Performance metrics for evaluating EMO methods&#13;
 (iv) Interactive EMO methodologies&#13;
 (v) Robust multi-objective optimization procedures&#13;
 (vi) Finding knee or other important solutions including partial&#13;
Pareto-optimal set&#13;
 (vii) Multi-objective scheduling and other optimization problems.&#13;
 &#13;
It was clear from the discussions that &#13;
evolutionary search methods offers an alternate means of solving&#13;
multi-objective optimization problems compared to classical &#13;
approaches. This is why multi-objective optimization using EAs is &#13;
getting a growing attention in the recent years. &#13;
The motivated readers may explore &#13;
current research issues and other important studies from various&#13;
texts (Coello et al, 2003; Deb, 2001), conference proceedings &#13;
(EMO-01 and EMO-03 Proceedings) and numerous research papers &#13;
(http://www.lania.mx/~ccoello/EMOO/).&#13;
&#13;
References:&#13;
----------&#13;
C. A. C. Coello, D. A. VanVeldhuizen, and G. Lamont.&#13;
Evolutionary Algorithms for Solving Multi-Objective Problems.&#13;
Boston, MA: Kluwer Academic Publishers, 2002.&#13;
&#13;
K.Deb. Multi-objective optimization using evolutionary algorithms.&#13;
Chichester, UK: Wiley, 2001.&#13;
&#13;
C. Fonseca, P. Fleming, E. Zitzler, K. Deb, and L. Thiele, editors.&#13;
Proceedings of the Second Evolutionary Multi-Criterion&#13;
Optimization (EMO-03) Conference &#13;
(Lecture Notes in Computer Science (LNCS) 2632).&#13;
Heidelberg: Springer, 2003.&#13;
&#13;
E. Zitzler, K. Deb, L. Thiele, C. A. C. Coello, and D. Corne, &#13;
editors. Proceedings of the First Evolutionary Multi-Criterion&#13;
Optimization (EMO-01) Conference &#13;
(Lecture Notes in Computer Science (LNCS) 1993).&#13;
Heidelberg: Springer, 2001.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Kalyanmoy Deb</dc:contributor>
          <dc:date>2005</dc:date>
          <dc:relation>Is Part Of Dagstuhl Seminar Proceedings, Volume 4461, Practical Approaches to Multi-Objective Optimization (2005)</dc:relation>
          <dc:type>InProceedings</dc:type>
          <dc:type>Text</dc:type>
          <dc:type>doc-type:ResearchArticle</dc:type>
          <dc:type>publishedVersion</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>doi:10.4230/DagSemProc.04461.5</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-2520</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04461.5</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by/4.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
