Heterogeneous Constraint Handling for Particle Swarm Optimization

Conference contribution

Publication Details

Author(s): Omeltschuk L, Helwig S, Mühlenthaler M, Wanka R
Title edited volumes: IEEE SSCI 2011 - Symposium Series on Computational Intelligence - SIS 2011: 2011 IEEE Symposium on Swarm Intelligence
Publisher: IEEE Press
Publishing place: New York, NY, USA
Publication year: 2011
Conference Proceedings Title: Proc. IEEE Swarm Intelligence Symposium (SIS)
Pages range: 37-43
ISBN: 978-1-61284-053-6


We propose a generic, hybrid constraint handling scheme for particle swarm optimization called Heterogeneous Constraint Handling. Inspired by the notion of social roles, we assign different constraint handling methods to the particles, one for each social role. In this paper, we investigate two social roles for particles, 'self' and 'neighbor'. Due to the usual particle dynamics, a powerful mixture of the two corresponding constraint handling methods emerges. We evaluate this heterogeneous constraint handling approach with respect to the complete set of the CEC 2006 benchmark instances. Our results indicate that a such a heterogeneous combination of two constraint handling methods often leads to significantly better results than running each individual constraint handling method separately and returning the best solution obtained. © 2011 IEEE.

FAU Authors / FAU Editors

Mühlenthaler, Moritz Dr.-Ing.
Lehrstuhl für Informatik 12 (Hardware-Software-Co-Design)
Wanka, Rolf Prof. Dr.
Professur für Informatik (Effiziente Algorithmen und Kombinatorische Optimierung)

How to cite

Omeltschuk, L., Helwig, S., Mühlenthaler, M., & Wanka, R. (2011). Heterogeneous Constraint Handling for Particle Swarm Optimization. In Proc. IEEE Swarm Intelligence Symposium (SIS) (pp. 37-43). Paris, FR: New York, NY, USA: IEEE Press.

Omeltschuk, Ludmila, et al. "Heterogeneous Constraint Handling for Particle Swarm Optimization." Proceedings of the IEEE Swarm Intelligence Symposium (SIS), Paris New York, NY, USA: IEEE Press, 2011. 37-43.


Last updated on 2018-23-11 at 06:06