Memetic particle swarm optimization

Memetic particle swarm optimization

We propose a new Memetic Particle Swarm Optimization scheme that incorporates local search techniques in the standard Particle Swarm Optimization algorithm, resulting in an efficient and effective optimization method, which is analyzed theoretically. The proposed algorithm is applied to different un...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Annals of operations research 2007-12, Vol.156 (1), p.99-127
Hauptverfasser: Petalas, Y. G., Parsopoulos, K. E., Vrahatis, M. N.
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
Evolution
Genetic algorithms
Integer programming
Mutation
Operations research
Optimization
Optimization algorithms
Population
Studies
Traveling salesman problem
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We propose a new Memetic Particle Swarm Optimization scheme that incorporates local search techniques in the standard Particle Swarm Optimization algorithm, resulting in an efficient and effective optimization method, which is analyzed theoretically. The proposed algorithm is applied to different unconstrained, constrained, minimax and integer programming problems and the obtained results are compared to that of the global and local variants of Particle Swarm Optimization, justifying the superiority of the memetic approach. [PUBLICATION ABSTRACT]
ISSN:0254-5330
1572-9338
DOI:10.1007/s10479-007-0224-y