This paper presents and analyzes a search paradigm called Magnetic Particle Swarm Optimization. This paradigm gives support to two algorithms that combine elements of the behavior of magnetic dipoles within a framework that includes several elements that are known to be essential to effective multimodal search. The algorithms are applied to a variety of functions and their performance is compared with those of a number of related well-established metaheuristics. In addition to that, convergence and sensitivity analyses are presented for the first time.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.