The role of e-dominance in Multi-Objective Particle Swarm Optimization Methods

Beitrag bei einer Tagung
(Konferenzbeitrag)


Details zur Publikation

Autor(en): Mostaghim S, Teich J
Verlag: IEEE Computer Society
Jahr der Veröffentlichung: 2003
Titel der Reihe: The role of e-dominance in Multi-Objective Particle Swarm Optimization Methods
Tagungsband: Proceedings of the Congress on Evolutionary Computation (CEC'03)
Seitenbereich: 1764-1771


Abstract


In this paper, the influence of ε-dominance on multi-objective particle swarm optimization (MOPSO) methods is studied. The most important role of ε-dominance is to bound the number of non-dominated solutions stored in the archive (archive size), which has influences on computational time, convergence and diversity of solutions. Here, ε-dominance is compared with the existing clustering technique for fixing the archive size and the solutions are compared in terms of computational time, convergence and diversity. A new diversity metric is also suggested. The results show that the ε-dominance method can find solutions much faster than the clustering technique with comparable and even in some cases better convergence and diversity. © 2003 IEEE.



FAU-Autoren / FAU-Herausgeber

Teich, Jürgen Prof. Dr.-Ing.
Lehrstuhl für Informatik 12 (Hardware-Software-Co-Design)


Autor(en) der externen Einrichtung(en)
Universität Paderborn


Zitierweisen

APA:
Mostaghim, S., & Teich, J. (2003). The role of e-dominance in Multi-Objective Particle Swarm Optimization Methods. In Proceedings of the Congress on Evolutionary Computation (CEC'03) (pp. 1764-1771). Canberra, AU: IEEE Computer Society.

MLA:
Mostaghim, Sanaz, and Jürgen Teich. "The role of e-dominance in Multi-Objective Particle Swarm Optimization Methods." Proceedings of the 2003 Congress on Evolutionary Computation, CEC 2003, Canberra IEEE Computer Society, 2003. 1764-1771.

BibTeX: 

Zuletzt aktualisiert 2018-03-11 um 13:50