<?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:08:26Z</responseDate>
  <request identifier="254" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:254</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 New Approach on Many Objective Diversity Measurement</dc:title>
          <dc:creator>Mostaghim, Sanaz</dc:creator>
          <dc:creator>Teich, Jürgen</dc:creator>
          <dc:subject>Multi-objective Optimization</dc:subject>
          <dc:subject>Particle Swarm Optimization</dc:subject>
          <dc:description>In multi-objective particle swarm optimization (MOPSO) methods, selecting the best {it local guide} (the global best particle)&#13;
for each particle of the population from a set of Pareto-optimal solutions has a great impact on the&#13;
convergence and diversity of solutions, especially when optimizing problems with high number of objectives.&#13;
here, we introduce the Sigma method as a new method for finding best local guides for each particle of the population.&#13;
The Sigma method is implemented &#13;
and is compared with another method, which uses the strategy of an existing MOPSO method for &#13;
finding the local guides. &#13;
These methods are examined for different test functions and the results are compared with the results of a multi-objective&#13;
evolutionary algorithm (MOEA).</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Sanaz Mostaghim and Jürgen Teich</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.4</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-2543</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04461.4</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>
